Abstract
We propose a scheduling algorithm for reducing unused timeslots by considering head gap and tail gap newly generated by assigning a data burst in order to improve the burst loss probability and the throughput performances in Time Sliced Optical Burst Switched (TSOBS) networks. The proposed scheduling algorithm selects the timeslot in which either head gap or tail gap newly generated becomes the minimum. We show that the proposed scheduling algorithm can improve the burst loss probability and the throughput performances as compared with the conventional one.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
C. Qiao and M. Yoo, “Optical burst switching(OBS)-a new paradigm for an optical internet,” J. High Speed Networks, vol.8, no.1, pp.69–84, Jan. 1999.
Y. Xiong, M. Vandehoute, and H. C. Cankaya, “Control architecture in optical burst-switched WDM networks,” IEEE J. Select. Areas Commun., vol.18, no.10, pp.1838–1851, Oct. 2000.
J. Ramamirtham and J. Turner, “Time sliced optical burst switching,” Proc. INFOCOM 2003, vol.3, pp.2030–2038, San Francisco, U.S.A., Apr. 2003.
B. C. Kim, Y. Z. Cho, J. H. Lee, Y. S. Choi, and D. Montgomery, “Performance of optical burst switching techniques in multi-hop networks,” Proc. GLOBECOM 2002, vol.3, pp.2772–2776, Taipei, Taiwan, Nov. 2002.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 International Federation for Information Processing
About this paper
Cite this paper
Ito, T., Ishii, D., Okazaki, K., Yamanaka, N., Sasase, I. (2005). A Scheduling Algorithm for Reducing Unused Timeslots by Considering Head Gap and Tail Gap in Time Sliced Optical Burst Switched Networks. In: Kitayama, KI., Masetti-Placci, F., Prati, G. (eds) Optical Networks and Technologies. IFIP International Federation for Information Processing, vol 164. Springer, Boston, MA. https://doi.org/10.1007/0-387-23178-1_9
Download citation
DOI: https://doi.org/10.1007/0-387-23178-1_9
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-23177-8
Online ISBN: 978-0-387-23178-5
eBook Packages: Computer ScienceComputer Science (R0)