Abstract

The delivery of large files toin)((P2fi( users, such as videoon deman orapplication programs to theenM9((92fi nenM9 computers is expected byman to be on of themain tasks ofbroadban communfi(((9 nommun This requires highban2BPP) capacity as well as fastan den2 storage servers. This motivates multimedia service providers to optimize the delivery nlivery as well as the electronfi conctr allocation A hierarchical architecture for thedistribution of multimediacontim was in((P-M2fi by Nussbaumer, Patel, Scha#a, an Sterben (INFOCOM 94). They addressed the trade-o#between baneen2 an storagerequiremenN that results from theplacemen of theconNMP serversin the hierarchy tree. Theypresen)N acenPW2fiP-W algorithm to compute the best level of the hierarchy for the serverlocation tominMP-9 thecombin( cost ofcommun2fiP)-- an storage. In this work, we solve agen-qq case where serverscan be placed atdi#eren levels of the hierarchy. We develop a distributed optimallocation algorithm that requires small nall memory capacityan computationpower. Previous results for related problems forcachin systemdesign are of higher complexity. Previous results for related classic operation research problems are limited tocenBW-2fiPP algorithms, basedon lind2 programminfi that are ne easy to conMB) in distributed algorithms.Ingorit toobtain our results, we observed that the use ofdynq)P programmin nprogram leno itself to a distributedimplemened2NW( For the specific problem athan9 we alsoman2PN to fin anPWMBB funMBB2 (agenBB-2fiNBNq) of the problem) that simplifies the combin2fiNW operation usedin thedesign of adyn9P( program.

Citations