Skip to main content
SpringerLink
Log in

Dynamic programming based heuristics for the topological design of local access networks

  • Section IV Computer And Communication Networks
  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

This paper deals with the terminal layout problem, which is a problem arising in data communication network design. The problem consists of finding the best way to link terminals to a computer site and, in graph-theoretical terms, it resorts to determining a minimal spanning tree with an additional constraint (CMST). We present a class of heuristics that combine dynamic programming with clustering and decomposition techniques. More specifically, the original problem is transformed, either by clustering or decomposition, in order to obtain smaller size problems that can be handled by a dynamic programming approach. Such heuristics were specifically aimed at improving solutions produced by the Esau-Williams algorithm, which is one of the most effective heuristics presented in the literature for the CMST. Actually, computational experience confirms that such improvements can be achieved by the new heuristic.

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. K. Altinkemer and B. Gavish, Parallel savings based heuristic for the delivery problem, Working Paper (1988).

  2. K. Altinkemer and B. Gavish, Heuristics with constant error guarantees for the design of tree networks, Manag. Sci. 34(1988)331–341.

    Google Scholar 

  3. K. Chandy and T. Lo, The capacitated minimum spanning tree, Networks 3(1973)173–181.

    Google Scholar 

  4. K. Chandy and R. Russell, The design of multipoint linkages in a teleprocessing tree network, IEEE Trans. Comp. C-21(1972)1062–1066.

    Google Scholar 

  5. L. Esau and K. Williams, A method for approximating the optimal network, IBM Syst. J. 581966)142–147.

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

    Google Scholar 

  7. B. Gavish, Augmented Lagrangian based algorithms for centralized network design, IEEE Trans. Commun. COM-33(1985)1247–1257.

    Google Scholar 

  8. B. Gavish and K. Altinkemer, Parallel savings heuristic for the topological design of local access tree networks, in:Proc. IEEE INFOCOM 86 Conf. (1986).

  9. B. Gavish, private communication (1989).

  10. L. Gouveia and J. Paixão, A dynamic programming formulation for the capacitated minimal spanning tree problem, Nota No. 6/89 do CEAUL (1989).

  11. L. Gouveia, A. Lucena and J. Paixão, A set-partitioning approach for the capacitated minimal spanning tree problem, Paper presented at theEuro X Conf. (1989).

  12. M. Karnaugh, A new class of algorithms for multipoint network optimization, IEEE Trans. Commun. COM-24(1976)500–505.

    Google Scholar 

  13. A. Kershenbaum, R. Boorstyn and R. Oppenheim, Second-order greedy algorithms for centralized network design, IEEE Trans. Commun. COM-28(1980)1835–1838.

    Google Scholar 

  14. A. Kershenbaum and W. Chou, A unified algorithm for designing multidrop teleprocessing networks, IEEE Trans. Commun. COM-22(1874)1762–1772.

    Google Scholar 

  15. J. Kruskal, On the shortest spanning subtree of a graph and the traveling salesman problem, Proc. Amer. Math. Soc. 7(1956).

  16. J. Paixão and L. Gouveia, Métodos de investigação operacional na idealização topológica de redes centralizadas, Actas do 40 Congresso Português de Informática, 2-b(1986)1625–1655.

    Google Scholar 

  17. C. Papadimitriou, The complexity of the capacitated tree problem, Networks 8(1978)217–230.

    Google Scholar 

  18. R. Prim, Shortest connection networks and some generalizations, Bell. Syst. Tech. J. 36(1957)1389–1401.

    Google Scholar 

  19. D. Rosenkrantz, R. Stearns and P. Lewis, An analysis of several heuristics for the traveling salesman problem, SIAM J. Comput. 6(1977)563–581.

    Google Scholar 

  20. R. Sharma and M. El-Bardai, Suboptimal communication network synthesis, in:Proc. Int. Conf. on Communications (1970).

  21. A. Tannenbaum,Computer Networks (Prentice-Hall, 1977).

  22. V. Whitney, Comparison of network topology optimization algorithms, in:Proc. Int. Conf. on Communications (1970).

Download references

Author information

Authors and Affiliations

  1. DEIOC - Faculdade de Ciências, Av. 24 de Julho, 134-5o, 1300, Lisboa, Portugal

    L. Gouveia & J. Paixão

Authors
  1. L. Gouveia
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. J. Paixão
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This research was partially supported by JNICT (Junta Nacional de Investigação Científica e Tecnológica) under Research Contract No. 87383/MIC.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Gouveia, L., Paixão, J. Dynamic programming based heuristics for the topological design of local access networks. Ann Oper Res 33, 305–327 (1991). https://doi.org/10.1007/BF02071978

Download citation

  • Issue Date:

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

Keywords

Search

Navigation