Abstract
This paper proposes an algorithm for cost-efficient network design. The two main network components are the routers and the links connecting them. As these network elements have discrete capacity values, their costs are modeled by stepwise functions. In the current interpretation of the network design problem the subproblems of topological design, resource dimensioning, and routing of traffic flows are handled simultaneously. Using new network technologies (e.g., MPLS) the operators have the opportunity to reconfigure their networks dynamically. By using this function the periodic (e.g., daily, weekly) changes of traffic volumes and directions can be taken into consideration during network design resulting in lower deployment costs. The algorithm proposed for multi-hour design is based on an efficient, published method. The efficiency of the new algorithm is demonstrated by simulation on random and real network topologies with the help of two reference algorithms.
Chapter PDF
Similar content being viewed by others
References
Awduche, D., Malcolm, J., Agogbua, J., O’Dell, M., McManus, J.: Requirements for Traffic Engineering Over MPLS. Internet Engineering Task Force, Request for Comments: 2702 (1999)
Bauschert, T.: Multihour design of multi-hop virtual path based widearea ATM networks. Proc of the 15th International Teletraffic Congress (ITC-15), Washington DC, USA (1997) 1019–1029
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco, CA. (1979)
ITU-T: QoS Routing and Related Traffic Engineering Methods — Capacity Management Methods. Recommendation E.360.6, CA. (2002)
Józsa, B.G., Király, Z., Magyar, G., Szentesi, Â.: An Efficient Algorithm for Global Path Optimization in MPLS Networks. Optimization and Engineering, Vol. 2., No. 3. Kluwer Academic Publishers (2001) 321–347
Józsa, B.G., Makai, M.: On the Solution of Reroute Sequence Planning Problem in MPLS Networks. Computer Networks, Vol. 42., No. 2. Elsevier Science (2003) 199–210
Jözsa, B.G., Orincsay, D., Kern, A.: On the Use of Routing Optimization for Virtual Private Network Design. In Proc. of the 7th IFIP Working Conference on Optical Network Design & Modelling (ONDM’2003), Budapest, Hungary (2003) 865–880
Medhi, D.: A Unified Approach to Network Survivability for Teletraffic Networks: Models, Algorithms and Analysis. IEEE Transactions on Communications, Vol. 42. (1994) 534–548
Medhi, D.: Multi-Hour, Multi-Traffic Class Network Design for VP-based Wide-Area Dynamically Reconfigurable ATM Networks. In Proc of IEEE INFOCOM’95, Boston, MA. (1995) 900–907
Medhi, D.: Some Approaches to Solving a Multi-Hour Broadband Network Capacity Design Problem with Single-Path Routing. Telecommunication Systems, Vol. 13. (2000) 269–291
Rosen, E., Viswanathan, A., Callon, R. : Multiprotocol Label Switching Architecture. Internet Engineering Task Force, Request for Comments: 3031 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Józsa, B.G., Orincsay, D., Tamási, L. (2004). Multi-hour Design of Dynamically Reconfigurable MPLS Networks. In: Mitrou, N., Kontovasilis, K., Rouskas, G.N., Iliadis, I., Merakos, L. (eds) Networking 2004. NETWORKING 2004. Lecture Notes in Computer Science, vol 3042. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24693-0_42
Download citation
DOI: https://doi.org/10.1007/978-3-540-24693-0_42
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21959-0
Online ISBN: 978-3-540-24693-0
eBook Packages: Springer Book Archive