358 search results - page 24 / 72 » A Computational Study of Routing Algorithms for Realistic Tr... |
INFOCOM
2007
IEEE
14 years 2 months ago
2007
IEEE
—We study the problem of landmark selection for landmark-based routing in a network of fixed wireless communication nodes. We present a distributed landmark selection algorithm ...
ICC
2007
IEEE
14 years 2 months ago
2007
IEEE
—We present a multi-constrained routing algorithm, called Delay-constrained Pool Sharing (DPS), in a survivable mesh network. The goal of this algorithm is to find a pair of link...
ADHOCNOW
2007
Springer
14 years 2 months ago
2007
Springer
Sensor networks are wireless adhoc networks where all the nodes cooperate for routing messages in the absence of a fixed infrastructure. Non-flooding, guaranteed delivery routing...
WICON
2010
13 years 6 months ago
2010
In order to meet the overwhelming demands of content retrieval for mobile end users, a novel architecture for the next-generation Internet called Cache-and-Forward (CNF) has been p...
INFOCOM
2003
IEEE
14 years 1 months ago
2003
IEEE
— There is a growing interest among service providers to offer new services with Quality of Service (QoS) guaranties that are also resilient to failures. Supporting QoS connectio...