RTCP-based RP reselection scheme for real-time multicast services in internet wide area network인터넷 광역망에서 실시간 멀티캐스트 서비스를 위한 RTCP 기반의 RP 재선정 기법에 관한 연구

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 502
  • Download : 0
Multicast tree construction algorithms for multimedia service are largely classified into Source based tree Shared. The Shared tree based multicast is known to show better performance in the aspect of scalability than source based tree. Generally, there have been lots of researches on the algorithm to satisfy QoS constraints through proper Rendezvous Point (RP) in the shared tree. In addition, as the multicast group members join and leave dynamically during the session, the RP shared tree should be reselected to satisfy the QoS of the new members. But, there is not much previous works on the RP reselection algorithm to guarantee peer-to-peer service quality. In this thesis, both of new initial RP selection (iRPSA) and RP reselection (nRPSA) algorithms are proposed, which use RTCP(REAL Time Control Protocol) report packet fields. Conventional RP selection algorithm can be classified into two algorithms depending on multiple QoS constraints. Multiple QoS constraints based RP selection algorithm considers multiple QoS constraints such as delay, delay jitter, and bandwidth simultaneously. RP selection algorithm without QoS constraints can be divided into three areas, which are random, topology based, and group based RP selection, respectively. Conventional RP selection algorithms, such as, Random, Topology based, and Group based algorithm cannot fully guarantee QoS constraints. Recent studies on RP selection report the RP selection algorithm considering multiple QoS constraints. In order to provide the real time multimedia service, the complexity of QoSconstraint algorithms should be reduced considerably. As the multicast group members join and leave dynamically during the session, it is difficult to guarantee the QoS constraints for some of newly joining members. In that case, new RP should be selected to guarantee QoS for every group member. There are two algorithms to select new RP. One is to select new RP considering member dynamic sensitivity that indica...
Advisors
Youn, Chan-Hyunresearcher윤찬현researcher
Description
한국정보통신대학원대학교 : 공학부,
Publisher
한국정보통신대학교
Issue Date
2001
Identifier
392059/225023 / 000993895
Language
eng
Description

학위논문(석사) - 한국정보통신대학원대학교 : 공학부, 2001, [ ix, 69 p. ]

Keywords

RP; 실시간; Real-Time

URI
http://hdl.handle.net/10203/54728
Link
http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=392059&flag=dissertation
Appears in Collection
School of Engineering-Theses_Master(공학부 석사논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0