article

Free access

Dynamic multi-path routing and how it compares with other dynamic routing algorithms for high speed wide area network

Authors:

Saewoong Bahk,

Magda El ZarkiAuthors Info & Claims

ACM SIGCOMM Computer Communication Review, Volume 22, Issue 4

Pages 53 - 64

https://doi.org/10.1145/144191.144205

Published: 01 October 1992 Publication History

PDF eReader

Abstract

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.

References

[1]

Bahk, S. and Zarki, M. E., "Routing in ATM Networks", 7th International Teletraftic Congress, New Jersey, 1990

Google Scholar

[2]

Bertsekas, D. and Gallager, R., Data Networks, Prentice-Hall, 1987, Englewood Cliffs, NJ 07632

Digital Library

Google Scholar

[3]

Rudin, H. and Mueller, H., "Dynamic Routing and Flow Control", IEEE Trans. on Comm., Vol. Com-28, No. 7, July 1980.

Google Scholar

[4]

Sunshine, C., "Source Routing in Computer Networks", A CM Computer Communication Review, Vol. 7, No. 1, pp. 29-33, Jan. 1977

Digital Library

Google Scholar

[5]

Woodruff, G.M., Rogers, R.G.H., and Richards, P.S., "A Congestion Control Framework for High Speed Integrated Packetized Transport", Proceedings of iEEE Globecom'88, 1988.

Crossref

Google Scholar

Cited By

View all

Wang ZZhang LZheng ZWang J(2017)Energy balancing RPL protocol with multipath for wireless sensor networksPeer-to-Peer Networking and Applications10.1007/s12083-017-0585-111:5(1085-1100)Online publication date: 13-Jul-2017
https://doi.org/10.1007/s12083-017-0585-1
Wang ZZhang LZheng ZWang J(2016)An Optimized RPL Protocol for Wireless Sensor Networks2016 IEEE 22nd International Conference on Parallel and Distributed Systems (ICPADS)10.1109/ICPADS.2016.0047(294-299)Online publication date: Dec-2016
https://doi.org/10.1109/ICPADS.2016.0047
Wang XWang X(2013)Generalizations and Interesting DirectionsScheduling and Congestion Control for Wireless Internet10.1007/978-1-4614-8420-2_4(39-51)Online publication date: 31-Jul-2013
https://doi.org/10.1007/978-1-4614-8420-2_4
Show More Cited By

Index Terms

Dynamic multi-path routing and how it compares with other dynamic routing algorithms for high speed wide area network

Recommendations

Dynamic multi-path routing and how it compares with other dynamic routing algorithms for high speed wide area network
SIGCOMM '92: Conference proceedings on Communications architectures & protocols

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 ...
A Dynamic Multi-Path Routing Algorithm for ATM Networks

In this paper we describe briefly a dynamic multi-path routing scheme that has been considered for connection oriented homogeneous high-speed wide area Asynchronous Transfer Mode (ATM) networks. The fundamental objective of the scheme is to bridge the ...
Congestion Control in High Speed Networks via Alternate Path Routing

This paper presents a congestion control scheme based on alternate path routing. In the scheme, if a node encounters congestion or loses its preferred neighbor on its primary path to a destination, it sends data packets to that destination over ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM SIGCOMM Computer Communication Review

ACM SIGCOMM Computer Communication Review Volume 22, Issue 4

Oct. 1992

308 pages

ISSN:0146-4833

DOI:10.1145/144191

Editors:
David Oran
Digital Equipment Corporation, Littleton, MA
,
Deepinder P. Sidhu
Univ. of Maryland, Baltimore

Issue’s Table of Contents

SIGCOMM '92: Conference proceedings on Communications architectures & protocols
October 1992
326 pages
ISBN:0897915259
DOI:10.1145/144179
Chairman:
Deepinder P. Sidhu
Univ. of Maryland, Baltimore
,
Editor:
David Oran
Digital Equipment Corporation, Littleton, MA

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 October 1992

Published in SIGCOMM-CCR Volume 22, Issue 4

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

68
Total Citations
View Citations
1,128
Total Downloads

Downloads (Last 12 months)141
Downloads (Last 6 weeks)30

Reflects downloads up to 15 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Wang ZZhang LZheng ZWang J(2017)Energy balancing RPL protocol with multipath for wireless sensor networksPeer-to-Peer Networking and Applications10.1007/s12083-017-0585-111:5(1085-1100)Online publication date: 13-Jul-2017
https://doi.org/10.1007/s12083-017-0585-1
Wang ZZhang LZheng ZWang J(2016)An Optimized RPL Protocol for Wireless Sensor Networks2016 IEEE 22nd International Conference on Parallel and Distributed Systems (ICPADS)10.1109/ICPADS.2016.0047(294-299)Online publication date: Dec-2016
https://doi.org/10.1109/ICPADS.2016.0047
Wang XWang X(2013)Generalizations and Interesting DirectionsScheduling and Congestion Control for Wireless Internet10.1007/978-1-4614-8420-2_4(39-51)Online publication date: 31-Jul-2013
https://doi.org/10.1007/978-1-4614-8420-2_4
Wang JWu KLi SQiao C(2010)Performance modeling and analysis of multi-path routing in integrated fiber-wireless networksProceedings of the 29th conference on Information communications10.5555/1833515.1833578(311-315)Online publication date: 14-Mar-2010
https://dl.acm.org/doi/10.5555/1833515.1833578
Zheng SWang JYang BYang M(2010)Minimum-cost multiple paths subject to minimum link and node sharing in a networkIEEE/ACM Transactions on Networking10.1109/TNET.2010.204451418:5(1436-1449)Online publication date: 1-Oct-2010
https://dl.acm.org/doi/10.1109/TNET.2010.2044514
Wang QVu LNahrstedt KKhurana H(2010)MIS: Malicious Nodes Identification Scheme in Network-Coding-Based Peer-to-Peer Streaming2010 Proceedings IEEE INFOCOM10.1109/INFCOM.2010.5462226(1-5)Online publication date: Mar-2010
https://doi.org/10.1109/INFCOM.2010.5462226
Wang JWu KLi SQiao C(2010)Performance Modeling and Analysis of Multi-Path Routing in Integrated Fiber-Wireless Networks2010 Proceedings IEEE INFOCOM10.1109/INFCOM.2010.5462221(1-5)Online publication date: Mar-2010
https://doi.org/10.1109/INFCOM.2010.5462221
Wang YLi KWu J(2010)Distance Estimation by Constructing The Virtual Ruler in Anisotropic Sensor Networks2010 Proceedings IEEE INFOCOM10.1109/INFCOM.2010.5461928(1-9)Online publication date: Mar-2010
https://doi.org/10.1109/INFCOM.2010.5461928
Scheibe KRagsdale C(2009)A model for the capacitated, hop-constrained, per-packet wireless mesh network design problemEuropean Journal of Operational Research10.1016/j.ejor.2008.07.020197:2(773-784)Online publication date: Sep-2009
https://doi.org/10.1016/j.ejor.2008.07.020
Das AMartel CMukherjee BRai S(2007)A Better Approach to Reliable Multi-Path ProvisioningIEEE GLOBECOM 2007-2007 IEEE Global Telecommunications Conference10.1109/GLOCOM.2007.516(2724-2728)Online publication date: Nov-2007
https://doi.org/10.1109/GLOCOM.2007.516
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

References

Cited By

Index Terms

Recommendations