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.
One of the most challenging problems in P2P computing is the difficulty of locating content in an efficient and scalable way. The structured P2P overlay is unsuitable for dynamic environments because users come from non-cooperating organizations with highly dynamic joining and leaving. Unstructured systems are designed more specifically for the heterogeneous Internet environment, where the nodespsila...
With the maturity of mobile application environment and the popularity of Bluetooth device, researchers focus on data transmission in Bluetooth mobile Peer-to-Peer (MP2P) network. However, QoS of data transmission becomes poor in Bluetooth mobile P2P network because of the limit communicating rate and the mobility of user. In this paper, we propose a novel cross-layer design mechanism, which controls...
P2P topology design is a hot topic because it is very important for solving the problems such as deficiency in scalability and effectivity of unstructured P2P overlays. A good topology can greatly improve the performance of search algorithm. The paper proposes a self-adaptive Super-node Overlay Based on Information Exchange called SOBIE. The super-node selection in the SOBIE is different from the...
As there are many malicious nodes spreading false information in P2P networks, it is of great importance to build a sound mechanism of trust in the P2P environments. To avoid the shortage of the existing trust model, this paper provides a Trust Path-Searching Algorithm based on PSO. In this algorithm, after initializing the particle swarm, each particle can update its speed and location according...
Locating content in an efficient and scalable way without centralized control is one of the challenges within P2P computing. The paper presents an unstructured P2P overlay called Maya pyramid overlay (MPO) where update and backup only take place in two neighboring levels or layers, differing from the recursive method in traditional hierarchical P2P tree-like structure overlay. Unlike normal redundant...
To improve the insufficiency of super-peer overlay network, an efficient, robust and expansible searching model, SSP2P, is put forward. The peers were organized into varied area autonomy system (AAS) according to their physical topology. Owing to heterogeneity, the peer with highest capability was selected as super-peer in each AAS. And super-peers were formed into many super-peer semantic overlay...
Query-by-keywords is the most popular manner to search for data in this computing age. However, most work was proposed for searching centralized relational databases. This paper investigates how keyword search is to be deployed in relational database-enabled peer-to-peer systems. Unlike centralized system, the key challenges in this new computing paradigm come from the autonomy of peers, the lack...
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.