By Topic

A Fair Channel Scheduling Algorithm in Optical Burst-Switched 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

3 Author(s)

Among various signaling protocols designed for OBS networks, the most popular one is just-enough-time (JET) protocol. JET can utilize the network capacity efficiently and reduce end-to-end transmission delay effectively. However, it may suffer from an intrinsic deficiency -fairness problem. Fairness problem is a traditional problem existing in various kinds of networks. It not only results in a phenomenon that bursts with shorter hops are generally favored but also deteriorates the networks utilization. In this paper, we investigated this problem and proposed a fair channel scheduling algorithm as a solution. Generally speaking, there is usually a tradeoff between fairness and blocking performance. Hence, our objective is to keep balanced between the two conflicting metrics. It gives each burst a dynamic priority which is defined by several characteristics of the burst. When a contention occurs, the proposed scheme picks the preferable burst and drops the other one according to their priorities then. Simulation results show that our scheme can improve fairness without degrading dropping performance too much. In addition, it increases the effective link utilizations as well.

Published in:

Advanced Information Networking and Applications, 2008. AINA 2008. 22nd International Conference on

Date of Conference:

25-28 March 2008