Sciweavers

147 search results - page 4 / 30
» Polynomial Fairness and Liveness
Sort
View
TCS
1998
13 years 8 months ago
Reachability in Live and Safe Free-Choice Petri Nets is NP-Complete
The complexity of the reachability problem for live and safe free-choice Petri nets has been open for several years. Several partial results seemed to indicate that the problem is...
Javier Esparza
PPNA
2011
13 years 3 months ago
LiquidStream - network dependent dynamic P2P live streaming
A successful P2P live streaming system must achieve high uploading bandwidth utilization, fast stream distribution, fair aggregate bandwidth distribution among participating nodes,...
Nikolaos Efthymiopoulos, Athanasios Christakidis, ...
TON
2008
120views more  TON 2008»
13 years 8 months ago
Centralized and distributed algorithms for routing and weighted max-min fair bandwidth allocation
Given a set of demands between pairs of nodes, we examine the traffic engineering problem of flow routing and fair bandwidth allocation where flows can be split to multiple paths ...
Miriam Allalouf, Yuval Shavitt
CONEXT
2009
ACM
13 years 9 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
ICUMT
2009
13 years 6 months ago
On the architecture and the design of P2P live streaming system schedulers
-- In this paper we analyze P2P live streaming systems. Through this analysis we obtain the crucial parameters for their performance in terms of bandwidth utilization, set-up time,...
Athanasios Christakidis, Nikolaos Efthymiopoulos, ...