Using Dynamic Replication to Manage Service Availability in a Multimedia Server Cluster

Dukes, Jonathan; Jones, Jeremy

doi:10.1007/978-3-540-30493-7_18

Cited by 6 publications

(5 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…There has been some other work on reconfiguration of data placement, in which heuristic solutions were investigated through experimental studies (e.g., [14,23,3,7]). The paper [8] studies a generalization of our reconfiguration problem, in which file deletions incur unit costs, and the files are of arbitrary sizes.…”

Section: Related Workmentioning

confidence: 99%

“…Given an optimal solution for LP 3 , we can apply the rounding technique of Shmoys and Tardos [19], as described in the proof of Claim 3.1. The resulting integral solution can be used to determine the storage allocation.…”

Section: Solving An Lp Relaxationmentioning

confidence: 99%

“…, for all i ∈ Big, 1 ≤ r ≤ k i , and 1 ≤ j ≤ N , we get a feasible solution for LP 3 . It follows that the optimal solution for LP 3 is a lower bound for the optimal solution of LP 2 .…”

Section: Lemma 42 the Optimal Solution For Lp 3 Is A Lower Bound Formentioning

confidence: 99%

“…3 However, in general, throughout the operation of a VoD system new movies are released and may become most popular, while the popularity of the previously hot movies drops. The system should be able to support any change in the distribution on file popularities.…”

Section: Introductionmentioning

confidence: 99%

“…Rounded values can be obtained by standard solutions for the apportionment problem [22]. 3 In VoD system design, this is also known as the static phase [20].…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Minimal Cost Reconfiguration of Data Placement in Storage Area Network

Shachnai

Tamir

2010

Approximation and Online Algorithms

View full text Add to dashboard Cite

Video-on-Demand (VoD) services require frequent updates in file configuration on the storage subsystem, so as to keep up with the frequent changes in movie popularity. This defines a natural reconfiguration problem in which the goal is to minimize the cost of moving from one file configuration to another. The cost is incurred by file replications performed throughout the transition. The problem shows up also in production planning, preemptive scheduling with set-up costs, and dynamic placement of Web applications. We show that the reconfiguration problem is NP-hard already on very restricted instances. We then develop algorithms which achieve the optimal cost by using servers whose load capacities are increased by O(1), in particular, by factor 1 + δ for any small 0 < δ < 1 when the number of servers is fixed, and by factor of 2 + ε for arbitrary number of servers, for some ε ∈ [0, 1). To the best of our knowledge, this particular variant of the data migration problem is studied here for the first time.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Solving An Lp Relaxationmentioning

confidence: 99%

Section: Lemma 42 the Optimal Solution For Lp 3 Is A Lower Bound Formentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

“…Rounded values can be obtained by standard solutions for the apportionment problem [22]. 3 In VoD system design, this is also known as the static phase [20].…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Minimal Cost Reconfiguration of Data Placement in Storage Area Network

Shachnai

Tamir

2010

Approximation and Online Algorithms

View full text Add to dashboard Cite

show abstract

Content Awareness inIPTVDelivery Networks

Fati¹,

Sumari²

2018

IPTV Delivery Networks

View full text Add to dashboard Cite

Theoretical Computer Science

Shachnai¹,

Tamir²,

Tamir³

2019

Communications in Computer and Information Science

View full text Add to dashboard Cite

This paper is concerned with an effective hierarchy of guaranteed processes. A process satisfies a guarantee requirement when that requirement holds at some forthcoming point of every computation. Cy being the class of w-languages accepted by the base of this process hierarchy, this class of processes, namely Or, is a class of universal machines. Translated in these terms, our results throw light on, first, the increased computational power of the machine resulting from communication between any finite number of such machines and, second, that the hierarchy whose next degree represents w-languages accepted by machines resulting from communication between any finite number of machines in the current degree, is infinite. Interaction product acts as jump operator.We naturally start with some effective classes of guarantee properties proven to form a hierarchy and first prove that they have not the separation property. A class k? of o-languages has the separation property if, for any pair (U, Y) in V, there exists an w-language W E V such that U II W = 0 H V n W # 0. We then induce non-separability under testing from the above language theoretic non-separability result. Two processes are said to be separable if they can be separated from each other by means of another test process from the same class.It finally turns out that some processes, having different visible behaviours, are test equivalent. We close the paper on logical complexity issues of the testing problem when test criteria and guarantee constraints range over the arithmetical hierarchy.

show abstract

Using Dynamic Replication to Manage Service Availability in a Multimedia Server Cluster

Cited by 6 publications

References 12 publications

Minimal Cost Reconfiguration of Data Placement in Storage Area Network

Minimal Cost Reconfiguration of Data Placement in Storage Area Network

Content Awareness inIPTVDelivery Networks

Theoretical Computer Science

Contact Info

Product

Resources

About