Conference Program
Overview
Keynote: Computer Scientists and the Law: The vital need for technical community leadership on privacy, security and law enforcement public policy challenges
Daniel J. Weitzner will give a keynote talk at ACM ICN 2018.
Abstract: The extraordinarily rapid growth of the Internet globally - from the very first commercial users in 1992 to 4 billion users (over half of the world’s population) just 25 years later in 2017 - has presented a number of challenges in law and policy. Confusion over how to proceed on Issues such as online privacy, cybersecurity, the role of law enforcement and copyright protection leaves many claiming that the law is behind the technology and a few, mostly from government, claiming that the technology is behind the law. In reality, legal and technical discussions of these issues proceed on largely non-overlapping paths, with each community feeling that it is going in circles. This talk will explore three specific technology policy questions - online copyright protection, individual privacy and law enforcement interaction with encryption - to illustrate the current gaps in the policy debate and how the technical community can come together to inform that discussion toward more comprehensive policy solutions.
Bio: Daniel J. Weitzner is the Founding Director of the MIT Internet Policy Research Initiative and Principal Research Scientist at the MIT Computer Science and Artificial Intelligence Lab. His group studies the relationship between network architecture and public policy, and develops new Web architectures to meet policy challenges such as privacy and intellectual property rights. He teaches Internet public policy in the MIT Electrical Engineering and Computer Science Department.
Schedule
-
8:00am - 9:00am Registration
Room: Atrium
- Registration
-
9:00am - 12:30pm Tutorials
Room: 142
- Tutorials
-
This session includes coffee break from 11:00am to 11:15am. Details on the tutorial are available here.
-
11:00am - 11:15am Coffee Break
Room: Atrium
- Coffee Break
-
This session includes coffee break from 11:00am to 11:15am. Details on the tutorial are available here.
-
12:30pm - 1:30pm Lunch
Room: Atrium
- Lunch
-
1:30pm - 5:00pm Tutorials
Room: 142
- Tutorials
-
This session includes coffee break from 03:30pm to 04:00pm. Details on the tutorial are available here.
-
03:30pm - 04:00pm Coffee Break
Room: Atrium
- Coffee Break
-
This session includes coffee break from 03:30pm to 04:00pm. Details on the tutorial are available here.
-
5:00pm - 6:00pm General Discussion Session
Room: 142
- General Discussion Session
-
6:30pm - 8:30pm Welcome Reception
-
-
Welcome reception will be hosted in Atrium.
-
8:00am - 9:00am Registration
Room: Atrium
- Registration
-
9:00am - 9:30am Opening Session
Room: 102
- Opening Session
-
Dave Oran (Network Systems Research & Design), Edmund Yeh (Northeastern University)
-
Stratis Ioannidis (Northeastern University), Dmitri Krioukov (Northeastern University)
-
Jussi Kangasharju (University of Helsinki), Satyajayant "Jay" Misra (New Mexico State University)
-
9:30am - 10:30am Technical Session 1: Edge
Session Chair: Christian Tschudin
Room: 102
- Technical Session 1: Edge
-
Michał Król (University College London), Karim Habak (Georgia Tech), David R Oran (Network Systems Research & Design), Dirk Kutscher (Huawei), Ioannis Psaras (University College London)
Abstract: Information Centric Networking has been proposed as a new network layer for the Internet, capable of encompassing the full range of networking facilities provided by the current IP architecture. In addition to the obvious content-fetching use cases which have been the subject of a large body of work, ICN has also shown promise as a substrate to effectively support remote computation, both pure functional programming (as exemplified by Named Function Net- working) and more general remote invocation models such as RPC and web transactions. Providing a unified remote computation capability in ICN presents some unique challenges, among which are timer management, client authorization, and binding to state held by servers, while maintaining the advantages of ICN protocol designs like CCN and NDN. In this paper we present a unified approach to remote function invocation in ICN that exploits the at- tractive ICN properties of name-based routing, receiver-driven flow and congestion control, flow balance, and object-oriented security while presenting a natural programming model to the application developer.
-
Xavier Marchal (CNRS), Thibault Cholez (Université de Lorraine), Olivier Festor (Université de Lorraine)
Abstract: As an extension of Network Function Virtualization, microservice architectures are a promising way to design future network services. At the same time, Information-Centric Networking architectures like NDN would benefit from this paradigm to offer more design choices for the network architect while facilitating the deployment and the operation of the network. We propose μNDN, an orchestrated suite of microservices as an alternative way to implement NDN forwarding and support functions. We describe seven essential micro-services we developed, explain the design choices behind our solution and how it is orchestrated. We evaluate each service in isolation and the entire microservice architecture through two realistic scenarios to show its ability to react and mitigate some performance and security issues thanks to the orchestration. Our results show that μNDN can replace a monolithic NDN forwarder while being more powerful and scalable.
-
10:30am - 11:00am Coffee Break
Room: Atrium
- Coffee Break
-
11:00am - 12:30pm Technical Session 2: Caching
Session Chair: Thomas Schmidt
Room: 102
- Technical Session 2: Caching
-
Yoji Yamamoto (Osaka University), Junji Takemasa (Osaka University), Yuki Koizumi (Osaka University), Toru Hasegawa (Osaka University)
Abstract: Increase in the size of content due to the emergence of bandwidth-intensive applications leads to a problematic phenomenon, looped replacement, of packet-level caching of information centric networking. This paper analytically investigates how looped replacement occurs. The analyses imply that cache admission is one of countermeasures against looped replacement. Through simulation, we confirm cache admission suppress looped replacement through simulation.
-
Junaid Ahmed Khan (University of Memphis, Memphis, TN, USA), Cedric Westphal (University of California, Santa Cruz, CA, USA), J.J. Garcia-Luna-Aceves (University of California, Santa Cruz, CA, USA), Yacine Ghamri-Doudane (University of La Rochelle, France)
Abstract: All Information-Centric Networking (ICN) architectures proposed to date aim at connecting users to content directly, rather than connecting clients to servers. Surprisingly, however, although content caching is an integral of any information-Centric Network, limited work has been reported on information-centric management of caches in the context of an ICN. Indeed, approaches to cache management in networks of caches have focused on network connectivity rather than proximity to content. We introduce the Network-oriented Information-centric Centrality for Efficiency (NICE) as a new metric for cache management in information-centric networks. We propose a method to compute information-centric centrality that scales with the number of caches in a network rather than the number of content objects, which is many orders of magnitude larger. Furthermore, it can be pre-processed offline and ahead of time. We apply the NICE metric to a content replacement policy in caches, and show that a content replacement based on NICE exhibits better performances than LRU and other policies based on topology-oriented definitions of centrality.
-
Jakob Pfender (Victoria University of Wellington), Alvin Valera (Victoria University of Wellington), Winston K.G. Seah (Victoria University of Wellington)
Abstract: In-network caching is one of the most defining aspects of Information-Centric Networking (ICN). It ensures that relevant content is readily available across the network, even if the original producer is not reachable. However, in the Internet of Things (IoT), where memory is often severely limited, nodes cannot simply cache any and all content they receive, necessitating an increased reliance on caching strategies that offer heuristics on when to cache incoming content and which cached content to replace when the cache is full. In this paper, we discuss several existing ICN caching and cache replacement strategies as well as metrics suitable for evaluating them in an IoT context. We then evaluate multiple different strategies using IoT devices in a large testbed. Our experimental results show that simple stateless caching policies can perform equally well or sometimes even better than other, more complex schemes. This result is encouraging as it implies that it is indeed possible to employ effective ICN caching even in resource-constrained IoT nodes. To the best of our knowledge, this paper is the first to perform such an evaluation using actual IoT hardware in a realistic deployment.
-
12:30pm - 2:00pm Lunch
Room: Atrium
- Lunch
-
2:00pm - 3:30pm Technical Session 3: Routing and Transport
Session Chair: Börje Ohlman
Room: 102
- Technical Session 3: Routing and Transport
-
Hila Ben Abraham (Washington University in St. Louis), Jyoti Parwatikar (Washington University in St. Louis), John DeHart (Washington University in St. Louis), Adam Drescher (Washington University in St. Louis), Patrrick Crowley (Washington University in St. Louis)
Abstract: The power of Information-Centric Networking (ICN) architectures lies in their abstraction for communication — the request for named data. This abstraction promises that applications can choose to operate only in the information plane, agnostic to the mechanisms implemented in the connectivity plane. However, despite this powerful promise, the information and connectivity planes are presently coupled in today’s incarnations of leading ICNs by a core architectural component, the forwarding strategy. Presently, this component is not sustainable: it implements both the information and connectivity mechanisms without specifying who should choose a forwarding strategy — an application developer or the network operator. In practice, application developers can specify a strategy only if they understand connectivity details, while network operators can assign strategies only if they understand application expectations. In this paper, we define the role of forwarding strategies, and we introduce Information-Centric Transport (ICT) as an abstraction for cleanly decoupling the information plane from the connectivity plane. We discuss how ICTs allow applications to operate in the information plane, concerned only with namespaces and trust identities, leaving network node operators free to deploy whatever strategy mechanisms make sense for the connectivity that they manage. To illustrate the ICT concept, we demonstrate ICT-Sync and ICT-Notify. We show how these ICTs 1) enable applications to operate regardless of connectivity details, 2) are designed to satisfy a predefined set of application requirements and are free from application-specifics, and 3) can be deployed by network operators where needed, without requiring any change to the application logic.
-
Onur Ascigil (University College London), Sergi Rene (University College London), Ioannis Psaras (University College London), George Pavlou (University College London)
Abstract: Information-centric Networking (ICN) is a future Internet architecture design, where application-level names are directly used to route interests to fetch a copy of the desired content/data from any location. Following the conventions of the Internet Protocol to store the pre-computed routing/forwarding state for all prefixes at the network nodes raises scalability concerns in ICN (where content name prefixes need to be stored), especially at the inter-domain level. Instead, we consider the other extreme; that is, On-Demand Routing (ODR) computation for content name prefixes as interests arrive. ODR makes use of domain-level, per-prefix routing instructions usable by all the forwarders in a domain, named Routing Information Objects (RIO). Forwarders discover and retrieve RIOs in a similar way as content and can be cached in a new data structure called Route Information Store (RIS). RIOs are handed to a routing strategy module to perform a routing decision before relaying the packets. We demonstrate through extensive simulations that ODR scales the storage of routing/forwarding information through caching and information discovery—two mechanisms inherent to the ICN design. We propose our design as an extension of the Named Data Networking (NDN) architecture and discuss all the proposed enhancements in detail.
-
Junghwan Song (Seoul National University), Munyoung Lee (Electronics and Telecommunications Research Institute), Ted "Taekyoung" Kwon (Seoul National University)
Abstract: In this paper, we focus on multi-path transport layer mechanisms of ICN. We first provide the comprehensive analysis of design criteria and possible solutions for designing multi-path Interest forwarding and congestion control mechanisms. We then propose a Subflow-level Multi-path Interest Control (SMIC) scheme to enhance the performances of content deliveries over multiple paths, while achieving throughput-friendliness with single path flows (controlled by TCP-like congestion control). Simulation results show that SMIC shortens the content retrieval time compared to other multi-path transport schemes in ICN, achieves the throughput-friendliness with single-path flows, and mitigates the traffic load imbalance among the network links.
-
3:30pm - 4:00pm Coffee Break
Room: Atrium
- Coffee Break
-
4:00pm - 6:00pm Posters and Demos
Room: Atrium/136/138
- Posters and Demos
-
Includes coffee break, time will be announced.
-
7:00pm - 11:00pm Conference Banquet
-
-
The Conference Banquet will take place at the Museum of Science. Please visit the Social Events section for further information.
-
9:00am - 10:30am Technical Session 4: Security and Privacy
Session Chair: Lan Wang
Room: 102
- Technical Session 4: Security and Privacy
-
Christian Tschudin (University of Basel)
Abstract: In Information Centric Networking (ICN), data items are made accessible through their name rather than their storage location. We extend this storage abstraction and complement it via a name lookup service for retrieving the latest version of a name binding in order to implement abstract data types (ADT), specifically “append- only logs” and “mutable key-value stores”. Moreover, we make these data types scalable by choosing implementation techniques known as CRDTs (conflict-free replicated data types) and we use end-to-end encryption for protecting the content and structure against untrusted storage providers and forwarding elements. In this paper we describe our architecture, the interface to the ADTs and report on a prototype implementation for the cloud that is inspired by a real Fintech use case.
-
Kentaro Kita (Osaka University), Yoshiki Kurihara (Osaka University), Yuki Koizumi (Osaka University), Toru Hasegawa (Osaka University)
Abstract: Location-based services, which provide services based on locations of consumers’ interests, are becoming essential for our daily lives. Since the location of a consumer’s interest contains private information, several studies propose location privacy protection mechanisms using an anonymizer, which sends queries specifying anonymous location sets, each of which contains k − 1 locations in addition to a location of a consumer’s interest, to an LBS provider based on the k-anonymity principle. The anonymizer is, however, assumed to be trusted/honest, and hence it is a single point of failure in terms of privacy leakage. To address this privacy issue, this paper designs a semi-honest anonymizer to protect location privacy in NDN networks. This study first reveals that session anonymity and location anonymity must be achieved to protect location privacy with a semi-honest anonymizer. Session anonymity is to hide who specifies which anonymous location set and location anonymity is to hide a location of a consumer’s interest in a crowd of locations. We next design an architecture to achieve session anonymity and an algorithm to generate anonymous location sets achieving location anonymity. Our evaluations show that the architecture incurs marginal overhead to achieve session anonymity and anonymous location sets generated by the algorithm sufficiently achieve location anonymity.
-
Noor Abani (UCLA), Torsten Braun (University of Bern), Mario Gerla (UCLA)
Abstract: In-network caching is a feature shared by all proposed Information Centric Networking (ICN) architectures as it is critical to achieving a more efficient retrieval of content. However, the default "cache everything everywhere" universal caching scheme has caused the emergence of several privacy threats. Timing attacks are one such privacy breach where attackers can probe caches and use timing analysis of data retrievals to identify if content was retrieved from the data source or from the cache, the latter case inferring that this content was requested recently. We have previously proposed a betweenness centrality based caching strategy to mitigate such attacks by increasing user anonymity. We demonstrated its efficacy in a transit-stub topology. In this paper, we further investigate the effect of betweenness centrality based caching on cache privacy and user anonymity in more general synthetic and real world Internet topologies. It was also shown that an attacker with access to multiple compromised routers can locate and track a mobile user by carrying out multiple timing analysis attacks from various parts of the network. We extend our privacy evaluation to a scenario with mobile users and show that a betweenness centrality based caching policy provides a mobile user with path privacy by increasing an attacker’s difficulty in locating a moving user or identifying his/her route.
-
10:30am - 11:00am Coffee Break
Room: Atrium
- Coffee Break
-
11:00am - 12:00pm Technical Session 5: Mobility
Session Chair: Cedric Westphal
Room: 102
- Technical Session 5: Mobility
-
Xavier Mwangi (MIT), Karen Sollins (MIT)
Abstract: In this paper, we present MNDN (Mobile NDN), a scalable design for mobility support of producers in the Named Data Network (NDN) architecture. The approach in this work is to separate concerns of scalability and mobility, noting that there are two aspects to mobility: 1) discovery that a part of the namespace can be mobile; 2) discovery of where that part of the namespace is currently attached to the network. This separation leads to the observation that the information for these two aspects have different performance requirements, driving us to a partitioned design, basing the scalability component of the design on NDN’s SNAMP and the mobility support on MobilityFirst’s DMap. The combination of these two components yields a mobility solution that allows NDN’s forwarding to operate and scale in the face of mobile clients and producers.
-
Yu Zhang (Harbin Institute of Technology), Zhongda Xia (Harbin Institute of Technology), Spyridon Mastorakis (UCLA), Lixia Zhang (UCLA)
Abstract: In Named Data Networking (NDN), mobility of data consumers is natively supported by the stateful forwarding plane. However, additional mechanisms are needed, so that requests for data can be forwarded toward a mobile data producer. In this paper, we present KITE, a trace-based producer mobility support that further exploits the stateful forwarding plane of NDN. KITE takes a soft-state approach to create a hop-by-hop path between a reachable rendezvous server and a mobile producer through authenticated Interest-Data exchanges. KITE is locator-free, transparent to data retrieval and routing, and abuse-proof. We show how KITE supports various mobile communication scenarios, and name-based rendezvous at the network layer. A KITE prototype is implemented and evaluated.
-
12:00pm - 1:00pm Lunch
Room: Atrium
- Lunch
-
1:00pm - 2:00pm Keynote
Room: 102
- Keynote
-
Computer Scientists and the Law: The vital need for technical community leadership on privacy, security and law enforcement public policy challenges
Daniel J. Weitzner (MIT)
Abstract: The extraordinarily rapid growth of the Internet globally -- from the very first commercial users in 1992 to 4 billion users (over half of the world’s population) just 25 years later in 2017 -- has presented a number of challenges in law and policy. Confusion over how to proceed on Issues such as online privacy, cybersecurity, the role of law enforcement and copyright protection leaves many claiming that the law is behind the technology and a few, mostly from government, claiming that the technology is behind the law. In reality, legal and technical discussions of these issues proceed on largely non-overlapping paths, with each community feeling that it is going in circles. This talk will explore three specific technology policy questions -- online copyright protection, individual privacy and law enforcement interaction with encryption -- to illustrate the current gaps in the policy debate and how the technical community can come together to inform that discussion toward more comprehensive policy solutions.
Bio: Daniel J. Weitzner is the Founding Director of the MIT Internet Policy Research Initiative and Principal Research Scientist at the MIT Computer Science and Artificial Intelligence Lab. His group studies the relationship between network architecture and public policy, and develops new Web architectures to meet policy challenges such as privacy and intellectual property rights. He teaches Internet public policy in the MIT Electrical Engineering and Computer Science Department.
From 2011-2012, Weitzner was the United States Deputy Chief Technology Officer for Internet Policy in the White House, where he lead initiatives on online privacy, cybersecurity, Internet copyright, and trade policies to promote the free flow of information. He also was Associate Administrator for Policy at the United States Commerce Department National Telecommunications and Information Administration (NTIA).
Weitzner was a member of the Obama-Biden Presidential Transition Team. Weitzner has been a leader in the development of Internet public policy from its inception, making fundamental contributions to the successful fight for strong online free expression protection in the United States Supreme Court, crafting laws that provide protection against government surveillance of email and web browsing data. His work on US legislation limiting the liability of Internet Service Providers laid the foundations for social media services and supporting the global free flow of information online.
Weitzner’s computer science research has pioneered the development of Accountable Systems architecture to enable computational treatment of legal rules and automated compliance auditing. At the World Wide Web Consortium, he lead the development of security and privacy standards, and Linked Data architectures now used to make data on the Web easier to analyze.
While at MIT he launched the Web Science Research Initiative with Tim Berners-Lee, Wendy Hall, Nigel Shadbolt and James Hendler, a cross-disciplinary research initiative promoting research on the technical and social impact of the Web. Before joining MIT, Weitzner was founder and Deputy Director of the Center for Democracy and Technology, and Deputy Policy Director of the Electronic Frontier Foundation. He has testified before the United States Congress, the European Commission, and leading international bodies.
Weitzner has law degree from Buffalo Law School, and a B.A. in Philosophy from Swarthmore College. His writings have appeared in Science magazine, the Yale Law Review, Communications of the ACM, the Washington Post, Wired Magazine and Social Research. In 2012 he was named to the Newsweek/Daily Beast Digital Power Index as a top Navigator of global Internet public policy. He received the International Association of Privacy Professionals Leadership Award in 2013.
-
2:00pm - 2:30pm Coffee Break
Room: Atrium
- Coffee Break
-
2:30pm - 4:30pm Technical Session 6: Routing and Transport II, Applications
Session Chair: Dirk Kutscher
Room: 102
- Technical Session 6: Routing and Transport II, Applications
-
Mauro Sardara (Cisco Systems), Luca Muscariello (Cisco Systems), Alberto Compagno (Cisco Systems)
Abstract: In this paper we present the design of a transport layer and socket API that can be used in several ICN architectures such as NDN, CCN and hICN. The current design makes it possible to expose an API that is simple to insert in current applications and easy to use to develop novel ones. The proliferation of connected applications for very different use cases and services with wide spectrum of requirements suggests that several transport services will coexist in the Internet. This is just about to happen with QUIC, MPTCP, LEDBAT as the most notable ones but is expected to grow and diversify with the advent of applications for 5G, IoT, MEC with heterogeneous connectivity. The advantages of ICN have to be measurable from the application, end-services and in the network, with relevant key performance indicators. We have implemented an high speed transport stack with most of the designed features that we present in this paper with extensive experiments and benchmarks to show the scalability of the current systems in different use cases.
-
Antonio Rodrigues (Carnegie Mellon University, USA and University of Porto, Portugal), Peter Steenkiste (Carnegie Mellon University, USA), Ana Aguiar (Faculdade de Engenharia da Universidade do Porto, Portugal)
Abstract: One of ICN’s main challenges is attaining forwarding table scalability when confronted with a huge content space. This is specially true in flat ID architectures, which do not naturally support route aggregation for hierarchical names. Previous work has proposed improving scalability by aggregating content names in a fixed-size Bloom Filters (BF). However, the negative impact of false positive (FPs) matches on forwarding correctness and performance has not been studied thoroughly. In this paper, we study the end-to-end network performance of BF-based forwarding. We devise an analytical model that accurately models BF-based forwarding and the flow of BF-based packets over inter-domain topologies. Using this model, we show that the use of BFs for packet forwarding puts feasibility at odds with scalability. Based on our analysis, we propose and evaluate several strategies to improve the feasibility of BF-based forwarding and examine different scenarios for which BF-based forwarding is suitable.
-
Cenk Gündoğan (HAW Hamburg), Peter Kietzmann (HAW Hamburg), Martine Lenders (FU Berlin), Hauke Petersen (FU Berlin), Thomas C. Schmidt (HAW Hamburg), Matthias Wählisch (FU Berlin)
Abstract: This paper takes a comprehensive view on the protocol stacks that are under debate for a future Internet of Things (IoT). It addresses the holistic question of which solution is beneficial for common IoT use cases. We deploy NDN and the two popular IP-based application protocols, CoAP and MQTT, in its different variants on a large-scale IoT testbed in single- and multi-hop scenarios. We analyze the use cases of scheduled periodic and unscheduled traffic under varying loads. Our findings indicate that (a) NDN admits the most resource-friendly deployment on nodes, and (b) shows superior robustness and resilience in multi-hop scenarios, while (c) the IP protocols operate at less overhead and higher speed in single-hop deployments. Most strikingly we find that NDN-based protocols are in significantly better flow balance than the UDP-based IP protocols and require fewer corrective actions.
-
Teng Liang (The University of Arizona), Ju Pan (The University of Arizona), Beichuan Zhang (The University of Arizona)
Abstract: A major challenge to potential ICN/NDN deployment is the requirement of application support, namely, applications need to be rewritten or modified in order to run on NDN networks and receive the full benefits. Using a proxy to translate between an application-level protocol and NDN offers a viable solution that balances between development cost and architectural benefits. In this paper, we study on the questions of how to facilitate and incentivize the development and deployment of such protocol translation proxies. We propose to enable existing applications to communicate “off the grid”, i.e., using only local network connectivity without the global Internet, by translating between conventional client- server protocols and NDN. This provides deployment incentives by enabling a useful feature with no or minimal changes to existing applications. By giving the experience of a few protocols, we hope to abstract out some common design patterns that can be reused in developing other application-level proxies. This paper reports our work on IMAP/NDN translation for local email access and XMPP/NDN translation for local group chat. Based on this work, we identify and discuss a number of common design issues including application-level framing, namespace design, application protocol semantics, multiparty synchronization, security and privacy, and real-world deployment challenges.
-
4:30pm - 5:30pm Panel discussion
Room: 102
- Panel discussion
-
Panelists: Dave Oran (Network Systems Research and Design), Karen Sollins (MIT), Marie-Jose Montpetit (Triangle Video), Christian Tschudin (University of Basel), Lixia Zhang (UCLA).
Abstract: The pull-based data delivery mechanism initiated by the data consumer has been the preferred design in NDN. However, different upcoming applications depending on Internet of Things, cyber-physical systems, and edge computing may require other data delivery mechanisms driven by the needs of the application, e.g., regular updates from sensors in smart homes, urgent messages generated in the smart grid or autonomous vehicle networks. Other mechanisms, such as publish-subscribe and payloaded interests have been proposed in the literature, but most of these designs are in silos. There is a need for the community to have a discussion and converge to move forward together on potential designs.
-
5:30pm - 5:45pm Closing
Room: 102
- Closing
List of Accepted Posters
-
Cenk Gündoğan (HAW Hamburg), Peter Kietzmann (HAW Hamburg), Thomas C. Schmidt (HAW Hamburg), Matthias Wählisch (FU Berlin)
Abstract: This paper introduces stateless and stateful header compression to support small MTUs typical for low-power link layers in the Internet of Things. We evaluate our proposals on the multi-hop IoT-Lab testbed and show significant overhead reductions for NDN.
-
Kalika Suksomboon (KDDI Research Inc.), Kazuaki Ueda (KDDI Research Inc.), Atsushi Tagami (KDDI Research, Inc.)
Abstract: This paper proposes a content-centric privacy (CCP) model that enables a privacy-preserving monitoring services in surveillance systems without cloud dependency. We design a simple yet powerful method that could not be obtained from a cloud-like system. The CCP model includes two key ideas: (1) the separation of the private data (i.e., target object images) from the public data (i.e., background images), and (2) the service authentication with the classification model. Deploying the CCP model over ICN enables the privacy central around the content itself rather than relying on a cloud system. Our preliminary analysis shows that the ICN-based CCP model can preserve privacy with respect to the W 3 -privacy in which the private information of target object are decoupled from the queries and cameras.
-
Thanh Dinh (Soongsil University), Younghan Kim (Soongsil University)
Abstract: One of ICN’s main advantages is that content can be retrieved from the content store (CS) of intermediate nodes, instead of original servers. However, CS information is not considered in the data plane of current native ICN routing protocols (i.e., in NDN and CCNx) in which Interest packets are forwarded mainly using forwarding information base (FIB). FIB is built based on name prefixes registered by content producers, lists next hops to name prefixes and use that information to forward Interests towards the producers. CS information at a node is used only to check the availability of the requested content at the local node on the routing path toward the producers, not to route Interest packets. This paper highlights the importance of CS information in routing and proposes N-hop CS-based caching policy and routing protocol. The main ideas are that based on the caching storage capacity and expected network performance, the caching policy encourages to cache popular content objects within N hops from consumers. The routing protocol exploits CS information of N-hops neighbors to route Interest packets toward nearby nodes which have the requested content, instead of toward producers.
-
Paulo Mendes (COPELABS, University Lusófona), Rute Sofia (COPELABS, University Lusófona), Vassilis Tsaoussidis (Democritus University of Thrace), Sotiris Diamantopoulos (Democritus University of Thrace), Christos-Alexandros Sarros (Democritus University of Thrace)
Abstract: This poster describes DABBER, a protocol developed to extend the reach of Named Data Networking into wireless environments. Our key contribution lies in the fact that DABBER supports communication in opportunistic wireless environments by relying on data reachability metrics that take into consideration availability and centrality of adjacent nodes, as well as the availability of different data sources. The poster provides an overview to the DABBER architecture, and of the available open-source implementation.
-
Mikiya Yoshida (University of Kitakyushu), Yusuke Ito (University of Kitakyushu), Yurino Sato (National Institute of Technology, Sasebo College), Hiroyuki Koga (University of Kitakyushu)
Abstract: Content-centric networking (CCN) promises efficient content delivery services with in-network caching. To improve cache efficiency, some approaches that efficiently distribute and obtain various caches over a domain, have been proposed. However, the time needed to obtain content gets longer in larger scale networks. We therefore propose an efficient cluster-based cache distribution scheme to improve the time needed to obtain content as well as cache efficiency. We evaluate the effectiveness of this approach through simulation.
-
Junji Takemasa (Graduate School of Information Science and Technology, Osaka University), Yuki Koizumi (Graduate School of Information Science and Technology, Osaka University), Toru Hasegawa (Graduate School of Information Science and Technology, Osaka University)
Abstract: This paper analyzes mutual exclusion overhead caused by Pending Interest Table (PIT) updates on multi-core Named Data Networking (NDN) software routers. The analysis reveals that an instruction to make the mutual exclusion atomic results in a bottleneck for high speed forwarding.
-
Zhiyi Zhang (UCLA), Edward Lu (UCLA), Yanbiao Li (UCLA), Lixia Zhang (UCLA), Tianyuan Yu (Sichuan University), Davide Pesavento (NIST), Junxiao Shi (NIST), Lotfi Benmohamed (NIST)
Abstract: The Named Data Networking (NDN) architecture provides simple solutions to the communication needs of Internet of Things (IoT) in terms of ease-of-use, security, and content delivery. To utilize the desirable properties of NDN architecture in IoT scenarios, we are working to provide an integrated framework, dubbed NDNoT, to support IoT over NDN. NDNoT provides solutions to auto configuration, service discovery, data-centric security, content delivery, and other needs of IoT application developers. Utilizing NDN naming conventions, NDNoT aims to create an open environment where IoT applications and different services can easily cooperate and work together. This poster introduces the basic components of our framework and explains how these components function together.
-
Susmit Shannigrahi (Colorado State University), Chengyu Fan (Colorado State University), Christos Papadopoulos (Colorado State University)
Abstract: The point-to-point resource reservation solutions over IP networks are often end-to-end, and data flowing through these reserved tunnels are not reusable. As a result, the in-network resources are not optimally utilized. Information Centric Networking (ICN) has several properties that can more intelligently facilitate resource reservations. In this paper, we present Strategic Caching And Reservation in ICN (SCARI) for reserving resources on ICN networks. Preliminary simulation results indicate that SCARI can reduce bandwidth consumption and free up network resources by aggregating reservation requests and strategically caching content in the network.
-
Susmit Shannigrahi (Colorado State University), Chengyu Fan (Colorado State University), Christos Papadopoulos (Colorado State University), Alex Feltus (Clemson University)
Abstract: Genomics datasets are currently managed by iRODS, the Integrated Rule-Oriented Data System, which is an open source data management software. iRODS provides several services, including indexing, publishing, integrity, storage, and provenance. In this work, we investigate how NDN can seamlessly integrate into iRODS to provide simplified and improved functionality such as name-based data discovery, replication, retrieval, and computation at the edge. We show how to integrate these NDN based mechanisms as well as caching into iRODs. Once completely functional, we aim to study NDN's benefits in a live, production system with real users.
-
Arthi Padmanabhan (UCLA), Lan Wang (University of Memphis), Lixia Zhang (UCLA)
Abstract: Named Data Networking (NDN) proposes a fundamental architectural change to the Internet, moving from point-to-point communication to a data-centric model. NDN-enabled nodes can communicate over any substrate that can deliver datagrams, such as layer-2 links (WiFi, BLE, Ethernet, etc.) and IP/UDP/TCP tunnels over IP connectivity. However in the latter case, NDN-enabled nodes must be able to discover the presence of each other and the data each serves in an automated way. This poster describes the design of an NDN Neighbor Discovery service (NDND), which enables isolated NDN nodes to discover each other and interconnect through tunneling over IP connectivity.
-
Tianxiang Li (UCLA), Spyridon Mastorakis (UCLA), Xin Xu (UCLA), Haitao Zhang (UCLA), Lixia Zhang (UCLA)
Abstract: Intermittent connectivity and dynamic network topology create unique challenges for distributed applications in Mobile Ad Hoc Networks (MANETs), where individual entities may produce data at any time while moving around continuously. In this poster, we present DDSN, a distributed dataset synchronization protocol in Named Data Networking (NDN) that enables applications in MANETs to keep all members in an application group synchronized on the latest state of a shared dataset. Taking intermittent connectivity as the norm, whenever nodes in the same application group are reachable to each other, DDSN provides an efficient mechanism to unify the shared state and dataset between the encountered nodes.
List of Accepted Demos
-
Atsushi Tagami (KDDI Research, Inc.), Kazuaki Ueda (KDDI Research, Inc.), Rikisenia Lukita (KOZO KEIKAKU ENGINEERING Inc.), Jacopo De Benedetto (University of Goettingen), Mayutan Arumaithurai (University of Goettingen), Giulio Rossi (University of Rome "Tor Vergata"), Andrea Detti (University of Rome "Tor Vergata")
Abstract: This demonstration shows the use of ICN for tile-based panoramic video streaming. To reduce the bandwidth usage, tiles are encoded with different qualities. Tiles having a valuable impact on user QoE are fetched by the client at high quality, the others at low quality. A well-known drawback of having a video with multiple qualities is the reduction of the cache hit probability, since clients can single out different quality for a same tile. To cope this problem, we introduce transcoding functionality on edge nodes, which exploits ICN routing by name for edge processing implementation.
-
Michał Król (University College London), Adrian-Cristian Nicolaescu (University College London), Sergi Reñé (University College London), Onur Ascigil (University College London), Ioannis Psaras (University College London), David Oran (Network Systems Research & Design), Dirk Kutscher (Huawei)
Abstract: This demo shows an implementation of a computation-centric architecture over NDN. The system is able to perform in-network load balancing of incoming computation requests, reliably authenticate consumers and allow them to submit large payloads without routable prefixes. The system is able to migrate requested function in a form of unikernels where they are needed, follows ICN pull-based model and introduces only minimal changes to the NDN stack.
-
Mauro Sardara (Cisco Systems Inc.), Luca Muscariello (Cisco Systems Inc.), Alberto Compagno (Cisco Systems Inc.)
Abstract: In this demonstration, we showcase a transport layer and socket API that can be used in several ICN architectures such as NDN, CCN and hICN. The current design follows the successful BSD socket approach: a simple API that can be easily inserted in current applications and used to develop novel ones. In the PoC, we compare the performance of some of the transport services provided by both our transport layer and the today’s transport layer: reliable communication, data segmentation and reassembly, data integrity. Moreover, we show the benefits of adopting our transport layer in existing application in terms of CPU load reduction and a lower memory consumption.
-
Damian Coomes (University of Memphis), Ashlesh Gawande (University of Memphis), Nicholas Gordon (University of Pittsburgh), Lan Wang (University of Memphis)
Abstract: Named Data Networking (NDN) thrives in use cases that require mobile peer-to-peer data sharing. To amplify interests in NDN research, we developed an NDN multimedia sharing application for mobile devices that mirrors the popular Snapchat app. Our research focuses on (1) creating a completely decentralized application, (2) exploring new trust models; and (3) using a new synchronization protocol that allows for synchronization of subsets of data. Our demo will show the basic flow of the application, from making friends to publishing and fetching files between Android devices.
-
Asit Chakraborti (Huawei Research Center), Syed Obaid Amin (Huawei Research Center), Aytac Azgin (Huawei Research Center), Satyajayant Misra (New Mexico State University), Ravishankar Ravindran (Huawei Research Center)
Abstract: We demonstrate 5G network slicing as a unique deployment opportunity for information centric networking (ICN), by using a generic service orchestration framework that operates on commodity compute, storage, and bandwidth resource pools to realize ICN service slices. In this demo, we specifically propose a service slice for the IoT Edge network. ICN has often been considered pertinent for IoT use due to its benefits like simpler stacks on resource constrained devices, in-network caching, and in-built data provenance. We use a lightweight ICN stack on IoT devices connected with sensors and actuators to build a network, where clients can set realistic policies using their legacy hand-held devices. We employ name based authentication protocols between the service end-points and IoT devices to allow secure onboarding. The IoT slice co-exists with other service slices that cater to different classes of applications (e.g., bandwidth intensive applications, such as video conferencing) allowing resource management flexibility. Our design creates orchestrated service Edge functions to which the clients connect, and these can in turn utilize in-network stateless functions to perform tasks, such as decision making and analytics using the available compute resources efficiently.
-
Andriana Ioannou (Tara Hill National Park Teo), Flannan O Coileain (Tara Hill National Park Teo), Diarmuid Collins (Trinity College Dublin), Yi Zhang (Trinity College Dublin), Beiran Chen (Freelance Android Developer)
Abstract: This demo provides a comparison between the content-oriented Named-Data Networking (NDN) architecture supported by cache cloudlets, called CLONE, and the existing location-oriented TCP/IP architecture. CLONE aims to address the challenges of poor mobile network coverage and/or high data roaming charges for tourists at remote tourist sites. To achieve this, CLONE places cloudlets at the edge of an NDN network, close to end-users. The comparison between CLONE and TCP/IP is based on the Discover Places Android application, a virtual tour guide that delivers both audio and visual content to tourists in popular locations in Ireland. This demo aims to explore the Quality-of-Experience (QoE) of end-users under both network architectures over the 2G, LTE and Wi-Fi technologies.
-
Cenk Gündoğan (HAW Hamburg), Peter Kietzmann (HAW Hamburg), Thomas C. Schmidt (HAW Hamburg), Matthias Wählisch (FU Berlin)
Abstract: In this demo, we showcase our NDN based Publish–Subscribe scheme HoPP in a multi-hop low-power and lossy IoT deployment using constrained devices that operate RIOT. These devices publish temperature sensor readings and subscribe to fan control commands. We manually induce network disruptions to illustrate a seamless publisher and subscriber mobility with HoPP. A web-based dashboard highlights the network resilience and visualizes topology maintenance as well as traffic flows.
-
Dennis Grewe (Robert Bosch GmbH), Claudio Marxer (University of Basel), Christopher Scherb (University of Basel), Marco Wagner (Robert Bosch GmbH), Christian Tschudin (University of Basel)
Abstract: Recently, vehicle-to-vehicle (V2V) and vehicle-to-infrastructure (V2I) connectivity transitioned from a vision of the future to reality. Applications in such environments vary from local propagation of road conditions to large-scale traffic flow control systems. In this demo, we present a network stack for the data exchange in the automotive IoT, based on the Named Function Networking (NFN) principles. In NFN, the communication model is not restricted to propagation of static data but natively supports computation-offloading to other nodes. We present solutions and report on experiments with real cars on a test course.
