Abstract
We study the link upgrading process in fixed and mobile broadband access networks, as a steadily ongoing planning procedure to keep pace with rapidly growing user demand and Internet traffic. Full mesh topologies are considered as a relevant core network structure, for which an explicit analysis of the resource and cost efficiency is carried out comparing bandwidth upgrades with and without optimized load balancing.
The results indicate that flexible traffic path design can essentially increase the admissible throughput or vice versa reduce part of the overprovisioning of routing and transmission capacity with corresponding savings in costs of equipment as well as reduced energy consumption. The availability of traffic engineering prerequisites on different Internet (IP) and especially on Multiprotocol Label Switching (MPLS) networking platforms is addressed.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Akamai, State of the Internet (2010), http://www.akamai.com
Cisco Systems, Visual networking index, forecast and methodology, White paper series, updated in 2011 especially for mobile networking traffic (2011), http://www.cisco.com
Cohen, R., Nakibly, G.: Maximizing Restorable Throughput in MPLS Networks. IEEE Infocom (2008)
Gonzalez Pietro, A., Stadler, R.: Controlling Performance Trade-offs in Adaptive Network Monitoring. In: 11th IFIP/IEEE International Symposium on Integrated Network Management, New York, USA (2009)
Haßlinger, G.: Quality-of-Service Analysis for Statistical Multiplexing with Gaussian Distributed and Autoregressive Input. Telecommunication Systems 16, 315–334 (2001)
Haßlinger, G., Nunzi, G., Meirosu, C., Fan, C., Andersen, F.-U.: Traffic Engineering Supported by Inherent Network Management: Analysis of Resource Efficiency and Cost Saving Potential. International Journal on Network Management 21, 45–64 (2011)
Hasslinger, G., Kunz, T.: Challenges for Routing and Search in Dynamic and Self-organizing Networks. In: Ruiz, P.M., Garcia-Luna-Aceves, J.J. (eds.) ADHOC-NOW 2009. LNCS, vol. 5793, pp. 42–54. Springer, Heidelberg (2009)
Haßlinger, G., Schnitter, S., Franzke, M.: The efficiency of traffic engineering with regard to failure resilience. Telecommunication Systems 29, 109–130 (2005)
Hasslinger, G., Hartleb, F., Beckhaus, T.: User Access to Popular Data on the Internet and Approaches for IP Traffic Flow Optimization. In: Al-Begain, K., Fiems, D., Horváth, G. (eds.) ASMTA 2009. LNCS, vol. 5513, pp. 42–55. Springer, Heidelberg (2009)
Internet Engineering Task Force (IETF), www.ietf.org ; MPLS working group, www.ietf.org/html.charters/mpls-charter.html (2011)
Menth, M., Duelli, M., Martin, R., Milbrandt, J.: Resilience analysis of packet switched communication networks. IEEE/ACM Trans. on Networking 17, 1950–1963 (2009)
Minnesota Internet traffic studies, MINTS (2010), http://www.dtc.umn.edu/mints/home.php
Odlyzko, A.: Internet traffic growth: Sources and implications. In: Proc. SPIE, vol. 5247, pp. 1–15 (2003)
Pioro, M., Mehdi, D.: Routing, Flow and Capacity Design in Communication and Computer Networks. Morgan Kaufmann Publ., San Francisco (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hasslinger, G. (2011). Flexible Traffic Engineering in Full Mesh Networks: Analysis of the Gain in Throughput and Cost Savings. In: Al-Begain, K., Balsamo, S., Fiems, D., Marin, A. (eds) Analytical and Stochastic Modeling Techniques and Applications. ASMTA 2011. Lecture Notes in Computer Science, vol 6751. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21713-5_17
Download citation
DOI: https://doi.org/10.1007/978-3-642-21713-5_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-21712-8
Online ISBN: 978-3-642-21713-5
eBook Packages: Computer ScienceComputer Science (R0)