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

Precomputation for intra-domain QoS routing

โœ Scribed by Yong Cui; Jianping Wu; Ke Xu

Book ID
108101084
Publisher
Elsevier Science
Year
2005
Tongue
English
Weight
556 KB
Volume
47
Category
Article
ISSN
1389-1286

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A routing algorithm with precomputation
A routing algorithm with precomputation for Multiprotocol Label Switching Traffic Engineering
โœ He, Tao ;Wang, Suoping ๐Ÿ“‚ Article ๐Ÿ“… 2011 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 544 KB

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-egres

Link-disjoint paths for reliable QoS rou
Link-disjoint paths for reliable QoS routing
โœ Yuchun Guo; Fernando Kuipers; Piet Van Mieghem ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 240 KB

## Abstract The problem of finding link/nodeโ€disjoint paths between a pair of nodes in a network has received much attention in the past. This problem is fairly well understood when the links in a network are only specified by a single link weight. However, in the context of quality of service rout

QoS-based routing algorithms for ATM net
QoS-based routing algorithms for ATM networks
โœ Li Layuan; Li Chunling ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 217 KB

This paper presents a planned routing algorithm (PRA) and a hierarchical routing algorithm (HRA) for ATM networks. The PRA can establish the multicast tree with the presence of bandwidth and delay constraints. The HRA can be compliant with the PNNI speciยฎcation from the ATM Forum. It uses an adaptiv