Accessing nearby copies of replicated objects in a distributed environment
Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Viceroy: a scalable and dynamic emulation of the butterfly
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Kademlia: A Peer-to-Peer Information System Based on the XOR Metric
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
The impact of DHT routing geometry on resilience and proximity
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Bandwidth-efficient management of DHT routing tables
NSDI'05 Proceedings of the 2nd conference on Symposium on Networked Systems Design & Implementation - Volume 2
Hi-index | 0.00 |
Internet of Things (IoT) is an emerging network which is designed to combine sensor networks and other things with the Internet. IoT includes numerous things, each of which is allocated an unique identity (UID). UID management plays an very important role in guaranteeing the efficiency of IoT system. Since IoT is a task-oriented network, there must be a coupling relation among UIDs. Based on this consideration, a correlated lookup scheme is proposed to improve the performance of UID management. Meanwhile, the Distributed Hash Table (DHT) is adopted as the underlying structure to construct the basic UID management methodology. To the best of our knowledge, it is the first time that the inherent relation is leveraged to improve the efficiency of UID Management. Extensive simulations are conducted to demonstrate the efficiency of the proposed lookup scheme.