Data networks
Source routing in computer networks
ACM SIGCOMM Computer Communication Review
Routing high-bandwidth traffic in max-min fair share networks
Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
A technique for partial broadcasting in networks (abstract)
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
Randomized distance-vector routing protocol
Proceedings of the 1999 ACM symposium on Applied computing
FIRE: flexible Intra-AS routing environment
Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
The Journal of Supercomputing
Traffic load monitoring and load balancing for the Internet
Cluster Computing
Crankback Prediction in Hierarchical ATM Networks
Journal of Network and Systems Management
Multi-Service Dynamic QoS Routing Schemes with Call Admission Control: A Comparative Study
Journal of Network and Systems Management
An Adaptive Flow-Level Load Control Scheme for Multipath Forwarding
ICN '01 Proceedings of the First International Conference on Networking-Part 1
IWDC '02 Proceedings of the 4th International Workshop on Distributed Computing, Mobile and Wireless 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
Dynamic Lazy Calendar Queue: An Event List for Network Simulation
HPC-ASIA '97 Proceedings of the High-Performance Computing on the Information Superhighway, HPC-Asia '97
Improving the efficiency of multipath traffic via opportunistic traffic scheduling
Computer Networks: The International Journal of Computer and Telecommunications Networking
Performance modeling and analysis of multi-path routing in integrated fiber-wireless networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
Minimum-cost multiple paths subject to minimum link and node sharing in a network
IEEE/ACM Transactions on Networking (TON)
Performance analysis of alternate routing with trunk reservation in multirate switched networks
Computer Communications
| Hi-index | 0.00 |
In this paper we describe briefly a dynamic multi-path routing scheme that has been considered for connection oriented homogeneous high speed networks. The fundamental objective of the scheme is to bridge the gap between routing and congestion control as the network becomes congested. Because propagation delay far out shadows queueing and transmission delay in high speed networks, the proposed routing scheme works as a shortest path (minimum hop) first algorithm under light traffic conditions. However as the shortest path becomes congested, the source node uses multiple paths when and if available in order to distribute the load and reduce packet loss. The scheme is a cross between Alternate Path routing and Trunk Reservation.We compare the performance of the proposed scheme with the Shortest Path Only algorithm, the Alternate Path routing algorithm, the Random Routing algorithm, and the Trunk Reservation scheme. The throughput and packet loss performance are compared via simulations. These have been carried out concentrating on a 5 node network with varying traffic patterns, the intention being to gain insight into the strengths and weaknesses of the various schemes.