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

  • Authors:

  • SeoungYoung Lee;InYong Hwang;HongShik Park

  • Affiliations:

  • BcN Engineering Research Center, Information and Communications University, Daejeon, Korea;BcN Engineering Research Center, Information and Communications University, Daejeon, Korea;BcN Engineering Research Center, Information and Communications University, Daejeon, Korea

  • Venue:
  • NETWORKING'06 Proceedings of the 5th international IFIP-TC6 conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

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.