article

Routing management in very large-scale networks

Author:

J. J. Aceves-Luna-GarciaAuthors Info & Claims

Future Generation Computer Systems, Volume 4, Issue 2

Pages 81 - 93

https://doi.org/10.1016/0167-739X(88)90009-X

Published: 01 September 1988 Publication History

Abstract

No abstract available.

Cited By

View all

Behrens JGarcia-Luna-Aceves J(1994)Distributed, scalable routing based on link-state vectorsACM SIGCOMM Computer Communication Review10.1145/190809.19032724:4(136-147)Online publication date: 1-Oct-1994
https://dl.acm.org/doi/10.1145/190809.190327
Behrens JGarcia-Luna-Aceves JCrowcroft J(1994)Distributed, scalable routing based on link-state vectorsProceedings of the conference on Communications architectures, protocols and applications10.1145/190314.190327(136-147)Online publication date: 1-Oct-1994
https://dl.acm.org/doi/10.1145/190314.190327
Garcia-Luna-Aceves J(1989)A unified approach to loop-free routing using distance vectors or link statesACM SIGCOMM Computer Communication Review10.1145/75247.7526819:4(212-223)Online publication date: 1-Aug-1989
https://dl.acm.org/doi/10.1145/75247.75268
Show More Cited By

Index Terms

Routing management in very large-scale networks

Recommendations

New approaches to routing for large-scale data networks
Greedy geographic routing in large-scale sensor networks: a minimum network decomposition approach

In geographic (or geometric) routing, messages are by default routed in a greedy manner: The current node always forwards a message to its neighbor node that is closest to the destination. Despite its simplicity and general efficiency, this strategy ...
Simulating Routing Schemes on Large-Scale Topologies
PADS '10: Proceedings of the 2010 IEEE Workshop on Principles of Advanced and Distributed Simulation

The expansion of the Internet routing system results in a number of research challenges, in particular, the Border Gateway Protocol (BGP) starts to show its limits a.o. in terms of the number of routing table entries it can dynamically process and ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image Future Generation Computer Systems

Future Generation Computer Systems Volume 4, Issue 2

Sept. 1988

72 pages

ISSN:0167-739X

Editor:
Peter P. Chen
Louisiana State Univ., Baton Rouge

Issue’s Table of Contents

Publisher

Elsevier Science Publishers B. V.

Netherlands

Publication History

Published: 01 September 1988

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

4
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 05 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Behrens JGarcia-Luna-Aceves J(1994)Distributed, scalable routing based on link-state vectorsACM SIGCOMM Computer Communication Review10.1145/190809.19032724:4(136-147)Online publication date: 1-Oct-1994
https://dl.acm.org/doi/10.1145/190809.190327
Behrens JGarcia-Luna-Aceves JCrowcroft J(1994)Distributed, scalable routing based on link-state vectorsProceedings of the conference on Communications architectures, protocols and applications10.1145/190314.190327(136-147)Online publication date: 1-Oct-1994
https://dl.acm.org/doi/10.1145/190314.190327
Garcia-Luna-Aceves J(1989)A unified approach to loop-free routing using distance vectors or link statesACM SIGCOMM Computer Communication Review10.1145/75247.7526819:4(212-223)Online publication date: 1-Aug-1989
https://dl.acm.org/doi/10.1145/75247.75268
Garcia-Luna-Aceves JLandweber L(1989)A unified approach to loop-free routing using distance vectors or link statesSymposium proceedings on Communications architectures & protocols10.1145/75246.75268(212-223)Online publication date: 1-Aug-1989
https://dl.acm.org/doi/10.1145/75246.75268

Abstract

Cited By

Index Terms

Recommendations

New approaches to routing for large-scale data networks

Greedy geographic routing in large-scale sensor networks: a minimum network decomposition approach

Simulating Routing Schemes on Large-Scale Topologies

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Share

Share this Publication link

Share on social media

Affiliations