Journal of the Korean Operations Research and Management Science Society (한국경영과학회지)

The Korean Operations Research and Management Science Society (한국경영과학회)
권호 표지

Optimal Design of Centralized Computer Networks - The Terminal Layout Problem and A Dual-based Procedure -

중앙집중식 전산망의 경제적 설계 -단말기 배치문제와 쌍대기반 해법-

  • Published : 1989.06.01
Download PDF
⟨ Previous Next ⟩

Abstract

The terminal layout problem is fundamental in may centralized computer networks, which is generated formulated as the capaciated minimum spanning tree problem (CMSTP). We present an implementation of the dual-based procedure to solve the CMSTP. Dual ascent procedure generates a good feasible solutions to the dual of the linear programming relaxation of CMSTP. A feasible primal solution to CMSTP can then be constructed based on this dual solution. This procedure can be used either as a stand-alone heuristic or, else, it can be incorporated into a branch and bound algorithm. A numerical result is given with quite favorable results.

Keywords

References

  1. Management Sci. v.34 Heuristics with constant error guarantees for the design of tree networks Altinkemer,K.;B.Gavish
  2. IEEE Trans. Comm. v.25 Lange scale network topological optimization Boorstyn,R.R.;H.Frank
  3. Networks v.3 The capacitated minimum spanning tree Chandy,K.M.;T.Lo
  4. IEEE Trans. Computers v.21 The design of multipoint linkage in a teleprocessing tree network Chandy,K.M.;R.A.Russell
  5. J. of Res. of the National Bureau of Standards-B. Mathmatics and Math. Physics v.71B Optimum branchings Edmonds,J.
  6. IEEE Trans. Comm. v.22 Topological design of multipoint teleprocessing networks Elias,D.;M.J.Ferguson
  7. Operations Res. v.26 A dual-based procedure for uncapacitated facility location Erlenkotter,D.
  8. IBM Systems J. v.5 On teleprocessing system design Part 2 Essau,L.R.;K.C.Williams
  9. Proc. IEEE v.60 Topological optimization of computer networks Frank,H.;W.Chou
  10. Networks v.1 Optimal design of centralized computer networks Frank,H.;I.T.Frisch;R. Van slyke;W.S.Chon
  11. Networks v.12 Topological design of centralized computer networks-formulations and algorithms Gavish,B.
  12. J. Assoc. Comput. mach. v.30 Formulations and algorithms for the capacitated minimal directed tree Gavish,B.
  13. IEEE Trans. Comm. v.33 Augmented Lagrangean based algorithms for centralized network design Gavish,B.
  14. Proc. IEEE-INFOCOM'86 A parallel savings heuristic for the topological design of local tree networks Gavish,B.;K.Altinkemer
  15. Math. Programming Study v.2 Lagrangean relaxation and its uses in integer programming Geoffrion,A.M.
  16. IEEE Trans. Comm. v.24 A new class of algorithms for multipoint network optimization Karnaugh,M.
  17. Networks v.4 Computing capacitated minmum spanning trees efficiently Kershenbaum,A.
  18. Networks v.13 Centralized teleprocessing network deoign Kershenbaum,A.;R.Boorstyn
  19. IEEE Trans. Comm. v.28 Second order greedy algorithms for centralized teleprocessing network design Kershenbaum,A.;R.Boorstyn;R.Oppenheim
  20. IEEE Trans. Comm. v.22 A unified algorithm for designing multidrop teleprocessing networks Kershenbaum,A.;W.Chou
  21. Computer Sci. Res. Report RC 9223, IBM T.J. Watson Res. center Communication network design and control algorithms-a survey Kobayashi,H.
  22. Europ. J. of Operational Res. v.12 The simple plant location problem Krarup,J.;P.M.Pruzan
  23. IEEE Trans. Comm. v.25 Network design : an algorithm for access facility location problem McGregor,P.M.;D.Shen
  24. Networks v.8 The complexity of the capacitated tree problem Papadimitriou,C.H.
  25. IEEE Trans. Comm. v.31 Design of an economical multidrop network topology with capacity constraints Sharam,R.L.
  26. Management Sci. v.28 A dual-based procedure for dynamic facility location Van Roy,T.J.;D.Erlenkotter
  27. Math. Programming v.28 A dual ascent approach for Steiner tree problems on a directed graph Wong,R.T.