| Autor: | Guy Leduc, François Blanchy, Laurent Mélon |
|---|---|
| Rok vydání: | 2003 |
| Předmět: |
Computer science
business.industry computer.internet_protocol Distributed computing Preemption Process (computing) Stability (learning theory) Context (language use) Multiprotocol Label Switching Traffic engineering State (computer science) Electrical and Electronic Engineering Routing (electronic design automation) business computer Computer network |
| Zdroj: | Telecommunication Systems. 24:187-206 |
| ISSN: | 1018-4864 |
| DOI: | 10.1023/a:1026166813657 |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full text from SpringerLink