Sciweavers

67 search results - page 2 / 14
» Algorithms for Computing QoS Paths with Restoration
Sort
View
TON
2002
138views more  TON 2002»
13 years 5 months ago
Algebra and algorithms for QoS path computation and hop-by-hop routing in the internet
Prompted by the advent of quality-of-service routing in the Internet, we investigate the properties that path weight functions must have so that hop-by-hop routing is possible and ...
João L. Sobrinho
NETWORKING
2000
13 years 6 months ago
An Algorithm for Multicast with Multiple QoS Constraints and Dynamic Membership
In this paper we present an algorithm to construct low-cost source trees for multicast with multiple QoS constraints and dynamic membership. Assuming the availability of link-state...
Aiguo Fei, Mario Gerla
AINA
2006
IEEE
13 years 9 months ago
EQ-BGP: an efficient inter-domain QoS routing protocol
In this paper we propose the Enhanced QoS Border Gateway Protocol1 (EQ-BGP) aimed at performing the inter-domain QoS routing in a multi-domain IP network. The objective of EQ-BGP ...
Andrzej Beben
IFIP
2009
Springer
13 years 12 months ago
A Distributed Exact Solution to Compute Inter-domain Multi-constrained Paths
The fundamental Quality of Service (QoS) routing problem, which consists in determining paths subject to multiple QoS constraints, has been extensively investigated in the intra-do...
Gilles Bertrand, Samer Lahoud, Géraldine Te...
ICNP
1998
IEEE
13 years 9 months ago
On Reducing the Processing Cost of On-Demand QoS Path Computation
Quality of Service (QoS) routing algorithms have become the focus of recent research due to their potential for increasing the utilization of an Integrated Services Packet Network...
George Apostolopoulos, Satish K. Tripathi