Article

Free access

Randomized distance-vector routing protocol

Authors:

Sangman Bak,

Jorge A. CobbAuthors Info & Claims

SAC '99: Proceedings of the 1999 ACM symposium on Applied computing

Pages 78 - 84

https://doi.org/10.1145/298151.298201

Published: 28 February 1999 Publication History

PDF eReader

References

[1]

Alaettinoglu, C., Dussa-Zieget, K., Matta, I., Gudmundsson, O., and Shankar, A. U. MaRS - Maryland Routing Simulator Version 1.0. Department of Computer Science, University of Maryland, 1991

Digital Library

Google Scholar

[2]

Bahk, S. and Zarki, M. E., Dynamic Multi-path Routing and How it Compares with other Dynamic Routing Algorithms for High Speed Wide Area Networks, Proceedings of the 1992 ACM SIGCOMM Conference, Vol 22, Oct. 1992.

Digital Library

Google Scholar

[3]

Christian Huitema, ROUTING iN THE INTERNET, Prentice Hall PTR, New Jersey, 1995.

Digital Library

Google Scholar

[4]

David R. Cheriton, Sirpent: A high-performance intemetworking approach, Proceedings of the 1989 ACM SIGCOMM Conference, Sep. 1989.

Digital Library

Google Scholar

[5]

Dimitri P. Bertsekas, Linear Network Optimization: Algorithms and Codes, The MIT Press, 1991.

Digital Library

Google Scholar

[6]

Dixon, R.C., Pitt, D.A., Addressing, bridging, and source routing (LAN interconnection), IEEE Network, Vol. 2, No. 1, Jan. 1988.

Google Scholar

[7]

J.j. Garcia-Luna-Aceves, A M'mirnum-Hop Routing Algorithm Based on Distributed Information, Computer Networks and ISDN Systems, Vol. 16, pp. 367-382, May 1989.

Digital Library

Google Scholar

[8]

J.M. McQuillan, Ira Richer and E.C. Rosen, The New Routing Algorithm for the ARPANET, iEEE Trans. On Communications, Vol. COM-28, No. 5, pp. 711- 719, May 1980.

Google Scholar

[9]

Jorge A. Cobb and Gouda M. G., Balanced Routing, IEEE Proceedings of International Conference on Network Protocols, 1997.

Digital Library

Google Scholar

[10]

