The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
This paper proposes Peer-to-Peer (P2P) Communication to share the resources in fast manner with the help of large area communication between the nodes in the network. The big size and good stability properties of P2P files in network give rise to the use of highly effective capacity planning and topology matching techniques as a promising solution to manage P2P communications in shared area network...
Peer to Peer (P2P) computer networks rely on direct connections between participants instead of conventional centralized resources. These networks are useful for many purposes, but the killer application nowadays is file sharing. BitTorrent is a very popular protocol for this matter. In this paper, we use a multi-agent model of a BitTorrent network. In it, each BitTorrent client is an agent that interacts...
Replica is better than erasure coding when managing the redundancy of a storage system under high churn. It needs extra network communication to keep the target redundancy. By classifying the hosts into different categories of availability and placing the data replicas carefully may reduce the maintenance overhead. Considering a globe scale P2P system, the time-zoned multilayer Chord divides the hosts...
In P2P live streaming services, a video streaming data is divided into chunks and peers collect the chunks to watch the live video. Peers receive chunks from a video server or other peers, and also send chunks to other peers. Generally, a peer cannot communicate with all of other peers and a peer can communicate with only a part of peers, which is called neighbors. How to select the neighbors has...
We consider the problem of content distribution to a group of cooperative wireless peer devices that desire the same block of information. The QoS metric is that peers are all required to receive the block by a fixed deadline, with a certain target probability. The block is divided into chunks, which are received via two methods that can be used simultaneously — (i) the B2P (base-station-to-peer)...
In recent years, Peer-to-Peer (P2P) multimedia streaming has become an alternative to cable/satellite TV services. Many P2P streaming applications further provide users with DVD-like operations: play, pause, chapter selection, fast-forward, and rewind. Such a real-time interactive multimedia streaming is commonly referred to as the P2P Video-on-Demand (VoD). To further improve the streaming quality,...
We present Band Codes (BC), a novel class of rate less codes that makes possible to control the computational complexity of Network Coding (NC). NC increases throughput of the networks via packet recombinations at the network nodes. In a NC scenario based on rate less codes, the recombinations at the nodes alter the packet degree distribution selected at the source and increase the computational complexity...
Recent work in defending against pollution attacks for intra-flow network coding systems proposed a null spaces based algebraic approach which has a smaller computation cost than previous pollution defenses. The approach requires the source to distribute keys periodically, but in order to scale involves forwarder nodes in the creation of new keys and their distribution. As a result the key distribution...
In this paper we propose a new hybrid architecture between client/server and P2P network architectures in order to provide better service quality to the end-user. To distribute and protect the content, we use a discrete geometry tool as the Finite Radon Transform (FRT) in a Maximum Distance Separable (MDS) fashion. The presented results clarify the interest of the proposed architecture in terms of...
Distributed storage systems frequently use erasure coding based redundancy or replication to improve availability. Traditional erasure coding based approaches to redundancy are optimal in terms of their storage overhead-reliability tradeoff, but are expensive to repair. In this paper, we propose Proactive Repair (PR), a novel hybrid redundancy scheme. We discuss the implementation of the proposed...
Multiple Description Coding (MDC) and Peer-to-Peer transmission protocols prove to be extremely effective in the transmission of multimedia contents for both their robustness and flexibility. As a matter of fact, they permit building efficient architectures for the transmission of three-dimensional video signals. The paper presents an MDC strategy for the transmission of 3D video signals consisting...
Three stakeholders come into play in peer-to-peer (P2P) video-on-demand (VoD), namely peers/viewers, content providers and ISPs. Different design choices have been proposed to improve quality of user experience, to bring down content server bandwidth cost and to reduce ISP-unfriendly traffic. However, it is unclear whether the ability of these design choices to meet interests of one stakeholder comes...
Distributed storage systems (DSS) play an important role in data storage applications, since they provide high reliability for huge data storage requirement. As node failures are frequent in a large distributed storage system, the performance of repairing node failure causes many researchers' interests. In this paper, we propose a distributed storage code to minimize the coding complexity during the...
We propose a new architecture for broadcasting an enormous amount of information over a large population of users in a typical urban area via multiple base stations for delay tolerant applications. The core idea is that each base station partially broadcasts the information instead of transmitting the whole information. In particular, the large target file is broken into M smaller chunks and is provided...
With the rising penetration of smartphones in the consumer market, mobile multimedia content is becoming the dominant form of information that people produce and consume on a daily basis. In this paper we present a wireless multi-hop video streaming application for mobile phones with the Android operating system. This application allows to share live information captured by mobile phone sensors (e...
Network coding (NC) can achieve the maximum information flow in the network by allowing nodes to combine received packets before retransmission. Several papers have shown NC to be beneficial in mobile ad-hoc networks, but the delay introduced by buffered decoding raises a problem in real-time streaming applications. Here we propose to use NC jointly with multiple description coding (MDC) to allow...
This paper discusses a way to communicate without relying on fixed infrastructure at some central hub. This can be useful for bootstrapping loosely connected peer-to-peer systems, as well as for circumventing egregious policy-based blocking (e.g., for censorship purposes). Our techniques leverage the caching and aging properties of DNS records to create a covert channel of sorts that can be used to...
Content distribution system can transmit large files rapidly between multiple users, and it has become the most widely used in internet. As a novel technology in communications, network coding technology has received widespread attention in academia. How to use network coding technology in P2P content distribution system is the hot focus of study. This paper propose a network coding algorithm based...
Some of P2P live streaming service encourage sending chunks of peers by changing quality of the video. In this case, peers connect each other and call each other as neighbors. However, the existing neighbor selection method has an issue. If peers that have high capacity for sending chunks has only low capacity peers as neighbor, the peer receives worse video quality than the peer might receive. We...
The emergence of mobile P2P systems is largely due to the evolution of mobile devices into powerful information processing units. The relatively structured context that results from the mapping of mobile patterns of behaviour onto P2P models is however constrained by the vulnerabilities of P2P networks and the inherent limitations of mobile devices. Whilst the implementation of P2P models gives rise...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.