Fair scheduling in optical burst switching networks

Authors:
Lin Liu;Yuanyuan Yang
Affiliations:
Dept. of Electrical & Computer Engineering, State University of New York, Stony Brook, NY;Dept. of Electrical & Computer Engineering, State University of New York, Stony Brook, NY
Venue:
ITC20'07 Proceedings of the 20th international teletraffic conference on Managing traffic performance in converged networks
Year:
2007

Citing 9
Cited 2

A generalized processor sharing approach to flow control in integrated services networks: the single-node case

IEEE/ACM Transactions on Networking (TON)
Efficient fair queueing using deficit round-robin

IEEE/ACM Transactions on Networking (TON)
Terabit burst switching

Journal of High Speed Networks - Special issue on optical networking
Optical burst switching (OBS) - a new paradigm for an optical Internet

Journal of High Speed Networks - Special issue on optical networking
Credit-based fair queueing (CBFQ): a simple service-scheduling algorithm for packet-switched networks

IEEE/ACM Transactions on Networking (TON)
A Strict Priority Scheme for Quality-of-Service Provisioning in Optical Burst Switching Networks

ISCC '03 Proceedings of the Eighth IEEE International Symposium on Computers and Communications
Advances in photonic packet switching: an overview

IEEE Communications Magazine
Optical burst switching for service differentiation in the next-generation optical Internet

IEEE Communications Magazine
Control architecture in optical burst-switched WDM networks

IEEE Journal on Selected Areas in Communications

Achieving high performance burst transmission for bursty traffic using optical burst chain switching in WDM networks

IEEE Transactions on Communications
Hierarchical time-sliced optical burst switching

Optical Switching and Networking

Quantified Score

Hi-index	0.00

Visualization

Abstract

Optical Burst Switching (OBS) is a promising switching technique that has received much attention in recent years. A fair scheduling algorithm can ensure fair bandwidth allocation among different users and isolate ill-behaved users from normal users in a network. However, fair scheduling in OBS networks is difficult to implement due to lack of inexpensive and large buffers in optical domain. In this paper, we propose a new scheme to provide fairness in OBS scheduling by considering the time-slotted version of OBS, the Slotted OBS or SOBS. We give a fair scheduling algorithm with O(1) time complexity called the Almost Strictly Proportional Fair Scheduling (ASPFS). Our simulation results demonstrate that by applying the algorithm to the control packets (CP) at the end of each time slot, fair scheduling can be achieved. The scheme significantly improves the fairness among different flows compared to other scheduling algorithms in OBS such as LAUC-VF and Pipeline with VST. We also give an approach to supporting Quality of Service (QoS) in OBS based on the proposed scheme.