In this paper, we study block codes that are optimized to recover some lost source data even in case when full recovery is not possible. Conventionally, block codes designed for p...
Opportunistic user access scheduling enhances the capacity of wireless networks by exploiting the multi user diversity. When frame aggregation is used, opportunistic schemes are no...
In this paper, we explore flexible name resolution as a way of supporting extensibility for wide-area distributed services. Our approach, called Active Names, maps names to a cha...
Amin Vahdat, Michael Dahlin, Thomas E. Anderson, A...
We analyze information leaks in the lookup mechanisms of structured peer-to-peer anonymous communication systems and how these leaks can be used to compromise anonymity. We show t...
ct 9 It is often useful to know the positions of nodes in a network. However, in a large network it is impractical to build a 10 single global map. In this paper, we present a new ...