Skip to main content

Backbone Network Design with QoS Requirements

  • Conference paper
Networking — ICN 2001 (ICN 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2094))

Included in the following conference series:

Abstract

In this paper, we consider the backbone network design problem with a full set of QoS requirements. Unlike previous researches, we consider both the transmission line cost and the switch cost. And the QoS requirements that we considered include the average packet delay, end-to-end packet delay and node disjoint paths. We formulate the problem as a combinatorial optimization problem where the objective function is to minimize the total network deployment cost subject to the aforementioned QoS constraints. Besides the integrality constraints, the nonlinear and the nonconvex properties associated with the problem formulation make it difficult. Lagrangean relaxation in conjunction with a number of optimization-based heuristics are proposed to solve this problem. From the computational experiments, the proposed algorithms calculate creditable solutions in minutes of CPU time for moderate problem sizes.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Cheng, K. T. and F. Y-.S. Lin, “Minimax End-to-End Delay Routing and Capacity Assignment for Virtual Circuit Networks,” Proc. IEEE Globecom, (1995) 2134–2138.

    Google Scholar 

  2. Cheng, S. T., “Topological Optimization of a Reliable Communication Network”, IEEE Trans. on Reliability, Vol. 47, No. 3, Sep. (1998) 225–233.

    Article  Google Scholar 

  3. Gavish, B., “Topological design of computer communication networks-The overall design problem”, European J. of Operational Research, 58, (1992) 149–172.

    Article  MATH  Google Scholar 

  4. Lin, F. Y-.S., “Link Set Sizing for Networks Supporting SMDS”, IEEE/ACM Trans. on Networking, Vol. 1, No. 6, Dec. (1993) 729–739.

    Article  Google Scholar 

  5. Ombuki, B., M. Nakamura, Z. Nakao and K. Onaga, “Evolutionary Computation for Topological Optimization of 3-Connected Computer Networks”, IEEE International Conference on Systems, Man, and Cybernetics, Vol. 1, (1999) 659–664.

    Google Scholar 

  6. Pierre, S. and A. Elgibaoui, “A Tabu-Search Approach for Designing Computer-Network Topologies with Unreliable Components”, IEEE Trans. on Reliability, Vol. 46, No. 3, Sep. (1997) 350–359.

    Article  Google Scholar 

  7. Suurballe, J. W. and R. E. Tarjan, “A Quick Method for Finding Shortest Pairs of Disjoint Paths”, Networks, Vol. 14, (1984) 325–336.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yen, HH., Lin, F.YS. (2001). Backbone Network Design with QoS Requirements. In: Networking — ICN 2001. ICN 2001. Lecture Notes in Computer Science, vol 2094. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-47734-9_15

Download citation

  • DOI: https://doi.org/10.1007/3-540-47734-9_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42303-4

  • Online ISBN: 978-3-540-47734-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics