By Topic

Dynamic Scheduling Algorithms for Large File Transfer on Multi-user Optical Grid Network Based on Efficiency and Fairness

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

3 Author(s)
Miaochao Hu ; State Key Lab. on Fiber-Opt. Local Area Networks & Adv. Opt. Commun. Syst., Shanghai Jiao Tong Univ., Shanghai ; Wei Guo ; Weisheng Hu

In this paper, we consider a multi-user optical grid environment where the optical grid network is shared among multiple users who have a high demand for data processing. In such multi-user grid environment, since the supercomputer can start the data processing only after the corresponding data file has reached it, one critical problem is how to effectively schedule large data file transfers on the optical grid network. In this paper, we propose four dynamic scheduling algorithms to address the issue of large file transfers on multi-user optical grid network. Two objectives, namely the efficiency and fairness, are considered to evaluate the performance of each scheduling algorithm. Efficiency aims at how to achieve the best overall quality of grid service, and fairness regards the service quality deviation among grid users. We study the performance of each algorithm, and a tradeoff between efficiency and fairness is shown by our results.

Published in:

Networking and Services, 2009. ICNS '09. Fifth International Conference on

Date of Conference:

20-25 April 2009