The mille feuilles: Routing algorithm for packet network and connected network

被引：0
作者：
Rombaut, M
Hebuterne, G
Priem, M
机构：
[1] STERIA, F-74180 Velizy Villacoublay, France
[2] Inst Natl Telecommun, F-91011 Evry, France
来源：
ANNALS OF TELECOMMUNICATIONS | 2004年 / 59卷 / 1-2期
关键词：
telecommunication switching; routing; packet switching; circuit switching; switched network; data communication network; telecommunication network planning; system design; core network; optimization; teletraffic; fault tolerant system;
D O I：
暂无
中图分类号：
TN [电子技术、通信技术];
学科分类号：
0809 ;
摘要：
We present in this paper an innovating routing method on constrained capacity based on the actual link load ratio. This method is used during the data network or switching network design step. Its goal is to use all the free capacity of the network, by splitting the flow along several paths, and lowering the maximal link load on the network. We present a routing method and a non additive metric on the network components for the computation of the paths. We compare this multi-routings method to disjoint multi-routing methods and show the interest of this method. It provides the network higher resistance to flow increase, and higher resistance to single link failure.
引用
收藏
页码：149 / 169
页数：21
相关论文
共 12 条
  • [1] [Anonymous], 1979, GRAPHES ALGORITHMES
  • [2] [Anonymous], COMPUTER NETWORKS
  • [3] BENAMEUR W, ACT C ECUMN 02 COLM
  • [4] CAHN RS, 1998, WIDE AREA NETWORK CO
  • [5] Fortz B., 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064), P519, DOI 10.1109/INFCOM.2000.832225
  • [6] HOCK NC, 1997, QUEUEING MODELING FU
  • [7] KYANDOGHERE K, IEEE T COMPUTERS, V47
  • [8] PRIEM M, 1999, INGENIERIE WAN CONCE
  • [9] ROBERTAZZI RG, PLANNING TELECOMMUNI
  • [10] ROMBAUT M, 2002, ACT C CFIP 2002 MONT
12