425 search results - page 44 / 85 » A Fully Dynamic Algorithm for Distributed Shortest Paths |
GIS
2009
ACM
14 years 1 months ago
2009
ACM
This paper looks at the problem of data prioritization, commonly found in mobile ad-hoc networks. The proposed general solution uses a machine learning approach in order to learn ...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
The neighbourhood function NG(t) of a graph G gives, for each t ∈ N, the number of pairs of nodes x, y such that y is reachable from x in less that t hops. The neighbourhood fun...
SIAMAM
2008
13 years 8 months ago
2008
This paper proposes a macroscopic fluid dynamic model dealing with the flows of information on a telecommunication network with sources and destinations. The model consists of a co...
NETWORKING
2007
13 years 10 months ago
2007
This paper addresses the optimal rate allocation problem in overlay content distribution for efficient utilization of limited bandwidths. We systematically present a series of opti...
PDP
2006
IEEE
14 years 2 months ago
2006
IEEE
Peer-to-Peer computing is mainly based on the virtual overlay network constructed in the application layer. Often, there is topology mismatching between the overlay network and th...