Hierarchical networks and the subnetwork partition problem

https://doi.org/10.1016/0169-7552(85)90004-2Get rights and content

Abstract

This paper describes the problem of having a network organized hierarchically, and having a subnetwork becoming physically partitioned. It describes how to detect partitions, how to identify individual partitions, how to locate nodes within a partition, how to route to a given partition, and how to route through a partitioned subnetwork.

References (4)

  • V. Cerf

    The Catenet Model for Internetworking

    Information Processing Techniques Office, Defense Advanced Research Projects Agency

    (July 1978)
  • J. Mcquillan

    The New Routing Algorithm for the ARPANET

    IEEE Trans. on Comm

    (May 1980)
There are more references available in the full text version of this article.

Cited by (15)

View all citing articles on Scopus
View full text