Journal of the Korean Operations Research and Management Science Society (한국경영과학회지)

The Korean Operations Research and Management Science Society (한국경영과학회)
권호 표지

Maximization of Path Reliabilities in Overlay Multicast Trees for Realtime Internet Service

실시간 인터넷 서비스를 위한 오브레이 말티케스트 트리의 패스 신뢰성 최대화

  • Published : 2008.06.30
Download PDF
⟨ Previous Next ⟩

Abstract

Overlay Multicast is a promising approach to overcome the implementation problem of IP multicast. Real time services like Internet broadcasting are provided by the overlay multicast technology due to the complex nature and high cost of IP multicast. To reduce frequent updates of multicast members and to support real time service without delay, we suggest a reliable overlay multicast tree based on members' sojourn probabilities. Path reliabilities from a source to member nodes are considered to maximize the reliability of an overlay multicast tree. The problem is formulated as a binary integer programming with degree and delay bounds. A tabu search heuristic is developed to solve the NP-complete problem. Outstanding results are obtained which is comparable to the optimal solution and applicable in real time.

Keywords

References

  1. Chu Y.-H., Ganjam, A., Ng, TSE, Rao, S.G., Sripanidkulchai, K., Zhan, J., and Zhang, H., Early experience with an Internet broadcast system based on overlay multicast, Technical Report CMU-CS-03-214, Carnegie Mellon University, December 2003
  2. Diot, C., Levine, B.N., Lyles, B., Kassem, H., and Balensiefen, D., "Deployment issues for the IP multicast service and architecture," IEEE Network, Vol.14, No.1(2000), pp.78-88 https://doi.org/10.1109/65.819174
  3. Oliveira, C.A.S. and Pardalos, P.M., Algorithms for the streaming cache placement problem on multicast networks, Proceedings of seventh INFORMS telecommunications conference (ITC'04), Florida; Boca Raton：March 7-10, 2004
  4. Lee, C., Park, H., and Baek, J., An overlay multicast to minimize end-to-end delay in IP networks, Proceedings of tenth international conference on communication technology (ICCT'06), (2006), pp.27-30
  5. Shi, S. and Turner, J., Routing in overlay multicast networks, IEEE INFOCOM, 2002
  6. Cho, H. and Lee, C., "Multicast tree rearrangement to recover node failure in overlay multicast network," Computers and Operations Research, Vol.33, No.3(2006), pp.581-594 https://doi.org/10.1016/j.cor.2004.07.018
  7. Lee, C. and Kim, H., "Reliable overlay multicast trees for private internet broadcasting with multiple sessions," Computers and Operations Research, Vol.34, No.9(2007), pp.884-899 https://doi.org/10.1016/j.cor.2005.05.016
  8. Shi, S., Turner, J., and Waldvogel, M., Dimensioning server access bandwidth and multicast routing in overlay networks, In：Proceedings of eleventh international workshop on network and operating systems support for digital audio and video (NOSSDAV'01), (2001), pp.25-26
  9. Garey, M.R., and Johnson, D.S., Computers and intractability：a guide to the theory of NP-completeness. W.H. Freeman and Company, 1979
  10. Glover, F. and Laguna, M., Tabu search. Dordrecht：Kluwer Academic Publishers; 1997
  11. Glover, F., "Tabu search：a tutorial," Interfaces, Vol.20, No.4(1990), pp.74-94 https://doi.org/10.1287/inte.20.4.74
  12. Digital encoding services, Inc.,
  13. CPLEX 8.1,
  14. Common log format,
  15. Extended common log format,