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.
Bibliographical noteFunding 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
- Atomic and Molecular Physics, and Optics
- Hardware and Architecture
- Computer Networks and Communications
- Electrical and Electronic Engineering