Chord: a scalable peer-to-peer lookup protocol for internet applications
IEEE/ACM Transactions on Networking (TON)
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
Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
Distributed Clustering for Ad Hoc Networks
ISPAN '99 Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms and Networks
Unmanaged Internet Protocol: taming the edge network management crisis
ACM SIGCOMM Computer Communication Review
Internet indirection infrastructure
IEEE/ACM Transactions on Networking (TON)
A layered naming architecture for the internet
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Virtual ring routing: network routing inspired by DHTs
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
A Feasibility Evaluation on Name-Based Routing
IPOM '09 Proceedings of the 9th IEEE International Workshop on IP Operations and Management
A Scalability Study of Enterprise Network Architectures
Proceedings of the 2011 ACM/IEEE Seventh Symposium on Architectures for Networking and Communications Systems
PAST: scalable ethernet for data centers
Proceedings of the 8th international conference on Emerging networking experiments and technologies
Conception of ID layer performance at the network level for Internet of Things
Personal and Ubiquitous Computing
An Efficient and Scalable Routing for MANETs
Wireless Personal Communications: An International Journal
Hi-index | 0.00 |
Current flat-id based routing schemes promise support for mobility and scalability. However, providing efficient routing with minimal overheads for mobility is still a challenge. In this paper we provide a solution to these problems by introducing Virtual Id Routing (VIR). VIR meets these basic requirements of future id-based routing schemes: namely, i) scalability - by using distributed hash table based routing framework; ii) mobility support - by separating the node-identifier from the network location; and iii) routing efficiency - by exploiting network topology information, which is done by introducing a dynamic, self-organizing virtual id (vid) space layer in between the node id space (uid) and the network topology. Preliminary evaluation of the protocol shows promising results, specifically routing stretch for VIR is very close to 1, and the overheads due to mobility are also much smaller than existing schemes such as VRR.