Jointly Optimal Routing and Caching for Arbitrary Network Topologies

We study a problem of fundamental importance to ICNs, namely, minimizing routing costs by jointly optimizing caching and routing decisions over an arbitrary network topology. We consider both source routing and hop-by-hop routing settings. The respective offline problems are NP-hard. Nevertheless, we show that there exist polynomial time approximation algorithms producing solutions within a constant approximation from the optimal. We also produce distributed, adaptive algorithms with the same approximation guarantees. We simulate our adaptive algorithms over a broad array of different topologies. Our algorithms reduce routing costs by several orders of magnitude compared to prior art, including algorithms optimizing caching under fixed routing.Comment: This is the extended version of the paper "Jointly Optimal Routing and Caching for Arbitrary Network Topologies", appearing in the 4th ACM Conference on Information-Centric Networking (ICN 2017), Berlin, Sep. 26-28, 201

PiCasso: enabling information-centric multi-tenancy at the edge of community mesh networks

© 2019 Elsevier. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/Edge computing is radically shaping the way Internet services are run by enabling computations to be available close to the users - thus mitigating the latency and performance challenges faced in today’s Internet infrastructure. Emerging markets, rural and remote communities are further away from the cloud and edge computing has indeed become an essential panacea. Many solutions have been recently proposed to facilitate efficient service delivery in edge data centers. However, we argue that those solutions cannot fully support the operations in Community Mesh Networks (CMNs) since the network connection may be less reliable and exhibit variable performance. In this paper, we propose to leverage lightweight virtualisation, Information-Centric Networking (ICN), and service deployment algorithms to overcome these limitations. The proposal is implemented in the PiCasso system, which utilises in-network caching and name based routing of ICN, combined with our HANET (HArdware and NETwork Resources) service deployment heuristic, to optimise the forwarding path of service delivery in a network zone. We analyse the data collected from the Guifi.net Sants network zone, to develop a smart heuristic for the service deployment in that zone. Through a real deployment in Guifi.net, we show that HANET improves the response time up to 53% and 28.7% for stateless and stateful services respectively. PiCasso achieves 43% traffic reduction on service delivery in our real deployment, compared to the traditional host-centric communication. The overall effect of our ICN platform is that most content and service delivery requests can be satisfied very close to the client device, many times just one hop away, decoupling QoS from intra-network traffic and origin server load.Peer ReviewedPostprint (author's final draft

QuLa: service selection and forwarding table population in service-centric networking using real-life topologies

The amount of services located in the network has drastically increased over the last decade which is why more and more datacenters are located at the network edge, closer to the users. In the current Internet it is up to the client to select a destination using a resolution service (Domain Name System, Content Delivery Networks ...). In the last few years, research on Information-Centric Networking (ICN) suggests to put this selection responsibility at the network components; routers find the closest copy of a content object using the content name as input. We extend the principle of ICN to services; service routers forward requests to service instances located in datacenters spread across the network edge. To solve this problem, we first present a service selection algorithm based on both server and network metrics. Next, we describe a method to reduce the state required in service routers while minimizing the performance loss caused by this data reduction. Simulation results based on real-life networks show that we are able to find a near-optimal load distribution with only minimal state required in the service routers

迅速な災害管理のための即時的,持続可能，かつ拡張的なエッジコンピューティングの研究

本学位論文は、迅速な災害管理におけるいくつかの問題に取り組んだ。既存のネットワークインフラが災害による直接的なダメージや停電によって使えないことを想定し、本論文では、最新のICTを用いた次世代災害支援システムの構築を目指す。以下のとおり本論文は三部で構成される。第一部は、災害発生後の緊急ネットワーキングである。本論文では、情報指向フォグコンピューティング（Information-Centric Fog Computing）というアーキテクチャを提案し、既存のインフラがダウンした場合に臨時的なネットワーク接続を提供する。本論文では、六次の隔たり理論から着想を得て、緊急時向け名前ベースルーティング（Name-Based Routing）を考慮した。まず、二層の情報指向フォグコンピューティングネットワークモデルを提案した。次に、ソーシャルネットワークを元に、情報指向フォグノード間の関係をモデリングし、名前ベースルーティングプロトコルをデザインする。シミュレーション実験では、既存のソリューションと比較し、提案手法はより高い性能を示し、有用性が証明された。第二部は、ネットワークの通信効率の最適化である。本論文は、第一部で構築されたネットワークの通信効率を最適化し、ネットワークの持続時間を延ばすために、ネットワークのエッジで行われるキャッシングストラテジーを提案した。本論文では、まず、第一部で提案した二層ネットワークモデルをベースにサーバー層も加えて、異種ネットワークストラクチャーを構成した。次に、緊急時向けのエッジキャッシングに必要なTime to Live （TTL）とキャッシュ置換ポリシーを設計する。シミュレーション実験では、エネルギー消費とバックホールレートを性能指標とし、メモリ内キャッシュとディスクキャッシュの性能を比較した。結果では、メモリ内ストレージと処理がエッジキャッシングのエネルギーを節約し、かなりのワークロードを共有できることが示された。第三部は、ネットワークカバレッジの拡大である。本論文は、ドローンの関連技術とリアルタイム視覚認識技術を利用し、被災地のユーザ捜索とドローンの空中ナビゲーションを行う。災害管理におけるドローン制御に関する研究を調査し、現在のドローン技術と無人捜索救助に対する実際のニーズを考慮すると、軽量なソリューションが緊急時に必要であることが判明した。そのため本論文では、転移学習を利用し、ドローンに搭載されたオンボードコンピュータで実行可能な空中ビジョンに基づいたナビゲーションアプローチを開発した。シミュレーション実験では、1/150ミニチュアモデルを用いて、空中ナビゲーションの実行可能性をテストした。結果では、本論文で提案するドローンの軽量ナビゲーションはフィードバックに基づいてリアルタイムに飛行の微調整を実現でき、既存手法と比較して性能において大きな進歩を示した。This dissertation mainly focuses on solving the problems in agile disaster management. To face the situation when the original network infrastructure no longer works because of disaster damage or power outage, I come up with the idea of introducing different emerging technologies in building a next-generation disaster response system. There are three parts of my research. In the first part of emergency networking, I design an information-centric fog computing architecture to fast build a temporary emergency network while the original ones can not be used. I focus on solving name-based routing for disaster relief by applying the idea from six degrees of separation theory. I first put forward a 2-tier information-centric fog network architecture under the scenario of post-disaster. Then I model the relationships among ICN nodes based on delivered files and propose a name-based routing strategy to enable fast networking and emergency communication. I compare with DNRP under the same experimental settings and prove that my strategy can achieve higher work performance. In the second part of efficiency optimization, I introduce the idea of edge caching in prolong the lifetime of the rebuilt network. I focus on how to improve the energy efficiency of edge caching using in-memory storage and processing. Here I build a 3-tier heterogeneous network structure and propose two edge caching methods using different TTL designs & cache replacement policies. I use total energy consumption and backhaul rate as the two metrics to test the performance of the in-memory caching method and compare it with the conventional method based on disk storage. The simulation results show that in-memory storage and processing can help save more energy in edge caching and share a considerable workload in percentage. In the third part of coverage expansion, I apply UAV technology and real-time image recognition in user search and autonomous navigation. I focus on the problem of designing a navigation strategy based on the airborne vision for UAV disaster relief. After the survey of related works on UAV fly control in disaster management, I find that in consideration of the current UAV manufacturing technology and actual demand on unmanned search & rescue, a lightweight solution is in urgent need. As a result, I design a lightweight navigation strategy based on visual recognition using transfer learning. In the simulation, I evaluate my solutions using 1/150 miniature models and test the feasibility of the navigation strategy. The results show that my design on visual recognition has the potential for a breakthrough in performance and the idea of UAV lightweight navigation can realize real-time flight adjustment based on feedback.室蘭工業大学 (Muroran Institute of Technology)博士（工学

Future of networking is the future of Big Data, The

2019 Summer.Includes bibliographical references.Scientific domains such as Climate Science, High Energy Particle Physics (HEP), Genomics, Biology, and many others are increasingly moving towards data-oriented workflows where each of these communities generates, stores and uses massive datasets that reach into terabytes and petabytes, and projected soon to reach exabytes. These communities are also increasingly moving towards a global collaborative model where scientists routinely exchange a significant amount of data. The sheer volume of data and associated complexities associated with maintaining, transferring, and using them, continue to push the limits of the current technologies in multiple dimensions - storage, analysis, networking, and security. This thesis tackles the networking aspect of big-data science. Networking is the glue that binds all the components of modern scientific workflows, and these communities are becoming increasingly dependent on high-speed, highly reliable networks. The network, as the common layer across big-science communities, provides an ideal place for implementing common services. Big-science applications also need to work closely with the network to ensure optimal usage of resources, intelligent routing of requests, and data. Finally, as more communities move towards data-intensive, connected workflows - adopting a service model where the network provides some of the common services reduces not only application complexity but also the necessity of duplicate implementations. Named Data Networking (NDN) is a new network architecture whose service model aligns better with the needs of these data-oriented applications. NDN's name based paradigm makes it easier to provide intelligent features at the network layer rather than at the application layer. This thesis shows that NDN can push several standard features to the network. This work is the first attempt to apply NDN in the context of large scientific data; in the process, this thesis touches upon scientific data naming, name discovery, real-world deployment of NDN for scientific data, feasibility studies, and the designs of in-network protocols for big-data science