We propose two approximation algorithms for identifying communities in dynamic social networks. Communities are intuitively characterized as "unusually densely knit" sub...
Abstract— In [1], Gupta and Kumar determined the capacity of wireless networks under certain assumptions, among them point-to-point coding, which excludes for example multi-acces...
Popular P2P file-sharing systems like Gnutella and Kazaa use unstructured network designs. These networks typically adopt flooding-based search techniques to locate files. Whil...
Boon Thau Loo, Ryan Huebsch, Ion Stoica, Joseph M....
By embedding sensors in mobile devices, it is possible to exploit the ubiquitous presence of these devices to construct applications for large-scale sensing and monitoring of envi...
—Recent findings showing that the output of traffic flows at packet switches has similar characteristics as the corresponding input enable a decomposition analysis of a networ...