A new Burst Scheduling algorithm for edge/core node combined optical burst switched networks

5Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

The burst contention problem in Optical Burst Switching network is an intrinsically serious problem. Many researches have tried to solve this problem, however it have been known that avoiding the burst loss is very difficult issues in the current OBS network. To improve burst blocking rate, we consider the edge/core combined OBS network where the core node performs the edge node function as well. Through this architecture, available amount of data burst that the node generates can be expected with respect to offset-time of transit data bursts. Any researches for this area has not been performed, thus we propose a new data scheduling algorithm for the edge/core combined OBS network where data bursts that the node generates do not interrupt transit data bursts from previous nodes. We analyzed the data burst loss rate and the throughput in relation with the offset-time of transit data bursts. Results show that the loss rate of the data bursts is drastically reduced and the throughput improves when the offset-time of transit data bursts increases. © IFIP International Federation for Information Processing 2006.

Author supplied keywords

Cite

CITATION STYLE

APA

Lee, S., Hwang, I., & Park, H. (2006). A new Burst Scheduling algorithm for edge/core node combined optical burst switched networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3976 LNCS, pp. 1240–1245). Springer Verlag. https://doi.org/10.1007/11753810_115

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free