A constrained version of a clustering algorithm for switch placement and interconnection in large networks

19th International Conference on Computer Applications in Industry and Engineering, CAINE 2006

Volumn , Issue , 2006, Pages 252-257

  Grout, Vic ^a   Cunningham, Stuart ^a  

^a GLYNDWR UNIVERSITY   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

GEOMETRIC FORM; LARGE NETWORKS; MAXIMUM LOAD; NEIGHBOURHOOD; ORIGINAL ALGORITHMS; WEIGHT CONSTRAINTS;

COMPUTER APPLICATIONS;

CLUSTERING ALGORITHMS;

EID: 84883265652     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (16)

1. J. G. Klincewicz, "Hub location in backbone/tributary network design: A review", Location Science, Vol. 6, 1998, pp. 307-335.
2. S. Soni, R. Gupta, and H. Pirkul, "Survivable Network Design: The state of the art", Information Systems Frontiers, Vol. 1, 1999, pp. 303-315.
3. V. Grout, "Optimisation Techniques for Telecommunication Networks", PhD Thesis, Plymouth Polytechnic, 1988.
4. B. Gavish, "Topological design of computer communication networks - The overall design problem", European Journal of Operational Research, Vol. 58, 1992, pp. 149-172.
5. R. B. Boorstyn and H. Frank, "Large-scale network topological optimization.", IEEE Transactions on Communications, Vol. 25, 1977, pp. 29-47.
6. S. Lin and J. H. Rath, "Designing networks for AT&T's customers", AT&T Technology, Vol. 2, 1987, pp. 18-25.
7. C. L. Monma and D. D. Sheng, "Backbone network design and performance analysis: A methodology for packet switching networks", IEEE Journal on Selected Areas in Communications", Vol. SAC-4, 1986, pp. 946- 965.
8. E. Rosenberg, "Dual Ascent for uncapacitated telecommunications network design with access, backbone and switch costs", Telecommunications Systems, Vol. 16, 2001, pp. 423-435.
9. V. Grout, R. Picking, S. Cunningham and R. Hebblewhite, "Compound Algorithms for Realistic Large-Scale Network Optimisation", Internet Research (to appear) 2006.
10. L. Kleinrock and F. Kamoun, "Optimal clustering structures for hierarchical topological design of large computer networks", Networks, Vol. 10, 1980, pp. 221-248.
11. D. Saha and A. Mukherjee, "Design of hierarchical communication networks under node/link failure constraints", Computer Communications, Vol. 18, 1995, pp. 378-383.
12. V. Grout, P.W. Sanders & C.T. Stockel, "Reduction Techniques Providing Initial Groupings for Euclidean Travelling Salesman PatchingAlgorithms", Applied Mathematical Modelling, Vol. 13, February 1989, pp110-114.
13. V. Grout, "A Distribution-Aware Partitioning Algorithm with Variable-Order Perturbation to Approximate Optimal Tours", Proceedings of the International Conference on Modeling and Optimization, MODOPT 2004, Temuco, Chile, 19th-22nd January 2004.
14. V. Grout, R. Picking, S. Cunningham and R.Hebblewhite, "Realistic Large-Scale Network Optimisation", Proceedings of the sixth International Network Conference (INC 2006), University of Plymouth, UK, 11-14 July 2006, pp121-130.
15. R. Chan, Wide Area Network Design: Concepts and tools for optimization, Morgan Kaufmann, 1998.
16. V. Gabrel, A. Knipple and M. Minoux, "Exact Solution of Multicommodity Network Optimization Problems with General Step Functions", Operations Research Letters, Vol. 25, pp15-23, 1999.