Filters








2,089 Hits in 4.5 sec

Efficient Broadcast in Structured P2P Networks [chapter]

Sameh El-Ansary, Luc Onana Alima, Per Brand, Seif Haridi
2003 Lecture Notes in Computer Science  
In this position paper, we present an efficient algorithm for performing a broadcast operation with minimal cost in structured DHT-based P2P networks.  ...  In a system of N nodes, a broadcast message originating at an arbitrary node reaches all other nodes after exactly N −1 messages.  ...  Given an overlay network constructed by a P2P DHT system, find an efficient algorithm for broadcasting messages.  ... 
doi:10.1007/978-3-540-45172-3_28 fatcat:6vdus2qat5a4tomgrsgo4ol2me

Ontology-Based Clustering and Routing in Peer-to-Peer Networks

Juan Li, Son Vuong
2005 Sixth International Conference on Parallel and Distributed Computing Applications and Technologies (PDCAT'05)  
This architecture helps reduce the search time and decrease the network traffic by minimizing the number of messages propagated in the system.  ...  Specifically, a distributed hash table (DHT) based overlay is constructed to assist peers organizing into communities. Those peers in the same community form a Gnutella-like unstructured overlay.  ...  Flooding is the predominant search technique in unstructured networks. This method, though simple, does not scale well in terms of message overhead.  ... 
doi:10.1109/pdcat.2005.178 dblp:conf/pdcat/LiV05 fatcat:aslz7635cvf5xm27tsusbw2xvy

Building Multicast Trees in Ad-hoc Networks

Raphaël Kummer, Peter Kropf, Pascal Felber
2008 Proceedings of the 2nd International ICST Conference on Autonomic Computing and Communication Systems  
Because relaying messages consumes scarce CPU cycles and energy, one must minimize the number of nodes that act as relays.  ...  A basic, unstructured approach consists in flooding the network with data. Alas, this method highly overloads the network and makes only inefficient use of the (limited) re-  ...  This research was partially supported by the Swiss National Science Foundation under grant number 5005-67322 (NCCR-MICS) and by the MiNEMA Research Network.  ... 
doi:10.4108/icst.autonomics2008.4648 dblp:conf/autonomics/KummerKF08 fatcat:td6a65pqgrhdvmyaalk5qkenqy

Considering complex search techniques in DHTs under churn

Jamie Furness, Mario Kolberg
2011 2011 IEEE Consumer Communications and Networking Conference (CCNC)  
This allows every node in the network to process the query locally, and hence is as powerful and flexible as flooding in unstructured networks, but without the inefficiency of redundant messages.  ...  Traditionally complex queries have been performed over unstructured P2P networks by means of flooding, which is inherently inefficient due to the large number of redundant messages generated.  ...  It is found that churn has a fairly low impact on flooding, though a high impact on random-walk.  ... 
doi:10.1109/ccnc.2011.5766542 dblp:conf/ccnc/FurnessK11 fatcat:wrnt6f3kafgztakcdt5cxqklue

A flexible and robust lookup algorithm for P2P systems

Mauro Andreolini, Riccardo Lancellotti
2009 2009 IEEE International Symposium on Parallel & Distributed Processing  
DHT) provide a very efficient lookup mechanism, but lacks flexibility.  ...  Flood-based P2P networks provide flexible lookup facilities and robust performance at the expense of high overhead, while other systems (e.g.  ...  An efficient resource lookup has the minimum impact on the underlying physical network.  ... 
doi:10.1109/ipdps.2009.5160900 dblp:conf/ipps/AndreoliniL09 fatcat:bu3lycrrn5ca7aqboartkwpbku

A Novel Locality Algorithm and Peer-to-Peer Communication Infrastructure for Optimizing Network Performance in Smart Microgrids

2017 Energies  
Experimental results will show that the proposed techniques meet the network requirements of smart microgrids, even with a large number of nodes on stream.  ...  , and they can route messages even when a large number of nodes are frequently entering or leaving the network.  ...  Flooding architectures have not been considered because they are not based on the chosen DHT protocol.  ... 
doi:10.3390/en10091275 fatcat:3iajwlxapbampkgunhzxhrddky

Optimally Efficient Multicast in Structured Peer-to-Peer Networks

Dirk Bradler, Jussi Kangasharju, Max Muhlhauser
2009 2009 6th IEEE Consumer Communications and Networking Conference  
The Distributed Tree Construction (DTC) algorithm is designed for optimally efficient multicast tree construction over structured peer-to-peer networks.  ...  We evaluate the performance of DTC over several DHTs by comparing the performance to existing application-level multicast solutions, we show that DTC sends 30-250% fewer messages than common solutions.  ...  While simple flooding approaches may apply to unstructured networks, DHT networks can take advantage of the structured neighbor lists and reduce the number of duplicate messages.  ... 
doi:10.1109/ccnc.2009.4784805 dblp:conf/ccnc/BradlerKM10 fatcat:u4no4jrunneapk5skyairhumiq

Scalable Resource Discovery Architecture for Large Scale MANETs

Saad Al-Ahmadi, Abdullah Al-Dhelaan
2014 Research Journal of Applied Sciences Engineering and Technology  
The study conducted a primary investigation into using the Gray cube structure, clustering and Distributed Hash Tables (DHTs) to build an efficient virtual network backbone for Resource Discovery (RD)  ...  All the Gray cubes are connected through gateways and access points to form virtual backbone used as substrate for DHT operations to distribute, register and locate network resources efficiently.  ...  We use DHT to assign and locate resources to these distributed directory agents of the network backbone. DHT is an efficient search structure based on resource's name.  ... 
doi:10.19026/rjaset.7.401 fatcat:6btbzr7dwzbc5dg4gjenuoxucy

Practical DHT-based location service for wireless mesh networks

Mehdi Bezahaf, Marcelo Dias de Amorim, Serge Fdida, Luigi Iannone
2009 Proceedings of the 5th international student workshop on Emerging networking experiments and technologies - Co-Next Student Workshop '09  
A preliminary evaluation of our DHT-based scheme on a real WMN test-bed shows encouraging results when compared to previous solutions.  ...  The major drawbacks of existing proposals is the fact that they rely on some sort of flooding-based technique and very often they need support from end-users' devices.  ...  We propose a distributed micro-mobility management service for WMNs based on DHT. The use of DHT allows avoiding flooding and retrieving a WMC's position by a simple unicast query.  ... 
doi:10.1145/1658997.1659023 dblp:conf/conext/BezahafAFI09 fatcat:r3kli3x3qbewvjhhbyvubpk2zu

Hybrid Retrieval Mechanisms in Vehicle-Based P2P Networks [chapter]

Quanqing Xu, Heng Tao Shen, Zaiben Chen, Bin Cui, Xiaofang Zhou, Yafei Dai
2009 Lecture Notes in Computer Science  
However, mobile P2P networks are subject to the limitations of transmission range, wireless bandwidth, and highly dynamic network topology, giving rise to many new challenges for efficient search.  ...  Our experiments show that the proposed approach is more accurate and efficient than existing methods.  ...  In unstructured P2P networks, the flooding-based technique is the most popular data retrieval one. Flooding entails message processing at every peer.  ... 
doi:10.1007/978-3-642-01970-8_30 fatcat:kedhyvarwvh4dmc3tzran3ng54

A cross-layer approach for real-time multimedia streaming on wireless peer-to-peer ad hoc network

Jun-Li Kuo, Chen-Hua Shih, Cheng-Yuan Ho, Yaw-Chung Chen
2013 Ad hoc networks  
Our proposed scheme (COME-P2P) integrates both P2P DHT-based lookup and IPv6 routing header to improve the delivery efficiency.  ...  Keywords: P2P-MANET Cross-layer design IPv6 Wireless ad hoc P2P live streaming Mobile wireless P2P a b s t r a c t Peer-to-peer (P2P) live streaming over mobile ad hoc network (MANET) is a state-of-theart  ...  How to deliver message and data efficiently is the key that impacts the quality of real-time service.  ... 
doi:10.1016/j.adhoc.2012.06.008 fatcat:se44jonnqjccjcmj6ayafbb2za

Popularity adaptive search in hybrid P2P systems

Xiaoqiu Shi, Jinsong Han, Yunhao Liu, Lionel M. Ni
2009 Journal of Parallel and Distributed Computing  
In a hybrid peer-to-peer (P2P) system, flooding and DHT are both employed for content locating. The decision to use flooding or DHT largely depends on the population of desired data.  ...  By dynamically detecting the content popularity, PASH properly selects search methods and efficiently saves query traffic cost and response time.  ...  Peers are joining and leaving the network based on existing observations on P2P behaviors [18] . In our simulation, we construct the DHT by using the SHA-1 algorithm.  ... 
doi:10.1016/j.jpdc.2008.09.004 fatcat:ckhfrpvnbjh5bm2aq3qqnvctf4

Popularity Adaptive Search in Hybrid P2P Systems

Xiaoqiu Shi, Jinsong Han, Yunhao Liu, Lionel M. Ni
2007 2007 IEEE International Parallel and Distributed Processing Symposium  
In a hybrid peer-to-peer (P2P) system, flooding and DHT are both employed for content locating. The decision to use flooding or DHT largely depends on the population of desired data.  ...  By dynamically detecting the content popularity, PASH properly selects search methods and efficiently saves query traffic cost and response time.  ...  Peers are joining and leaving the network based on existing observations on P2P behaviors [18] . In our simulation, we construct the DHT by using the SHA-1 algorithm.  ... 
doi:10.1109/ipdps.2007.370300 dblp:conf/ipps/ShiHLN07 fatcat:dhvm2h26mfeghodwgyqccqxt3e

A New Caching Technique to Support Conjunctive Queries in P2P DHT

K. KOBATAKE, S. TAGASHIRA, S. FUJITA
2008 IEICE transactions on information and systems  
Members SUMMARY P2P DHT (Peer-to-Peer Distributed Hash Table) is one of typical techniques for realizing an efficient management of shared resources distributed over a network and a keyword search over  ...  such networks in a fully distributed manner.  ...  In the flooding type, the search of an object is realized by flooding a query message over an overlay network; i.e., upon receiving a query from an adjacent peer in the overlay; it notifies the search  ... 
doi:10.1093/ietisy/e91-d.4.1023 fatcat:yfdyh5b5krh7jadme6tw22se4e

Optimally Efficient Prefix Search and Multicast in Structured P2P Networks [article]

Dirk Bradler and Jussi Kangasharju and Max Muehlhaeuser
2008 arXiv   pre-print
P2P networks based on Distributed Hash Tables (DHT) are optimized for single key lookups, whereas unstructured networks offer more complex queries at the cost of increased traffic and uncertain success  ...  Searching in P2P networks is fundamental to all overlay networks.  ...  While simple flooding approaches may apply to unstructured networks, DHT networks can take advantage of the structured neighbor lists and reduce the number of duplicate messages.  ... 
arXiv:0808.1207v1 fatcat:rppql3tgyreihdvnawabbnx5w4
« Previous Showing results 1 — 15 out of 2,089 results