Optimal policy for label switched path setup in MPLS networks

被引:22
|
作者
Anjali, T
Scoglio, C
de Oliveira, JC
Akyildiz, IF
Uhl, G
机构
[1] Georgia Inst Technol, Sch Elect & Comp Engn, Broadband & Wireless Networking Lab, Atlanta, GA 30332 USA
[2] NASA, Goddard Space Flight Ctr, Beltsville, MD 20705 USA
[3] Swales Aerosp, Beltsville, MD 20705 USA
基金
美国国家航空航天局;
关键词
LSP establishment; LSP re-dimensioning; MPLS; MPLS network topology;
D O I
10.1016/S1389-1286(01)00308-5
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
An important aspect in designing a multiprotocol label switching (MPLS) network is to determine an initial topology and to adapt it to the traffic load. A topology change in an MPLS network occurs when a new label switched path (LSP) is created between two nodes. The LSP creation involves determining the route of the LSP and the according resource allocation to the path. A fully connected MPLS network can be used to minimize the signaling. The objective of this paper is to determine when an LSP should be created and how often it should be re-dimensioned. An optimal policy to determine and adapt the MPLS network topology based on the traffic load is presented. The problem is formulated as a continuous time Markov decision process with the objective to minimize the costs involving bandwidth, switching, and signaling. These costs represent the trade-off between utilization of network resources and signaling/processing load incurred on the network. The policy performs a filtering control to avoid oscillations which may occur due to highly variable traffic. The new policy has been evaluated by simulation and numerical results show its effectiveness and the according performance improvement. A sub-optimal policy is also presented which is less computationally intensive and complicated. (C) 2002 Elsevier Science B.V. All rights reserved.
引用
收藏
页码:165 / 183
页数:19
相关论文
共 50 条
  • [41] A novel routing algorithm of multi-priority label switch path in MPLS over WDM mesh networks
    Su, Y
    Xu, ZQ
    Liu, ZJ
    NETWORK ARCHITECTURES, MANAGEMENT, AND APPLICATIONS III, PTS 1 AND 2, 2005, 6022
  • [42] An efficient backup path selection algorithm in MPLS networks
    Jeong, W
    Kim, G
    Kim, C
    QUALITY OF SERVICE IN MULTISERVICE IP NETWORKS, PROCEEDINGS, 2005, 3375 : 164 - 175
  • [43] Path selection and restoration for MPLS-based networks
    Lu, YM
    Liu, AB
    Li, H
    Ji, YF
    ICCC2004: Proceedings of the 16th International Conference on Computer Communication Vol 1and 2, 2004, : 180 - 184
  • [44] Inter-domain path computation using improved crankback signaling in label switched networks
    Aslam, Faisal
    Uzmi, Zartash Afzal
    Farrel, Adrian
    Pioro, Michal
    2007 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, VOLS 1-14, 2007, : 2023 - +
  • [45] K Highest Label Path Algorithm Based on MPLS Traffic Engineering
    Lin, Na
    Yang, Tao
    MINES 2009: FIRST INTERNATIONAL CONFERENCE ON MULTIMEDIA INFORMATION NETWORKING AND SECURITY, VOL 2, PROCEEDINGS, 2009, : 579 - 582
  • [46] Adaptive segment path restoration (ASPR) in MPLS networks
    Dong, S
    Phillips, C
    NETWORK CONTROL AND ENGINEERING FOR QOS, SECURITY AND MOBILITY, 2003, 107 : 65 - 76
  • [47] Path protection with pre-identification for MPLS networks
    Wang, D
    Ergun, F
    2005 2nd International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks (QShine), 2005, : 374 - 381
  • [48] An improved adaptive preemption policy in MPLS Networks
    Zhu, Mingying
    Ye, Wu
    Feng, Suili
    He, Xiaoming
    2008 4TH INTERNATIONAL CONFERENCE ON WIRELESS COMMUNICATIONS, NETWORKING AND MOBILE COMPUTING, VOLS 1-31, 2008, : 4456 - +
  • [49] Optimal LSP selection method in MPLS networks
    Kuribayashi, Shin-ichi
    Tsumura, Shigehiro
    2007 IEEE PACIFIC RIM CONFERENCE ON COMMUNICATIONS, COMPUTERS AND SIGNAL PROCESSING, VOLS 1 AND 2, 2007, : 367 - 370
  • [50] QoS aware path protection schemes for MPLS networks
    Gupta, A
    Gupta, A
    Jain, BN
    Tripathi, S
    PROCEEDINGS OF THE ICCC 2002: 15TH INTERNATIONAL CONFERENCE ON COMPUTER COMMUNICATION, VOLS 1 AND 2: REDEFINING INTERNET IN THE CONTEXT OF PERVASIVE COMPUTING, 2002, : 103 - 118