A stochastic Random-Races algorithm for routing in MPLS traffic engineering

被引：0

作者：

Oommen, B. John ^{[1
]}

Misra, Sudip ^{[1
]}

Granmo, Ole-Christoffer ^{[2
]}

机构：

[1] Carleton Univ, Sch Comp Sci, Ottawa, ON K1S 5B6, Canada

[2] Agder Univ Coll, Fac Sci & Engn, Grimstad, Norway

来源：

25TH IEEE INTERNATIONAL CONFERENCE ON COMPUTER COMMUNICATIONS, VOLS 1-7, PROCEEDINGS IEEE INFOCOM 2006 | 2006年

基金：

加拿大自然科学与工程研究理事会;

关键词：

D O I：

暂无

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

This paper(1) presents an efficient adaptive online routing algorithm for the computation of bandwidth-guaranteed paths in Multiprotocol Label Switching (MPLS) based networks, using a learning scheme that computes an optimal ordering of routes. This work has two-fold contributions. The first is that we propose a new class of solutions other than those available in the literature incorporating the family of stochastic Random-Races (RR) algorithms. The most popular previously-proposed MPLS Traffic Engineering (TE) solutions attempt to find a superior path to route an incoming path setup request. Our algorithm, on the other hand, tries to learn an optimal ordering of the paths through which requests can be routed according to the "rank" of the paths in the order learnt by the algorithm. The second contribution of our work is that we have proposed a routing algorithm that has better performance than the important algorithms in the literature. The efficiency of our algorithm was experimentally established.

引用

页码：111 / +

页数：3

共 50 条

[31] MPLS based traffic engineering - A distributed traffic supporting model and evaluation algorithm
Deng, J.S., 2000, Chinese Institute of Electronics (28):
[32] A hybrid multicommodity routing algorithm for traffic engineering
Ouaja, W
Richards, B
NETWORKS, 2004, 43 (03) : 125 - 140
[33] Multiobjective multicast routing algorithm for traffic engineering
Crichigno, J
Barán, B
ICCCN 2004: 13TH INTERNATIONAL CONFERENCE ON COMPUTER COMMUNICATIONS AND NETWORKS, PROCEEDINGS, 2004, : 301 - 306
[34] Adaptive algorithms for routing and traffic engineering in stochastic networks
Misra, S
Oommen, BJ
PROCEEDING OF THE NINETEENTH NATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE AND THE SIXTEENTH CONFERENCE ON INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2004, : 993 - 994
[35] Multi-Commodity Flow Traffic Engineering with Hybrid MPLS/OSPF Routing
Zhang, Mingui
Liu, Bin
Zhang, Beichuan
GLOBECOM 2009 - 2009 IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE, VOLS 1-8, 2009, : 6610 - +
[36] Minimum interference routing of bandwidth guaranteed tunnels with MPLS traffic engineering applications
Kar, K
Kodialam, M
Lakshman, TV
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2000, 18 (12) : 2566 - 2579
[37] MPLS advantages for traffic engineering
Swallow, G
IEEE COMMUNICATIONS MAGAZINE, 1999, 37 (12) : 54 - 57
[38] Traffic engineering with MPLS in the Internet
Xiao, XP
Hannan, A
Bailey, B
Ni, LM
IEEE NETWORK, 2000, 14 (02): : 28 - 33
[39] Analysis of MPLS traffic engineering
Chung, JM
PROCEEDINGS OF THE 43RD IEEE MIDWEST SYMPOSIUM ON CIRCUITS AND SYSTEMS, VOLS I-III, 2000, : 550 - 553
[40] 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

← 1 2 3 4 5 →