Graduate School of Fundamental Science and Engineering Waseda University
博 士 論 文 概 要
Doctoral Thesis Synopsis
論 文 題 目
Thesis Theme
Adaptive Routing Path Control in Information-Centric Networking
申 請 者 (Applicant Name)
Yao HU
胡 曜
Department of Computer Science and Engineering, Research on Information Systems
December, 2014
The current IP-based networks are based on the initial concept: IP addresses are given to host machines. All the packets from a host to another host have the source IP address and the destination IP address. The IP address specifies the location of a host machine in a network.
Network applications have changed from the initial Internet. In some applications like VoD services, users care about what information is or what content is rather than where the information or content is located. There are certain areas of application which are called information-centric. In IP-based networks, a user’s client machine maps the requested content to a specified host name (domain name) that provides the content. Then the domain name is translated into the corresponding IP address by DNS.
Information-centric networking (ICN) is proposed to change the network architecture. In ICN, information becomes the first-class object. Information is given a globally unique, location independent name. The ICN architecture profoundly changes the current Internet and offers the Internet users broader prospects for various information-centric applications. There are several active projects based on the concept of ICN. While these projects have been initiated by various organizations, they share the same essential ICN concept, such as location independent, receiver driven, in-network caching, and data centric security.
A seminal paper is written by Jacobson et al. which sketches out a blueprint of the overall ICN architecture.
They called it CCN (Content-Centric Networking). Their paper did not fully explain the operations of forwarding and routing methods which are essential mechanisms in ICN. This thesis proposes new adaptive forwarding and routing mechanisms to realize an efficient and reliable ICN architecture. To address the issue of FIB configuration in large networks rather than manual operation with static routes, the proposed forwarding mechanism is equipped with an FIB learning capability to make best use of the adaptive forwarding feature in ICN. The new routing mechanism enhances the hop-by-hop ICN architecture (CCN) with global dynamic adjustment. It deals with mobility concern as well as name-based routing under the guidance of a special scheduler node in the network. Rather like existing works, the new routing service runs on top of the standard ICN architecture by providing a new naming scheme for packets. Our proposal gives ICN a step further towards a practically working system.
This thesis is organized as follows:
Chapter 1 presents a brief introduction to the thesis. It includes the thesis organization and our original works or contributions.
Chapter 2 first summarizes the current IP architecture and then gives an overview of the ICN architecture to set the context for later discussions. Among several ICN instantiations, we pick CCN as the basis of our architecture due to their leading design and popularity. It should be noted here that many of our findings and schemes in this thesis are also applicable to other ICN architectures. We describe the CCN architecture in some detail, including the three essential structures of a CCN node, namely forwarding information base (FIB), pending interest table (PIT) and content store (CS). We identify the missing pieces or mechanisms in the current ICN design and explain how our works fill in these research gaps. We design a new FIB learning forwarding mechanism to deal with the issue of FIB configuration in large networks rather than manual operation with static
No. 1
routes. We propose a new name-based routing mechanism to provide the ICN/CCN architecture with global dynamic adjustment. It includes a new naming scheme for packets and a new dynamic FIB configuration method.
Chapter 3 discusses the related works. We emphasize two specific topics of ICN forwarding and routing, in that they are distinguished features in ICN from those in IP, but they are still not well-documented or developed in the ICN research area. While routing in an ICN architecture serves the same purpose as in an IP network, i.e.
computing a routing table, forwarding in ICN is performed in two steps: users first send an Interest packet, then the corresponding Data packets returns along the same path in the reverse direction. In ICN, on-path routers keep states of pending Interest packets to guide Data packets in returning to the requesting users. This state keeping function for pending Interest packets, together with the symmetric exchange of Interest and Data, enables routers to calculate metrics of various routing paths. It can also detect link failures and retry with an alternative path. We survey alternative solutions proposed by related projects.
Chapter 4 details our design of FIB forwarding with learning capability in ICN. We start with presenting the motivation for our work. According to the original ICN protocol, it is possible for a name-prefix to have multiple outgoing faces in FIB. Naive manual configuration with static routes is feasible for small ICN networks.
However, it may introduce much traffic wastage in large-scale networks. We need more sophisticated mechanisms to fill in the FIB with promising forwarding entries. Traditional IP routing algorithms like OSPF may be a possible solution for this issue. However, they do not make use of the cached data in ICN. In ICN, an intermediate node (router) on a path has the responsibility of returning and caching the requested data to the end user. ICN provides us a chance to design an adaptive forwarding mechanism based on the information which is observed at each router. With the powerful feature of our adaptive forwarding, ICN routers can detect and recover from network failure quickly without waiting for global routing convergence.
In Chapter 4, we then move on to discuss the design principles and advantages of our FIB learning forwarding mechanism. Our new idea takes advantage of successful data retrieval and makes use of the forwarding strategy to discover paths to potential content providers or holders. This approach can also quickly react to topology changes in the network. We focus on two issues in our design. The first issue is how to fill FIB with entries composed by pairs of name-prefix and face. The second issue is how to forward Interest packets to potential content providers or holders according to these FIB entries. We evaluate the new design to show the space-time advantage over an Interest flooding method and to present superiority of recovery from link failure to a RTT-based solution. Finally, we use a sport team example to investigate the application of our design for a mobile node. The results demonstrate the resilience with dynamic network configurations in the proposed method.
Chapter 5 proposes a new name-based ICN routing mechanism. We motivate our work by pointing out the problems with existing ICN routing algorithms. In our proposal, a new scheduler node assists routing as an additional function to the existing ICN architecture. The proposed method still retains basic characteristics of ICN. The scheduler is a special ICN node, which can be implemented upon a standard ICN router. It has
knowledge of the network topology and the location of specific named data. Therefore, it can play a role as a scheduler to calculate and assign the best routes towards data providers for data requesters. Basically, there are four steps for the configuration of ICN nodes. First, each participant router sends a greeting message to its adjacent routers. This is to let all routers know their neighbors including information of link metrics such as RTT values. Second, if a router does not know the location or ID of the scheduler in the network, it sends an Interest packet and uses a flooding method to discover routes towards the scheduler. This is to let all routers know how to reach the scheduler in the network. Third, the router sends a registration message to register itself at the scheduler. This is to let the scheduler be aware of the network topology. Fourth, if a data provider wants to register the named data or served name-prefix, it sends a registration Interest packet to register the data or name-prefix at the scheduler. That indicates that the data provider will be responsible for serving requests for the registered named data or name-prefix. Then, the scheduler knows the location where the registered data is in the network.
In Chapter 5, within the name-based routing mechanism, we propose a new naming scheme for Interest and Data packet exchanges between the scheduler and routers. By comparing our design with other ICN architectures as well as other existing ICN routing schemes, we can differentiate the value of our work on the ICN routing and mobility areas. We elaborate the experiments to evaluate the overhead and resource consumption and to demonstrate the performance in case of mobility of data user and data provider based on our ICN prototype software implemented in PlanetLab platform. As for data user mobility, we take an on-going railway train project as a realistic problem example to discuss the advantage of the new design over the standard ICN mechanism. If the proposal is combined with a pre-determined caching scheme, the performance is proved to be higher. Our method in this thesis deals with single path forwarding, nevertheless it is shown that the new strategy can be easily extended to cover multi-path forwarding in ICN.
In Chapter 5, we also show that the new name-based routing mechanism can be treated as a new dynamic FIB configuration method for ICN routers. The new method helps ICN users being even unaware of the infrastructure change from the standard ICN to guide the requests on the best calculated routes by the scheduler to fetch their desired data according to the dynamically configured FIB entries.
Chapter 6 summarizes the entire thesis and explains a few possible directions for further research.
In conclusion, this thesis identifies the missing technology in routing path control in the current ICN research area. We propose new methods in ICN forwarding and routing mechanisms to address these issues. On the basis of our proposals, we provide the current ICN architecture with a new possibility of being equipped with a learning forwarding plane and routing packets along adaptive resource-saving paths. The results of our works demonstrate that the proposed mechanisms lead to solutions for realizing such hop-by-hop packet exchanges with global dynamic adjustment in this new network architecture, and thus make ICN a step further towards a practically working system.
No. 3
No.1
早稲田大学 博士（工学） 学位申請 研究業績書
(List of research achievements for application of doctorate (Dr. of Engineering), Waseda University)
氏 名
(Yao HU)
印(seal or signature )
（
As of November, 2014
） 種 類 別(By Type)
題名、 発表・発行掲載誌名、 発表・発行年月、 連名者（申請者含む）
(theme, journal name, date & year of publication, name of authors inc. yourself)
○論文
○国際会議
○国際会議
論文
論文
論文
講演
講演
Y. Hu and S. Goto, "Introducing Routing Guidance Name in Content-Centric Networking", IEICE TRANSACTIONS on Communications, Vol. E97-B, No.12, Dec. 2014.（採録決定）
Y. Hu and S. Goto, "Learning Forwarding Mechanism in Content-Centric Networking", Proceedings of the Asia-Pacific Advanced Network, vol. 36, pp. 106--114, 2013.
Y. Hu and S. Goto, "Performance Evaluation of File Transmission in Content-Centric Networking", 2nd IEEE International Conference on Cloud Computing and Intelligence Systems, No. 200-619, pp. 979--980, Hangzhou, China, November, 2012.
Y. Hu, L. Li, and Y. Liu, "Implementation and Research of Combinatorial Double Auction in Economic Grid Based on Gridsim" (in Chinese), Sciencepaper Online, 200809-863, Sep.
2008.
Y. Hu, L. Li, and Y. Liu, "Design and Simulation of Genetic Algorithm in Combinatorial Double Auction in Economic Grid" (in Chinese), Sciencepaper Online, 200808-439, Aug.
2008.
Y. Hu, L. Li, and Y. Liu, "Simulation and Analysis of Grid Scheduling Based on Gridsim" (in Chinese), Sciencepaper Online, 200808-192, Aug. 2008.
Y. Hu and S. Goto, "Smart Name-based Routing in ICN", Proceedings of the IEICE General Conference, BS-1-56, Mar. 2014.
Y. Hu and S. Goto, "A New Learning Mechanism of Forwarding Information Base in CCN", Proceedings of the IEICE General Conference, BS-1-60, Mar. 2013.
