Nothing Special   »   [go: up one dir, main page]

skip to main content
article

A minimum-hop routing algorithm bases on distributed information

Published: 01 May 1989 Publication History

Abstract

No abstract available.

Cited By

View all

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image Computer Networks and ISDN Systems
Computer Networks and ISDN Systems  Volume 16, Issue 5
May 1989
65 pages
ISSN:0169-7552
Issue’s Table of Contents

Publisher

Elsevier Science Publishers B. V.

Netherlands

Publication History

Published: 01 May 1989

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 29 Nov 2024

Other Metrics

Citations

Cited By

View all
  • (2018)An adaptive---alternative restoration algorithm for optical networksPhotonic Network Communications10.1007/s11107-017-0729-535:1(35-52)Online publication date: 1-Feb-2018
  • (1999)Randomized distance-vector routing protocolProceedings of the 1999 ACM symposium on Applied computing10.1145/298151.298201(78-84)Online publication date: 28-Feb-1999
  • (1993)Loop-free routing using diffusing computationsIEEE/ACM Transactions on Networking10.1109/90.2229131:1(130-141)Online publication date: 1-Feb-1993
  • (1992)Simulation based performance study of a dynamic routing algorithmACM SIGSIM Simulation Digest10.1145/141426.14142922:1(28-38)Online publication date: 1-Jul-1992
  • (1991)Dynamics of distributed shortest-path routing algorithmsACM SIGCOMM Computer Communication Review10.1145/115994.11599721:4(31-42)Online publication date: 1-Aug-1991
  • (1991)Dynamics of distributed shortest-path routing algorithmsProceedings of the conference on Communications architecture & protocols10.1145/115992.115997(31-42)Online publication date: 1-Aug-1991
  • (1990)Shortest paths and loop-free routing in dynamic networksACM SIGCOMM Computer Communication Review10.1145/99517.9955020:4(177-187)Online publication date: 1-Aug-1990
  • (1990)Shortest paths and loop-free routing in dynamic networksProceedings of the ACM symposium on Communications architectures & protocols10.1145/99508.99550(177-187)Online publication date: 1-Aug-1990
  • (1989)A loop-free extended Bellman-Ford routing protocol without bouncing effectACM SIGCOMM Computer Communication Review10.1145/75247.7526919:4(224-236)Online publication date: 1-Aug-1989
  • (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
  • Show More Cited By

View Options

View options

Login options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media