1991
DOI: 10.1137/0404017
|View full text |Cite
|
Sign up to set email alerts
|

New Ressults on Server Problems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
160
0

Year Published

2006
2006
2016
2016

Publication Types

Select...
4
2
1

Relationship

0
7

Authors

Journals

citations
Cited by 210 publications
(161 citation statements)
references
References 7 publications
1
160
0
Order By: Relevance
“…This generalizes the previous results for h = k [3,4]. Our proof also follows similar ideas, but our potential function is more involved (it has three terms instead of two), and the analysis is more subtle.…”
Section: Theorem 2 For Any Tree the Competitive Ratio Of DC Is At Mosupporting
confidence: 82%
See 3 more Smart Citations
“…This generalizes the previous results for h = k [3,4]. Our proof also follows similar ideas, but our potential function is more involved (it has three terms instead of two), and the analysis is more subtle.…”
Section: Theorem 2 For Any Tree the Competitive Ratio Of DC Is At Mosupporting
confidence: 82%
“…Note this generalizes the potential considered in [3,4] for the case of h = k. In that setting, all the online servers are matched and hence D M = D X and is independent of M, and thus the potential above becomes k times that minimum cost matching between X and Y plus D x . On the other hand in our setting, we need to select the right set M of DC servers to be matched to the offline servers based on minimizing…”
Section: Upper Boundmentioning
confidence: 58%
See 2 more Smart Citations
“…This has led us to the development of an online algorithm that is both lazy and non-marking. Unfortunately for us, we later discovered that this algorithm already appears as ROTATE in [CKPV91], where it is proved to be k-competitive, by means of amortized analysis. Below we give a brief description of FWF and ROTATE.…”
Section: Symbolic Model-checking Algorithmmentioning
confidence: 99%