Abstract
In this paper, we propose a P2P-based IPTV system using a multiple chain architecture. The proposed system robustly accommodates peer churn. As opposed to the Internet, the IPTV network managed by a single ISP has fewer bandwidth constraints and guarantees stability. Therefore, we emphasize preferentially the robustness of a P2P network in an IPTV environment. A single chain structure, which was proposed previously, emphasizes simplicity, but suffers delay toward the end of the chain as the number of peers increases. To diminish delay time, we propose a scheme that divides the chain into several levels, and again divides each level into spans. Although the chain is divided into levels and spans, the basic structure of the proposed scheme is still a chain structure, one that simplifies the recovery procedure caused by the entry or departure of peers. We also propose a generalized structure that classifies channel types into popular channels and unpopular channels, so as to improve P2P performance. We will show that with respect to delay time, the proposed scheme offers improved performance over the single chain structure reorganization process for coping with peer churn. One factor that should be considered in a P2P IPTV system is the necessity of dealing with the transfer structure according to the number of peers in a DSLAM. If a large number of peers are connected in a DSLAM for one channel (namely, the popular channel), it is efficient to receive data from the head-end server. But unpopular channels with smaller numbers of peers connected in a DSLAM decrease the efficiency of a P2P system. We propose an algorithm that increases the efficiency of P2P by separating the situation associated with the numbers of peer connected in a DSLAM. There is a varity of network environments depending on areas or countries, and in this paper, we propose the P2P-based IPTV system which is good to be applied to an urban network environment that is a densed house area in a city.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have