Sciweavers

8 search results - page 1 / 2
» Search Space Reduction in QoS Routing
Sort
View
ICDCS
1999
IEEE
13 years 9 months ago
Search Space Reduction in QoS Routing
To provide real-time service or engineer constrained-based paths, networks require the underlying routing algorithm to be able to find low-cost paths that satisfy given Quality-of...
Liang Guo, Ibrahim Matta
CLUSTER
2004
IEEE
13 years 4 months ago
Resource Management for Ad-Hoc Wireless Networks with Cluster Organization
Boosted by technology advancements, government and commercial interest, ad-hoc wireless networks are emerging as a serious platform for distributed mission-critical applications. G...
Ionut Cardei, Srivatsan Varadarajan, Allalaghatta ...
LION
2009
Springer
145views Optimization» more  LION 2009»
13 years 11 months ago
A Variable Neighborhood Descent Search Algorithm for Delay-Constrained Least-Cost Multicast Routing
Abstract. The rapid evolution of real-time multimedia applications requires Quality of Service (QoS) based multicast routing in underlying computer networks. The constrained Steine...
Rong Qu, Ying Xu, Graham Kendall
TON
2008
125views more  TON 2008»
13 years 4 months ago
Two techniques for fast computation of constrained shortest paths
Abstract-- Computing constrained shortest paths is fundamental to some important network functions such as QoS routing, which is to find the cheapest path that satisfies certain co...
Shigang Chen, Meongchul Song, Sartaj Sahni
ISPD
2000
ACM
97views Hardware» more  ISPD 2000»
13 years 9 months ago
Exact switchbox routing with search space reduction
Frank Schmiedle, Daniel Unruh, Bernd Becker