Abstract
IP networks have established as a global telecommunication platform with increasing user population and an extending spectrum of services. The traffic is also steadily increasing, recently driven by peer to peer networking in addition to client server based applications. Network planers and operators have to ensure the scalability of IP platforms in a permanent upgrade process for transmission capacities. At present, Deutsche Telekom and other telecommunication network providers are introducing traffic engineering methods to achieve an optimum resource utilization.
In a first step, traffic engineering can be applied to a predefined network topology, but a comprehensive approach has to be coordinated with a process for upgrading the link capacities and has to prepare for relevant failure scenarios. We have evaluated the efficiency of traffic engineering together with simple link upgrade strategies in order to get a maximum throughput. Therefore a predefined traffic matrix T is taken into account. The optimization goal is to scale the traffic matrix by a maximum factor λ max such that the traffic demand λ max T can still be carried on the available network resources. The influence of the network topology on the evaluation results is shown in examples with regard to single link failures.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
R.K. Ahuja, T.L. Magnanti and J.B. Orlin, Network Flows: Theory, Algorithms and Applications (Prentice Hall, 1993).
V.K. Balakrishnan, Network Optimization (Chapman & Hall, London, 1995).
N. Benameur and J.W. Roberts, Traffic matrix interference in IP networks, in: Proc. 10th Internat. Network Strategy and Planning Symposium (Munich, 2002) pp. 151–156.
I. Berry et al., An integrated GA-LP approach to communication network design, Telecommunication Systems 12 (1999) 265–280.
A. Elwalid, C. Lin, S. Low and I. Widjaja, MATE: MPLS adaptive traffic engineering, in: Proc. IEEE Infocom (2001).
A. Feldmann, A. Greenberg, C. Lund, N. Reingold and J. Rexford, NetScope: Traffic engineering for IP networks, IEEE Network, special issue on Internet traffic engineering, ed. Z. Wang (March 2000) pp. 11–19.
B. Fortz and M. Thorup, Optimizing OSPF/IS-IS weights in a changing world, IEEE JSAC (2002) 756–766.
B. Fortz, J. Rexroth and M. Thorup, Traffic engineering with traditional IP routing protocols, IEEE Comm. Magaz. (Oct. 2002) 118–124.
Fraleigh et al., Packet-level traffic measurements from the Sprint IP backbone, IEEE Network (Nov./Dez. 2003) 6–16.
M. Franzke and A. Pönitz, Global shortest path solutions for the traffic engineering problem, in: Proc. 10th Internat. Network Strategy and Planning Symposium, Munich (2002) pp. 275–278.
M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, New York, 1979).
B. Gavish, Topological design of communication networks: The overall design problem, Europ. J. Oper. Res. 58 (1992) 149–172.
G. Haßlinger, Quality-of-service analysis for statistical multiplexing with Gaussian distributed and autoregressive input modeling, Telecommunication Systems 16 (2001) 315–336.
G. Haßlinger, Internet service provider platforms under a heavy peer-to-peer workload, to appear in Peer-to-Peer Systems and Applications, eds. R. Steinmetz and K. Wehrle, Lecture notes in computer science LNCS 3485 (Springer, 2005).
G. Haßlinger and S. Schnitter, Optimized load distribution in MPLS networks, Telecommunications Network Design and Management, Kluwer Akad. Publ. (2002) 125–142.
G. Haßlinger and S. Schnitter, IP Network expansion for growing traffic demands with shortest path first routing and traffic engineering, in: Proc. 11th Internat. Network Strategy and Planning Symposium (Vienna, Austria, 2004) pp. 81–86.
M. Kolonko, Some new results on simulated annealing applied to the job shop scheduling problem, Europ. J. Operational Research 113 (1999) 123–136.
M. Menth, J. Milbrandt and S. Kopf, Capacity assignment for NAC budgets in resilient networks, in: Proc. 11th Internat. Network Strategy and Planning Symposium (Vienna, Austria, 2004) pp. 193–198.
M. Menth, A. Reifert and J. Milbrandt, Self-protecting multipaths—A simple and resource-efficient protection switching mechanism for MPLS networks, in: Proc. 3. IFIP-TC6 Networking Conference (Athens, Greece, 2004).
A. Odlyzko, Internet traffic growth: Sources and implications, Proc. SPIE 5247 (2003) 1–15.
M. Pioro and D. Mehdi, Routing, Flow and Capacity Design in Communication and Computer Networks (Morgan Kaufmann Publishers, 2004).
E. Rosen, A. Viswanathan and R. Callon, Multiprotocol label switching architecture, RFC 3031, Proposed IETF standard (2001).
S. Schnitter and G. Haßlinger, Heuristic solutions to the LSP-design for MPLS traffic engineering, in: Proc. 10th Internat. Network Strategy and Planning Symposium (Munich, 2002) pp. 269–273.
S. Schnitter and M. Horneffer, Traffic matrices for MPLS networks with LDP statistics, in: Proc. 11th Internat. Network Strategy and Planning Symposium (Vienna, Austria, 2004) pp. 231–236.
R.D. Wollmer, Optimal investment in capacity expansion of arcs in stochastic multi commodity network flows, in: Proc. 6. INFORMS Telecommunication Conf. WA1.4 (Boca Raton, 2002).
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Hasslinger, G., Schnitter, S. & Franzke, M. The Efficiency of Traffic Engineering with Regard to Link Failure Resilience. Telecommun Syst 29, 109–130 (2005). https://doi.org/10.1007/s11235-005-2145-x
Issue Date:
DOI: https://doi.org/10.1007/s11235-005-2145-x