Construction algorithms and approximation bounds for the streaming cache placement problem in multicast networks

Authors:
C. A. Oliveira;P. M. Pardalos
Affiliations:
Center for Applied Optimization, Department of Industrial and Systems Engineering, University of Florida, USA;Oklahoma State University, School of Industrial Engineering and Management, USA
Venue:
Cybernetics and Systems Analysis
Year:
2005

Citing 12
Cited 1

Multicast routing for multimedia communication

IEEE/ACM Transactions on Networking (TON)
Core based trees (CBT)

SIGCOMM '93 Conference proceedings on Communications architectures, protocols and applications
MBONE: the multicast backbone

Communications of the ACM
The PIM architecture for wide-area multicast routing

IEEE/ACM Transactions on Networking (TON)
A threshold of ln n for approximating set cover

Journal of the ACM (JACM)
Efficient Algorithms for Delay Bounded Multicast Tree Generation for Multimedia Applications

HiPC '99 Proceedings of the 6th International Conference on High Performance Computing
Secure Multicast Software Delivery

WETICE '00 Proceedings of the 9th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises
On the Optimal Placement of Web Proxies in the Internet: The Linear Topology

HPN '98 Proceedings of the IFIP TC-6 Eigth International Conference on High Performance Networking
Efficient and robust streaming provisioning in VPNs

WWW '03 Proceedings of the 12th international conference on World Wide Web
A Distributed Algorithm for Delay-Constrained Unicast Routing

INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Asynchronous Organizations for Solving the Point-to-Point Connection Problem

ICMAS '98 Proceedings of the 3rd International Conference on Multi Agent Systems
Algorithms for delay-constrained low-cost multicast tree construction

Computer Communications

Redundant multicast routing in multilayer networks with shared risk resource groups: Complexity, models and algorithms

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

The streaming cache placement problem (SCPP) is considered. The SCPP is known to be NP-hard and MAX SNP-hard. It is shown that for the SCPP there is no approximation algorithm with a guarantee better than log k unless NP can be solved in sub-exponential time. Construction algorithms for the SCPP, based on two general techniques, are proposed. The results of computational experiments based on these two algorithms and their modifications are reported.