Sciweavers

16128 search results - page 2882 / 3226
» Distributed network scheduling
Sort
View
ICDCSW
2002
IEEE
15 years 11 months ago
Efficient Massive Sharing of Content among Peers
In this paper we focus on the design of high performance peer-to-peer content sharing systems. In particular, our goal is to achieve global load balancing and short user-request r...
Peter Triantafillou, Chryssani Xiruhaki, Manolis K...
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
INFOCOM
2002
IEEE
15 years 11 months ago
Exact sampling of TCP Window States
We demonstrate how to apply Coupling from the Past, a simulation technique for exact sampling, to Markov chains based on TCP variants. This approach provides a new, statistically ...
Ashish Goel, Michael Mitzenmacher
FCT
2009
Springer
15 years 11 months ago
1-Local 17/12-Competitive Algorithm for Multicoloring Hexagonal Graphs
Abstract. In the frequency allocation problem we are given a cellular telephone network whose geographical coverage area is divided into cells where phone calls are serviced by fre...
Rafal Witkowski
EUROPAR
2001
Springer
15 years 11 months ago
Optimal Many-to-One Routing on the Mesh with Constant Queues
We present randomized and deterministic algorithms for many-to-one routing on an n-node two-dimensional mesh under the store-and-forward model of packet routing. We consider the g...
Andrea Pietracaprina, Geppino Pucci
« Prev « First page 2882 / 3226 Last » Next »