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.
Auction mechanisms are used for allocating a resource among multiple agents with the objective to maximize social welfare. What makes auctions attractive is that they are agnostic to utility functions of agents. Auctions involve a bidding method by agents-buyers, which is then mapped by a central controller to an allocation and a payment for each agent. In autonomic networks comprising self-interested...
Recent success deployment of P2P streaming can provided hundreds of media channels of users at any given time. This evokes an interesting question can the streaming server allocate channel resources efficiently with limited capabilities? In this paper, we propose an auction-based new strategy for resources allocation. The mechanism enable streaming server can provide service according to peer's bidding...
Based on analysis of various P2P architectures, the authors in this paper integrate semantic grid with super-peer P2P architecture. First of all, the authors introduce resources searching algorithm based on semantic cluster, and analyze the educational resources sharing mechanism & service system based on super-peer P2P, especially on the model of super-peer P2P. Then the authors focus on the...
Free-riding phenomenon is overwhelming in nowadays P2P network which causes researchers to investigate and develop many approaches to combat it. However, almost all the studies neglect the role of relative contribution of peers, namely willingness of contribution (WoC) in our paper. The ignorant to the ratio of peer's actually contribution to its physical capability would undoubtedly lead to unfairly...
The available P2P streaming protocols are not compatible with each other for real-time video-on-demand (VOD) applications. As a result, they are not suitable for business usage on large-scale networks. In contrast, the BT protocol, which is a strictly-defined file sharing protocol, performs very well in data transferring and is supported by a large number of P2P file sharing systems. In this paper,...
The opportunistic computing paradigm is extremely valuable to modern technical and scientific endeavors, as it can support the demand for large and steady amounts of computing capacity. The applications of opportunistic computing environments often require independent and intensive processing over different data sets, characterizing themselves as BoT applications. Opportunistic computing systems,...
Supporting relational query processing in P2P data management systems needs multi-dimensional exact match queries processing and multi-dimensional range queries processing. The paper proposes a method for using a DHT-based P2P system to support multi-dimensional data while allowing range queries. The proposed system used a two-layered architecture, one for resource sharing and another for resource...
In P2P networks, it is effective to allocate replicas of each data item to multiple peers for improving search efficiency and data availability. It has been mathematically proved that the square-root allocation, in which the ratios of numbers of replicas are proportional to the square-root of their access frequencies, is optimal in terms of search efficiency. In this paper, we propose a replica relocation...
With the rapid development of peer-to-peer networks, simulation is considered as a useful tool to demonstrate initial ideas before building prototypes with real network transmissions. In flow-based simulation models of peer-to-peer networks, the algorithm for rate allocation which computes the per-flow rate for several competing flows at each peer in a given network topology is a fundamental component...
In recent years, BitTorrent file distribution network has been more and more widely used for media file distribution. Its build-in resource scheduling policies (local rare first, tit-for-tat, etc.) work well in file distribution in single swarm environments. However, the resource scheduling policy is missing in multiple swarms environments and the resource utilization has not been optimized. In this...
As the number of mobile users increases, and cell phones become more powerful, delivering multimedia content to them using a centralized infrastructure becomes both expensive and inadequate. Here we study an alternative solution, which leverages local dedicated caches on these devices to opportunistically fulfill other user requests, in a peer-to-peer manner. The problem we study is that of choosing...
BitTorrent, one of the most popular content distribution protocols nowadays, has an identification generation scheme that is completely autonomous. Furthermore, BitTorrent uses a random mechanism to discover new peers. This leaves the system vulnerable to a sybil attack, by which an entity associates multiple identifications to itself in an attempt to fool the other peers that execute the agreed protocol...
In this paper, we report our experience in working with network address translators (NATs). Traditionally, there were only 4 types of NATs. For each type, the (im)possibility of traversal is well-known. Recently, the NAT community has provided a deeper dissection of NAT behaviors resulting into at least 27 types and documented the (im)possibility of traversal for some types. There are, however, two...
Recently, task allocation in multi-agent systems has been investigated by many researchers. Some researchers suggested to have a central controller which has a global view about the environment to allocate tasks. Although centralized control brings convenience during task allocation processes, it also has some obvious weaknesses. Firstly, a central controller plays an important role in a multi-agent...
Layered streaming is an effective solution to address receiver heterogeneity in a peer-to-peer (P2P) network. This paper addresses the problem of rate allocation for layered video stream in p2p mesh networks. We present a distributed rate allocation algorithm that achieves close to optimal layer allocation among peers receiving the same video. We use load balancing technique that evenly distributes...
Peer-to-peer (P2P) architectures are gaining increasing popularity in disseminating content to a large number of nodes. In this paper, we show that small coalitions between peers can further enhance the performance of current P2P architectures. Small coalitions bridge the gap between inefficient non-cooperative and fully cooperative architectures by establishing a robust tradeoff between the complexity...
The following topics are dealt with: cloud computing; resource management; P2P networks; distributed storage; delay assurance; data security; wireless networks; QoS routing; TCP; and service management.
Retrieving resources which are interesting, useful, relevant, and valuable to users is always a challenge for researchers and vendors of information retrieval in a peer-to-peer (P2PIR) environment. Current research of document-based P2PIR focused mainly on the feasibility of extending IR operations and the concept of social network analysis (SNA) has been adopted as a methodology to model interrelationships...
Though plenty of research has been conducted to improve Internet P2P streaming quality perceived by end-users, little has been known about the upper bounds of achievable performance with available resources so that different designs could compare against. On the other hand, the current practice has shown increasing demand of server capacities in P2P-assisted streaming systems in order to maintain...
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.