The choice of the best among the shortest routes in transparent optical networks

Authors:
Gilvan M. Durães;André Soares;José R. Amazonas;William Giozza
Affiliations:
Research Group on Optical Networks (GRO), University Salvador (UNIFACS), Salvador, BA, Brazil;Department of Informatics and Statistics, Federal University of Piauí, Teresina, PI, Brazil;Escola Politécnica of the University of São Paulo, SP, Brazil;Department of Electrical Engineering, University of Brasília (UnB), DF, Brazil
Venue:
Computer Networks: The International Journal of Computer and Telecommunications Networking
Year:
2010

Citing 3
Cited 1

Introduction to Algorithms

Introduction to Algorithms
On-line routing and wavelength assignment for dynamic traffic in WDM ring and torus networks

IEEE/ACM Transactions on Networking (TON)
Computing approximate blocking probabilities for a class of all-optical networks

IEEE Journal on Selected Areas in Communications

ABOI: a novel strategy to mitigate the blocking due to outdated information in OCS/OBS network

Proceedings of the 28th Annual ACM Symposium on Applied Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This work introduces the problem of the best choice among M combinations of the shortest paths for dynamic provisioning of lightpaths in all-optical networks. To solve this problem in an optimized way (shortest path and load balance), a new fixed routing algorithm, named Best among the Shortest Routes (BSR), is proposed. The BSR's performance is compared in terms of blocking probability and network utilization with Dijkstra's shortest path algorithm and others algorithms proposed in the literature. The evaluated scenarios include several representative topologies for all-optical networking and different wavelength conversion architectures. For all studied scenarios, BSR achieved superior performance.