skip to main content
10.1145/1853079.1853093acmotherconferencesArticle/Chapter ViewAbstractPublication PagescfiConference Proceedingsconference-collections
research-article

Frequency-aware reconstruction of forwarding tables in name-based routing

Published:16 June 2010Publication History

ABSTRACT

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.

References

  1. Abilene Network, http://www.internet2.edu/network/.Google ScholarGoogle Scholar
  2. T. Berners-Lee, R. Fielding, and L. Masinter. RFC 3986: Uniform Resource Identifier (URI), Jan 2005.Google ScholarGoogle Scholar
  3. L. Breslau, P. Cao, L. Fan, G. Phillips, and S. Shenker. Web Caching and Zipf-like Distributions: Evidence and Implications. In Proc. of IEEE INFOCOM, volume 1, pages 126--134, Mar 1999.Google ScholarGoogle ScholarCross RefCross Ref
  4. A. Carzaniga, M. J. Rutherford, and A. L. Wolf. A Routing Scheme for Content-Based Networking. In Proc. of IEEE INFOCOM, Mar 2004.Google ScholarGoogle ScholarCross RefCross Ref
  5. A. Datta, R. Schmidt, and K. Aberer. Query-load Balancing in Structured Overlays. In Proc. of the 7th IEEE CCGRID, pages 453--460, May 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Digital Object Identifier (DOI), http://www.doi.org/.Google ScholarGoogle Scholar
  7. W. Doeringer, G. Karjoth, and M. Nassehi. Routing on longest-matching prefixes. IEEE/ACM Transactions on Networking, 4:86--97, Feb 1996. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. B. Hariri, S. Shirmohammadi, and M. R. Pakravan. LOADER: A Location-Aware Distributed Virtual Environment Architecture. In Proc. of the IEEE VECIMS, pages 97--101, July 2008.Google ScholarGoogle ScholarCross RefCross Ref
  9. H. Hwang, S. Ata, and M. Murata. A Feasibility Evaluation on Name-based Routing. In Proc. of IEEE IPOM, pages 130--142, Oct 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. H. Hwang, S. Ata, and M. Murata. The Impact of FQDN Database Updates on Name-based Routing Architecture. In to be presented at 5th IFIP/IEEE BcN, Apr 2010.Google ScholarGoogle Scholar
  11. Internet Systems Consortium (ISC), http://www.isc.org/index.pl?/ops/ds/.Google ScholarGoogle Scholar
  12. C. Kozierok. The TCP/IP Guide: A Comprehensive, Illustrated Internet Protocols Reference. No Starch Press, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Life Sciences Identifiers (LSID), http://lsids.sourceforge.net/.Google ScholarGoogle Scholar
  14. T. Qiu, G. Chen, M. Ye, E. Chan, and B. y. Zhao. Towards Location-aware Topology in both Unstructured and Structured P2P Systems. In Proc. of International Conference on Parallel Processing, pages 30--37, Sep 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker. A Scalable Content-Addressable Network. In Proc. of the SIGCOMM, pages 161--172, Aug 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. D. Reed and D. McAlpin. Extensible Resource Identifier (XRI) Syntax V2.0. http://www.oasis-open.org/committees/download.php/15376#_Toc117301832.Google ScholarGoogle Scholar
  17. A. Rowstron and P. Druschel. Pastry: Scalable, Distributed Object Location and Routing for Large-scale Peer-to-peer Systems. IFIP/ACM International Conference on Distributed Systems Platforms (Middleware), 11:329--350, Nov 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. S. Serbu, S. Bianchi, P. Kropf, and P. Felber. Dynamic Load Sharing in Peer-to-Peer Systems: When Some Peers Are More Equal than Others. IEEE Internet Computing, 11(4):53--61, July 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. I. Stoica, R. Morris, D. Karger, M. Kaashoek, and H. Balakrishnan. Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications. Proceedings of the SIGCOMM, 31(4):149--160, Aug 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. K. Tesink and R. Fox. RFC 4152: A Uniform Resource Name (URN), August 2005.Google ScholarGoogle Scholar
  21. Z. Xu, C. Tang, and Z. Zhang. Building Topology-aware Overlays using Global Soft-state. In Proceedings of International Conference on Distributed Computing Systems, volume 23, pages 500--508, May 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. S. Zoels, Z. Despotovic, and W. Kellerer. On Hierarchical DHT Systems--An Analytical Approach for Optimal Designs. Computer Communications, 31(3):576--590, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Frequency-aware reconstruction of forwarding tables in name-based routing

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in
      • Published in

        cover image ACM Other conferences
        CFI '10: Proceedings of the 5th International Conference on Future Internet Technologies
        June 2010
        96 pages
        ISBN:9781450302302
        DOI:10.1145/1853079

        Copyright © 2010 ACM

        Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 16 June 2010

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • research-article

        Acceptance Rates

        Overall Acceptance Rate29of55submissions,53%
      • Article Metrics

        • Downloads (Last 12 months)0
        • Downloads (Last 6 weeks)0

        Other Metrics

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader