Routing on longest-matching prefixes
IEEE/ACM Transactions on Networking (TON)
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
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
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
Building Topology-Aware Overlays Using Global Soft-State
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
The TCP/IP Guide: A Comprehensive, Illustrated Internet Protocols Reference
The TCP/IP Guide: A Comprehensive, Illustrated Internet Protocols Reference
Query-load balancing in structured overlays
CCGRID '07 Proceedings of the Seventh IEEE International Symposium on Cluster Computing and the Grid
Towards Location-aware Topology in both Unstructured and Structured P2P Systems
ICPP '07 Proceedings of the 2007 International Conference on Parallel Processing
On hierarchical DHT systems - An analytical approach for optimal designs
Computer Communications
Dynamic Load Sharing in Peer-to-Peer Systems: When Some Peers Are More Equal than Others
IEEE Internet Computing
A Feasibility Evaluation on Name-Based Routing
IPOM '09 Proceedings of the 9th IEEE International Workshop on IP Operations and Management
| Hi-index | 0.00 |
In the future Internet, routing on contents or resources is anticipated as the post-Internet Protocol (IP) routing. The final goal of our research is to realize routing based on the name of a resource in the network layer. Towards this purpose, we use the 'name' for routing, particularly the 'fully qualified domain name (FQDN)' to show the feasibility of name-based routing and to generalize it to resource-based routing. When writing the routing information of hierarchically structured FQDN into a hierarchical virtual topology, mismatch between the virtual topology and physical topology can occur if the virtual topology lacks the physical topology's information. In addition, routing tables should be reorganized to reflect the different access frequency among the FQDNs. In this paper, we propose an algorithm for reconstructing routing tables to better map a virtual topology to the physical topology. As a result, we show that using the access frequency and physical topology's information increases the efficiency for searching FQDN.