Sciweavers

INFOCOM
2005
IEEE
14 years 2 months 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
14 years 2 months ago
Fast replication in content distribution overlays
— We present SPIDER – a system for fast replication or distribution of large content from a single source to multiple sites interconnected over Internet or via a private networ...
Samrat Ganguly, Akhilesh Saxena, Sudeept Bhatnagar...
INFOCOM
2005
IEEE
14 years 2 months ago
A beacon-less location discovery scheme for wireless sensor networks
— In wireless sensor networks (WSNs), sensor location plays a critical role in many applications. Having a GPS receiver on every sensor node is costly. In the past, a number of l...
Lei Fang, Wenliang Du, Peng Ning
INFOCOM
2005
IEEE
14 years 2 months ago
The effect of network topology on the spread of epidemics
Ayalvadi J. Ganesh, Laurent Massoulié, Dona...
INFOCOM
2005
IEEE
14 years 2 months ago
Link scheduling in sensor networks: distributed edge coloring revisited
— We consider the problem of link scheduling in a sensor network employing a TDMA MAC protocol. Our link scheduling algorithm involves two phases. In the first phase, we assign ...
Shashidhar Gandham, Milind Dawande, Ravi Prakash
INFOCOM
2005
IEEE
14 years 2 months ago
Fair resource allocation in wireless networks using queue-length-based scheduling and congestion control
— We consider the problem of allocating resources (time slots, frequency, power, etc.) at a base station to many competing flows, where each flow is intended for a different re...
Atilla Eryilmaz, R. Srikant
INFOCOM
2005
IEEE
14 years 2 months ago
Avoiding transient loops during IGP convergence in IP networks
— When the topology of an IP network changes due to a link failure or a link weight modification, the routing tables of all the routers must be updated. Each of those updates ma...
Pierre Francois, Olivier Bonaventure
INFOCOM
2005
IEEE
14 years 2 months ago
Distributed querying of Internet distance information
— Estimation of network proximity among nodes is an important building block in several applications like service selection and composition, multicast tree formation, and overlay...
Rodrigo Fonseca, Puneet Sharma, Sujata Banerjee, S...
INFOCOM
2005
IEEE
14 years 2 months ago
Bayesian packet loss detection for TCP
— One of TCP’s critical tasks is to determine which packets are lost in the network, as a basis for control actions (flow control and packet retransmission). Modern TCP implem...
Nahur Fonseca, Mark Crovella
INFOCOM
2005
IEEE
14 years 2 months ago
A fair resource allocation algorithm for peer-to-peer overlays
— Over the past few years, Peer-to-Peer (P2P) systems have become very popular for constructing overlay networks of many nodes (peers) that allow users geographically distributed...
Yannis Drougas, Vana Kalogeraki