ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
Computer Networks
Volume 45, Issue 6, 21 August 2004, Pages 819-834
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Article
Purchase PDF (369 K)

Article Toolbox
 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/j.comnet.2004.03.030    
How to Cite or Link Using DOI (Opens New Window)

Copyright © 2004 Elsevier B.V. All rights reserved.

Link scheduling state information based offset management for fairness improvement in WDM optical burst switching networks

Purchase the full-text article



References and further reading may be available for this article. To view references and further reading you must purchase this article.

S. K. Tan, G. MohanCorresponding Author Contact Information, E-mail The Corresponding Author, E-mail The Corresponding Author and K. C. Chua

Department of Electrical and Computer Engineering, National University of Singapore, 4 Engineering Drive 3, Kent Ridge, Singapore 117576, Singapore


Received 7 October 2003; 
Revised 14 March 2004; 
accepted 16 March 2004
Responsible Editor: G. Rouskas 
Available online 5 May 2004.

Abstract

In wavelength division multiplexed (WDM)-based optical burst switching (OBS) networks, bursts that traverse longer paths are more likely to be dropped compared to bursts that traverse shorter paths resulting in a fairness problem. Fairness here refers to having, for all ingress–egress node pairs in a network, a burst to have equal likelihood to get through independent of the hop length involved. In this paper, we develop a link scheduling state based fairness improvement method which can be used in a classless as well as a multi-class environment. The basic idea is to collect link scheduling state information and use it to determine the offset times for routes with different hop lengths. By using the online link state information, this method periodically computes and adapts the offset times needed, thus inherently accounting for the traffic loading patterns and network topological connectivity. It also ensures that the delay experienced by a burst is low and shorter-hop bursts are not over-penalized while improving the performance of longer-hop bursts. The effectiveness of the proposed method is evaluated through simulation experiments.

Author Keywords: Wavelength division multiplexing; Optical burst switching; Scheduling; Burst dropping performance; Fairness

Article Outline

1. Introduction
2. Overview of LSOS
3. LSOS for intra-class fairness
3.1. Preliminaries
3.2. Computation of link scheduling probabilities
3.3. Offset selection
4. Performance study
4.1. Performance of LSOS in a classless traffic environment
4.2. Performance of LSOS in a multi-class environment
4.3. Effect of the link-probing phase period on the performance of LSOS
5. Conclusions
Acknowledgements
References
Vitae













Corresponding Author Contact InformationCorresponding author. Tel.: +65-6874-4688; fax: +65-6779-1103


Computer Networks
Volume 45, Issue 6, 21 August 2004, Pages 819-834
 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.