In this paper, we present DKS(N, k, f), a family of infrastructures for building Peer-To-Peer applications. Each instance of DKS(N, k, f) is a fully decentralized overlay network ...
Luc Onana Alima, Sameh El-Ansary, Per Brand, Seif ...
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...
The enlarging market of portable devices and wireless networks stimulates the provisioning of mobilityenabled Internet services with differentiated levels of Quality of Service (Q...
During the last few years, continuous progresses in wireless communications have opened new research fields in computer networking, aimed at extending data networks connectivity ...
We propose two fast algorithms for abrupt change detection in streaming data that can operate on arbitrary unknown data distributions before and after the change. The first algor...