Improving topological routing in N2R networks

Authors:
Jose M. Gutierrez Lopez;Ruben Cuevas Rumin;Jens M. Pedersen;Ole B. Madsen
Affiliations:
Network and Security Department, Aalborg University, Aalborg, Denmark;Departamento de Ingeniera Telemtica, Escuela Politcnica, Superior Universidad Carlos III de Madrid, Legans, Madrid;Network and Security Department, Aalborg University, Aalborg, Denmark;Network and Security Department, Aalborg University, Aalborg, Denmark
Venue:
CAAN'07 Proceedings of the 4th conference on Combinatorial and algorithmic aspects of networking
Year:
2007

Citing 3
Cited 0

Analyzing Kleinberg's (and other) small-world Models

Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
BLINC: multilevel traffic classification in the dark

Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
Mesh-based Survivable Transport Networks: Options and Strategies for Optical, MPLS, SONET and ATM Networking

Mesh-based Survivable Transport Networks: Options and Strategies for Optical, MPLS, SONET and ATM Networking

Quantified Score

Hi-index	0.00

Visualization

Abstract

Topological routing is basically table free, and allows for very fast restoration and thus a high level of reliability in communication. It has already been satisfactorily proposed for some regular structures such as Grid or Honeycomb. An initial proposal has also been developed for the N2R structures. This paper proposes a modification of this previous algorithm, and in addition two other alternatives. The three options are systematically analyzed in terms of executing time and path distances, showing that trade-offs are needed in order to determine which algorithm is best for a given case. Also, the possible practical applications the methods could have, are discussed for different traffic scenarios.