Abstract
In the Optical Burst Switching (OBS) research area, the burst control packet (BCP) queuing delay problem has not been addressed because it is believed to be quite small. However, with a realistic OBS simulator, we have investigated this issue and clarified its impact on performance degradation from the point-of-view of data burst loss rate. We know that the BCP load to the control channel is not negligible. Thus, the burst loss rate due to the queueing delay of BCP on the control channel is very serious compared to the existing well-known burst contention. We propose a Dynamic Offset-Time Update scheme to avoid serious data burst loss due to BCP queueing delay, and a Priority BCP queue to guarantee the minimum offset-time for high class bursts. Our simulation results show that the Dynamic Offset-Time Update scheme can completely avoid data burst loss due to BCP congestion while guaranteeing a certain level of minimum offset-time.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Qiao, C., Yoo, M.: Optical Burst switching (OBS) - a new paradigm for an optical Internet. Journal of High Speed Networks 8(1), 68–84 (1999)
Chen, Y., et al.: Optical burst switching: a new area in optical networking research. IEEE Network, 16–23 (May/June 2004)
Xing, Y., Vanderhoute, M., Cankaya, C.C.: Control architecture in optical burst-switched WDM networks. IEEE Journal on Selected Areas in Communications 18(10), 1838–1851 (2000)
White, J., Tucker, R., Long, K.: Merit-base Scheduling Algorithm for Optical Burst Switching. In: COIN 2002 (July 2002)
Kim, J., Yun, H., Choi, J., Kang, M.: A Novel Buffer Scheduling Algorithm for Burst Control Packet in Optical Burst Switching WDM Networks. In: APOC (October 2002)
Kim, J., Choi, J., Kang, M.:Offset-Time Based Scheduling Algorhthm for Burst Control Packet in Optical Burst Switched Networks. LNCS, vol. 3098. Springer, Heidelberg (2004)
Jiang, Y., et al.: Delay Bounds for a Network of Guaranteed Rate Servers with FIFO Aggregation. Computer Networks, Elsevier Science 40(6), 683–694 (2002)
Zhang, Z., Duan, Z., Hou, Y.T.: Fundamental trade-offs in aggregate packet scheduling. In: Proceedings of ICNP 2001 (2001)
Charny, A., Le Boudec, J.Y.: Delay bounds in a network with aggregate scheduling. In: Proceedings of QOFIS (October 2000)
Morato, D., Aracil, J., Diez, L.A., Izal, M., Magana, E.: On linear prediction of internet traffic for packet and burst switching networks. In: Proceedings of ICCCN, pp. 138–143 (2001)
Hwang, I.-Y., et al.: OIRC OBS-ns simulator supported by OIRC and Samsung Advanced Institute of Technology (SAIT) (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hwang, IY., Lee, S., Park, HS. (2006). Impact of Burst Control Packet Congestion on Burst Loss Rate in Optical Burst Switched Networks. In: Chong, I., Kawahara, K. (eds) Information Networking. Advances in Data Communications and Wireless Networks. ICOIN 2006. Lecture Notes in Computer Science, vol 3961. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11919568_37
Download citation
DOI: https://doi.org/10.1007/11919568_37
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-48563-6
Online ISBN: 978-3-540-48564-3
eBook Packages: Computer ScienceComputer Science (R0)