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.
The research work was supported in part by NSF grant number CCR-0207999.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Choa, F.-S., Zhao, X., et al.: An optical packet switch based on WDM technologies. J. Lightwave Technology 23, 994–1014 (2005)
Qiao, C., Yoo, M.: Optical burst switching (OBS) - a new paradigm for an optical Internet. J. High Speed Networks 8(1), 69–84 (1999)
Xiong, Y., Vandenhoute, M., Cankaya, H.: Control architecture in optical burst-switched WDM networks. IEEE J. Sel. A. Comm. 18, 1838–1851 (2000)
Turner, J.: Terabit burst switching. J. High Speed Networks 8, 3–16 (1999)
Turner, J.: Terabit burst switching progress report (10/00-3/01) (2001)
Xu, J., Qiao, C., Li, J., Xu, G.: Efficient channel scheduling algorithms in optical burst switched networks. In: Proc. INFOCOM 2003, vol. 3, pp. 2268–2278 (March 2003)
Li, J.K., Qiao, C., Xu, J.H., Xu, D.H.: Maximizing throughput for optical burst switching networks. In: Proc. INFOCOM 2004, vol. 3, pp. 1853–1863 (2004)
Li, H.L., Neo, H.M., Ian, T.L.: Performance of the implementation of a pipeline buffering system in optical burst switching networks. In: Proc. GLOBECOM 2003, vol. 5, pp. 2503–2507 (2003)
Li, H., Liak, M.T.W., Li-Jin, I.T.: A distributed monitoring-based fairness algorithm in optical burst switching networks. In: Proc. ICC 2004, vol. 3, pp. 1564–1568 (June 2004)
Kaheel, A., Alnuweiri, H.: Quantitative QoS guarantees in labeled optical burst switching networks. In: Proc. GLOBECOM 2003, vol. 3, pp. 1747–1753 (2004)
Yao, S., Mukherjee, B., Dixit, S.: Advances in photonic packet switching: an overview. IEEE Commun. Mag., vol. 38(2) (February 2000)
Yoo, M., Qiao, C., Dixit, S.: Optical burst switching for service differentiation in the nex generation optical internet. IEEE Commun. Mag., 98–104 (2001)
Vokkarane, V.M., Jue, J.: A strict priority scheme for quality of service provisioning in optical burst switching networks. In: Proc. ISCC 2003, pp. 16–21 (2003)
Ramamirtham, J., Turner, J.: Time-sliced Optical Burst Switching. In: Proc. INFOCOM 2003, pp. 2030–2038 (April 2003)
Shreedhar, M., Varghese, G.: Efficient fair queueing using deficit round-robin. IEEE/ACM Trans. Networking 4, 375–385 (1996)
Zhou, Y., Sethu, H.: On the relationship between absolute and relative fairness bounds. IEEE Commun. Letters 6(1), 37–39 (2002)
Parekh, A.K., Gallager, R.G.: A generalized processor sharing approach to flow control in integrated services networks: the single-node case. IEEE/ACM Trans. Networking 1(3), 344–357 (1993)
Bensaou, B., Tsang, D.H., Chan, K.T.: Credit-based fair queueing (CBFQ): a simply service-scheduling algorithm for packet-switched networks. IEEE/ACM Trans. Networking 9(5), 591–604 (2001)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Liu, L., Yang, Y. (2007). Fair Scheduling in Optical Burst Switching Networks. In: Mason, L., Drwiega, T., Yan, J. (eds) Managing Traffic Performance in Converged Networks. ITC 2007. Lecture Notes in Computer Science, vol 4516. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72990-7_18
Download citation
DOI: https://doi.org/10.1007/978-3-540-72990-7_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72989-1
Online ISBN: 978-3-540-72990-7
eBook Packages: Computer ScienceComputer Science (R0)