Abstract
In this paper, we consider the network traffic engineering problem for provisioning tunnels in a backbone network where services with varied levels of protection are offered. Network protection to address for a failure continues to be a critical issue for the Next Generation Internet. Our modeling framework allows protection at various levels to be considered in a unified manner through the notion of cycles that are made up of a disjoint pair of paths where the network may be capacitated by both bandwidth as well as tunnel constraint. We also consider a variety of network goals including the ability to provide as much bandwidth as possible for best-effort services along with guaranteed protection services and develop a composite objective function. We then present two heuristic for solving the models presented. Through our studies of different network topologies, we show the convergence as well as the effectiveness of our approach in considering multiple goals in a unified manner. For example, we have shown the tradeoff between accepting new requests of protection service classes and providing residual bandwidth for best- effort services. Finally, our results also show that capacity and tunnels can have equally important roles in ensuring effective traffic engineering of a network.
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
Aubin, R. and Nasrallah, H. (2003). MPLS Fast reroute and optical mesh protection: A comparative analysis of the capacity required for packet link protection. In: Proceedings of Design of Reliable Communication Networks (DRCN’2003), pp. 349–355, Banff, Canada.
Awduche, D., Malcolm, J., Agogbua, J., O’Dell, M. and McManus, J. (1999). Requirements for traffic engineering over MPLS. Internet RFC 2702, http://www.ietf.org/rfc/rfc2702.txt.
Davie, B. and Rekhter, Y. (2000). MPLS: Technology and Applications. Morgan Kaufmann Publishers.
Fumagalli, A., Cerutti, I., Tacca, M., Masetti, F., Jagannathan, R., and Alagar, S. (1999). Survivable networks based on optimal routing and WDM self-healing rings. In: Proceedings of INFOCOM, pp. 726–733, IEEE Press.
Kajiyama, Y., Tokura, N., and Kikuchi, K. (1994). An ATM VP-based self healing ring. IEEE Journal on Selected Areas of Communication, 12(1):171–187.
Kawamura, R., Sato, K., and Tokizawa, I. (1994). Self healing ATM networks based on virtual path concept. IEEE Journal on Selected Areas of Communication, 12(l):120–127.
Kodialam, M and Lakshman, T.V. (2000). Dynamic routing of bandwidth guaranteed tunnels with restoration. In: Proceedings of INFOCOM, pp. 902–911, IEEE Press.
Krithikaivasan, B., Srivastava, S., Medhi, D., and Pióro, M. (2003). Backup path restoration design using path generation technique. In: Proceedings of Design of Reliable Communication Networks (DRCN), pp. 77–84, Banff, Canada.
Lawler, E.L. (1976). Combinatorial Optimization: Networks and Metroids, Holt, Rine-hart, and Winston.
Le Faucheur, F. and Lai, W. (2003). Requirements for Support of Differentiated Services-aware MPLS Traffic Engineering. Internet RFC 3564, http://www.ietf.org/rfc/rfc3564.txt, July 2003.
Medhi, D. (1991). Diverse routing for survivability in a fiber-based sparse network. In: Proceedings of International Conference on Communications, pp. 672–676, IEEE Press.
Medhi, D. (1994). A unified approach to network survivability for teletraffic networks: Models, algorithms and analysis. IEEE Transaction on Communication, 42:534–548.
Medhi, D. and Khurana, R. (1995). Optimization and performance of network restoration schemes for wide-area teletraffic networks. Journal of Network and Systems Management, 3:265–294.
Pióro, M. and Gajowniczek, P. (1997). Solving multicommodity integral flow problems by simulated allocation. Telecommunication Systems, 7(l–3):17–28.
Pióro, M. and Medhi, D. (2004). Routing, Flow, and Capacity Design in Communication and Computer Networks. Morgan Kauffmann Publishers.
Ramamurthy, S. and Mukherjee, B. (1999). Survivable WDM mesh networks, part I-protection. In: Proceedings of INFOCOM, pp. 744–751, IEEE Press.
Srivastava, S., Krithikaivasan, B., Medhi, D., and Pióro, M. (2003). Traffic engineering in the presence of tunneling and diversity constraints: Formulation and Lagrangean decomposition approach. In: Proceedings of International Teletraffic Congress, Berlin, pp. 461–470, Elsevier Science.
Suurballe, J.W. (1974). Disjoint paths in a network. Networks, 4:125–145.
Suurballe, J.W. and Tarjan, R.E. (1986). A quick method for finding shortest pairs of disjoint paths. Networks, 14:325–336.
Wu, T.H. (1992). Fiber Network Service Survivability. Artech House.
Xiong, Y. and Mason, L.G. (1999). Restoration strategies and spare capacity requirements in self healing ATM networks. IEEE/ACM Transactions on Networking, 7(l):98–110.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer Science+Business Media, Inc.
About this chapter
Cite this chapter
Srivastava, S., Thirumalasetty, S.R., Medhi, D. (2005). Network Traffic Engineering with Varied Levels of Protection in the Next Generation Internet. In: Girard, A., Sansò, B., Vázquez-Abad, F. (eds) Performance Evaluation and Planning Methods for the Next Generation Internet. Springer, Boston, MA. https://doi.org/10.1007/0-387-25551-6_4
Download citation
DOI: https://doi.org/10.1007/0-387-25551-6_4
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-25550-7
Online ISBN: 978-0-387-25551-4
eBook Packages: Business and EconomicsBusiness and Management (R0)