Path level reliability in overlay multicast trees for realtime service = 경로 수준의 신뢰성을 고려한 오버레이 멀티캐스트 트리의 구성

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 403
  • Download : 0
Overlay Multicast is a promising approach to overcome the implementation problem of IP multicast. Real time services like internet broadcasting are provided by overlay multicast technology due to the complex nature of IP multicast and the high cost to support multicast function. Since multicast members can dynamically join or leave their multicast group, it is necessary to keep a reliable overlay multicast tree to support real time service without delay. In this paper, we consider path level reliability that connects each member node. The problem is formulated as a binary integer programming which maximizes the reliability of multicast tree. Tabu search based algorithm is presented to solve the NP-hard problem.
Advisors
Lee, Chae-Youngresearcher이채영researcher
Description
한국과학기술원 : 산업공학과,
Publisher
한국과학기술원
Issue Date
2007
Identifier
264241/325007  / 020053468
Language
eng
Description

학위논문(석사) - 한국과학기술원 : 산업공학과, 2007.2, [ iv, 22 p. ]

Keywords

path level reliability; multicast tree; overlay multicast; tabu search; 타부 서치; 신뢰성; 멀티캐스트 트리; 오버레이 멀티캐스트

URI
http://hdl.handle.net/10203/40773
Link
http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=264241&flag=dissertation
Appears in Collection
IE-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