Sciweavers

2498 search results - page 158 / 500
» Algorithms for the Topological Watershed
Sort
View
IPPS
2006
IEEE
16 years 16 days ago
Free network measurement for adaptive virtualized distributed computing
An execution environment consisting of virtual machines (VMs) interconnected with a virtual overlay network can use the naturally occurring traffic of an existing, unmodified ap...
Ashish Gupta, Marcia Zangrilli, Ananth I. Sundarar...
INFOCOM
2005
IEEE
16 years 3 days ago
GLIDER: gradient landmark-based distributed routing for sensor networks
— We present Gradient Landmark-Based Distributed Routing (GLIDER), a novel naming/addressing scheme and associated routing algorithm, for a network of wireless communicating node...
Qing Fang, Jie Gao, Leonidas J. Guibas, V. de Silv...
INFOCOM
2005
IEEE
16 years 3 days ago
Hybrid search schemes for unstructured peer-to-peer networks
— We study hybrid search schemes for unstructured peer-to-peer networks. We quantify performance in terms of number of hits, network overhead, and response time. Our schemes comb...
Christos Gkantsidis, Milena Mihail, Amin Saberi
IMC
2003
ACM
15 years 11 months ago
On the number of distributed measurement points for network tomography
Internet topology information is only made available in aggregate form by standard routing protocols. Connectivity information and latency characteristicsmust therefore be inferre...
Joseph Douglas Horton, Alejandro López-Orti...
MOBICOM
2000
ACM
15 years 11 months ago
GPSR: greedy perimeter stateless routing for wireless networks
We present Greedy Perimeter Stateless Routing (GPSR), a novel routing protocol for wireless datagram networks that uses the positions of routers and a packet’s destination to ma...
Brad Karp, H. T. Kung