Peer to peer file sharing using network coding

Structured peer-to-peer overlay networks provide a solution for the construction of large scale, decentralized applications, including distributed storage, group communication, and content distribution. These overlays are highly flexible; they can route messages correctly even when a large numbers of the nodes crash. Network coding is beneficial technique to improve peer to peer file sharing networks. Our idea is to split the file to be distributed in fixed length blocks, later each block would be encoded and routed independently in the peer to peer network overlay. The overlay networks create a virtual topology on top of the physical topology. Because overlay networks define neighbor nodes by content stored, they can change search from a standard graph-traversal problem into a localized iterative process. Network coding can improve throughput, robustness, complexity, and security. P2P File sharing network are secure as compared to centralized file sharing as there no need to upload the files on the third party server. In network coding each peer is computational node so it can perform encoding and decoding operation rather than simply storing and forwarding. Networks such as Gnutella organize nodes independently of the underlying physical topology; “neighbors” might exist within the same sub network or across the Internet, they are classified as unstructured P2P networks. Our scheme focuses on constructing peer to peer network overlay and improves routing with the help of intermediate nodes. The routing scheme is dynamic and decided by central server. The server constructs graph, finds out best path for routing. Each peer follows server guidelines for routing and participates in peer to peer network.