—User Fairness aims at fairly distributing the network resources among users, where a user is an entity that can possibly send different flows through different paths. In this p...
We consider the problem of maintaining a large matching and a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge in...
Abstract— Optimal rate allocation in a networked control system with highly limited communication resources is instrumental to achieve satisfactory overall performance. In this p...
Lei Bao, Mikael Skoglund, Carlo Fischione, Karl He...
Two novel suboptimal algorithms for mutual exclusion in distributed systems are presented. One is based on the modi cation of Maekawa's grid based quorum scheme. The size of ...
There is a growing demand for web applications to provide fair service to the highly concurrent requests. In this paper, we present an approach to addressing this requirement. Bas...