34 search results - page 7 / 7 » sigmetrics 2004 |
SIGMETRICS
2004
ACM
14 years 4 months ago
2004
ACM
The problem of estimating the capacity of an Internet path is one of fundamental importance. Due to the multitude of potential applications, a large number of solutions have been ...
SIGMETRICS
2004
ACM
14 years 4 months ago
2004
ACM
Traditional Peer-to-Peer (P2P) networks do not provide service differentiation and incentive for users. Consequently, users can easily access information without contributing any ...
SIGMETRICS
2004
ACM
14 years 4 months ago
2004
ACM
The Least Attained Service (LAS) scheduling policy, when used for scheduling packets over the bottleneck link of an Internet path, can greatly reduce the average flow time for sh...
SPAA
2005
ACM
14 years 4 months ago
2005
ACM
We describe a new class of utility-maximization scheduling problem with precedence constraints, the disconnected staged scheduling problem (DSSP). DSSP is a nonpreemptive multipro...