3,183 research outputs found

    QoE in Pull Based P2P-TV Systems: Overlay Topology Design Tradeoff

    Get PDF
    Abstract—This paper presents a systematic performance anal-ysis of pull P2P video streaming systems for live applications, providing guidelines for the design of the overlay topology and the chunk scheduling algorithm. The contribution of the paper is threefold: 1) we propose a realistic simulative model of the system that represents the effects of access bandwidth heterogeneity, latencies, peculiar characteristics of the video, while still guaranteeing good scalability properties; 2) we propose a new latency/bandwidth-aware overlay topology design strategy that improves application layer performance while reducing the underlying transport network stress; 3) we investigate the impact of chunk scheduling algorithms that explicitly exploit properties of encoded video. Results show that our proposal jointly improves the actual Quality of Experience of users and reduces the cost the transport network has to support. I

    Extended Equal Service and Differentiated Service Models for Peer-to-Peer File Sharing

    Full text link
    Peer-to-Peer (P2P) systems have proved to be the most effective and popular file sharing applications in recent years. Previous studies mainly focus on the equal service and the differentiated service strategies when peers have no initial data before their download. In an upload-constrained P2P file sharing system, we model both the equal service process and the differentiated service process when peers' initial data distribution satisfies some special conditions, and also show how to minimize the time to get the file to any number of peers. The proposed models can reveal the intrinsic relations among the initial data amount, the size of peer set and the minimum last finish time. By using the models, we can also provide arbitrary degree of differentiated service to a certain number of peers. We believe that our analysis process and achieved theoretical results could provide fundamental insights into studies on bandwidth allocation and data scheduling, and can give helpful reference both for improving system performance and building effective incentive mechanism in P2P file sharing systems

    Autonomic Management of Maintenance Scheduling in Chord

    Get PDF
    This paper experimentally evaluates the effects of applying autonomic management to the scheduling of maintenance operations in a deployed Chord network, for various membership churn and workload patterns. Two versions of an autonomic management policy were compared with a static configuration. The autonomic policies varied with respect to the aggressiveness with which they responded to peer access error rates and to wasted maintenance operations. In most experiments, significant improvements due to autonomic management were observed in the performance of routing operations and the quantity of data transmitted between network members. Of the autonomic policies, the more aggressive version gave slightly better results

    Improving file distribution performance by grouping in peer-to-peer networks

    Get PDF
    It has been shown that the peer-to-peer paradigm is more efficient than the traditional client-server model for file sharing among a large number of users. Given a group of leechers who wants to download a single file and a group of seeds who possesses the whole file, the minimum time needed for distributing the file to all users can be calculated based on their bandwidth availabilities. A scheduling algorithm has been developed so that every leecher can obtain the file within this minimum time. Unfortunately, this mechanism is not optimal with regard to the average download time among the peers. In this paper, we study how to reduce the average download time without prolonging the time needed for all leechers to obtain the file from a theoretical perspective. Based on the bandwidth capacities, the seeds and leechers are divided into different groups. We identify the necessary conditions for grouping to bring about benefits. We also study the impact on performance when leechers leave the system before the downloading process is complete. To evaluate our mechanism, we conduct extensive simulations and compare the performance with a BitTorrentlike file sharing algorithm. The results show that our grouping protocol successfully reduces the average download time over a wide range of system configurations. © 2009 IEEE.published_or_final_versio

    Novel bandwidth strategy for wireless P2P file sharing

    Get PDF
    With the rapid development of the mobile device technology and wireless network technology, the need of an efficient file sharing method on wireless network becomes more and more significant. Peer-to-Peer(P2P) file distribution, as a quite popular method being used now, is a promising choice. However, the limitation of bandwidth of wireless networks greatly restricts the performance of wireless P2P. In this paper, we propose a new idea of better utilizing the limited bandwidth to improve the file distribution performance. The criteria of an optimal splitting of the half-duplex bandwidth is deduced with mathematical analysis. To achieve a further improvement on the average distribution time, we also propose a grouping strategy which works with the bandwidth strategy. Simulation results show that our mechanism can efficiently reduce the file distribution time among wireless peers. © 2011 IEEE.published_or_final_versionThe 2011 IEEE Wireless Communications and Networking Conference (WCNC), Cancun, Mexico, 28-31 March 2011. In IEEE Wireless Communications and Networking Conference Proceedings, 2011, p. 2161-216
    corecore