Live video streaming becomes one of the most popular internet activities in the recent years. Along with its popularity, the problems such as scalability, availability and low-latency are still the main drawbacks of the peer-to-peer (P2P) live video streaming. The DHT-aided chunk-driven overlay (DCO) [3] tried to overcome these problems by using the Distributed Hash Table (DHT) in live video streaming. Even the performance of DCO is better than other traditional works such as tree-based system, in terms of vulnerability to churn, and mesh-based system, in terms of high delay and message overhead, there are some problems in DCO which need to be solved. The coordinator is easy to get overloaded by many requests because one coordinator is responsible for storing the chunk index of several segments. Moreover, the number of nodes that the video server is responsible for sending the video segment to are not clearly defined. To solve these problems, in this paper, a more efficient approach of using the coordinator nodes is proposed. Furthermore, the threshold is carefully calculated in order to use the server capacity efficiently. The server is only responsible for sending the video segment to the threshold nodes. After that, the video segment will be shared among nodes in the network until every node receives the video segment. The performance evaluation results show that our work is more efficient than DCO, and the server capacity can be used efficiently if the threshold is careful defined.
목차
Abstract 1. Introduction 2. Related works 3. Overall Architecture 3.1 Buffer Map Management 3.2 Segment Retrieval 4. Threshold Modeling 5. Performance Analysis 5.1 Optimized server bandwidt h 5.2 Number of node requests 5.3 Number of DHT Searches 6. Conclusion REFERENCES
키워드
Live video streamingPeer-to-Peer networkDHTThreshold
한국EA학회는 전사적 관점의 아키텍처 개념 및 원칙을 국내 민간기업 및 정부기관에 적용 확산시키고, EA 및 관련 분야의 연구, 전문인력의 양성 및 정책적 건의 등을 통해 기업 및 정부기관의 경쟁력 및 생산성을 향상시키고, 우리나라 지식 기반 산업 등의 고도화를 도모하는 것을 목적으로 합니다.