Distributed and fail-safe routing algorithms in toroidal-based metropolitan area networks

  • Wong J
  • Kang Y
  • 4

    Readers

    Mendeley users who have this article in their library.
  • 8

    Citations

    Citations of this article.

Abstract

A two-dimensional toroidal network is simply a rectangular mesh where opposite nodes on the left and right boundaries are connected to each other and opposite nodes on the upper and lower boundaries are also connected to each other. Examples of toroidal based metropolitan area networks are HR4-NET and Manhattan Street Network (MSN). The original routing algorithm for HR4-NET proposed by Borgonovo and Cadorin, however, does not direct packets through shortest paths. This paper presents shortest path routing algorithms for HR4-NET, which are distributed and fail-safe. These algorithms can also be applied to multiple traffic types. Simple routing rules that use of the regular structure of the network are compared to MSN. © 1990.

Author-supplied keywords

  • Fail-safe routing
  • distributed algorithm
  • metropolitan area networks
  • shortest path routing

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

Authors

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free