서지주요정보
랜드마크 기반의 향상된 트리 퍼스트 방식의 응용계층 멀티캐스트 = Enhanced tree-first application-layer multicast based on landmark
서명 / 저자 랜드마크 기반의 향상된 트리 퍼스트 방식의 응용계층 멀티캐스트 = Enhanced tree-first application-layer multicast based on landmark / 김유성.
발행사항 [대전 : 한국과학기술원, 2004].
Online Access 원문보기 원문인쇄

소장정보

등록번호

8015260

소장위치/청구기호

학술문화관(문화관) 보존서고

MCS 04014

휴대폰 전송

도서상태

이용가능(대출불가)

사유안내

반납예정일

리뷰정보

초록정보

Logistical Networking is one of the end-to-end approaches for globally scalable network storage. It is applied to large-scale distributed network storage system such as web caching, FTP mirroring, Content Distribution Network (CDN), and Data Grid etc. To transfer data to large-scale distributed nodes through Logistical Networking, a scalable and efficient mechanism for one-to-many data transfer is necessary. Multicasting is an efficient mechanism for one-to-many data transfer application. It eliminates redundant packet replication and decouples the size of the receiver set. However deployment of network-layer multicast has not been widely adopted and thus Internet is still incapable of native multicast. Application-layer Multicast approaches do not change the network infrastructure, instead they implement multicast forwarding functionality at end-host. Tree first approach improved scalability of application-layer multicast, however it does not consider global topology information. Constructing data paths without topological information which is congruent with the underlying IP-level topology, the data paths may include unnecessary high latency hops and make network resource usage increased. In this thesis, we propose a landmark based approach which adds landmark scheme to tree first approach for the scalable application-layer multicast. Measuring network latency to each landmark, we can approximate global topology information and construct topologically-aware data paths. Our results of the performance evaluation indicate that the landmark based approach can reduce average path delay (from source to each member) and total link latency of data paths over the tree first approach, and still offer the scalability of the tree first approach at the same time.

서지기타정보

서지기타정보
청구기호 {MCS 04014
형태사항 iii, 39 p. : 삽화 ; 26 cm
언어 한국어
일반주기 저자명의 영문표기 : Yu-Sung Kim
지도교수의 한글표기 : 전길남
지도교수의 영문표기 : Kil-Nam Chon
학위논문 학위논문(석사) - 한국과학기술원 : 전산학전공,
서지주기 참고문헌 : p. 38-39
QR CODE

책소개

전체보기

목차

전체보기

이 주제의 인기대출도서