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 introduces a Combinatory Optimization Problem (COP) which captures the performance in cooperation of a P2P Streaming Network, considered at the buffer level. A new family of strategies of cooperation is defined, which represents the order of query of pieces in a communication between peers. We define a measure of quality for each strategy, based on the most shocking video streaming parameters,...
This work proposes a new piece selection strategy for improving latency and continuity in a P2P streaming network. Different piece selection strategies based on a simple and symmetrical model for sharing are considered. It is well known the scalability properties of rarest first and low values of latency of greedy. In this work these techniques have been revised, and a new family of strategies is...
In this paper, we present an algorithm based on the GRASP meta-heuristic for solving a dynamic assignment problem in a P2P network designed for sending real-time video over the Internet. In a highly dynamic P2P topology, the frequent connections and disconnections of nodes are the main obstacle we face when trying to offer a high quality-of-experience (QoE) to clients. We first introduce the P2P network...
We consider the design of a P2P network for the distribution of real-time video streams through the Internet. We follow a multi-source approach where the stream is decomposed into several flows sent by different peers to each client. The goal is to resist to the frequent moves of the peers entering and leaving the network. We analyze our approach using the recently proposed PSQA technology which allows...
This work proposes a novel utilization of instant messaging (IM) services as an ubiquitous network layer for protocol encapsulation and transmission. As more than 70% of organizations and almost all home users do not block IM traffic, this work evidences a latent vulnerability of the technology that can be exploited. A working prototype was implemented using open source software. The prototype combines...
One of the fundamental decisions in content networks is how the information about the existing contents is deployed and accessed. In particular, in many content network architectures, there are access nodes which cache information about the contents location, in order to ensure a quick answer to queries formulated from the peer nodes. In this work we present a simplified model of the costs and restrictions...
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.