2473 search results - page 196 / 495 » The Logic of Communication Graphs |
162
click to vote
INFOCOM
2009
IEEE
15 years 10 months ago
2009
IEEE
— The automatic detection of failures in IP paths is an essential step for operators to perform diagnosis or for overlays to adapt. We study a scenario where a set of monitors se...
136
click to vote
INFOCOM
2009
IEEE
15 years 10 months ago
2009
IEEE
—Greedy routing is a novel routing paradigm where messages are always forwarded to the neighbor that is closest to the destination. Our main result is a polynomial-time algorithm...
103
click to vote
INFOCOM
2006
IEEE
15 years 10 months ago
2006
IEEE
— In this paper, we seek to understand the intrinsic reasons for the well-known phenomenon of heavy-tailed degree in the Internet AS graph and argue that in contrast to tradition...
113
click to vote
SIROCCO
2007
15 years 5 months ago
2007
Abstract. A large group of autonomous, mobile entities e.g. robots initially placed at some arbitrary node of the graph has to jointly visit all nodes (not necessarily all edges) a...
145
Voted
GRID
2008
Springer
15 years 4 months ago
2008
Springer
SmartGridSolve is an extension of GridSolve that expands the single task map and client-server model of GridRPC by implementing server to server communication and the mapping of a...