๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A routing algorithm with precomputation for Multiprotocol Label Switching Traffic Engineering

โœ Scribed by He, Tao ;Wang, Suoping

Book ID
102838135
Publisher
John Wiley and Sons
Year
2011
Tongue
English
Weight
544 KB
Volume
22
Category
Article
ISSN
1124-318X

No coin nor oath required. For personal study only.

โœฆ Synopsis

The Label Switch Path routing algorithm in Multiprotocol Label Switching (MPLS) has become an important topic in Traffic Engineering. This paper presents a new routing scheme with precomputation, called the Least Maximum Flow Categories Routing Algorithm. In the MPLS network, different ingress-egress pairs have different maximum flow values on different links. Each link has a vector consisting of the maximum flow values flowing through it. This paper considers these vectors as weights of links and presents a method for calculating them. Simulation results show that the algorithm has the same precision as the other algorithms but has less computational complexity.

๐Ÿ“œ SIMILAR VOLUMES

Routing algorithms for switching network
Routing algorithms for switching networks with probabilistic traffic
โœ Lin, Geng; Pippenger, Nicholas ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 639 KB

Switching networks with probabilistic traffic are positioned prominently in communication engineering. Measures of performance for such a network include the blocking probability of the network and the time for the routing algorithm to establish communication paths. Although literature exists concer