Cart (Loading....) | Create Account
Close category search window
 

Joint flow control and processor allocation for task scheduling in grid over OBS networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Yahong Yang ; State Key Lab. on Adv. Opt. Commun. Syst. & Networks, Shanghai Jiaotong Univ., Shanghai, China ; Guiling Wu ; Xinwan Li ; Jianping Chen

This paper presents a model for the joint design of flow control and processor allocation for task scheduling in grid over optical burst switching (GOBS) networks. The GOBS resource allocation is formulated as a utility maximization problem with constraints that arise from the resource and user preferences. The optimization problem is decomposed into two parts: flow control for burst length adjustment and processor allocation for computational capacity adjustment. The parameters from the resource layer are abstracted and provided to a cross-layer optimizer to maximize user's utility function. The performance of the algorithm is evaluated through simulations.

Published in:

Communications, 2009. APCC 2009. 15th Asia-Pacific Conference on

Date of Conference:

8-10 Oct. 2009

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.