Journal ArticleDOI
The Efficiency of Traffic Engineering with Regard to Link Failure Resilience
TLDR
The efficiency of traffic engineering together with simple link upgrade strategies in order to get a maximum throughput is evaluated and a predefined traffic matrix T is taken into account, to scale the traffic matrix by a maximum factor λ max such that the traffic demand can still be carried on the available network resources.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.read more
Citations
More filters
Journal ArticleDOI
Content delivery and caching from a network provider's perspective
Gerhard Haílinger,Franz Hartleb +1 more
TL;DR: The main goal, namely to shorten end-to-end paths and delays, would not only enhance the user experience and benefit network providers by reducing the load in the backbone and on expensive global interconnection links, but would also, last but not least, reduce energy consumption.
Journal ArticleDOI
Traffic engineering supported by inherent network management: analysis of resource efficiency and cost saving potential
TL;DR: The results indicate that flexible path design with INM support can increase the admissible throughput or reduce part of the over-provisioning of routing and transmission capacity with corresponding savings in capital expenditure as well as for operational expenditure due to reduced energy consumption.
Journal ArticleDOI
Failure Resiliency With Only a Few Tunnels – Enabling Segment Routing for Traffic Engineering
TL;DR: This paper addresses the use of SR to increase the resilience against failure scenarios, and proposes a post-convergence aware SR based optimization model that can proactively find a single SR configuration that is beneficial in all predefined failure scenarios.
Book ChapterDOI
User Access to Popular Data on the Internet and Approaches for IP Traffic Flow Optimization
TL;DR: This work compares the efficiency of both approaches to content delivery networks and peer-to-peer systems, which are based on overlay structures within the network or on the terminals of the users, with different implications for network resource efficiency, service provisioning and usage.
Optimized Incremental Network Planning
Joachim Charzinski,Uwe Walter +1 more
TL;DR: It is shown that the straightforward approach to upgrade the most utilized link is not necessarily the best choice and an optimized upgrade planning including routing optimzation can deliver a higher resilience at lower cost.
References
More filters
Book
Computers and Intractability: A Guide to the Theory of NP-Completeness
TL;DR: The second edition of a quarterly column as discussed by the authors provides a continuing update to the list of problems (NP-complete and harder) presented by M. R. Garey and myself in our book "Computers and Intractability: A Guide to the Theory of NP-Completeness,” W. H. Freeman & Co., San Francisco, 1979.
Book
Network Flows: Theory, Algorithms, and Applications
TL;DR: In-depth, self-contained treatments of shortest path, maximum flow, and minimum cost flow problems, including descriptions of polynomial-time algorithms for these core models are presented.
Multiprotocol Label Switching Architecture
TL;DR: This document specifies the architecture for Multiprotocol Label Switching (MPLS).