The Community for Technology Leaders
RSS Icon
Issue No.03 - March (2008 vol.19)
pp: 311-322
In this paper, a novel approximate link-state dissemination framework, called TROP, is proposed for shared backup path protection (SBPP) in Multi-Protocol Label Switching (MPLS) networks. While performing dynamic explicit survivable routing in a distributed environment, link-state dissemination may cause non-trivial signaling overhead in the process of exploring spare resource sharing among individual backup Label Switched Paths (LSPs). Several previously reported studies have tackled this problem by initiating a compromise between the amount of dissemination and the achievable extent of resource sharing. The paper first summarizes the previously reported schemes into a compact and general link-state dissemination framework by way of singular value decomposition (SVD). To improve the accuracy of the matrix reconstruction and to eliminate overestimation of the sharable spare capacity along each link, a novel SVD approach based on Min-Plus algebra (or called Tropical Semi-Rings) is introduced. Simulation results show that the proposed schemes can achieve a lower blocking probability than that by all the other counterpart schemes while taking the same complexity of link-state dissemination. This great advantage is gained at the expense of longer computation time for solving a linear program (LP) in each dissemination cycle at the core nodes. We also consider the stale link-state phenomena that may cause imprecision in the routing information at the ingress nodes due to the delay in the periodic/event-driven link-state update message advertisement.
Shared protection, Multi-Protocol Label Switching (MPLS), Singular value decomposition (SVD), Stale link-state, Min-Plus algebra
János Tapolcai, Pin-Han Ho, Anwar Haque, "TROP: A Novel Approximate Link-State Dissemination Framework For Dynamic Survivable Routing in MPLS Networks", IEEE Transactions on Parallel & Distributed Systems, vol.19, no. 3, pp. 311-322, March 2008, doi:10.1109/TPDS.2007.70744
[1] P.-H. Ho and H.T. Mouftah, “A Framework of Service-Guaranteed Shared Protection for Optical Networks,” IEEE Comm. Magazine, pp. 97-103, Feb. 2002.
[2] Y. Liu, D. Tipper, and P. Siripongwutikorn, “Approximating Optimal Spare Capacity Allocation by Successive Survivable Routing,” Proc. IEEE INFOCOM '01, pp. 699-708, 2001.
[3] P.-H. Ho, J. Tapolcai, and H.T. Mouftah, “On Optimal Diverse Routing for Shared Protection in Mesh WDM Networks,” IEEE Trans. Reliability, vol. 53, no. 6, pp. 2216-2225, June 2004.
[4] G. Li, D. Wang, C. Kalmanek, and R. Doverspike, “Efficient Distributed Path Selection for Shared Restoration Connections,” IEEE/ACM Trans. Networking, vol. 11, no. 5, pp. 761-771, Oct. 2003.
[5] E. Bouillet, J.-F. Labourdette, G. Ellina, R. Ramamurthy, and S. Chaudhuri, “Stochastic Approaches to Compute Shared Mesh Restored Lightpaths in Optical Network Architectures,” Proc. IEEE INFOCOM '02, pp. 801-807, June 2002.
[6] L. Ruan and H. Luo, “Dynamic Routing of Restorable Lightpaths: A Tradeoff between Capacity Efficiency and Resource Information Requirement,” Proc. Seventh IFIP Working Conf. Optical Network Design and Modelling (ONDM '03), pp. 537-548, 2003.
[7] M. Kodialam and T.V. Lakshman, “Dynamic Routing of Locally Restorable Bandwidth Guaranteed Tunnels Using Aggregated Link Usage Information,” Proc. IEEE INFOCOM '01, pp. 376-385, 2001.
[8] P.-H. Ho and H.T. Mouftah, “Issues on Diverse Routing for WDM Mesh Networks with Survivability,” Proc. 10th IEEE Int'l Conf. Computer Comm. and Networks (ICCCN '01), pp. 60-65, Oct. 2001.
[9] C. Qiao and D. Xu, “Distributed Partial Information Management (DPIM) Schemes for Survivable Networks—Part I,” Proc. IEEE INFOCOM '02, pp. 302-311, June 2002.
[10] J. Tapolcai, P.-H. Ho, X. Jiang, and S. Horiguchi, “A Study on Distributed Control Architectures for Shared Protection,” Proc. IEEE GLOBECOM, 2004.
[11] P. Laborczi, J. Tapolcai, P.-H. Ho, T. Cinkler, A. Recski, and H.T. Mouftah, “Algorithms for Asymmetrically Weighted Pair of Disjoint Paths in Survivable Networks,” Proc. Third Int'l Workshop Design of Reliable Comm. Networks (DRCN '01), pp. 220-227, 2001.
[12] S. Gaubert and M. Plus, “Methods and Applications of (MAX, +) Linear Algebra,” Proc. 14th Ann. Symp. Theoretical Aspects of Computer Science, pp. 261-282, methods.html , 1997.
[13] B. De Schutter and B. De Moor, “The QR Decomposition and the Singular Value Decomposition in the Symmetrized Max-Plus Algebra,” SIAM J. Matrix Analysis and Applications, vol. 19, no. 2, pp. 378-406, Apr. 1998.
[14] L.G. Khachian, “A Polynomial Time Algorithm for Linear Programming,” Doklady Akademii Nauk SSSR 244, vol. 4, pp.1093-1096, 1979.
[15] J. Dirks and M. Berkelaar, LP Solve Toolkit,, 1999.
[16] “LION and COST 266,” Reference Networks, part of the European Information Soc. Technologies (IST) Fifth Framework program, 2003.
[17] M. De, V. Mariappan, V. Chandramouli, and S.K. Kuppusamy, US National Network Design, presentation held at CReWMaN, Univ. of Texas at Arlington, 2002.
[18] R.W.M. Vaughn, “Metropolitan Network Traffic Demand Study,” Proc. 13th Ann. Meeting Lasers and Electro-Optics Soc. (LEOS '00), vol. 1, pp. 102-103, Nov. 2000.
[19] R.W.A. Dwivedi, “Traffic Model for USA Long-Distance Optical Network,” Proc. Optical Fiber Communication Conf. (OFC '00), vol. 1, pp. 156-158, Mar. 2000.
[20] K.J. Christense, Tools Page, , 2004.
[21] G.H. Golub and C.F.V. Loan, Matrix Computations. Johns Hopkins Univ. Press, 1983.
15 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool