SPeCRA: a stochastic performance comparison routing algorithm for LSP setup in MPLS networks

Author

de Oliveira, J.C. ; Martinelli, E. ; Scoglio, C.

Author_Institution

Sch. of Electr. & Comput. Eng., Georgia Inst. of Technol., Atlanta, GA, USA

Volume

3

fYear

2002

fDate

17-21 Nov. 2002

Firstpage

2190

Abstract

A new algorithm for dynamic routing of LSPs is proposed. While off-line algorithms are not suitable due to the necessary a priori knowledge of future LSP setup requests, our proposed algorithm, SPeCRA (stochastic performance comparison routing algorithm), does not assume any specific stochastic traffic model and does not require any knowledge of future demands. Both features are a must for the new Internet traffic. In order to analyze SPeCRA´s performance, we compare the ISP rejection ratios of SPeCRA and MIRA (Kar, K. et al., IEEE J. on Selected Areas in Commun., vol.18, no.12, p.2566-79, 2000). SPeCRA is easy to implement. It can be implemented using only simple shortest-hop or shortest-cost algorithms, which are interesting solutions for vendors, and not as computationally heavy as other routing algorithms.

Keywords

Internet; computational complexity; multiprotocol label switching; stochastic processes; telecommunication network routing; telecommunication traffic; Internet traffic; LSP setup; MPLS networks; dynamic routing; label switched path; shortest-cost algorithms; shortest-hop algorithms; stochastic performance comparison routing algorithm; Computer networks; Costs; Delay estimation; Heuristic algorithms; Intelligent networks; Interference; Laboratories; Multiprotocol label switching; Routing; Stochastic processes;

fLanguage

English

Publisher

ieee

Conference_Titel

Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE

Print_ISBN

0-7803-7632-3

Type

conf

DOI

10.1109/GLOCOM.2002.1189020

Filename

1189020