Optimization algorithms for large self-structuring networks

Proceedings - IEEE INFOCOM

Volumn 1, Issue , 1999, Pages 71-78

  Krishnan, Rajesh ^a   Ramanathan, Ram ^a   Steenstrup, Martha ^a  

^a BBN TECHNOLOGIES   (United States)

Author keywords

Clustering; Graph partitioning; Hierarchical network organization

Indexed keywords

CLUSTERING; GRAPH PARTITIONING; HIERARCHICAL NETWORK; HIERARCHICAL ORGANIZATIONS; MULTILEVEL TECHNIQUE; NETWORK HIERARCHIES; OPTIMIZATION ALGORITHMS; POST PROCESSING; SELF-STRUCTURING;

ALGORITHMS; INTERNET PROTOCOLS; OPTIMIZATION; HEURISTIC METHODS; MATHEMATICAL MODELS;

GRAPH THEORY; COMPUTER NETWORKS;

GRAPH PARTITIONING; HIERARCHICAL NETWORK ORGANIZATION; SELF-STRUCTURING NETWORKS;

EID: 0032632328     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.1999.749254     Document Type: Conference Paper

References (34)

1. P. Arabie, L.J.Hubert and G. De Soete (eds.), "Clustering and Classification, " World Scientific, 1996.
2. ATM Forum Technical Committee, "Private Network-Network Interface Specification, " Version 1.0 (PNNI), Mar 1996.
3. B. Awerbuch and Y. Shavitt, "Topology Aggregation for Directed Graph, " Third IEEE Symposium on Computers and Communication, Jun 1998.
4. A.E. Baratz and J.M. Jaffe, "Establishing Virtual Circuits in Large Computer Networks, " Computer Networks and ISDN Systems, Vol. 12, pp. 27-37, 1986.
5. K.L. Calvert, M.B. Doar and E.W. Zegura, "Modeling Internet Topology, " IEEE Communications Magazine, Jun 1997.
6. I. Castineyra, N. Chiappa and M. Steenstrup, "The Nimrod Routing Architecture, " Request for Comments: 1992, IETF Network Working Group, Aug 1996.
7. H. de Fraysseix and P. Kuntz, "Pagination of Large-Scale Networks, " Algorithms Review, Vol. 2, No. 3, pp. 105-112, 1992.
8. C.M. Fiduccia and R.M. Mattheyses, "A Linear Time Heuristic for Improving Network Partitions, " Proc. ACM-IEEE 19th Design Automation Conference, Las Vegas, pp. 175-181, 1982.
9. J.J. Garcia-Luna-Aceves, "Routing Management in Very Large-Scale Networks, " Future Generation Computer Systems Vol. 4, pp. 81-93, 1988.
10. M.R. Garey and D.S. Johnson, "Computers and Intractability: A Guide to the Theory of NP-Completeness, " Freeman Inc., 1979.
11. O. Goldschmidt and D. S. Hochbaum, "A Polynomial Algorithm for the K-cut Problem for Fixed K", Mathematics of Operations Research, Vol. 19., No. 1, pp. 24-37, Feb 1994.
12. T.F. Gonzalez, "On the Computational Complexity of Clustering and Related Problems, " Proc. 10th IFIP Conference on System Modeling and Optimization, New York, NY, USA, pp. 174-182, Sep 1981.
13. J.A. Hartigan, "Clustering Algorithms, " Wiley, New York, NY, USA, 1975.
14. B. Hendrickson and R. Leland, "A Multilevel Algorithm for Partitioning Graphs, " Proc. Supercomputing'95, San Diego, CA, USA, Dec 1995.
15. D.S. Johnson, C R. Aragon, L A. McGeoch and C. Schevon, "Optimization by Simulated Annealing: An Experimental Evaluation; Part 1, Graph Partitioning, " Operations Research, Vol. 37, No.6, pp. 865-892, 1989.
16. F. Kamoun and L. Kleinrock, "Stochastic Performance Evaluation of Hierarchical Routing for Large Networks, " Computer Networks, Vol. 3, No. 5, pp. 337-353, 1979.
17. D.R. Karger and C. Stein, "A New Approach to the Minimum Cut Problem, " Journal of the ACM, Vol. 43, No.4, pp. 601-640, Jul 1996.
18. G. Karypis and V. Kumar, "Analysis of Multilevel Graph Partitioning, " Proc. Supercomputing'95, San Diego, CA, USA, Dec 1995.
19. G. Karypis and V. Kumar, "Multilevel k-way Partitioning Scheme for Irregular Graphs, " Tech Report 95-064, Department of Computer Science, University of Minnesota, 1995.
20. B.W. Kernighan and S. Lin, "An Efficient Heuristic Procedure for Partitioning Graphs, " Bell Technical Journal, pp. 291-307, Feb 1970.
21. L. Kleinrock and F. Kamoun, "Hierarchical Routing for Large Networks: Performance Evaluation and Optimization, " Computer Networks, Vol. 1, No. 1, pp. 155-174, 1977.
22. D.E. Knuth, "The Stanford GraphBase: A Platform for Combinatorial Computing, " ACM Press with Addison-Wesley Publishing Company, 1993.
23. G.S. Lauer, "Hierarchical Routing Design for SURAN, " Proc. ICC'86, Toronto, Canada, pp. 93-102, Jun 1986.
24. W.C. Lee, "Topology Aggregation for Hierarchical Routing in ATM Networks, " ACM SIGCOMM Computer Communications Review, Apr 1995, Vol. 25, No.2, pp. 82-92, Apr 1995.
25. C.R. Lin and M.Gerla, "Adaptive Clustering for Mobile Wireless Networks, " IEEE JSAC, Vol. 15, No. 7, pp. 1265-1275, Sep 1997.
26. H.S. Maini, K.G. Mehrotra, C.K. Mohan, and S. Ranka, "Genetic Algorithms for Graph Partitioning and Incremental Graph Partitioning, " Proc. Supercomputing'94, Washington D.C., USA, pp. 449-457, Nov 1994.
27. J. McQuillan, "Adaptive Routing Algorithms for Distributed Computer Networks, " BBN Report No. 2831, May 1974.
28. J. Moy, "OSPF Version 2, " Request for Comments: 2328, IETF Network Working Group, Apr 1998.
29. K.H. Muralidhar and M.K. Sundareshan, "A Hierarchical Scheme for Multiobjective Adaptive Routing in Large Communication Networks, " Proc. IEEE, Vol. 71, Dec 1983.
30. C.V. Ramamoorthy, A. Bhide, and J. Srivastava, "Reliable Clustering Techniques for Large, Mobile Packet Radio Networks, " pp. 218-226, 1987.
31. R. Ramanathan and M. Steenstrup, "Hierarchically-Organized, Multihop Mobile Wireless Networks for Quality-of-Service Support, " Mobile Networks and Applications, Vol. 3, No. 2, Aug 1998.
32. H.D. Simon and S.-H. Teng, "How good is recursive bisection ?, " SIAM Journal of Scientific Computing, Vol. 18, No. 5, pp. 1436-1445, Sept 1997.
33. L. Tao, Y.C. Zhao, K. Thulasiraman and M.N.S. Swamy, "Simulated Annealing and Tabu Search Algorithms for Multiway Graph Partition, " Journal of Circuits, Systems and Computers, Vol. 2, No. 2, pp. 159-185, 1992.
34. W.T. Tsai, C.V. Ramamoorthy, W.K. Tsai and O. Nishiguchi, "An Adaptive Hierarchical Routing Protocol, " IEEE Trans. Computers, Vol. 38, No. 8, pp. 1059-1075, Aug 1989.