Sciweavers

DAM
2006
132views more  DAM 2006»
13 years 4 months ago
On the combinatorial structure of chromatic scheduling polytopes
Chromatic scheduling polytopes arise as solution sets of the bandwidth allocation problem in certain radio access networks, supplyingwirelessaccesstovoice/datacommunicationnetwork...
Javier Marenco, Annegret Wagler
CONEXT
2009
ACM
13 years 5 months ago
FairTorrent: bringing fairness to peer-to-peer systems
Peer-to-Peer file-sharing applications suffer from a fundamental problem of unfairness. Free-riders cause slower download times for others by contributing little or no upload band...
Alex Sherman, Jason Nieh, Clifford Stein
CCGRID
2010
IEEE
13 years 5 months ago
Bandwidth Allocation for Iterative Data-Dependent E-science Applications
We develop a novel framework for supporting e-Science applications that require streaming of information between sites. Using a Synchronous Dataflow (SDF) model, our framework inco...
Eun-Sung Jung, Sanjay Ranka, Sartaj Sahni
ESA
2006
Springer
95views Algorithms» more  ESA 2006»
13 years 8 months ago
Resource Allocation in Bounded Degree Trees
We study the bandwidth allocation problem (bap) in bounded degree trees. In this problem we are given a tree and a set of connection requests. Each request consists of a path in t...
Reuven Bar-Yehuda, Michael Beder, Yuval Cohen, Dro...