An architecture for wide-area multicast routing
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
IEEE/ACM Transactions on Networking (TON)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
ESA '95 Proceedings of the Third Annual European Symposium on Algorithms
Preemption-based admission control in multimedia multiparty communications
INFOCOM '95 Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 2)-Volume - Volume 2
On bandwidth and storage tradeoffs in multimedia distribution networks
INFOCOM '95 Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 3)-Volume - Volume 3
Project mars: scalable, high performance, web based multimedia-on-demand (mod) services and servers
Project mars: scalable, high performance, web based multimedia-on-demand (mod) services and servers
Distributed interactive video system design and analysis
IEEE Communications Magazine
An O(pn2) algorithm for the p -median and related problems on tree graphs
Operations Research Letters
Optimal Placement of Replicas in Data Grid Environments with Locality Assurance
ICPADS '06 Proceedings of the 12th International Conference on Parallel and Distributed Systems - Volume 1
DBA'06 Proceedings of the 24th IASTED international conference on Database and applications
Designing cost-effective content distribution networks
Computers and Operations Research
Computers and Operations Research
Impact of QoS on Replica Placement in Tree Networks
ICCS '07 Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007
Optimal replica placement in hierarchical Data Grids with locality assurance
Journal of Parallel and Distributed Computing
A QoS-Aware Heuristic Algorithm for Replica Placement
GRID '06 Proceedings of the 7th IEEE/ACM International Conference on Grid Computing
Comparison of Access Policies for Replica Placement in Tree Networks
Euro-Par '09 Proceedings of the 15th International Euro-Par Conference on Parallel Processing
Optimizing server placement in distributed systems in the presence of competition
Journal of Parallel and Distributed Computing
An IPTV service delivery model using novel virtual network topology
Proceedings of the 5th International Conference on Ubiquitous Information Management and Communication
CIT'04 Proceedings of the 7th international conference on Intelligent Information Technology
Branch and price algorithm for content allocation problem in VOD network
ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part IV
Designing content distribution networks for optimal cost and performance
Information Technology and Management
CEA: A Cyclic Expansion Algorithm for data migration in parallel video servers
Journal of Parallel and Distributed Computing
Concurrency and Computation: Practice & Experience
Growing half-balls: minimizing storage and communication costs in CDNs
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Hi-index | 0.00 |
The delivery of large files to individual users, such as video on demand or application programs to the envisioned network computers is expected by many to be one of the main tasks of broadband communication networks. This requires high bandwidth capacity as well as fast and dense storage servers. This motivates multimedia service providers to optimize the delivery network, as well as the electronic content allocation.A hierarchical architecture for the distribution of multimedia content was introduced by Nussbaumer, Patel, Schaffa, and Sterbenz (INFOCOM 94). They addressed the trade-off between bandwidth and storage requirements that results from the placement of the content servers in the hierarchy tree. They presented a centralized algorithm to compute the best level of the hierarchy for the server location to minimize the combined cost of communication and storage.In this work we solve a general case where servers can be placed at different levels of the hierarchy. We develop a distributed optimal location algorithm that requires small nodal memory capacity and computational power. Previous results for related problems for caching system design are of higher complexity. Previous results for related classic operations research problems are limited to centralized algorithms, based on linear programming, that are not easy to convert into distributed algorithms. Instead, to obtain our results, we observed that the use of dynamic programming naturally lends itself to a distributed implementation.For the specific problem at hand, we also managed to find a natural function (a generalization of the problem) that simplifies the combination operation used in the design of a dynamic program.