Computer Networks and ISDN Systems
Volume 9, Issue 4, April 1985, Pages 297-303
Hierarchical networks and the subnetwork partition problem
References (4)
The Catenet Model for Internetworking
Information Processing Techniques Office, Defense Advanced Research Projects Agency
(July 1978)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)
Efficient clustering algorithms for self-organizing wireless sensor networks
2006, Ad Hoc NetworksQuo Vadis - A framework for intelligent routing in large communication networks
1997, Journal of Systems and SoftwareReliability optimization of communication networks using simulated annealing
1993, Microelectronics ReliabilityOn the reliability evaluation of dynamic networks with m-level hierarchical routing
1989, Microelectronics ReliabilityOverall reliability evaluation of hierarchical computer networks with dynamic behaviour
1989, Microelectronics ReliabilityOn the determination of overall computer network reliability with m-level hierachical routing
1988, Microelectronics Reliability
Copyright © 1985 Published by Elsevier B.V.