(Created page with " == Abstract == Multiprotocol Label Switching (MPLS) is an emerging Internet technology that facilitates traffic engineering in service provider networks. This paper consider...") |
|||
| (One intermediate revision by the same user not shown) | |||
| Line 3: | Line 3: | ||
Multiprotocol Label Switching (MPLS) is an emerging Internet technology that facilitates traffic engineering in service provider networks. This paper considers a network performance optimization problem related to traffic engineering over MPLS. We investigate the issue of dynamic partitioning of MPLS ingress traffic into several parallel Label Switched Paths (LSP). Specifically, we present a stochastic framework for the traffic partitioning problem. Within this framework, a set of parallel edge disjoint LSPs is modeled by parallel queues and a partitioning algorithm is devised for different service classes that is adaptive to the prevailing state of the network. The performance of this approach is illustrated by numerical examples. | Multiprotocol Label Switching (MPLS) is an emerging Internet technology that facilitates traffic engineering in service provider networks. This paper considers a network performance optimization problem related to traffic engineering over MPLS. We investigate the issue of dynamic partitioning of MPLS ingress traffic into several parallel Label Switched Paths (LSP). Specifically, we present a stochastic framework for the traffic partitioning problem. Within this framework, a set of parallel edge disjoint LSPs is modeled by parallel queues and a partitioning algorithm is devised for different service classes that is adaptive to the prevailing state of the network. The performance of this approach is illustrated by numerical examples. | ||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| Line 15: | Line 10: | ||
* [https://link.springer.com/content/pdf/10.1007%2F3-540-45551-5_13.pdf https://link.springer.com/content/pdf/10.1007%2F3-540-45551-5_13.pdf] | * [https://link.springer.com/content/pdf/10.1007%2F3-540-45551-5_13.pdf https://link.springer.com/content/pdf/10.1007%2F3-540-45551-5_13.pdf] | ||
| + | |||
| + | * [http://link.springer.com/content/pdf/10.1007/3-540-45551-5_13 http://link.springer.com/content/pdf/10.1007/3-540-45551-5_13], | ||
| + | : [http://dx.doi.org/10.1007/3-540-45551-5_13 http://dx.doi.org/10.1007/3-540-45551-5_13] | ||
| + | |||
| + | * [https://link.springer.com/chapter/10.1007/3-540-45551-5_13 https://link.springer.com/chapter/10.1007/3-540-45551-5_13], | ||
| + | : [https://dblp.uni-trier.de/db/conf/networking/networking2000.html#DinanAJ00 https://dblp.uni-trier.de/db/conf/networking/networking2000.html#DinanAJ00], | ||
| + | : [https://rd.springer.com/chapter/10.1007/3-540-45551-5_13 https://rd.springer.com/chapter/10.1007/3-540-45551-5_13], | ||
| + | : [https://academic.microsoft.com/#/detail/1535992547 https://academic.microsoft.com/#/detail/1535992547] | ||
Latest revision as of 15:08, 21 January 2021
Abstract
Multiprotocol Label Switching (MPLS) is an emerging Internet technology that facilitates traffic engineering in service provider networks. This paper considers a network performance optimization problem related to traffic engineering over MPLS. We investigate the issue of dynamic partitioning of MPLS ingress traffic into several parallel Label Switched Paths (LSP). Specifically, we present a stochastic framework for the traffic partitioning problem. Within this framework, a set of parallel edge disjoint LSPs is modeled by parallel queues and a partitioning algorithm is devised for different service classes that is adaptive to the prevailing state of the network. The performance of this approach is illustrated by numerical examples.
Original document
The different versions of the original document can be found in:
Document information
Published on 01/01/2007
Volume 2007, 2007
DOI: 10.1007/3-540-45551-5_13
Licence: CC BY-NC-SA license
Share this document
Keywords
claim authorship
Are you one of the authors of this document?