358 search results - page 19 / 72 » A Computational Study of Routing Algorithms for Realistic Tr... |
MOBIHOC
2004
ACM
14 years 1 months ago
2004
ACM
In this work, we develop an analytical framework to investigate the behavior of the communication links of a node in a random mobility environment. Analytical expressions characte...
NETWORKING
2004
13 years 9 months ago
2004
Abstract. In computer networks (and, say, transportation networks), we can consider the situation where each user has its own routing decision so as to minimize noncooperatively th...
SIGCOMM
2006
ACM
14 years 2 months ago
2006
ACM
Traditional studies of routing problems often assumed strict preferences on paths, by eliminating ambiguity in path comparisons, or imposing a priori deterministic tie-breaking. S...
MOBIHOC
2007
ACM
14 years 8 months ago
2007
ACM
The non-existence of an end-to-end path poses a challenge in adapting the traditional routing algorithms to delay tolerant networks (DTNs). Previous works include centralized rout...
SIGMOD
2011
ACM
12 years 11 months ago
2011
ACM
We study the problem of computing approximate quantiles in large-scale sensor networks communication-efficiently, a problem previously studied by Greenwald and Khana [12] and Shri...