Skip to main content
SpringerLink
Log in

Topological design of wide area communication networks

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

This paper develops a model for designing a backbone network. It assumes the location of the backbone nodes, the traffic between the backbone nodes and the link capacities are given. It determines the links to be included in the design and the routes used by the origin destination pairs. The objective is to obtain the least cost design where the system costs consist of connection costs and queueing costs. The connection costs depend on link capacity and queueing costs are incurred by users due to the limited capacity of links. The Lagrangian relaxation embedded in a subgradient optimization procedure is used to obtain lower bounds on the optimal solution of the problem. A heuristic based on the Lagrangian relaxation is developed to generate feasible solutions.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. P. Afentakis and B. Gavish, Optimal lot-sizing algorithms for complex product structures, Oper. Res. 34 (1986) 237–249.

    Google Scholar 

  2. V. Ahuja, Routing and flow control in systems network architecture, IBM Syst. J. (1979) 298–314.

  3. A. Balakrishnan and K. Altinkemer, Using hop constrained model to generate alternative communication network designs. Designing communication networks with hop restrictions, ORSA J. Comput. (1991) (in print).

  4. R.R. Boorstyn and H. Frank, Large scale network topological optimization, IEEE Trans. Commun. COM-25 (1977) 29–47.

    Google Scholar 

  5. M.A. Bonuccelli, Allocating additional link capacities in computer communication networks, IBM Res. Report RC 8967 (1981).

  6. P.M. Camerini, L. Fratta and F. Maffioli, On improving relaxation methods by modified gradient techniques, Math. Prog. Study 3 (1975) 26–34.

    Google Scholar 

  7. L. Fratta, M. Gerla and L. Kleinrock, The flow deviation algorithm: an approach to store-and forward computer communication network design, Networks 3 (1973) 97–133.

    Google Scholar 

  8. B. Gavish, Topological design of centralized computer networks — formulations and algorithms, Networks 12 (1982) 355–377.

    Google Scholar 

  9. B. Gavish, Formulations and algorithms for the capacitated minimal directed tree problem, J. ACM 30 (1983) 118–132.

    Google Scholar 

  10. B. Gavish and S.L. Hantler, An algorithm for the optimal route selection in SNA networks, IEEE Trans. Commun. COM-31 (1983) 1154–1161.

    Google Scholar 

  11. B. Gavish, A general model for the topological design of computer networks,Proc. IEEE-GLOBECOM 86 (1986) pp. 1584–1588.

    Google Scholar 

  12. B. Gavish and I. Neuman, Capacity and flow assignment in large computer networks,Proc. IEEE-GLOBECOM 86 (1986) pp. 275–284.

    Google Scholar 

  13. B. Gavish and K. Altinkemer, Backbone network design tools with economic tradeoffs, ORSA J. Comput. 2 (1990) 236–252.

    Google Scholar 

  14. B. Gavish and I. Neuman, Routing in a network with unreliable components, IEEE Trans. Commun. (1991) (in print).

  15. B. Gavish, Topological design of computer communication networks — The overall design problem, EJOR (1991) (in print).

  16. A.M. Geoffrion, Lagrangian relaxation and its uses in integer programming, Math. Progr. Study 2 (1974) 82–114.

    Google Scholar 

  17. M. Gerla, Deterministic and adaptive routing policies in packet switched computer networks,ACM-IEEE 3rd Data Communications Symp., Tampa, FL (1973).

  18. M. Gerla, H. Frank, W. Chou and J. Eckle, A cut saturation algorithm for topological design of packet switched communication networks,Proc. NTC (1974) pp. 1074–1085.

  19. M. Gerla, Approximations and bounds for the topological design of distributed computer networks,Proc. 4th ACM Data Communications Symp., Quebec, Canada (1975).

  20. M. Gerla and L. Kleinrock, On the topological design of distributed computer networks, IEEE Trans. Commun. COM-25 (1977) 48–60.

    Google Scholar 

  21. K. Maruyama and D.T. Tang, Discrete link capacity assignment in communication networks,3rd ICCC, Toronto (1976) pp. 92–97.

  22. K. Maruyama, K. Fratta and D.T. Tang, Heuristic design algorithm for computer communication networks with different classes of customers, IBM J. Res. Dev. (1977) 360–369.

  23. I. Neuman, Methods for the design of computer networks with different classes of messages, Working Paper, NYU (1988).

  24. H. Pirkul and S. Narasimhan, A new algorithm for the design of backbone networks, Working Paper, College of Business, Ohio State University (1987).

  25. H. Pirkul and S. Narasimhan, Primary and secondary route selection in backbone computer networks, Working Paper, College of Business, Ohio State University (1988).

  26. L.R.W. Tymes, Routing and flow control in TYMNET, IEEE Trans. Commun. COM-29 (1981) 392–398.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Krannert Graduate School of Management, Purdue University, 47907, West Lafayette, IN, USA

    Kemal Altinkemer & Zhuolin Yu

Authors
  1. Kemal Altinkemer
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zhuolin Yu
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Altinkemer, K., Yu, Z. Topological design of wide area communication networks. Ann Oper Res 36, 365–381 (1992). https://doi.org/10.1007/BF02094337

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02094337

Keywords

Search

Navigation