HASH-BASED OVERLAY PARTITIONING IN UNSTRUCTURED PEER-TO-PEER SYSTEMS

2009 ◽  
Vol 19 (01) ◽  
pp. 57-71
Author(s):  
HARRIS PAPADAKIS ◽  
PARASKEVI FRAGOPOULOU ◽  
EVANGELOS P. MARKATOS ◽  
MARIOS D. DIKAIAKOS ◽  
ALEXANDROS LABRINIDIS

Unstructured peer-to-peer (P2P) networks suffer from the increased volume of traffic produced by flooding. Methods such as random walks or dynamic querying managed to limit the traffic at the cost of reduced network coverage. In this paper, we propose a partitioning method of the unstructured overlay network into a relative small number of distinct subnetworks. The partitioning is driven by the categorization of keywords based on a uniform hash function. The method proposed in this paper is easy to implement and results in significant benefit for the blind flood method. Each search is restricted to a certain partition of the initial overlay network and as a result it is much more targeted. Last but not least, the search accuracy is not sacrificed to the least since all related content is searched. The benefit of the proposed method is demonstrated with extensive simulation results, which show that the overhead for the implementation and maintenance of this system is minimal compared to the resulted benefit in traffic reduction.

2011 ◽  
Vol 211-212 ◽  
pp. 295-299 ◽  
Author(s):  
Ya Dong Gong ◽  
He Ping Deng ◽  
Zhan Ran Gu ◽  
Ji Ye Hu ◽  
Yong Xiang Wen

In peer-to-peer (P2P) networks, nodes are quite different from each other in many aspects, such as sharing resources, online time and bandwidth. Some approaches have been introduced to take advantage of the query forwarding and answering heterogeneity such that the high bandwidth and query answering capability of nodes can be fully utilized to improve the system performance. In this paper, we suggest using the online time heterogeneity to improve the search efficiency of P2P networks. In our proposed Differentiated Index (Diff-Index) algorithm, the nodes with long online time will have higher priority to be queried. Because the online time is quite different among nodes, much search traffic can be saved by querying only a small portion of a network. The query success rate can be kept high because the nodes sharing a great amount of resources tend to have long online time. Our simulation results show that the Diff-Index algorithm can save 66 percent of search traffic.


2003 ◽  
Vol 13 (04) ◽  
pp. 643-657 ◽  
Author(s):  
L. GARCÉS-ERICE ◽  
E. W. BIERSACK ◽  
K. W. ROSS ◽  
P. A. FELBER ◽  
G. URVOY-KELLER

Structured peer-to-peer (P2P) lookup services organize peers into a flat overlay network and offer distributed hash table (DHT) functionality. Data is associated with keys and each peer is responsible for a subset of the keys. In hierarchical DHTs, peers are organized into groups, and each group has its autonomous intra-group overlay network and lookup service. Groups are organized in a top-level overlay network. To find a peer that is responsible for a key, the top-level overlay first determines the group responsible for the key; the responsible group then uses its intra-group overlay to determine the specific peer that is responsible for the key. We provide a general framework for hierarchical DHTs with scalable overlay management. We specifically study a two-tier hierarchy that uses Chord for the top level. Our analysis shows that by using the most reliable peers in the top level, the hierarchical design significantly reduces the expected number of hops. We also present a method to construct hierarchical DHTs that map well to the Internet topology and achieve short intra-group communication delay. The results demonstrate the feasibility of locality-based peer groups, which allow P2P systems to take full advantage of the hierarchical design.


2010 ◽  
Vol 439-440 ◽  
pp. 870-874 ◽  
Author(s):  
Ming Zhang ◽  
Jin Qiu Yang

Structured peer-to-peer (P2P) systems are creating a large proportion of network traffic in today’s Internet. Peer-to-peer systems enable access to data spread over an extremely large number of machines. A P2P system typically involves thousands or millions of live peers in the network. Multi-dimensional data indexing has received much attention in a centralized database. In this paper, we propose and evaluate a multi-dimensional searching scheme in structured P2P networks. We present the design and implementation of a peer-to-peer index service for high dimensional data that is capable of handling complex queries. We design a VibIndex scheme in structured P2P overlay networks. We analyze this scheme’s performance and present simulation results. Our simulation results demonstrated the benefits of the proposed system and show that the approach is able to search efficiently.


2019 ◽  
Vol 19 (04) ◽  
pp. 1950010
Author(s):  
SATOSHI FUJITA

This paper considers the problem of improving the routing performance of hierarchical Delaunay networks. Delaunay network is a network topology for peer-to-peer systems based on the Delaunay triangulation of a set of points associated with a set of peers. It is known that Delaunay networks have a favorable property as a topology for peer-to-peer systems such that a greedy routing scheme always delivers a given message to its destination without encountering a dead-end. The key idea used in the proposed method is to apply a hash function to the address of participant peers. More concretely, by applying a hash function to the coordinate point of the peers and by associating several points to each peer, we could realize an overlay so that the number of hops to the destination in the original network could be significantly reduced.


