— 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...
— Internet maps are generally constructed using the traceroute tool from a few sources to many destinations. It appeared recently that this exploration process gives a partial an...
— The advent of packet networks has motivated many researchers to study the performance of networks of queues in the last decade or two. However, most of the previous work assume...
This paper analyzes a single server queueing system in which service is alternated between two queues and the server requires a (finite) switchover time to switch from one queue ...
Abstract— Client puzzles have been proposed in a number of protocols as a mechanism for mitigating the effects of distributed denial of service (DDoS) attacks. In order to provid...
— In this paper, we present a novel packet delivery mechanism called Multi-path and Multi-Speed Routing Protocol (MMSPEED) for probabilistic QoS guarantee in wireless sensor netw...
Emad Felemban, Chang-Gun Lee, Eylem Ekici, Ryan Bo...
— 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...
— 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...
— 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...