Performance Analysis of Edge Nodes with Multiple Path Routing

被引：0
|
作者：
Hung Tuan Tran [1 ]
Tien Van Do [1 ]
Yang, Yeon-Mo [2 ]
机构：
[1] Budapest Univ Technol & Econ, Dept Networked Syst & Serv, Budapest, Hungary
[2] Kumoh Natl Inst Technol, Gumi, Gyeongsangbuk D, South Korea
来源：
ADVANCED COMPUTATIONAL METHODS FOR KNOWLEDGE ENGINEERING | 2013年 / 479卷
关键词：
SERVERS;
D O I：
10.1007/978-3-319-00293-4_13
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
Multiprotocol label switching (MPLS) can flexibly establish one or several paths for traffic demands in the form of label switched paths (LSP). In this paper we propose a scheme for the multiple LSPs operation of edge nodes in MPLS networks. The proposal comprises the mechanisms of load-dependent path-decision, intervention and path selection policy to facilitate efficient LSP routing. We develop a performance model to evaluate the performance of the proposed scheme.
引用
收藏
页码：157 / 165
页数：9
相关论文
共 50 条
  • [1] Performance Analysis of SLTC - A Stable Path, Low Overhead, Truthful, and Cost Efficient Routing Protocol in MANETs with Selfish Nodes
    Saremi, Fatemeh
    Mousavi, Hamid
    Movaghar, Ali
    2008 IEEE ASIA-PACIFIC SERVICES COMPUTING CONFERENCE, VOLS 1-3, PROCEEDINGS, 2008, : 243 - 250
  • [2] Performance Analysis of Epidemic Routing in DTN with Overlapping Communities and Selfish Nodes
    Wu, Y.
    Deng, S.
    Huang, H.
    Deng, Y.
    INTERNATIONAL JOURNAL OF COMPUTERS COMMUNICATIONS & CONTROL, 2013, 8 (05) : 744 - 753
  • [3] PERFORMANCE ANALYSIS OF MINIMAL PATH FAULT TOLERANT ROUTING IN NOC
    M.Ahmed
    V.Laxmi
    M.S.Gaur
    Journal of Electronics(China), 2011, 28(Z1) (China) : 587 - 595
  • [4] PERFORMANCE ANALYSIS OF MINIMAL PATH FAULT TOLERANT ROUTING IN NOC
    M.Ahmed
    V.Laxmi
    M.S.Gaur
    Journal of Electronics(China), 2011, (Z1) : 587 - 595
  • [5] An efficient shortest path routing on the hypercube with blocking/faulty nodes
    Arabpour Niasari, Mehrdad
    Qiu, Ke
    CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE, 2021, 33 (12):
  • [6] OPTIMIZING MULTI-PATH ROUTING BY AVOIDING KEY NODES
    Yang Junlong
    Yu Hewei
    PROCEEDINGS OF 2009 2ND IEEE INTERNATIONAL CONFERENCE ON BROADBAND NETWORK & MULTIMEDIA TECHNOLOGY, 2009, : 48 - 51
  • [7] An Efficient Shortest Path Routing on the Hypercube with Blocking/Faulty Nodes
    Niasari, Mehrdad Arabpour
    Qiu, Ke
    2018 SIXTH INTERNATIONAL SYMPOSIUM ON COMPUTING AND NETWORKING (CANDAR 2018), 2018, : 39 - 46
  • [8] Performance analysis of path selection routing protocol for UVANET based on geographical multicast routing algorithm
    Mengistu, Fikreselam Gared
    Yihunie, Hiruy Daricha
    COGENT ENGINEERING, 2024, 11 (01):
  • [9] Epidemic Routing Performance in DTN With Selfish Nodes
    Wang, Rong
    Wang, Zhifei
    Ma, Wubin
    Deng, Su
    Huang, Hongbin
    IEEE ACCESS, 2019, 7 : 65560 - 65568
  • [10] Performance analysis of epidemic routing in DTNs with limited forwarding times and selfish nodes
    Wu, Yahui
    Deng, Su
    Huang, Hongbin
    INTERNATIONAL JOURNAL OF AD HOC AND UBIQUITOUS COMPUTING, 2013, 13 (3-4) : 254 - 263
12345