2011 ◽  
pp. 66-78
Author(s):  
Dinesh C. Verma

This chapter describes a peer-to-peer approach for managing data backup and recovery in an enterprise environment. Data management systems in enterprises constitute a significant portion of the total cost of management of data in enterprise systems. Maintaining data with a high degree of availability and reliability is typically done by having a centralized backup system that maintains backup copies of data. The maintenance of a large dedicated backup server for data management requires a highly scalable network and storage infrastructure, leading to a major expense center within the enterprise. With the current trends in workstation disk storage, an alternative peer-to-peer paradigm for data management can offer an approach that provides equivalent performance at a fraction of the cost of the centralized backup system. The author hopes that the contents of the chapter would lead to the development of more solutions that harness the power of peer-to-peer networks.


2016 ◽  
Author(s):  
Mark Lemley

Suing actual infringers is passe in copyright law. In the digitalenvironment, the real stakes lie in suing those who facilitate infringementby others. There is of course a good reason copyright owners are filingsuch suits. They see themselves as under threat from a flood of cheap, easycopies and a dramatic increase in the number of people who can make thosecopies. The high volume of illegal uses, and the low return to suing anyindividual, make it more cost-effective to aim as far up the chain aspossible. From the perspective of the movie industry, it's easier and moreeffective to shut down Napster than to sue the millions of people whotraded files illegally on Napster. So far, the courts have been willing togo along, shutting down a number of innovative services in the digitalmusic realm.In this article, we argue that unrestricted liability for anyone who is inany way involved with copyright infringement is a bad idea. Indirectliability is a continuum, in which acts most closely related toinfringement and with the fewest affirmative benefits are the easiest tocondemn. Going after makers of technology for the uses to which theirtechnologies may be put threatens to stifle innovation. The fundamentaldifficulty is that while courts can make decisions about directinfringement on a case-by-case basis, lawsuits based on indirect liabilitynecessarily sweep together both socially beneficial and socially harmfuluses of a program or service, either permitting both uses or condemningboth.Optimal digital copyright policy would do two things: stop deterringinnovators, and permit cost-effective enforcement of copyright in thedigital environment. In this paper, we suggest at least two possiblealternatives that might provide ways out of the digital copyright morass.Both alternatives stem from the basic economics of copyright enforcement.It is not currently cost-effective for copyright owners to sue individualinfringers, because there are tens of millions of them, because lawsuitsare expensive, and because each infringer would be liable only for minimaldamages. They are happy to sue facilitators instead, because there arefewer of them and both damages and the benefits of injunctive relief aresubstantial. Copyright owners have no incentive to permit optimalinnovation by facilitators, because they do not benefit from thatinnovation except indirectly. Individual infringers in turn have noincentive to change their behavior or to subscribe to fee-based services,because they suffer none of the costs of infringement.One solution is to change the incentives of individuals. Because individualusers of peer-to-peer (p2p) networks know that it is extremely unlikelythey will be sued, economic theory suggests that the only way toeffectively deter infringement is to increase the effective sanctionsubstantially for those who are caught. Were the government to begincriminally prosecuting selected users of peer-to-peer services - or werethe RIAA to sue end users in earnest - it could have a substantialdeterrent effect on many illegal users. Selective prosecution has otheradvantages as well - the government could target the relatively fewkeystone providers of illegal files on p2p sites, and those are preciselythe users who are least likely to be engaged in fair use. While particularprosecutions won't stop illegal file trading altogether, copyright ownershave never been able to prevent all piracy. All they need to do is reducepiracy enough that they can make a return on their investment.Another solution is to change the incentives of copyright owners to sueindividual infringers by reducing the cost of such a suit. One suchapproach would be a levy system. Levies on equipment or services have thevirtue of permitting automatic collection of royalties, reducing theenforcement cost dramatically, but at the cost of taxing legal as well asillegal uses. A levy solves the enforcement problem at the front end, butit is similar in many ways to the current approach of suing facilitators.The main difference is that under a levy system the copyright owner isprotected by a compulsory license rather than a property rule.An alternative proposal to reduce the cost of enforcement is to create somesort of quick, cheap arbitration system that enables copyright owners toget some limited relief against abusers of p2p systems. The existing domainname trademark arbitration system is a model in some respects - its speedand low cost - but a cautionary tale in others - its lack of processprotections. Such a system would permit low-cost enforcement of copyrightinfringement against direct infringers, reducing the need for contentowners to sue facilitators. Relative to levies, an arbitration system wouldtrade off some increase in cost for accuracy, targeting only those makingillegal uses rather than all users of computers or p2p networks. It wouldbe fairer than selective criminal prosecution, because the burden wouldfall more evenly on each wrongdoer, rather than imposing stark punishmenton a few in order to serve society's interest in deterring the rest. Thesystem could also be designed to improve accuracy relative to the binarychoice the courts face in indirect infringement cases today. We coulddesign the system so that it is limited to clear cases. We could also buildin a defense for arguable fair uses, so that a user who could prove theywere space-shifting CDs they already own would have a defense.


Sign in / Sign up

Export Citation Format

Share Document