All-to-all disjoint multipath routing using cycle embedding

Authors:
Sandeep K. Ahuja;Srinivasan Ramasubramanian
Affiliations:
Department of Electrical and Computer Engineering, University of Arizona, Tucson, AZ 85721, United States;Department of Electrical and Computer Engineering, University of Arizona, Tucson, AZ 85721, United States
Venue:
Computer Networks: The International Journal of Computer and Telecommunications Networking
Year:
2008

Citing 10
Cited 2

Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications
An engineering approach to computer networking: ATM networks, the Internet, and the telephone network

An engineering approach to computer networking: ATM networks, the Internet, and the telephone network
The Complexity of Near-Optimal Graph Coloring

Journal of the ACM (JACM)
Ad-hoc On-Demand Distance Vector Routing

WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
Stable Node-Disjoint Multipath Routing with Low Overhead in Mobile Ad Hoc Networks

MASCOTS '04 Proceedings of the The IEEE Computer Society's 12th Annual International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems
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
Disjoint multipath routing using colored trees

Computer Networks: The International Journal of Computer and Telecommunications Networking
Congestion-oriented shortest multipath routing

INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 3
Distributed linear time construction of colored trees for disjoint multipath routing

NETWORKING'06 Proceedings of the 5th international IFIP-TC6 conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems
Routing of multipoint connections

IEEE Journal on Selected Areas in Communications

Probing multiple node-disjoint paths using multi-labelled tree traversing

International Journal of Autonomous and Adaptive Communications Systems
Hamiltonian cycles passing through linear forests in k-ary n-cubes

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we evaluate the performance of disjoint multipath routing approaches for all-to-all routing in packet-switched networks with respect to packet overhead, path length, and routing table size. We develop a novel approach based on cycle embedding to obtain two node-disjoint paths between all source-destination pairs with reduced number of routing table entries maintained at a node (hence the reduced lookup time), small average path length, and less packet overhead. We study the trade-off between the number of routing table entries maintained at a node and the average length of the two disjoint paths by: (a) formulating the cycle-embedding problem as an integer linear program; and (b) developing a heuristic. We show that the number of routing table entries at a node may be reduced to at most two per destination using cycle-embedding approach if the average length of the disjoint paths are allowed to exceed the minimum by 25%.