Elsevier

Journal of Algorithms

Volume 24, Issue 2, August 1997, Pages 287-309
Journal of Algorithms

Regular Article
Designing Least-Cost Nonblocking Broadband Networks

https://doi.org/10.1006/jagm.1997.0866Get rights and content

Abstract

Integrated network technologies, such as ATM, support multimedia applications with vastly different bandwidth needs, connection request rates, and holding patterns. Due to their high level of flexibility and communication rates approaching several gigabits per second, the classical network planning techniques, which rely heavily on statistical analysis, are less relevant to this new generation of networks. In this paper, we propose a new model for broadband networks and investigate the question of their optimal topology from a worst-case performance point of view. Our model is more flexible and realistic than others in the literature, and our worst-case bounds are among the first in this area. Our results include a proof of intractability for some simple versions of the network design problem and efficient approximation algorithms for designing nonblocking networks of provably small cost. More specifically, assuming some mild global traffic constraints, we show that a minimum-cost nonblockingstarnetwork achieves near-optimal cost; the cost ratio is at most 2 if switch source and sink capacities are symmetric and at most 3 when the total source and sink capacities are balanced. In the special case of unit link costs, we can show that a star network is indeed the cheapest nonblocking network.

References (19)

  • M. Bern et al.

    The Steiner problem with edge lengths 1 and 2

    Inform. Process. Lett.

    (1989)
  • V.E. Beneš

    Mathematical Theory of Connecting Networks and Telephone Traffic

    (1965)
  • C. Clos

    A study of nonblocking switching networks

    Bell Systems Tech. J.

    (1953)
  • J. A. Fingerhut, May 1994, Approximation Algorithms for Configuring Nonblocking Communication Networks, Washington...
  • J. A. Fingerhut, R. Jackson, S. Suri, J. S. Turner, Design of nonblocking ATM...
  • J. A. Fingerhut, R. Jackson, S. Suri, J. S. Turner, New models for network...
  • M.R. Garey et al.

    Computers and Intractability: A Guide to the Theory of NP-Completeness

    (1979)
  • A. Gersht et al.

    Joint optimization of data network design and facility selection

    IEEE J. Selected Areas Comm.

    (1990)
  • A. Kershenbaum et al.

    MENTOR: An algorithm for mesh network topological optimization and routing

    IEEE Trans. Comm.

    (1991)
There are more references available in the full text version of this article.

Cited by (127)

  • Robust alternative fuel refueling station location problem with routing under decision-dependent flow uncertainty

    2023, European Journal of Operational Research
    Citation Excerpt :

    The hybrid model comprises a hose model and an interval model. Duffield et al. (1999) and Fingerhut, Suri, & Turner (1997) introduce the hose model to model demand uncertainty in telecommunication networks. The model limits the total traffic associated with each node instead of estimating individual pairwise demands.

  • On the approximability of robust network design

    2021, Theoretical Computer Science
  • Multipolar robust optimization

    2018, EURO Journal on Computational Optimization
  • Hose-based cross-layer backbone network design with Benders decomposition

    2023, SIGCOMM 2023 - Proceedings of the ACM SIGCOMM 2023 Conference
View all citing articles on Scopus
*

E-mail: {jaf,jst,suri}@cs.wustl.edu.

View full text