• Title/Summary/Keyword: Overlay Service Network

Search Result 92, Processing Time 0.017 seconds

Building Low Delay Application Layer Multicasting Trees for Streaming Services (스트리밍 서비스를 위한 적은 지연의 응용계층 멀티캐스트 트리 구축)

  • Kim, Jong-Gyung
    • The Journal of the Korea Contents Association
    • /
    • v.8 no.10
    • /
    • pp.20-26
    • /
    • 2008
  • The quality of stream remaking is decided the load of a server and Jitter through the traffic of the transmission path between end to end. In order to improve these problems in this paper, I propose tree construction method of low-delay-level-multicast. In this case which the network congestion will be occurred by streaming quality, I also propose the technique which dynamically changes the transmission path. This technique first constructs the overlay structure for relaxing the overload of server. Secondly, in order to decrease Jitter of client, it makes upload bandwidth and low latency balanced. In the evaluation of the performance, this paper showed better enhancement of about $15%{\sim}24%$ than P2CAST[4] in the simulation about node average join count, average bandwidth, service request refusal ratio, RTT measurement of nodes, and node average join count by defect ratio.

Architecture and Server Selection for DHT-based Distributed CDN (해시 테이블 기반 분산형 CDN 구조 및 서버 선택 방안)

  • Jung, Jong-Hae;Oh, Gun-Young;Lee, Nam-Kyung;Yoon, Chang-Woo;Lee, Hyun-Woo;Ryu, Won;Lee, Sung-Chang
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.11 no.5
    • /
    • pp.217-228
    • /
    • 2011
  • In centralize CDN systems, the content server selection is performed by service node for every user request, and the selected node is notified to the user. In this paper, we present distributed CDN architecture and algorithm in which the request from a user is delivered to the content source by a P2P algorithm utilizing DHT(distributed hash table) through the overlay network and the user selects one of the source nodes based on real-time user-centric criteria. For this purpose, we propose a modified Pastry algorithm for contents registration, search and selection, in addition to the distributed architecture. The proposed architecture has the advantages of load balancing, traffic balancing, scalability, fault-tolerance due to the self-configuration, self-healing attributes of distributed architecture. Various simulation shows the feasibility of the proposed architecture and algorithm, and the performance is compared and discussed for the variations of the proposed scheme.