|
|
Select Language
Simple Search
Advanced Search
OPAC
Katalog Online Perpustakaan Universitas Ma Chung
Villa Puncak Tidar N-01 Malang - Jawa Timur.
DDC v.22
Klasifikasi & Katalogisasi DDC versi 22
Validated
|
Title |
A Preemption-Aware On-line Routing Algorithm for MPLS Networks |
Edition |
Volume 24, Numbers 2-4 |
Call Number |
|
ISBN/ISSN |
1018-4864 |
Author(s) |
BLANCHY,FRANÇOIS MÉLON,LAURENT LEDUC,GUY LEDUC
|
Subject(s) |
|
Classification |
|
Series Title |
Telecommunication Systems |
GMD |
Electronic Journal |
Language |
English |
Publisher |
Springer Netherlands |
Publishing Year |
2003 |
Publishing Place |
Netherlands |
Collation |
20p |
Abstract/Notes |
In the context of Multiprotocol Label Switching (MPLS), we look at the problem of organizing
the mapping of Label Switched Paths (LSPs) in an optimal way throughout the network on the basis of a
given objective function. This problem is highly combinatorial and makes dynamic and real-time features a
difficult issue for any LSP routing scheme. For this reason, we propose a computationally efficient, though
approximate, on-line scheme adapted to an incremental optimization of the network state. We also propose
an integration of a computationally efficient preemption mechanism into this approximation. The efficiency
of this algorithm is obtained through a very rigid but seemingly appropriate policy concerning which LSPs
are appropriate for preemption. A feedback from preemption on the routing process is proposed, in order to
regulate the rate of the reroutings and to tune the balance between stability and continuous reorganization
in a network. |
Specific Detail Info |
|
Image |
 |
File Attachment |
LOADING LIST... |
Availability |
LOADING LIST... |
|
Back To Previous |
|