A dynamic hop count shifting RWA algorithm for wavelength routed optical networks

Min Ho Park; Jin Seek Choi; Jeonghoon Mo

doi:10.1007/s11107-008-0112-7

A dynamic hop count shifting RWA algorithm for wavelength routed optical networks

Min Ho Park, Jin Seek Choi, Jeonghoon Mo

Department of Industrial Engineering

Research output: Contribution to journal › Article › peer-review

1 Citation (Scopus)

Abstract

In this article, we find that the limiting hop count in a lightpath impacts on the performance of optical networks. Based on this observation, we propose a dynamic hop count shifting (DYHOS) algorithm that limits the hop count of lightpaths dynamically, depending on the traffic load. The proposed algorithm searches an available route, while minimizing the waste of network resources and limiting excessive traffic on the network. Hence, the proposed algorithm increases the network throughput and reduces the blocking probability. Comparing with shortest path routing and adaptive path routing algorithms, we show the performance of the proposed algorithm has the lowest blocking probability influenced by the hop count of lightpaths for a given routing algorithm.

Original language	English
Pages (from-to)	1-9
Number of pages	9
Journal	Photonic Network Communications
Volume	16
Issue number	1
DOIs	https://doi.org/10.1007/s11107-008-0112-7
Publication status	Published - 2008 Aug

Bibliographical note

Funding Information:
Acknowledgements This work was supported by the Korea Science and Engineering Foundation (KOSEF) grant funded by the Korea government (MOST) (No. R11-2000-074-02006-0).

All Science Journal Classification (ASJC) codes

Software
Atomic and Molecular Physics, and Optics
Hardware and Architecture
Computer Networks and Communications
Electrical and Electronic Engineering

Access to Document

10.1007/s11107-008-0112-7

Cite this

@article{2de257d79abe4e46a908bac3777d29f2,

title = "A dynamic hop count shifting RWA algorithm for wavelength routed optical networks",

abstract = "In this article, we find that the limiting hop count in a lightpath impacts on the performance of optical networks. Based on this observation, we propose a dynamic hop count shifting (DYHOS) algorithm that limits the hop count of lightpaths dynamically, depending on the traffic load. The proposed algorithm searches an available route, while minimizing the waste of network resources and limiting excessive traffic on the network. Hence, the proposed algorithm increases the network throughput and reduces the blocking probability. Comparing with shortest path routing and adaptive path routing algorithms, we show the performance of the proposed algorithm has the lowest blocking probability influenced by the hop count of lightpaths for a given routing algorithm.",

author = "Park, {Min Ho} and Choi, {Jin Seek} and Jeonghoon Mo",

note = "Funding Information: Acknowledgements This work was supported by the Korea Science and Engineering Foundation (KOSEF) grant funded by the Korea government (MOST) (No. R11-2000-074-02006-0).",

year = "2008",

month = aug,

doi = "10.1007/s11107-008-0112-7",

language = "English",

volume = "16",

pages = "1--9",

journal = "Photonic Network Communications",

issn = "1387-974X",

publisher = "Springer Netherlands",

number = "1",

}

TY - JOUR

T1 - A dynamic hop count shifting RWA algorithm for wavelength routed optical networks

AU - Park, Min Ho

AU - Choi, Jin Seek

AU - Mo, Jeonghoon

N1 - Funding Information: Acknowledgements This work was supported by the Korea Science and Engineering Foundation (KOSEF) grant funded by the Korea government (MOST) (No. R11-2000-074-02006-0).

PY - 2008/8

Y1 - 2008/8

N2 - In this article, we find that the limiting hop count in a lightpath impacts on the performance of optical networks. Based on this observation, we propose a dynamic hop count shifting (DYHOS) algorithm that limits the hop count of lightpaths dynamically, depending on the traffic load. The proposed algorithm searches an available route, while minimizing the waste of network resources and limiting excessive traffic on the network. Hence, the proposed algorithm increases the network throughput and reduces the blocking probability. Comparing with shortest path routing and adaptive path routing algorithms, we show the performance of the proposed algorithm has the lowest blocking probability influenced by the hop count of lightpaths for a given routing algorithm.

AB - In this article, we find that the limiting hop count in a lightpath impacts on the performance of optical networks. Based on this observation, we propose a dynamic hop count shifting (DYHOS) algorithm that limits the hop count of lightpaths dynamically, depending on the traffic load. The proposed algorithm searches an available route, while minimizing the waste of network resources and limiting excessive traffic on the network. Hence, the proposed algorithm increases the network throughput and reduces the blocking probability. Comparing with shortest path routing and adaptive path routing algorithms, we show the performance of the proposed algorithm has the lowest blocking probability influenced by the hop count of lightpaths for a given routing algorithm.

UR - http://www.scopus.com/inward/record.url?scp=39849094628&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=39849094628&partnerID=8YFLogxK

U2 - 10.1007/s11107-008-0112-7

DO - 10.1007/s11107-008-0112-7

M3 - Article

AN - SCOPUS:39849094628

SN - 1387-974X

VL - 16

SP - 1

EP - 9

JO - Photonic Network Communications

JF - Photonic Network Communications

IS - 1

ER -

A dynamic hop count shifting RWA algorithm for wavelength routed optical networks

Abstract

Bibliographical note

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this