Journal of Network and Systems Management

, Volume 13, Issue 1, pp 57–76 | Cite as

Design Models for Robust Multi-Layer Next Generation Internet Core Networks Carrying Elastic Traffic

  • Eligijus KubilinskasEmail author
  • Pål Nilsson
  • Michał Pióro


This paper presents three mathematical formulations for designing robust two-layer networks carrying elastic traffic. The formulations differ in the way flow reconfiguration is performed in the case of link failures. An iterative algorithm to solve the problems is given and a numerical study is provided comparing the effectiveness of the three reconfiguration mechanisms. The formulations can be applied for designing Next Generation Internet (NGI) core networks with the two-layer, IP-over-WDM, structure.


Network design resilience elastic traffic fairness Next Generation Internet multi-commodity flows 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    D. Bertsekas and R. Gallager, Data Networks, Prentice-Hall, Englewood Cliffs, NJ, 1987.Google Scholar
  2. 2.
    W. Ogryczak, On the lexicographic minimax approach to location problems, European Journal of Operational Research, Vol. 100, No. 3, pp. 566–587, 1997.CrossRefGoogle Scholar
  3. 3.
    F. P. Kelly, A. K. Mauloo, and D. H. K. Tan, Rate control for communication networks: Shadow prices, proportional fairness and stability, Journal of the Operational Research Society, Vol. 49, No. 3, pp. 237–252, 1998.CrossRefGoogle Scholar
  4. 4.
    M. Pióro, E. Kubilinskas, P. Nilsson, and M. Matuszewski, Robust dimensioning of proportionally fair networks, 2nd Polish-German Teletraffic Symposium (pGTS 2002), pp. 235–251, September 23–24, 2002.Google Scholar
  5. 5.
    J. Kleinberg, Y. Rabani, and E. Tardos, Fairness in routing and load balancing, Proceedings of the 40th Annual IEEE Symposium on the Foundations of Computer Science, 1999.Google Scholar
  6. 6.
    M. Pióro and D. Medhi, Routing, Flow and Capacity Design in Communication and Computer Networks, Morgan Kaufmann (Elsevier), ISBN 0125571895, March 2004.Google Scholar
  7. 7.
    ILOG CPLEX 7.1 User’s Manual, France, March 2001.Google Scholar
  8. 8.
    M. Pióro, P. Nilsson, E. Kubilinskas, and G. Fodor, On efficient max-min fair routing algorithms, 8th IEEE International Symposium on Computer Communications (ISCC’2003), Antalya, Turkey, June 2003.Google Scholar

Copyright information

© Springer Science + Business Media, Inc. 2005

Authors and Affiliations

  • Eligijus Kubilinskas
    • 1
    • 3
    Email author
  • Pål Nilsson
    • 1
  • Michał Pióro
    • 1
    • 2
  1. 1.Department of Communication SystemsLund UniversityLundSweden
  2. 2.Institute of TelecommunicationsWarsaw University of TechnologyWarszawaPoland
  3. 3.Department of Communication SystemsLund UniversityLundSweden

Personalised recommendations