Cybernetics and Systems Analysis

, Volume 41, Issue 6, pp 898–908 | Cite as

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

  • C. A. S. Oliveira
  • P. M. Pardalos


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.


multicast networks SCPP approximation algorithm NP 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    A. Ballardie, P. Francis, and J. Crowcroft, “Core-based trees (CBT) — an architecture for scalable inter-domain multicast routing,” Computer Communication Review, 23, No. 4, 85–95 (1993).CrossRefGoogle Scholar
  2. 2.
    G. Chockler, N. Huleihel, I. Keidar, and D. Dolev, “Multimedia multicast transport service for groupware,” in: Proc. TINA Conf. on the Convergence of Telecommunications and Distributed Computing Technologies (1996), pp. 43–54.Google Scholar
  3. 3.
    C. Chow, “On multicast path finding algorithm,” in: Proc. IEEE INFO-COMM’91 (1991), pp. 1274–1283.Google Scholar
  4. 4.
    S. Deering, D. Estrin, D. Farinacci, Van Jacobson, C. Liu, and L. Wei, “The PIM architecture for wide-area multicast routing,” IEEE/ACM Trans. Networking, 4, No, 2, 153–162 (1996).CrossRefGoogle Scholar
  5. 5.
    D.-Z. Du, B. Lu, H. Ngo, and P. M. Pardalos, “Steiner tree problems,” in: C. Floudas and P. Pardalos (eds.), Encyclopedia of Optimization, 5 (2001), pp. 227–290.Google Scholar
  6. 6.
    H. Eriksson, “MBONE: The multicast backbone,” Communications of ACM, 37, No. 8 (1994).Google Scholar
  7. 7.
    U. Feige, “A threshold of ln n for approximating set cover,” J. ACM, 45, No. 4, 634–652 (1998).CrossRefMATHMathSciNetGoogle Scholar
  8. 8.
    G. Feng and T. P. Yum, “Efficient multicast routing with delay constraints,” Intern. J. Communication Systems, 12, 181–195 (1999).Google Scholar
  9. 9.
    F. Gomes, C. Menezes, A. Lima, and C. Oliveira, “Asynchronous organizations for solving the point-to-point connection problem,” in: Proc. Int. Conf. on Multiagents Systems (ICMAS), IEEE Computer Society (1998), pp. 144–149.Google Scholar
  10. 10.
    L. Han and N. Shahmehri, “Secure multicast software delivery,” IEEE 9th Intern. Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises (WET ICE’00) (2000), pp. 207–212.Google Scholar
  11. 11.
    V. Kompella, J. Pasquale, and G. Polyzos, “Multicast routing for multimedia communication,” IEEE/ACM Trans. Networking, 1, No. 3, 286–292 (1993).CrossRefGoogle Scholar
  12. 12.
    V. Kompella, J. Pasquale, and G. Polyzos, “Two distributed algorithms for the constrained Steiner tree problem,” in: Proc. 2nd Intern. Conf. on Computer Communications and Networking (ICCCN’93) (1993), pp. 343–349.Google Scholar
  13. 13.
    G. Kumar, N. Narang, and C. Ravikumar, “Efficient algorithms for delay bounded multicast tree generation for multimedia applications,” in: Proc. 6th Intern. Conf. on High Performance Computing (1999), pp. 169–173.Google Scholar
  14. 14.
    B. Li, M. Golin, G. Italiano, X. Deng, and K. Sohraby, “On the optimal placement of web proxies in the Internet,” in: Proc. IEEE INFOCOM’99 (1999).Google Scholar
  15. 15.
    Z. Mao, D. Johnson, O. Spatscheck, van der J. Merwe, and J. Wang, “Efficient and robust streaming provisioning in VPNs,” in: Proc. WWW2003 (May 20–24, 2003), Budapest, Hungary (2003).Google Scholar
  16. 16.
    C. Oliveira, P. Pardalos, O. Prokopyev, and M. Resende, “Streaming cache placement problems: Complexity and algorithms,” Technical report, Department of Industrial and Systems Engineering, University of Florida (2003). Available at∼oliveira/research.html.Google Scholar
  17. 17.
    C. Papadimitriou and M. Yannakakis, “Optimization, approximation, and complexity classes,” J. Comput. System Sci., No. 43, 425–440 (1991).Google Scholar
  18. 18.
    H. Salama, D. Reeves, and Y. Viniotis, “A distributed algorithm for delay-constrained unicast routing,” in: Proc. IEEE INFOCOM’97, Kobe, Japan (1997).Google Scholar
  19. 19.
    R. Sriram, G. Manimaran, and C. Siva Ram Murthy, “Algorithms for delay-constrained low-cost multicast tree construction,” Computer Communications, 21, No. 18, 1693–1706 (1998).Google Scholar

Copyright information

© Springer Science+Business Media, Inc. 2005

Authors and Affiliations

  • C. A. S. Oliveira
    • 1
  • P. M. Pardalos
    • 2
  1. 1.Center for Applied Optimization, Department of Industrial and Systems EngineeringUniversity of FloridaUSA
  2. 2.Oklahoma State University, School of Industrial Engineering and ManagementUSA

Personalised recommendations