A server-mediated peer-to-peer system

Kwok, Sai Ho; Chan, Kin-Ching; Cheung, Muller Y. M.

doi:10.1145/1120680.1120686

Cited by 12 publications

(9 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Therefore, communication overhead and scalability are the main problems in this approach. These problems have been proven in a number of papers [2,7,8] . In the random Breadth-First-Search (BFS) approach [9,10] , each peer forwards a search message to only a fraction of its peers.…”

Section: Related Workmentioning

confidence: 94%

Selective Flooding Based on Relevant Nearest-Neighbor using Query Feedback and Similarity across Unstructured Peer-to-Peer Networks

Ishak¹

2009

Journal of Computer Science

View full text Add to dashboard Cite

Problem statement: Efficient searching is a fundamental problem for unstructured peer to peer networks. Flooding requires a lot of resources in the network and thus will increase the search cost. Searching approach that utilizes minimum network resources is required to produce efficient searching in the robust and dynamic peer-to-peer network. Approach: This study addressed the need for efficient flood-based searching in unstructured peer-to-peer network by considering the content of query and only selecting peers that were most related to the query given. We used minimum information to perform efficient peer selection by utilizing the past queries data and the query message. We exploited the nearest-neighbor concept on our query similarity and query hits space metrics for selecting the most relevant peers for efficient searching. Results: As demonstrated by extensive simulations, our searching scheme achieved better retrieval and low messages consumption. Conclusion: This study suggested that, in an unstructured peer-to-peer network, flooding that was based on the selection of relevant peers, can improve searching efficiency.

show abstract

Section: Related Workmentioning

confidence: 94%

Selective Flooding Based on Relevant Nearest-Neighbor using Query Feedback and Similarity across Unstructured Peer-to-Peer Networks

Ishak¹

2009

Journal of Computer Science

View full text Add to dashboard Cite

show abstract

“…The resource sharing model in P2P systems is either pure or hybrid. In a pure model, there is no centralized server [25,26]. In a data-sharing pure P2P system, all nodes are equal and no functionality is centralized.…”

Section: Related Workmentioning

confidence: 99%

“…Pure P2P networks have become quite unpopular though because they generate a lot of traffic to keep the network up and running [10,27]. These systems are faced with critical problems such as: (1) limited search scope, (2) dynamic nature of peers, and (3) lack of collaboration among peers [26].…”

Section: Related Workmentioning

confidence: 99%

“…After that, the P2P communication is performed. Examples of the hybrid model include Napster, Groove, Magi, and iMesh [2,26]. In the hybrid model, some nodes like global central server nodes have special functionality and can optimize the connections much better than it is done in other resource sharing models.…”

Section: Related Workmentioning

confidence: 99%

“…When the nodes start searching, they first search for the files in the file index kept by the super peer. If results are found, they are returned to the nodes at once, so the search performance is better than that of the flooding algorithm [26].…”

Section: Related Workmentioning

confidence: 99%

See 2 more Smart Citations

A dynamic framework for integrated management of all types of resources in P2P systems

2009

View full text Add to dashboard Cite

Traditional Peer-to-Peer (P2P) systems were restricted to sharing of files on the Internet. Although some of the more recent P2P distributed systems have tried to support transparent sharing of other types of resources, like computer processing power, but none allow and support sharing of all types of resources available on the Internet. This is mainly because the resource management part of P2P systems are custom designed in support of specific features of only one type of resource, making simultaneous access to all types of resources impractical. Another shortcoming of existing P2P systems is that they follow a client/server model of resource sharing that makes them structurally constrained and dependent on dedicated servers (resource managers). Clients must get permission from a limited number of servers to share or access resources, and resource management mechanisms run on these servers. Because resource management by servers is not dynamically reconfigurable, such P2P systems are not scalable to the ever growing extent of Internet. We present an integrated framework for sharing of all types of resources in P2P systems by using a dynamic structure for managing four basic types of resources, namely process, file, memory, and I/O, in the same way they are routinely managed by operating systems. The proposed framework allows P2P systems to use dynamically reconfigurable resource management mechanisms where each machine in the P2P system can at the same time serve both as a server and as a client. The pattern of requests for shared resources at a given time identifies which machines are currently servers and which ones are currently clients. The client server pattern changes with changes in the pattern of requests for distributed resources. Scalable P2P systems with dynamically M. Sharifi ( ) · 150 M. Sharifi et al.reconfigurable structures can thus be built using our proposed resource management mechanisms. This dynamic structure also allows for the interoperability of different P2P systems.

show abstract

A Trustworthy ID Management Mechanism in Open Market

Jeun

Won

2010

Information Security, Practice and Experience

View full text Add to dashboard Cite

A server-mediated peer-to-peer system

Cited by 12 publications

References 15 publications

Selective Flooding Based on Relevant Nearest-Neighbor using Query Feedback and Similarity across Unstructured Peer-to-Peer Networks

Selective Flooding Based on Relevant Nearest-Neighbor using Query Feedback and Similarity across Unstructured Peer-to-Peer Networks

A dynamic framework for integrated management of all types of resources in P2P systems

A Trustworthy ID Management Mechanism in Open Market

Contact Info

Product

Resources

About