Load-Balanced IP Routing Scheme Based on Shortest Paths in Hose Model

被引:29
|
作者
Oki, Eiji [1 ]
Iwaki, Ayako [1 ]
机构
[1] Univ Electrocommun, Dept Informat & Commun Engn, Tokyo, Japan
关键词
Routing; OSPF; load balancing; hose model;
D O I
10.1109/TCOMM.2010.07.090219
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
This paper proposes a simple shortest-path-based load-balanced Internet-Protocol (IP) routing scheme based on the hose model. The proposed scheme is an extension of the Smart-OSPF (S-OSPF) scheme. The proposed scheme, the same as S-OSPF, splits traffic demand only at source edge nodes and transmits the traffic along the shortest path routes. In S-OSPF, the split ratios are determined for each source-destination edge node pair by assuming that the traffic demand between all source-destination edge node pairs are known, in other words, the exact traffic matrix is completely given. This, however, is difficult to measure and predict accurately because of the measurement costs and rapid traffic fluctuations. On the other hand, in the proposed scheme, we assume the use of the hose model; in this model, only the total amount of traffic that a node injects into the network and the total amount of traffic it receives from the network are known. This simplicity makes it easy for network operators to apply the hose model for IP routing. This is because measuring just the total amount of traffic is less expensive than measuring the traffic demands between all source-destination edge node pairs. In addition, the aggregated traffic exhibits less fluctuation and is easier to predict than the traffic demand between each source-destination pair. Any extension of the Linear Programming (LP) formulation that optimizes S-OSPF to suit the hose model cannot be solved as a simple LP problem, because the traffic matrix is not known. By introducing a duality theorem, we successfully formulate our problem as an LP formulation that can be easily solved yielding the desired split ratios. Numerical results show that the proposed scheme dramatically reduces the network congestion ratio compared to the classical shortest path routing scheme and it provides performance close to that provided by the sophisticated traffic-engineering (TE) scheme of Multi-Protocol Label Switching (MPLS)-TE.
引用
收藏
页码:2088 / 2096
页数:9
相关论文
共 50 条
  • [1] Efficient Load-Balanced IP Routing Scheme Based on Shortest Paths in Hose Model
    Oki, Eiji
    Iwaki, Ayako
    Masuda, Akeo
    Shiomoto, Kohei
    2009 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, VOLS 1-8, 2009, : 2097 - +
  • [2] Optimization of IP Load-Balanced Routing for Hose Model
    Oki, Eiji
    Iwaki, Ayako
    ICTAI: 2009 21ST INTERNATIONAL CONFERENCE ON TOOLS WITH ARTIFICIAL INTELLIGENCE, 2009, : 800 - 805
  • [3] Load-Balanced Shortest-Path-Based Routing Without Traffic Splitting in Hose Model
    Tsunoda, Shunichi
    Al Muktadir, Abu Hena
    Oki, Eiji
    2011 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC), 2011,
  • [4] Load-Balanced Non-split Shortest-Path-Based Routing with Hose Model and Its Demonstration
    Tsunoda, Shunichi
    Al Muktadir, Abu Hena
    Oki, Eiji
    IEICE TRANSACTIONS ON COMMUNICATIONS, 2013, E96B (05) : 1130 - 1140
  • [5] Valiant load-balanced robust routing under hose model for WDM mesh networks
    Zhang, Xiaoning
    Li, Lemin
    Wang, Sheng
    OPTICAL TRANSMISSION, SWITCHING, AND SUBSYSTEMS IV, PTS 1 AND 2, 2006, 6353
  • [6] F-TPR: Fine Two-Phase IP Routing Scheme over Shortest Paths for Hose Model
    Oki, Eiji
    Iwaki, Ayako
    IEEE COMMUNICATIONS LETTERS, 2009, 13 (04) : 277 - 279
  • [7] Load-Balanced Shortest-Path-Based Routing with Even Traffic Splitting
    Honma, Masashi
    Tsunoda, Shunichi
    Oki, Eiji
    18TH ASIA-PACIFIC CONFERENCE ON COMMUNICATIONS (APCC 2012): GREEN AND SMART COMMUNICATIONS FOR IT INNOVATION, 2012, : 361 - 365
  • [8] Load-balanced Routing Scheme for Wireless Sensor Networks
    Zhang, Jianmin
    Li, Jian
    Liu, Xiande
    2009 ISECS INTERNATIONAL COLLOQUIUM ON COMPUTING, COMMUNICATION, CONTROL, AND MANAGEMENT, VOL III, 2009, : 339 - +
  • [9] Load-balanced anycast routing
    Lin, CY
    Lo, JH
    Kuo, SY
    TENTH INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED SYSTEMS, PROCEEDINGS, 2004, : 701 - 708
  • [10] Load-balanced routing through virtual paths: Highly adaptive and efficient routing scheme for ad hoc wireless networks
    Altalhi, AH
    Richard, GG
    CONFERENCE PROCEEDINGS OF THE 2004 IEEE INTERNATIONAL PERFORMANCE, COMPUTING, AND COMMUNICATIONS CONFERENCE, 2004, : 407 - 413