Congestion-oriented shortest multipath routing

Authors:
Shree Murthy;J. J. Garcia-Luna-Aceves
Affiliations:
Computer Engineering Department, University of California, Santa Cruz, CA;Computer Engineering Department, University of California, Santa Cruz, CA
Venue:
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
Year:
1996

Citing 6
Cited 12

Analysis and simulation of a fair queueing algorithm

SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
A generalized processor sharing approach to flow control in integrated services networks: the single-node case

IEEE/ACM Transactions on Networking (TON)
Loop-free routing using diffusing computations

IEEE/ACM Transactions on Networking (TON)
A generalized processor sharing approach to flow control in integrated services networks: the multiple node case

IEEE/ACM Transactions on Networking (TON)
Reliable and efficient hop-by-hop flow control

SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Credit-based flow control for ATM networks: credit update protocol, adaptive credit allocation and statistical multiplexing

SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications

Randomized distance-vector routing protocol

Proceedings of the 1999 ACM symposium on Applied computing
Traffic load monitoring and load balancing for the Internet

Cluster Computing
An adaptive framework for QoS routing through multiple paths in ad hoc wireless networks

Journal of Parallel and Distributed Computing - Special issue on Routing in mobile and wireless ad hoc networks
Disjoint multipath routing using colored trees

Computer Networks: The International Journal of Computer and Telecommunications Networking
Linear time distributed construction of colored trees for disjoint multipath routing

Computer Networks: The International Journal of Computer and Telecommunications Networking
All-to-all disjoint multipath routing using cycle embedding

Computer Networks: The International Journal of Computer and Telecommunications Networking
Optimal routing for end-to-end guarantees using Network Calculus

Performance Evaluation
On path selection and rate allocation for video in wireless mesh networks

IEEE/ACM Transactions on Networking (TON)
Maintaining colored trees for disjoint multipath routing under node failures

IEEE/ACM Transactions on Networking (TON)
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
Independent directed acyclic graphs for resilient multipath routing

IEEE/ACM Transactions on Networking (TON)
Dynamic resource-allocation for congestion-control in high-speed LAN Interconnection

Computer Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a framework for the modeling of multipath routing in connectionless networks that dynamically adapt to network congestion. The basic routing protocol uses a short-term metric based on hop-by-hop credits to reduce congestion over a given link, and a long-term metric based on end-to-end path delay to reduce delays from a source to a given destination. A worst-case bound on the end-to-end path delay is derived under three architectural assumptions: each router adopts weighted fair queueing (or packetized generalized processor sharing) service discipline on a per destination basis, a permit-bucket filter is used at each router to regulate traffic flow on a per destination basis, and all paths are loop free. The shortest multipath routing protocol regulates the parameters of the destination-oriented permit buckets and guarantees that all portions of a multipath are loop free.