Distributed top-down hierarchy construction

Proceedings - IEEE INFOCOM

Volumn 2, Issue , 1998, Pages 693-701

  Thaler, David G ^a   Ravishankar, Chinya V ^a  

^a UNIVERSITY OF MICHIGAN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER NETWORKS; COMPUTER SIMULATION; CONSTRAINT THEORY; DATA COMMUNICATION SYSTEMS;

TOP DOWN HIERARCHY CONSTRUCTION;

NETWORK PROTOCOLS;

EID: 0031678933     PISSN: 0743166X     EISSN: None     Source Type: None    
DOI: 10.1109/INFCOM.1998.665091     Document Type: Conference Paper

References (21)

1. C. Zahn Graph-theoretical methods for detecting and describing gestalt clusters IEEE Trans. Computers 20 68 86 1971
2. W. Koontz P. Narendra K. Fukunaga A graph-theoretic approach to nonparametric cluster analysis IEEE Trans. Computers 25 9 936 944 Sep. 1976
3. R. Mizoguchi M. Shimura A nonparametric algorithm for detecting clusters using hierarchical structure IEEE Trans. Pattern Analysis and Machine Intelligence 2 4 292 300 July 1980
4. R. Urquhart Graph theoretical clustering based on limited neighbourhood sets Pattern Recognition 15 3 1982
5. P. Mockapetris Domain names-concepts and facilities RFC-1034 Nov. 1987
6. G. W. Neufeld Descriptive names in X.500 Proc. ACM SIGCOMM'89 64 70 Proc. ACM SIGCOMM'89 1989
7. P. F. Tsuchiya The landmark hierarchy: A new hierarchy for routing in very large networks Proceedings of the ACM SIGCOMM Proceedings of the ACM SIGCOMM 1988
8. P. F. Tsuchiya The landmark hierarchy: Description and analysis June 1987 MTR-87W00152 MITRE Corporation
9. P. F. Tsuchiya Landmark routing: Architecture, algorithms, and issues Sep. 1987 MTR-87W00174 MITRE Corporation
10. P. F. Tsuchiya R. Zahavi Landmark routing algorithms: Analysis and simulation results Dec. 1989 MTR-89W00277 MITRE Corporation
11. L. Kleinrock F. Kamoun Hierarchical routing for large networks: Performance evaluation and optimization Computer Networks 1 155 174 1977
12. N. Shacham J. Westcott Future directions in packet radio architectures and protocols Proceedings of the IEEE 75 1 83 99 Jan. 1987
13. J. Hagouel Issues in routing for large and dynamic networks May 1983 Columbia University
14. M. R. Garey D. S. Johnson Computers and Intractability: A Guide to the Theory of NP-Completeness June 1988 W. H. Freeman and Company
15. Estrin Handley Helmy Huang Thaler A dynamic bootstrap mechanism for rendezvous-based multicast routing IEEE/ACM Trans. Networking 1997
16. H. Garcia-Molina Elections in a distributed computing system IEEE Trans. Computers C-31 1 48 59 Jan. 1982
17. D. G. Thaler C. V. Ravishankar Distributed center-location algorithms IEEE J. Select. Areas in Commun. 15 3 291 303 Apr. 1997
18. D. G. Thaler An architecture for inter-domain network troubleshooting 1998 University of Michigan
19. H. Schulzrinne S. Casner R. Frederick V. Jacobson RTP: A transport protocol for real-time applications Jan. 1996 RFC-1889
20. D. G. Thaler C. V. Ravishankar Using name-based mappings to increase hit rates IEEE/ACM Trans. Networking 6 1 Feb. 1998
21. B. M. Waxman Routing of multipoint connections IEEE J. Select. Areas in Commun. 6 9 Dec. 1988