Conference Paper

A Feasibility Evaluation on Name-Based Routing.

DOI: 10.1007/978-3-642-04968-2_11 Conference: IP Operations and Management, 9th IEEE International Workshop, IPOM 2009, Venice, Italy, October 29-30, 2009. Proceedings
Source: DBLP


The IPv4 addressing scheme has been the standard for In- ternet communication since it was established in the 1960s. However, the enormous increase in Internet traffic usage has been leading in the past to issues such as increased complexity of routing protocols, explosion in routing table entries, provider-dependent addressing, and security prob- lem, demonstrating the need for a redesign in advanced router technolo- gies. The past proposals have limitations when it comes to establishing the foundations of future-generation networks, which require more so- phisticated routing protocols, like content-based routing. Furthermore, those previous approaches were not conceived to fully utilize the ad- vantages of TCAM, which is a type of memory capable of performing high-speed lookups that is already implemented in high-end routers. In this paper, we show that routing based on domain names is already a feasible technology on the Network Layer and we evaluate the necessary network and hardware resources needed to implement name-based rout- ing strategies. We present a routing scheme and propose three methods for equally balancing the routing information in the TCAM of multiple routers. The results show that this routing scheme is scalable and that the required number of routers is two orders of magnitude smaller than the number of currently existing routers.

Download full-text


Available from: Shingo Ata,
  • Source
    • "In our previous work [6], we showed the feasibility of name-based routing by evaluating the required number of routers, where TCAM was used as the memory in the routers. Although we were able to show that the number of required routers is two orders of magnitude smaller than the number of currently available routers deployed in the Internet, the previous work was only preliminary for evaluating the effect of dynamic updates of the FQDN database entries. "
    [Show abstract] [Hide abstract]
    ABSTRACT: Sophisticated routing protocols, such as content-based routing, have been studied and proposed to replace Internet Protocol (IP) in the future Internet. Routing based on content will make finding, querying, and retrieving the desired information possible within the routers rather than having the routers forward the packets to data servers or domain name servers. However, one of the main reasons that has prevented achieving content-based routing within the routers in the past has been their storage constraints. In our previous work, we showed that name-based routing, which is a good example of content-based routing, is feasible in practice utilizing Ternary Content Addressable Memory (TCAM). Using our proposed algorithms based on longest alphabet match and Distributed Hash Table (DHT), the Fully Qualified Domain Name (FQDN) database was distributed among less than the number of routers that are currently existing in the Internet. In this paper, we evaluate the feasibility of robustly updating the routing information database entries and show that there are no drastic changes in the routers' forwarding tables. We propose an algorithm for mapping a logical network topology to the physical topology to achieve robustness against dynamically changing databases that also considers the characteristic of TCAMs.
    Network Operations and Management Symposium Workshops (NOMS Wksps), 2010 IEEE/IFIP; 05/2010
  • Source
    • "We demonstrated in [9] the feasibility of storing the routing information in FQDNs in ternary content addressable memory (TCAM), which is the high-speed memory used in modern routers. The required number of routers for the storage is less than two orders of magnitude compared to the number of currently deployed routers [9]. "
    [Show abstract] [Hide abstract]
    ABSTRACT: In the future Internet, routing on contents or resources is antici-pated 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 topol-ogy, mismatch between the virtual topology and physical topology can occur if the virtual topology lacks the physical topology's infor-mation. 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 bet-ter 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.
  • [Show abstract] [Hide abstract]
    ABSTRACT: The enormous increase in Internet traffic usage has been leading to problems such as increased complexity of routing topology, explosion in routing table entries, provider-dependent addressing, which reduce the speed of network service. The emerging new techniques such as CDN, P2P, VPN, etc. speed up the network from different perspectives. A new speed up system called CANR, content aware and name based routing, is proposed in this paper, which integrates benefits of several existing mehanisms. CANR consists of a cluster of proxy peers deployed in different network domains, which can work as collaborative routers, forwarding requests to each other to speed up the cross-domain visits. CANR can automatically aware the changes of network and re-construct name-based routing table based on a new multi objectie k shortest algoritm by itself, finding a set of cheapest and most fast k routing paths, which is different from current static preconfigured systems.
    Proceedings of the 2012 international conference on Pervasive Computing and the Networked World; 11/2012
Show more