Loading...
Search for:
p2p-overlays
0.008 seconds
A mathematical foundation for topology awareness of P2P overlay networks
, Article 4th International Conference on Grid and Cooperative Computing - GCC 2005, Beijing, 30 November 2005 through 3 December 2005 ; Volume 3795 LNCS , 2005 , Pages 906-918 ; 03029743 (ISSN); 3540305106 (ISBN); 9783540305101 (ISBN) ; Habibi, J ; Sharif University of Technology
2005
Abstract
In peer-to-peer (P2P) overlay networks, the mechanism of a peer randomly joining and leaving a network, causes a topology mismatch between the overlay and the underlying physical topology. This causes a large volume of redundant traffic in the underlying physical network as well as an extra delay in message delivery in the overlay network. Topology mismatch occurs because overlay networks are not aware of their underlying physical networks. In this paper we present a mathematical model for topology awareness of overlay networks (degree of matching between an overlay and its underlying physical network) and the efficiency of message delivery on them. We also after determining the...
SLoPCloud: an efficient solution for locality problem in peer-to-peer cloud systems
, Article Algorithms ; Volume 11, Issue 10 , 2018 ; 19994893 (ISSN) ; Malekimajd, M ; Movaghar, A ; Sharif University of Technology
Abstract
Peer-to-Peer (P2P) cloud systems are becoming more popular due to the high computational capability, scalability, reliability, and efficient data sharing. However, sending and receiving a massive amount of data causes huge network traffic leading to significant communication delays. In P2P systems, a considerable amount of the mentioned traffic and delay is owing to the mismatch between the physical layer and the overlay layer, which is referred to as locality problem. To achieve higher performance and consequently resilience to failures, each peer has to make connections to geographically closer peers. To the best of our knowledge, locality problem is not considered in any well known P2P...
Semantic partitioning of peer-to-peer search space
, Article Computer Communications ; Volume 32, Issue 4 , 2009 , Pages 619-633 ; 01403664 (ISSN) ; Habibi, J ; Livani, E ; Sharif University of Technology
2009
Abstract
Peer-to-peer (P2P) networks are beginning to form the infrastructure of future applications. Computers are organized in P2P overlay networks to facilitate search queries with reasonable cost. So, scalability is a major aim in design of P2P networks. In this paper, to obtain a high factor of scalability, we partition network search space using a consistent static shared upper ontology. We name our approach semantic partition tree (SPT). All resources and queries are annotated using the upper ontology and queries are semantically routed in the overlay network. Also, each node indexes addresses of other nodes that possess contents expressible by the concept it maintains. So, our approach can be...