In this paper, we show the feasibility of real-time flow monitoring with controllable accuracy in today’s IP networks. Our approach is based on Netflow and A-GAP. A-GAP is a prot...
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
Andrey Gubichev, Srikanta J. Bedathur, Stephan Seu...
DHT is a widely used building block for scalable P2P systems. However, as uniform hashing employed in DHTs destroys data locality, it is not a trivial task to support complex queri...
In the literature, asymptotic studies of multi-hop wireless network capacity often consider only centralized and deterministic TDMA (time-division multi-access) coordination schem...
We proposed and implemented a novel clustering algorithm called LAIR2, which has constant running time average for on-the-fly Scatter/Gather browsing [4]. Our experiments showed ...