Sciweavers

66 search results - page 3 / 14
» Approximation Algorithm for QoS Routing with Multiple Additi...
Sort
View
CN
1999
103views more  CN 1999»
13 years 7 months ago
Topology Information Condensation in Hierarchical Networks
Inspired by the PNNI protocol of the ATM Forum, this work focuses on the problem of node aggregation within peer groups and link aggregation between peer groups. It is assumed tha...
Piet Van Mieghem
ICOIN
2001
Springer
13 years 11 months ago
Performance Analysis of QoS Routing with Network Dependant Delay Cost
This paper investigates the problem of path calcul ation of multiple metric routing. Toda ’s Internet routing is based on a single metric path selecting algorithm. Single metric...
Hahnearl Jeon, Sung-Dae Kim, Young Joon Kim, Hyung...
WIMOB
2008
IEEE
14 years 1 months ago
A Distributed Scheduling Algorithm with QoS Provisions in Multi-hop Wireless Mesh Networks
—Multi-hop wireless mesh networks (WMNs) are considered a promising technology to backhaul heterogeneous data traffic from wireless access networks to the wired Internet. WMNs a...
Chi Harold Liu, Athanasios Gkelias, Yun Hou, Kin K...
IFIP
2009
Springer
14 years 1 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...
GLOBECOM
2007
IEEE
14 years 1 months ago
Multiconstrained QoS Routing: Greedy is Good
— A fundamental problem in quality-of-service (QoS) routing is to find a path connecting a source node to a destination node that satisfies K ≥ 2 additive QoS constraints. Th...
Guoliang Xue, Weiyi Zhang