G. Malkin, RIP Version 2, {nternet Request for Comments 1723, Nov. 1994, Available from httv://~.ieff, c~.reston.va.us.

Google Scholar

[11]

Mohamed G. Gouda, Protocol verification made simple: a tutorial, Computer Networks and ISDN Systems, Vol. 25, pp. 969-980, 1993.

Digital Library

Google Scholar

[12]

Mohamed G. Gouda, The Elements of Network Protocol Design, A Wiley-Interseience Publication, John Wiley & Sons, Inc., 1998.

Digital Library

Google Scholar

[13]

Moy J., Ospf Version 2, lnternet Request for Comment~ 1583, March 1994. Available from httn://www.ieff, cnri.reston, va.us.

Google Scholar

[14]

S. Murthy and j.J. Garcia-Luna-Aceves, Congestion- Oriented Shortest Multipath Routing, Proc. IEEE INFOCOM 96, San Francisco, California, March 1996.

Digital Library

Google Scholar

[15]

A. Segall and M. Sidi, A failsafe distributed protocol for minimum delay routing, IEEE Trans. On Commun., COM-29(5), 686-695, May 1981.

Google Scholar

[16]

Sidhu D., Nair 1L, Abdallah S., Finding Disjoint Paths in Networks, Proceedings of the 1991 ACM SIGCOMM Conference.

Digital Library

Google Scholar

[17]

Wang Z., Crowcrofi J., Shortest Path First with Emergency Exists, Proceedings of the 1990 ACM SIGCOMM Conference.

Digital Library

Google Scholar

[18]

W.T. Zaumen and $.S. Garcia-Luna-Aceves, Loop-Free Mulfipath Routing Using Generalized Diffusing Computafiomn, Proe. IEEE INFOCOM 98, San Francisco, California, March 29, 1998.

Google Scholar

Cited By

View all

Elangovan AAgilandan ALakkshmanan A(2014)Building a Robust Software Based RouterAdvanced Computing, Networking and Informatics- Volume 210.1007/978-3-319-07350-7_20(181-188)Online publication date: 2014
https://doi.org/10.1007/978-3-319-07350-7_20
Li YGouda M(2009)The Blocking Option in Routing ProtocolsProceedings of the 2009 28th IEEE International Symposium on Reliable Distributed Systems10.1109/SRDS.2009.10(227-235)Online publication date: 27-Sep-2009
https://dl.acm.org/doi/10.1109/SRDS.2009.10
Zlatokrilov HLevy H(2008)Area Avoidance Routing in Distance-Vector NetworksIEEE INFOCOM 2008 - The 27th Conference on Computer Communications10.1109/INFOCOM.2008.95(475-483)Online publication date: Apr-2008
https://doi.org/10.1109/INFOCOM.2008.95
Show More Cited By

Index Terms

Randomized distance-vector routing protocol
1. Networks
  1. Network protocols
2. Software and its engineering
  1. Software organization and properties
    1. Contextual software domains
      1. Operating systems
        Communications management

Recommendations

Better Alternatives to OSPF Routing

The current standard for intra-domain network routing, Open Shortest Path First (OSPF), suffers from a number of problems-the tunable parameters (the weights) are hard to optimize, the chosen paths are not robust under changes in traffic or network state, ...
Fault-tolerant routing strategy using routing capability in hypercube multicomputers
ICPADS '96: Proceedings of the 1996 International Conference on Parallel and Distributed Systems

This paper addresses fault-tolerant routing which is concerned with finding feasible minimum paths in a faulty hypercube. The concept of routing capability, which is defined with respect to the entire spectrum of distance, is proposed to assist routing ...
Routing with load balancing: increasing the guaranteed node traffics

In this paper we introduce the novel routing scheme based on load balancing and shortest-path routing. First, we present the linear program for routing optimization. The nonblocking network is considered, which only limits the traffic loads of the ...

Comments

Information & Contributors

Information

Published In

SAC '99: Proceedings of the 1999 ACM symposium on Applied computing

February 1999

635 pages

ISBN:1581130864

DOI:10.1145/298151

Chairmen:
Barrett Bryant
Univ. of Alabama, Birmingham
,
Gary B. Lamont
Air Force Institute of Technology, Wright-Patterson, OH
,
Hisham Haddad
Marshall Univ., Huntington, WV
,
Janice Carroll
Sam Houston State Univ., Houston, TX

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: 28 February 1999

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

SAC99

Sponsor:

SAC99: 1999 Symposium on Applied Computing

February 28 - March 2, 1999

Texas, San Antonio, USA

Acceptance Rates

Overall Acceptance Rate 1,650 of 6,669 submissions, 25%

Upcoming Conference

SAC '25

Sponsor:
sigapp

The 40th ACM/SIGAPP Symposium on Applied Computing

March 31 - April 4, 2025

Catania , Italy

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

8
Total Citations
View Citations
465
Total Downloads

Downloads (Last 12 months)37
Downloads (Last 6 weeks)8

Reflects downloads up to 06 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Elangovan AAgilandan ALakkshmanan A(2014)Building a Robust Software Based RouterAdvanced Computing, Networking and Informatics- Volume 210.1007/978-3-319-07350-7_20(181-188)Online publication date: 2014
https://doi.org/10.1007/978-3-319-07350-7_20
Li YGouda M(2009)The Blocking Option in Routing ProtocolsProceedings of the 2009 28th IEEE International Symposium on Reliable Distributed Systems10.1109/SRDS.2009.10(227-235)Online publication date: 27-Sep-2009
https://dl.acm.org/doi/10.1109/SRDS.2009.10
Zlatokrilov HLevy H(2008)Area Avoidance Routing in Distance-Vector NetworksIEEE INFOCOM 2008 - The 27th Conference on Computer Communications10.1109/INFOCOM.2008.95(475-483)Online publication date: Apr-2008
https://doi.org/10.1109/INFOCOM.2008.95
Zlatokrilov HLevy H(2007)Navigation in Distance Vector Spaces and Its Use for Node Avoidance RoutingProceedings of the IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications10.1109/INFCOM.2007.149(1253-1261)Online publication date: 1-May-2007
https://dl.acm.org/doi/10.1109/INFCOM.2007.149
Fong JGilbert AKannan SStrauss M(2005)Better Alternatives to OSPF RoutingAlgorithmica10.1007/s00453-005-1161-243:1-2(113-131)Online publication date: 1-Sep-2005
https://dl.acm.org/doi/10.1007/s00453-005-1161-2
Bak S(2003)A Hierarchical Routing Method for Load-BalancingHigh Performance Computing - HiPC 200310.1007/978-3-540-24596-4_16(142-151)Online publication date: 2003
https://doi.org/10.1007/978-3-540-24596-4_16
Sangman Bak Cheng ACobb JLeiss E(2000)Load-balanced routing and scheduling for real-time traffic in packet-switch networksProceedings 25th Annual IEEE Conference on Local Computer Networks. LCN 200010.1109/LCN.2000.891110(634-643)Online publication date: 2000
https://doi.org/10.1109/LCN.2000.891110
Bak SCobb JLeiss E(1999)Hierarchical load-balanced routing via bounded randomizationProceedings Eight International Conference on Computer Communications and Networks (Cat. No.99EX370)10.1109/ICCCN.1999.805578(589-594)Online publication date: 1999
https://doi.org/10.1109/ICCCN.1999.805578

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.

Cited By

Index Terms

Recommendations

Better Alternatives to OSPF Routing

Fault-tolerant routing strategy using routing capability in hypercube multicomputers

Routing with load balancing: increasing the guaranteed node traffics

Comments

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Author Tags

Qualifiers

Conference

Acceptance Rates

Upcoming Conference

Other Metrics

Article Metrics

Other Metrics

Cited By

PDF

eReader

Login options

Full Access

References

Cited By

Index Terms

Recommendations

Better Alternatives to OSPF Routing

Fault-tolerant routing strategy using routing capability in hypercube multicomputers

Routing with load balancing: increasing the guaranteed node traffics

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Author Tags

Qualifiers

Conference

Acceptance Rates

Upcoming Conference

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations