Topology design and bridge-capacity assignment for interconnecting token ring LANs: A simulated annealing approach

Telecommunication Systems

Volumn 6, Issue 1, 1996, Pages 21-43

  LeBlanc, Larry J ^a   Park, June S ^b   Sridhar, V ^c   Kalvenes, Joakim ^d  

^a VANDERBILT UNIVERSITY   (United States)

^b UNIVERSITY OF IOWA   (United States)

^c OHIO UNIVERSITY   (United States)

^d UNIVERSITY OF TEXAS AT DALLAS   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 21444453363     PISSN: 10184864     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF02114284     Document Type: Article

References (31)

1. R.R. Boorstyn and H. Frank, Large scale network topological optimization, IEEE Trans. Commun. COM-25(1977)29-46.
2. W. Bux, Token-ring local-area networks and their performance, Proc. IEEE 77(1989)238-256.
3. J.J. Dongarra, Performance of various computers using standard linear equations software, Technical Report CS-89-85, Computer Science Department, University of Tennessee, Knoxville, TN (1993).
4. P.C. Fetterolf and G. Anandalingam, Optimizing interconnection of local area networks: An approach using simulated annealing, ORSA J. Comput. 3(1991)275-287.
5. P.C. Fetterolf and G. Anandalingam, A Lagrangian relaxation technique for optimizing interconnection of local area networks, Oper. Res. 40(1992)678-688.
6. L. Fratta, M. Gerla and L. Kleinrock, The flow deviation method: An approach to store-and-forward computer communication network design, Networks 3(1973)97-133.
7. B. Gavish, A general model for the topological design of computer networks, GLOBECOM-86 (1986) pp. 1584-1588.
8. B. Gavish, Topological design of computer communication networks - The overall design problem, Euro. J. Oper. Res. 58(1992)149-172.
9. B. Gavish and K. Altinkemer, Backbone network design tools with economic tradeoffs, ORSA J. Comput. 2(1990)236-252.
10. B. Gavish and I. Neuman, A system for routing and capacity assignment in computer communication networks, IEEE Trans. Commun. COM-37(1989)360-366.
11. B. Gavish, B. Trudeau, P. Dror, M. Gendreau and L. Mason, Fiber optic circuit network design under reliability constraints, IEEE J. Select. Areas Commun. SAC-7(1989)1181-1187.
12. A.M. Geoffrion, Lagrangian relaxation for integer programming, Math. Progr. 2(1974)82-114.
13. M. Gerla and L. Kleinrock, On the topological design of distributed computer networks, IEEE Trans. Commun. COM-25(1977)48-60.
14. M. Gerla and L. Kleinrock, Congestion control in interconnected LANs, IEEE Networks 2(1988) 72-76.
15. S. Gupta and K.W. Ross, Performance modeling and optimization of networks of bridged LANs, Queueing Systems 9(1991)113-132.
16. Vendor Master Directory and Vendor Catalogs on CD-ROM, Information Handling Services, Englewood, CO (1993).
17. A. Kershenbaum, P. Kermani and G. Grover, MENTOR: An algorithm for mesh network topological optimization and routing, IEEE Trans. Commun. COM-39(1991)503-513.
18. P.J.M. van Laarhoven and E.H.L. Aarts, Simulated Annealing: Theory and Applications (Reidel, Dordrecht, 1987).
19. L.J. LeBlanc, Mathematical programming algorithms for large-scale network equilibrium and network design problems, Ph.D. Dissertation, Department of Industrial Engineering and Management Sciences, Northwestern University, Evanston, IL (1973).
20. T.L. Magnanti and R.T. Wong, Network design and transportation planning: Models and algorithms, Transport. Sci. 18(1984)1-55.
21. T. Mikkelson, Network Systems Corp., private communication.
22. C.L. Monma and D.D. Sheng, Backbone network design and performance analysis: A methodology for packet switching networks, IEEE J. Select. Areas Commun. SAC-4(1986)946-965.
23. C.H. Papadimitriou, The complexity of the capacitated tree problems, Networks 8(1978)217-230.
24. J.S. Park, R. Bartoszynski and W.A. Rosenkrantz, Stability of p-persistent CSMA/CD, ORSA J. Comput., to be published.
25. J.S. Park and K. Kang, Delay analysis of multidimensional queueing process in CSMA/CD local area networks, Telecom. Syst. 1(1993)217-242.
26. J.S. Park and V. Sridhar, Optimal interconnection of token ring networks using source routing bridges, Proc. Telecommunication Systems Conf., Vanderbilt University, Nashville, TN (1993) pp. 463-475.
27. R. Perlman, Interconnection: Bridges and Routers (Addison-Wesley, Reading, 1992).
28. V. Sridhar, Optimal design of interconnected local area networks, Ph.D. Dissertation, Department of Management Sciences, The University of Iowa, Iowa City, IA (1994).
29. H. Takagi, Application of polling models to computer networks, IBM Research Report RT 0032 (1990).
30. L.G. Valiant, The complexity of enumeration and reliability problems, SIAM J. Comput. 8(1979) 410-421.
31. Data Sources - The Complete Computer Product Book: Hardware and Data Communications Volume (Ziff-Davis Publ., New York, 1993).