Dynamic Routing Algorithm based on Minimum Path-Cost in Optical Burst Switching Networks 


Vol. 30,  No. 3, pp. 72-84, Mar.  2005


PDF Full-Text
  Abstract

Optical burst switching networks usually employ one-way reservation by sending a burst control packet with a specific offset time, before transmitting each data burst frame. Due to such a property, burst-contentions occur when multiple bursts contend for the same wavelength in the same output link simultaneously in a node, leading to burst losses, eventually degrading the quality of service. Therefore, in this paper, we propose a dynamic routing algorithm using minimum local state information in order to decrease burst-contentions. In this proposed scheme, if burst loss rate exceeds a threshold value at a certain node, a new alternative routing path is chosen according to burst priority and location of burst generation, which enables the contending bursts to detour around the congested link. Moreover, for reducing the effect of sending bursts on the primary path due to the alternative path, we also apply a minimum path-cost based routing on link-cost concept. Our simulation results show that proposed scheme improves the network performance in terms of burst loss probability and throughput by comparing with conventional one.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

H. j. Lee, K. y. Song, K. m. Yoo, W. Yoo, Y. c. Kim, "Dynamic Routing Algorithm based on Minimum Path-Cost in Optical Burst Switching Networks," The Journal of Korean Institute of Communications and Information Sciences, vol. 30, no. 3, pp. 72-84, 2005. DOI: .

[ACM Style]

Hae joung Lee, Kyu yeop Song, Kyoung min Yoo, Wan Yoo, and Young chon Kim. 2005. Dynamic Routing Algorithm based on Minimum Path-Cost in Optical Burst Switching Networks. The Journal of Korean Institute of Communications and Information Sciences, 30, 3, (2005), 72-84. DOI: .

[KICS Style]

Hae joung Lee, Kyu yeop Song, Kyoung min Yoo, Wan Yoo, Young chon Kim, "Dynamic Routing Algorithm based on Minimum Path-Cost in Optical Burst Switching Networks," The Journal of Korean Institute of Communications and Information Sciences, vol. 30, no. 3, pp. 72-84, 3. 2005.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880