Efficient lookup on unstructured topologies
نویسندگان
چکیده
منابع مشابه
Topologies in Unstructured Peer To Peer Networks
The Peer-to-Peer (P2P) architectures that are most prevalent in today's Internet are decentralized and unstructured. As the peers participating in unstructured networks interconnect randomly, they rely on flooding query messages to discover objects of interest and thus introduce remarkable network traffic. Empirical measurement studies indicate that the peers in P2P networks have similar prefer...
متن کاملBuilding Efficient Limited Scale-Free Overlay Topologies for Unstructured P2P Networks
In addition to the peer/data organization and search algorithm, the overlay network topology (logical connectivity graph) among peers is a crucial component in unstructured peer-to-peer (P2P) networks. Its topological characteristics significantly affect the efficiency of a search on such unstructured P2P networks. Scale-free (power-law) overlay network topologies are one type of the structures...
متن کاملOn Efficient Topologies for Bluetooth Scatternets
In this paper we investigate the relationship between network capacity and topology for Bluetooth scatternets. We start by considering the intrinsic capacity limits of a scatternet structure, and we show that limiting capacity may be achieved for very local traffic and under specific conditions on the scatternet structure. Then, we provide a description of the performance achievable with two ba...
متن کاملA New Efficient IP Address Lookup Based on Binary Search
IP address lookup is an important function in a router to settle overall performance of the router. Binary search on range is a useful algorithm based on binary search for IP address lookup. However, this approach requires a lot of memories for adapting binary search to variable-length prefixes. We propose the improved algorithm to reduce memory requirements than binary search on range dramatic...
متن کاملEfficient Peer-to-Peer Lookup Based on a Distributed Trie
Two main approaches have been taken for distributed key/value lookup operations in peer-to-peer systems: broadcast searches [1, 2] and location-deterministic algorithms [5, 6, 7, 9]. We describe a third alternative based on a distributed trie. This algorithm functions well in a very dynamic, hostile environment, offering security benefits over prior proposals. Our approach takes advantage of wo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Journal on Selected Areas in Communications
سال: 2007
ISSN: 0733-8716
DOI: 10.1109/jsac.2007.07007