SearcharxivSearch

arXiv subjects

P Ganeshkumar

Publications and source records attributed to P Ganeshkumar.

2 recordsLinked to original sources

An Efficient QOS Based Multimedia Content Distribution Mechanism in P2P Network

Peer-to-peer network is one in which each node in the network can act as a client or server for the other nodes in the network. It allows shared access to various resources such as files, peripherals, and sensors without the need for a central server. Content distribution in the P2P network from server is done by multicasting. Multicasting is the process of sending the data to the multiple designations. This technology is highly efficient for the large scale multimedia content delivery in P2P network where the end peer have identical set of system components. But in reality, the peers have heterogeneous set of requirements for different service levels as well as different service components. The ability to provide differentiated services to each peer with widely varying requirements is becoming important. We need to provide differentiated Services above the existing shared network infrastructure. The solution proposed to solve the above said problem is to provide individualized service to each peer. It focuses on constructing and maintaining an efficient multiple overlay multicast tree structure in the P2P network. The tree maintenance process is governed by two mechanisms called as dynamic reconfiguration driven by peer and less frequent tree maintenance by network status change observation. In this paper new scalable architecture is constructed and analysed based on the above strategies.

cs.MA

An Efficient Framework for Network Code based Multimedia Content Distribution in a Hybrid P2P Network

Most of the existing P2P content distribution schemes implement a random or rarest piece first dissemination procedure to avoid duplicate transmission of the same pieces of data and rare pieces of data occurring in the network. This problem can be solved using peer-to-peer content distribution based on network coding scheme. Network coding scheme uses random linear combination of coded pieces. Hence the above stated problem can be solved ease and simple. Our proposed mechanism uses network coding mechanism in which several contents of same message is grouped into different group and coding operation is performed only within the same group. The interested peers are also divided into several groups with each group have the responsibility to spread one set of contents of some message. The coding system is designed to assure the property that any subset of the messages can be utilized to decode the original content as long as the size of the subset is suitably large. To meet this condition, dynamic smart network coding scheme is defined which assures the preferred property, then peers are connected in the same group to send the corresponding message, and connect peers in different groups to disseminate messages for carrying out decoding operation. Moreover, the proposed system can be readily expanded to support topology change to get better system performance further in terms of reliability, link stress and throughput. The simulation results prove that the proposed system can attain 20 to 25% higher throughput than existing systems, it also further attains good reliability, link failure and robustness to peer churn.

cs.NI