Quantum algorithms for graph problems are considered, both in the adjacency matrix model and in an adjacency list-like array model. We give almost tight lower and upper bounds for ...
We propose using least attained service (LAS) scheduling in network routers to prevent some connections against utilizing all or a large fraction of network bandwidth. This phenome...
Idris A. Rai, Guillaume Urvoy-Keller, Ernst W. Bie...
Recent advances in technical capabilities have facilitated an increase in the reach and range of the connectivity of Information and Communications Technologies (ICTs). It is prop...
Resiliency to link failures in optical networks is becoming increasingly important due to the increasing data rate in the fiber. Path protection schemes attempt to guarantee a bac...
In this paper we show how imposing an organization (topology and search mechanism) on agents in a peerto-peer network can improve system performance. The organizational structure ...