In the cyclic-to-random shuffle, we are given n cards arranged in a circle. At step k, we exchange the k'th card along the circle with a uniformly chosen random card. The pro...
Today most Internet services are pre-assigned to servers statically, hence preventing us from doing real-time sharing of a pool of servers across as group of services with dynamic...
In this paper, we study the fundamental limits of a wireless sensor network's lifetime under connectivity and k-coverage constraints. We consider a wireless sensor network wit...
World Wide Web, the biggest distributed system ever built, experiences tremendous growth and change in Web sites, users, and technology. A realistic and accurate characterization ...
Katerina Goseva-Popstojanova, Fengbin Li, Xuan Wan...
In mobile ad hoc networks, mobile devices wander autonomously for the use of wireless links and dynamically varying network topology. AODV (Ad-hoc on-demand Distance vector routing...