Peer-to-peer (P2P) networking is a distributed architecture that partitions tasks or data between peer nodes. In this paper, an efficient Hypercube Sequential Matrix Partition (HS-MP) for efficient data sharing in P2P...Peer-to-peer (P2P) networking is a distributed architecture that partitions tasks or data between peer nodes. In this paper, an efficient Hypercube Sequential Matrix Partition (HS-MP) for efficient data sharing in P2P Networks using tokenizer method is proposed to resolve the problems of the larger P2P networks. The availability of data is first measured by the tokenizer using Dynamic Hypercube Organization. By applying Dynamic Hypercube Organization, that efficiently coordinates and assists the peers in P2P network ensuring data availability at many locations. Each data in peer is then assigned with valid ID by the tokenizer using Sequential Self-Organizing (SSO) ID generation model. This ensures data sharing with other nodes in large P2P network at minimum time interval which is obtained through proximity of data availability. To validate the framework HS-MP, the performance is evaluated using traffic traces collected from data sharing applications. Simulations conducting using Network simulator-2 show that the proposed framework outperforms the conventional streaming models. The performance of the proposed system is analyzed using energy consumption, average latency and average data availability rate with respect to the number of peer nodes, data size, amount of data shared and execution time. The proposed method reduces the energy consumption 43.35% to transpose traffic, 35.29% to bitrev traffic and 25% to bitcomp traffic patterns.展开更多
Peer-to-peer(P2P) swarm technologies have been shown to be very efficient for large scale content distribution systems, such as the well-known BitTorrent and eMule applications.However, these systems have been designe...Peer-to-peer(P2P) swarm technologies have been shown to be very efficient for large scale content distribution systems, such as the well-known BitTorrent and eMule applications.However, these systems have been designed for generic file sharing with little consideration of media streaming support, and the user cannot start a movie playback before it is completely downloaded.The playing-as-downloading capability would be particularly useful for a downloading peer to evaluate if a movie is valuable to be downloaded, and it could also help the P2P content distribution system to locate and eliminate the polluted contents.In this paper we address this issue by introducing a new algorithm, wish driven chunk distribution(WDCD), which enables the P2P file sharing system to support the video-on-demand(VOD) function while keeping the P2P native downloading speed.A new parameter named next-play-frequency is added to the content chunk to strike a replication balance between downloading and streaming requests.We modify the eMule as the test bed by adding the WDCD algorithm and then verify the prototype implementation by experiments.The experimental results show that the proposed algorithm can keep the high downloading throughput performance of the eMule system with a good playing-as-downloading function.展开更多
文摘Peer-to-peer (P2P) networking is a distributed architecture that partitions tasks or data between peer nodes. In this paper, an efficient Hypercube Sequential Matrix Partition (HS-MP) for efficient data sharing in P2P Networks using tokenizer method is proposed to resolve the problems of the larger P2P networks. The availability of data is first measured by the tokenizer using Dynamic Hypercube Organization. By applying Dynamic Hypercube Organization, that efficiently coordinates and assists the peers in P2P network ensuring data availability at many locations. Each data in peer is then assigned with valid ID by the tokenizer using Sequential Self-Organizing (SSO) ID generation model. This ensures data sharing with other nodes in large P2P network at minimum time interval which is obtained through proximity of data availability. To validate the framework HS-MP, the performance is evaluated using traffic traces collected from data sharing applications. Simulations conducting using Network simulator-2 show that the proposed framework outperforms the conventional streaming models. The performance of the proposed system is analyzed using energy consumption, average latency and average data availability rate with respect to the number of peer nodes, data size, amount of data shared and execution time. The proposed method reduces the energy consumption 43.35% to transpose traffic, 35.29% to bitrev traffic and 25% to bitcomp traffic patterns.
基金Project (No. 2005C11001-02) supported by the Science and Technology Plan of Zhejiang Province, China
文摘Peer-to-peer(P2P) swarm technologies have been shown to be very efficient for large scale content distribution systems, such as the well-known BitTorrent and eMule applications.However, these systems have been designed for generic file sharing with little consideration of media streaming support, and the user cannot start a movie playback before it is completely downloaded.The playing-as-downloading capability would be particularly useful for a downloading peer to evaluate if a movie is valuable to be downloaded, and it could also help the P2P content distribution system to locate and eliminate the polluted contents.In this paper we address this issue by introducing a new algorithm, wish driven chunk distribution(WDCD), which enables the P2P file sharing system to support the video-on-demand(VOD) function while keeping the P2P native downloading speed.A new parameter named next-play-frequency is added to the content chunk to strike a replication balance between downloading and streaming requests.We modify the eMule as the test bed by adding the WDCD algorithm and then verify the prototype implementation by experiments.The experimental results show that the proposed algorithm can keep the high downloading throughput performance of the eMule system with a good playing-as-downloading function.
