查看文章

Both Academics and industry experts in computer networking are showing a growing interest in peer-to-peer (P2P) networking. In recent years, researchers have attempted to use decentralized peer-to-peer networks to deliver Live Streaming (LS) & Video-on-Demand (VoD). Most of these studies have centered on the properties of the overlaying graph (P2P overlay) that connects the set of interested peers and on the creation of distributed P2P blocks scheduling algorithms for content transfer among the participating peers. Both excessive network traffic and unpredictable delay are significant issues for unstructured p2p systems. Flooding and dynamic query, two of the most used search methods in decentralized p2p networks, are ineffective in dealing with these issues because they lack a heuristic. Existing congestion control designs are not well suited for P2P live streaming traffic, and there has been a paucity of study on the network congestion of these systems. In this work we are proposing an efficient load balancing scheme called Routing Algorithm for Covering Dynamic Time to avoid congestion control for transmitting large amount of data in unstructured Peer-to-peer networks. We are evaluating the proposed efficient Load Balancing mechanismin terms of load distribution rate with virtual servers & performance rate and proved that our proposed scheme works efficiently when compared to existing load balancing schemes.