425 search results - page 55 / 85 » A Fully Dynamic Algorithm for Distributed Shortest Paths |
INFOCOM
2006
IEEE
14 years 1 months ago
2006
IEEE
— In autonomous mobile ad hoc networks (MANET) where each user is its own authority, fully cooperative behaviors, such as unconditionally forwarding packets for each other or, ho...
ICSE
2009
IEEE-ACM
14 years 8 months ago
2009
IEEE-ACM
In modern software systems, programs are obtained by dynamically assembling components. This has made it necessary to subject component providers to access-control restrictions. W...
INFOCOM
2007
IEEE
14 years 1 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 ...
IPPS
2002
IEEE
14 years 16 days ago
2002
IEEE
‘ We take advantage of the hierarchical structure of the star graph network to obtain an efficient method for constructing node-disjoint paths between arbitrary pairs of nodes in...
CONEXT
2006
ACM
14 years 1 months ago
2006
ACM
We consider the case of a virtual world of peers that are organized in an overlay built by Delaunay Triangulation. Application layer routing is used to determine the path taken in...