@inproceedings{c9333258522d430b8d53fb21bb5fce3b,
title = "Fair scheduling in optical burst switching networks",
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.",
keywords = "Fair scheduling, Optical burst switching (OBS), Optical networks, Scheduling algorithms, Time-slotted",
author = "Lin Liu and Yuanyuan Yang",
year = "2007",
doi = "10.1007/978-3-540-72990-7\_18",
language = "English",
isbn = "9783540729891",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "166--178",
booktitle = "Managing Traffic Performance in Converged Networks - 20th International Teletraffic Congress, ITC20 2007, Proceedings",
note = "20th International Teletraffic Congress, ITC20 2007 ; Conference date: 17-06-2007 Through 21-06-2007",
}