(A) multicast tree to minimize maximum delay in dynamic overlay network = 동적인 오버레이 네트워크에서 최대 지연을 최소화 하기 위한 멀티캐스트 트리

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 280
  • Download : 0
Overlay multicast is an emerging technology for next generation Internet service to various groups of multicast members. It will take the place of traditional IP multicast which is not widely deployed due to the complex nature of its technology. The overlay multicast which effectively reduces processing at IP routers can be easily deployed on top of a densely connected IP network. An end-to-end delay problem is considered which is serious in the multicast service when members frequently join and leave their service group. To periodically optimize the route in the overlay network and to minimize the maximum end-to-end delay, overlay multicast tree is investigated with degree bound at each member node. The problem is formulated as a degree-bounded minimum spanning tree, which is known to be NP-hard. A tabu search heuristic is developed based on reconnection and swap moves. Frequency based diversification strategy is also adopted to improve solutions by intensification. Outstanding experimental results are obtained which is comparable to the optimal solution and applicable in real time.
Advisors
Lee, Chae-Youngresearcher이채영researcher
Description
한국과학기술원 : 산업공학과,
Publisher
한국과학기술원
Issue Date
2006
Identifier
260012/325007  / 020043259
Language
eng
Description

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

Keywords

node degree bound; multicast tree; Overlay multicast; tabu search; 타부 서치; 차수 제약; 멀티캐스트 트리; 오버레이 멀티캐스트

URI
http://hdl.handle.net/10203/40759
Link
http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=260012&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