Jon Kleinberg, Yuval Rabani, and Eva Tardos. Allocating bandwidth for bursty connections. SIAM J. Comput., 30(1):191--217 (electronic), 2000. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Stream-Packing: Resource Allocation in Web Server Farms.. - Shahabuddin, Kumar (Correct)
....connection requests (jobs) have been studied on a single network connection. It is based on statistical multiplexing the combining uncorrelated bursty demands to improve packing efficiency. A study of statistical multiplexing from the perspective of approximation algorithms has been done in [14] where they consider the problems of stochastic load balancing, bin packing and knapsack. Burstiness is approximated by a single number the effective bandwidth, which speeds up the process of client selection at the cost of packing efficiency. This conservative approach is suitable for ....
....than the one that ensures that during a period of 24 hours a client is given promised capacity proportion of time. In that case client may not be given the desired capacity during his peak requirement period. The same notion of QoS as ours, but for a single dimension, has been used in [13] [14], and [9] This QoS is based on usage history and unexpected surges are likely to cause a deterioration in performance. Approaches towards providing QoS guarantees are classified in [16] and our QoS falls into the observation based class of guarantees. Web server performance analysis tools ....
[Article contains additional citation context not shown here]
Jon Klienberg, Yuval Rabani, Eva Tardos, Allocating Bandwidth for Bursty Connections, Proceedings of the 29th ACM Symposium on Theory of Computing, 1997.
Boosted Sampling: Approximation Algorithms for Stochastic .. - Gupta, Pal, Ravi, Sinha (2004) (1 citation) (Correct)
No context found.
Jon Kleinberg, Yuval Rabani, and Eva Tardos. Allocating bandwidth for bursty connections. SIAM J. Comput., 30(1):191--217 (electronic), 2000.
Boosted Sampling: Approximation Algorithms for Stochastic.. - Pal, Ravi, Sinha (2003) (1 citation) (Correct)
No context found.
Jon Kleinberg, Yuval Rabani, and Eva Tardos. Allocating bandwidth for bursty connections. SIAM J. Comput., 30(1):191--217 (electronic), 2000.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC