Sciweavers

5056 search results - page 772 / 1012
» Network Coding Theory
Sort
View
INFOCOM
2002
IEEE
15 years 11 months ago
User Fair Queing: Fair Allocation of Bandwidth for Users
—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...
Albert Banchs
171
Voted
STOC
2010
ACM
193views Algorithms» more  STOC 2010»
15 years 11 months ago
Maintaining a large matching and a small vertex cover
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...
Krzysztof Onak, Ronitt Rubinfeld
CDC
2009
IEEE
142views Control Systems» more  CDC 2009»
15 years 11 months ago
Optimized rate allocation for state feedback control over noisy channels
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...
ICDCS
1997
IEEE
15 years 10 months ago
Two New Quorum Based Algorithms for Distributed Mutual Exclusion
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 ...
Wai-Shing Luk, Tien-Tsin Wong
ASWEC
2007
IEEE
15 years 10 months ago
Explicitly Controlling the Fair Service for Busy Web Servers
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...
Zhanwen Li, David Levy, Shiping Chen, John Zic