• DocumentCode
    3599842
  • Title

    HFA: Novel naming and routing design for future Internet architecture

  • Author

    Meng Zhang ; Jianfeng Guan ; Wei Quan ; Changqiao Xu ; Hongke Zhang

  • Author_Institution
    State Key Lab. of Networking & Switching Technol., Beijing Univ. of Posts & Telecommun., Beijing, China
  • fYear
    2014
  • Firstpage
    207
  • Lastpage
    211
  • Abstract
    The design of naming and routing scheme is an important research area for scalable future Internet infrastructure. Currently, existing naming and routing schemes such as hierarchical or flat structure have some individual drawbacks, which limit the development of future Internet greatly. In this paper, we make an in-depth study of existing naming and routing schemes for future Internet, and propose a naming scheme named HFA, which is built by a hybrid Hierarchical-Flat-Attributes structure. Based on this design, an efficient routing scheme using Trie and Hash Table is further proposed as the corresponding routing method. Experimental results show that the HFA has a good flexibility and superior performance with respective to purely hierarchical-based and flat-based naming scheme using our routing method in terms of routing aggregation, lookup time and memory consumption.
  • Keywords
    Internet; table lookup; tree data structures; HFA; Internet architecture; Trie-and-Hash table; flat-based naming scheme; hierarchical-based naming scheme; hybrid hierarchical-flat-attribute structure; lookup time; memory consumption; routing aggregation; routing design; Engines; IP networks; Internet; Memory management; Motion pictures; Routing; Uniform resource locators; Future Internet; Lookup time; Memory consumption; Naming; Routing;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Cloud Computing and Intelligence Systems (CCIS), 2014 IEEE 3rd International Conference on
  • Print_ISBN
    978-1-4799-4720-1
  • Type

    conf

  • DOI
    10.1109/CCIS.2014.7175730
  • Filename
    7175730