Browse > Article

A Study on the Optimal Rate Allocation Problem in Overlay Multimedia Multicasting  

Chung, Ji-Bok (대전대학교 경영학과)
Choi, Byung-Cheon (충남대학교 경영학부)
Park, Jong-Dae (한국전자통신연구원)
Ryu, Ho-Yong (한국전자통신연구원)
Publication Information
Journal of the Korean Operations Research and Management Science Society / v.36, no.2, 2011 , pp. 33-42 More about this Journal
Abstract
Overlay multicasting has received a lot of attention as a core technology for multimedia streaming service. In this paper, we consider the discrete optimal rate allocation problem in multimedia overlay multicasting, which has been proposed by Akbari et al.[2]. The computational complexity of this problem is not known. Thus, we propose a special case which can be solved in polynomial time.
Keywords
Overlay Multicasting; Computational Complexity; Polynomial-time Algorithm;
Citations & Related Records
Times Cited By KSCI : 1  (Citation Analysis)
연도 인용수 순위
1 김현기, "QoS를 위한 오버레이 멀티캐스트의 복원경로에 관한 연구", 한국산업정보학회논문지, 제24권, 제4호(2009), pp.49-56.
2 Akbari, B., H.R. Rabiee, and M. Ghanbari, "An optimal discrete rate allocation for overlay video multicasting," Computer Communications, Vol.31(2008), pp.551-563.   DOI   ScienceOn
3 Sarkar, S. and L. Tassiulas, "Fair Bandwidth Allocation for Multicasting in Networks with Discrete Feasible Set," IEEE Transactions on Computers, Vol.53, No.7(2004), pp.785-797.   DOI   ScienceOn
4 Wu, C. and B. Li, "Optimal Rate Allocation in Overlay Content Distribution, NETWORKING 2007," LNCS, Vol.4479(2007), pp.678-690.
5 Yi, C., Y. Xue, and K. Nahrstedt, "Optimal Resource Allocation in Overlay Multicast," IEEE Transactions on Parallel and Distributed Systems, Vol.17, No.8(2006), pp.808-823.   DOI