Sciweavers

1771 search results - page 314 / 355
» Parallel Network Simulation under Distributed Genesis
Sort
View
INFOCOM
2007
IEEE
14 years 1 months ago
Landmark Selection and Greedy Landmark-Descent Routing for Sensor Networks
—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 ...
An Nguyen, Nikola Milosavljevic, Qing Fang, Jie Ga...
LCN
2006
IEEE
14 years 1 months ago
Computing Real Time Jobs in P2P Networks
— In this paper, we present a distributed computing framework designed to support higher quality of service and fault tolerance for processing deadline-driven tasks in a P2P envi...
Jingnan Yao, Jian Zhou, Laxmi N. Bhuyan
SIGCOMM
2005
ACM
14 years 1 months ago
Fast hash table lookup using extended bloom filter: an aid to network processing
Hash table is used as one of the fundamental modules in several network processing algorithms and applications such as route lookup, packet classification, per-flow state manage...
Haoyu Song, Sarang Dharmapurikar, Jonathan S. Turn...
SIGCOMM
2005
ACM
14 years 1 months ago
Using redundancy to cope with failures in a delay tolerant network
We consider the problem of routing in a delay tolerant network (DTN) in the presence of path failures. Previous work on DTN routing has focused on using precisely known network dy...
Sushant Jain, Michael J. Demmer, Rabin K. Patra, K...
SECON
2007
IEEE
14 years 1 months ago
Fairness and Physical Layer Capture in Random Access Networks
Abstract— While physical layer capture has been observed in real implementations of wireless devices which randomly accessing shared channels, fair rate control algorithms based ...
Hoon Chang, Vishal Misra, Dan Rubenstein