ACM ICN 2020, Montreal, Canada
MENU

7th ACM Conference on Information-Centric Networking (ICN 2020)

Preliminary Conference Program

Kindly note that the schedule below is tentative and subject to updates.

Conference Schedule at a Glance

Schedule

  • Tuesday, September 29, 2020

  • 1pm - 7pm UTC: Tutorial day with afternoon tutorials in parallel

  • 1pm - 4pm UTC Tutorial: Online Learning for Data Caching and Network Service Delivery

  • 4pm - 7pm UTC Tutorial: Fed4FIRE: A federation of testbeds for hands-on experimentation

  • 4pm - 7pm UTC Tutorial: Practical NDN Application Development and Seamless Deployment

  • Wednesday, September 30, 2020

  • 1:30pm - 2pm UTC: Welcome Session

    Session Chair: General Chairs, PC Chairs, ...

  • 2pm - 2:50pm UTC: Keynote

  • Keynote: The Economics of Content Delivery

    Bruce Maggs (Emerald Innovations / Duke)


    Abstract: This talk examines the economics of commercial content-delivery networks (CDNs). It begins with a review of the technical infrastructure and mechanisms deployed by CDNs, and examines the rationale behind recent trends such as whole-site delivery by CDNs. It then delves into the flow of money between the various parties involved in content delivery, including content providers, end users, CDNs, CDN brokers, network operators, and hosting services, emphasizing which services have become most "commoditized," where competition is based primarily on price. Finally, the talk speculates on the implications of these economic factors on successful applications of information-centric networking.

     

    Bio:
    Bruce Maggs received the S.B., S.M., and Ph.D. degrees in computer science from the Massachusetts Institute of Technology in 1985, 1986, and 1989, respectively. His advisor was Charles Leiserson. After spending one year as a Postdoctoral Associate at MIT, he worked as a Research Scientist at NEC Research Institute in Princeton from 1990 to 1993. In 1994, he moved to the Computer Science Department at Carnegie Mellon, where he achieved the rank of full Professor. While on a two-year leave-of-absence from Carnegie Mellon, Maggs was a founding employee of Akamai Technologies, serving as its first Vice President for Research and Development. In 2009, Maggs joined Duke University, where he is the Pelham Wilder Professor of Computer Science. In 2018 he was part of a large team that received the inaugural ACM SIGCOMM Networking Systems Award for the Akamai Content Distribution Network, and was named an ACM Fellow. Maggs is currently on leave from Duke and is serving as Director of Engineering for Emerald Innovations.

     

  • 2:50pm - 3pm UTC: Virtual Coffee Break

  • 3pm - 4:20pm UTC: Paper Session 1: In-Network Computing & Naming

  • ENDN: An Enhanced NDN Architecture with a P4-programmable Data Plane

    Ouassim Karrakchou, Nancy Samaan, and Ahmed Karmouch (University of Ottawa)

    • Abstract:

      Named data networking (NDN) is a content-centric future Internet architecture that uses routable content names instead of IP addresses to achieve location-independent forwarding. Nevertheless, NDN’s design is limited to offering hosted applications a simple content pull mechanism. As a result, increased complexity is needed in developing applications that require more sophisticated content delivery functionalities (e.g., push, publish/subscribe, streaming, generalized forwarding, and dynamic content naming). In this paper, we introduce a novel Enhanced NDN (ENDN) architecture that offers an extensible catalog of content delivery services (e.g., adaptive forwarding, customized monitoring, and in-network caching control) that can be programmed in the data plane using customizable P4 programs. More precisely, the proposed architecture allows hosted applications to associate their content namespaces with a set of services offered by the ENDN control plane. The controller then configures the data plane, which is comprised of two main modules: the enhanced packet processing and the forwarding logic modules. The former parses the packets and queries the enhanced content-based forwarding tables to generate a set of metadata fields used by P4 functions. The latter module is a novel P4 target architecture that executes these P4 functions on the arriving packets. The new architecture extends existing P4 models to overcome their limitations with respect to processing string-based content names. It also allows running independent P4 functions in isolation, thus enabling P4 code run-time pluggability. Experimental results demonstrate the ability of ENDN to achieve network efficiency with low latency.

       

  • What’s in a Name? Naming Big Science Data in Named Data Networking

    Susmit Shannigrahi (Tennessee Technological University) and Chengyu Fan and Craig Partridge (Colorado State University)

    • Abstract:

      Data naming is the most critical construct of Named Data Networking (NDN). The way a piece of content is named has profound impacts on content discovery, routing of user requests, data retrieval, and security. Besides, the naming of individual pieces of content seriously affects how the network behaves. While names are ubiquitous in NDN, the design choices for content names and how they affect the network have largely been overlooked. NDN applications and protocols usually name content to fit their particular application scenarios, often derived from existing naming conventions. However, these ad-hoc naming schemes often ignore the impact of these names on the network and the applications themselves. Drawing upon our experience in applying NDN to multiple science domains, we point out different exiting naming schemes in scientific communities, how we translated these names into NDN names, and the effect of naming on the network. Based on these observations, we provide a set of naming guidelines for future scientific applications and network operators supporting those applications.

       

  • Result Provenance in Named Function Networking

    Claudio Marxer and Christian Tschudin (University of Basel)

    • Abstract:

      Data chunks with names bound to them are "first-class citizens" in information-centric networks. The main service such a network provide to its users is the resolution of names to the associated data. A named function network (NFN) extends this service and also resolves on-demand computation expressions composed from named data and functions. The resolution of computation expressions is completely transparent to the user which makes it very convenient for application developers, however, also means the whole network becomes a black box that must be trusted totally. In this work we augment NFN with a datastructure that creates transparency about the genesis of every evaluation result. We show that this datastructure enables applications to single out results produced by dubious computing providers and further to maintain trust relationships with these.

       

  • 4:20pm - 4:30pm UTC: Virtual Coffee Break

  • 4:30pm - 5:50pm UTC: Paper Session 2: Routing & Forwarding

  • NDN-DPDK: NDN Forwarding at 100 Gbps on Commodity Hardware

    Junxiao Shi, Davide Pesavento, and Lotfi Benmohamed (National Institute of Standards and Technology)

    • Abstract:

      Since the Named Data Networking (NDN) data plane requires name-based lookup of potentially large tables using variable-length hierarchical names as well as per-packet state updates, achieving high-speed NDN forwarding remains a challenge. In order to address this gap, we developed a high-performance NDN router capable of reaching forwarding rates higher than 100 Gbps while running on commodity hardware. In this paper we present our design and discuss its tradeoffs. We achieved this performance through several optimization techniques that include adopting better algorithms and efficient data structures, as well as making use of the parallelism offered by modern multi-core CPUs and multiple hardware queues with user-space drivers for kernel bypass. Our open-source forwarder is the first software implementation of NDN to exceed 100 Gbps throughput while supporting the full protocol semantics. We also present the results of extensive benchmarking carried out to assess a number of performance dimensions and to diagnose the current bottlenecks in the packet processing pipeline for future scalability enhancements. Finally, we identify future work which includes hardware-assisted ingress traffic dispatching, dynamic load balancing across forwarding threads, and novel caching solutions to accommodate on-disk content stores.

       

  • On the Prefix Granularity Problem in NDN Adaptive Forwarding

    Teng Liang (the University of Arizona), Junxiao Shi (NIST), and Beichuan Zhang (University of Arizona)

    • Abstract:

      One unique architectural benefit of Named Data Networking (NDN) is adaptive forwarding, i.e., the forwarding plane is able to observe data retrieval performance of past Interests and use it to adjust forwarding decisions for future Interests. To be effective, adaptive forwarding assumes Interest Routing Locality, meaning that Interests sharing the same prefix are likely to follow a similar forwarding path within a short period of time. Therefore, past observations can provide insight into how forwarding will likely perform for the same prefix in the near future. Since Interests can have multiple common prefixes with different lengths, the real challenge is determining which prefix length should be used in adaptive forwarding to record path measurements - we refer to this as the Prefix Granularity Problem. The longer the common prefix is, the better Interest Routing Locality. However, finer grained-prefixes cover fewer Interests each and require a larger forwarding table. Existing adaptive forwarding designs use a static prefix length, which is known to encounter issues in the event of partial network failures. In this work, we propose to dynamically aggregate and de-aggregate name prefixes in the forwarding table in order to use the prefixes that are the most appropriate given current network situation. In addition, to reduce the overhead of adaptive forwarding, we propose mechanisms to minimize the use of longest prefix matching during the processing of Data packets. Simulations demonstrate that the proposed techniques can result in better forwarding decisions in the event of partial network failures with significantly reduced overhead.

       

  • Analyzing ICN Forwarding Performance on the Wire

    Adam Drescher, John DeHart, Jyoti Parwatikar, and Patrick Crowley (Washington University in St. Louis)

    • Abstract:

      Information Centric Networking (ICN) is growing in both popularity and maturity. Two highly-related architectures under the ICN umbrella, Content Centric Networking (CCNx) and Named Data Networking (NDN), received significant effort to improve their forwarding performance. Despite this focus, little work has been done to evaluate ICN forwarders in a comprehensive and rigorous manner. Furthermore, the preexisting literature in IP can only apply broadly due to the substantial differences between the architectures.

      In this paper, we provide a methodology to analyze the performance of ICN forwarders. Our testing methodology has two key focuses: (i) packet processing performance is the primary metric of exploration, as bytes are usually cheap; and (ii) the PIT, FIB, and Content Store are the primary structures to probe when considering performance impact. With these focuses in mind, we present a series of behavioral microbenchmarks that can probe the performance of CCNx/NDN forwarders in a rigorous way. To show the efficacy of these experiments, we apply them to the reference forwarders of the CCNx and NDN architectures, Metis and NFD, giving us a careful understanding of their performance characteristics. Additionally, these microbenchmarks should readily apply to high performance forwarders in the space.

       

  • 5:50pm - 6pm UTC: Virtual Coffee Break

  • 6pm - 8pm UTC: Poster and Demo Session

  • Real-time Digital Signatures for Named Data Networking

    Charalampos Katsis, Ankush Singla, and Elisa Bertino (Department of Computer Science, Purdue University)

    • Abstract:

      Digital signatures are a fundamental building block for ensuring integrity and authenticity of contents delivered by the Named Data Networking (NDN) systems. However, current digital signature schemes adopted by NDN open source libraries have a high computational and communication overhead making them unsuitable for high throughput applications like video streaming and virtual reality gaming. In this poster, we propose a real-time digital signature mechanism for NDN based on the offline-online signature framework known as Structure-free and Compact Real-time Authentication scheme (SCRA). Our signature mechanism significantly reduces the signing and verification costs and provides different variants to optimize for the specific requirements of applications (i.e. signing overhead, verification overhead or communication cost). Our experiments results show that SCRA is a suitable framework for latency-sensitive NDN applications.

       

  • Long-Range IoT: Is LoRaWAN an option for ICN?

    Peter Kietzmann (HAW Hamburg), Dirk Kutscher (Hochschule Emden/Leer), Thomas C. Schmidt (HAW Hamburg), and Matthias Wählisch (Freie Universität Berlin)

    • Abstract:

      In this poster, we discuss design options for a LoRaWAN and LoRa transmission system to employing Information-Centric Networking (ICN). ICN has been successfully applied to LoWPAN scenarios and can provide many benefits with respect to object-based security, performance, disruption tolerance and usability. Our findings indicate that the current LoRaWAN MAC layer is impractical for an ICN request-response with caching. We present ideas for a new MAC layer that harmonizes the long-range LoRa radios with ICN.

       

  • On economic, societal, and political aspects in ICN

    Pouyan Fotouhi Tehrani (Weizenbaum Institute / Fraunhofer FOKUS), Jochen Schiller (Freie Universität Berlin), Thomas Schmidt (HAW Hamburg), and Matthias Wählisch (Freie Universität Berlin)

    • Abstract:

      Information-centric networking (ICN), as an antithesis of host-centric networking, denotes a paradigm shift in communication networks. It introduces names to the network layer and favors de-localized content instead of addresses and hosts. ICN is an attempt to design a network tailored to demands of users who only care about data. The simplicity of this basic premise, however, turns out to be rather deceptive; a pitfall in waiting on the path of ICN to wide-scale deployment. Surely users care about data, but they also care about trust, accountability, private communication, and everything else that the current Internet provides beside mere content. This paper is a first attempt in pinpointing the missing non-technical aspects that are crucial to success of ICN as a viable replacement for the Internet.

       

  • CertCoalesce: Efficient Certificate Pool for NDN-Based Systems

    Sanjeev Kaushik Ramani and Alexander Afanasyev (Florida International University)

    • Abstract:

      Named Data Networking (NDN) relies on public key signing to ensure integrity and authenticity for all data packets fetched in the network. One of the considerations for reliability of such signing is limiting the scope (what the key can sign) and time (how long the key can sign) of the public keys and their certificates, usually referred to as “least privilege principle.” Traditionally, the public key certificates are issued for relative long periods of times measured in months or years; which requires considerations for certificate revocation, e.g, when the private key is lost or compromised. However, if the validity periods can be reduced to days or hours, the complex (and sometimes semi-broken) revocation mechanisms can be completely eliminated. This poster proposes such a mechanism—CertCoalesce certificates—to efficiently manage virtually unlimited pools of short-term certificates with limited networking, storage, and computational overheads. Specifically, a single certificate request with a “primary” key can be used to bootstrap the process of creating an unlimited number of short-term certificates for derivative private/public keys. Moreover, such certificates can be issued asynchronously—periodically pre-provisioned or upon request with an Interest—terminating issuance of future certificates when necessary. Moreover, CertCoalesce design owing to the underlying elliptic curve cryptography ensures that a compromised key from the pool of keys will not reveal information about other keys/certificates in the pool.

       

  • Chipmunk: Distributed Object Storage for NDN

    Yong Yoon Shin, Sae Hyong Park, and Namseok Ko (ETRI) and Arm Jeong (GurumNetworks)

    • Abstract:

      This demo shows an implementation of distributed object storage over NDN. It demonstrates how to reliably store and distribute data generated from sensors that do not have storage capability or generate large amounts of data. Chipmunk is an NDN based object storage system that leverages metadata that has data names and data locations to enable object storage service in a distributed system.

       

  • NDNDrop - Device Agnostic File Sharing Using NDN

    Nishant Sabharwal and Carlos Santillana (UCLA)

    • Abstract:

      We explore the Named Data Networking architecture by designing a file sharing app which can share files utilizing the network layer. This app demonstrates the usefulness of the NDN architecture in a small, standalone application which is an important step before widespread adoption. The app also highlights the difficulties newcomers to NDN have in picking up the design principles and tools.

       

  • Multi-Worker NFD : an NFD-compatible High-speed NDN Forwarder

    Sung Hyuk Byun, Jongseok Lee, Dong Myung Sul, and Namseok Ko (Electronics and Telecommunications Research Institute)

    • Abstract:

      The NDN Forwarding Daemon (NFD) has been a reference forwarder implementation of Named Data Networking. Its good modularity and extensibility make it easy to experiment with new ideas, but it shows limited forwarding performance even with multi-core CPUs because its forwarding structure uses only single core. We present the Multi-Worker NFD (MW-NFD), an NFD-compatible NDN forwarder with parallel forwarding capability on multi-core CPUs. Since the NFD’s forwarding architecture is maintained as is, MW-NFD inherits the advantages (modularity and extensibility) of NFD, and it is fully compatible with NFD and existing NDN applications. In this demo, we shows that MW-NFD can yield high forwarding performance, about 13 times higher than NFD’s performance.

       

  • NFDFuzz: A Stateful Structure-Aware Fuzzer for Named Data Networking

    George Torres, Davide Pesavento, Junxiao Shi, and Lotfi Benmohamed (National Institute of Standards and Technology)

    • Abstract:

      Fuzzing is a very popular automated testing technique that has yet to be applied in any significant way to NDN (Named Data Networking). NDN and its software forwarding daemon NFD present interesting challenges for fuzzing. To be effective, a fuzzer for NFD needs to be both stateful, due to the nature of the NDN data plane, and aware of the packet structure and the rules governing the NDN wire protocol. In this work we present the design of our NFD fuzzer and provide an overview of its most salient implementation details.

       

  • Thursday, October 1, 2020

  • 2pm - 3:20pm UTC: Paper Session 3: Mobile & Constrained Environments

  • Leveraging Content Connectivity and Location Awareness for Adaptive Forwarding in NDN-based Mobile Ad Hoc Networks

    Muktadir Chowdhury (University of Memphis), Junaid Khan (West Washington University), and Lan Wang (University of Memphis)

    • Abstract:

      Communication in Mobile Ad-hoc Networks (MANETs) is challenging due to their highly dynamic topology, intermittent connectivity, and low data rate. Named Data Networking (NDN) offers a data-centric approach to communication with an adaptive forwarding plane and in-network data caching, which can be leveraged to address these challenges. In this work, we propose a forwarding strategy called Content Connectivity and Location-Aware Forwarding (CCLF) for NDN-based MANETs. CCLF broadcasts NDN packets and lets each node make independent decisions on whether to forward packets based on per-prefix performance measurements and any available geo-location information. In addition, it employs a density-aware suppression mechanism to reduce unnecessary packet transmissions. Moreover, we have developed a link adaptation layer for ad-hoc links to bridge the gap between CCLF and the capabilities of the underlying link. Our evaluation shows that CCLF not only reduces packet overhead significantly compared to flooding, but also has a data fetching performance close to that achieved by flooding. It also outperforms three other forwarding strategies proposed for information-centric vehicular networks.

       

  • Connecting the Dots: Selective Fragment Recovery in ICNLoWPAN

    Martine S. Lenders (Freie Universität Berlin), Cenk Gündoğan and Thomas C. Schmidt (HAW Hamburg), and Matthias Wählisch (Freie Universität Berlin)

    • Abstract:

      In this paper, we analyze the benefits of integrating 6LoWPAN Selective Fragment Recovery (SFR) in ICNLoWPAN. We present a solution that allows for immediate fragment forwarding—a key feature of SFR—in combination with ICN caching. Our proposal introduces a Virtual Reassembling Endpoint (VREP), which acts transparently as an SFR fragment forwarder while simultaneously collecting fragments. Once a datagram is complete, it is exposed to the content cache, effectively making the VREP the new fragmenting endpoint. Our solution complies with current specs defined in the IETF/IRTF. Furthermore, we combine the reverse path forwarding schemes of both SFR and ICNLoWPAN and assess drawbacks and benefits in a testbed. Our evaluation shows that SFR with VREP performs similar to hop-wise reassembly, details depend on the topology, but both outperform SFR without VREP in all scenarios.

       

  • Toward a RESTful Information-Centric Web of Things: A Deeper Look at Data Orientation in CoAP

    Cenk Gündoğan (HAW Hamburg), Christian Amsüss, Thomas C. Schmidt (HAW Hamburg), and Matthias Wählisch (Freie Universität Berlin)

    • Abstract:

      The information-centric networking (ICN) paradigm offers replication of autonomously verifiable content throughout a network, in which content is bound to names instead of hosts. This has proven beneficial in particular for the constrained IoT. Several approaches, the most prominent of which being Named Data Networking, propose access to named content directly on the network layer. Independently, the IETF CoAP protocol group started to develop mechanisms that support autonomous content processing and in-network storage.

      In this paper, we explore the emerging CoAP protocol building blocks and how they contribute to an information-centric network architecture for a data-oriented RESTful Web of Things. We discuss design options and measure characteristic performances of different network configurations, which deploy CoAP proxies and OSCORE content object security, and compare with NDN. Our findings indicate an almost continuous design space ranging from plain CoAP at the one end to NDN on the other. On both ends—ICN and CoAP—we identify protocol features and aspects whose mutual transfer potentially improves design and operation of the other.

       

  • 3:20pm - 3:30pm UTC: Virtual Coffee Break

  • 3:30pm - 4:50pm UTC: Paper Session 4: Caching & CDNs

  • Far Cry: Will CDNs Hear NDN's Call?

    Chavoosh Ghasemi (University of Arizona), Hamed Yousefi (Aryaka Networks), and Beichuan Zhang (University of Arizona)

    • Abstract:

      Content Delivery Networks (CDNs) have become indispensable to Internet content distribution. As they evolve to meet the ever-increasing demands, they are also facing challenges such as system complexity, resource footprint, and content security. In this paper, we look at CDNs once again, but this time from the eyes of a young networking technology called named-data networking (NDN). NDN supports content distribution without requiring an overlay service to bridge the gap between network services and application needs. Therefore, it can realize content distribution at large scale with an arguably simpler system design.

      We conducted real-world experiments to compare the standard deployment of NDN (i.e., the global NDN testbed) and two leading CDNs (Akamai and Fastly) in terms of caching and retrieving static contents through streaming videos from four different continents over these networks for two weeks. We found that although NDN can provide a satisfactory quality of service in most cases, it falls behind CDNs mainly due to its lack of hardware infrastructure and software/protocol immaturity. Nevertheless, NDN outperforms CDNs in terms of server workload and failure resiliency due to its ubiquitous in-network caching and adaptive forwarding plane. Besides, NDN comes with built-in content security, but it needs an efficient solution for content privacy. NDN’s architectural advantages make it a natural fit for Internet content distribution in the long run. That said, in terms of forthcoming goals, this paper reveals several limitations of the current NDN deployment and discusses why the future of NDN hinges on addressing those limitations.

       

  • iCDN: An NDN-based CDN

    Chavoosh Ghasemi (University of Arizona), Hamed Yousefi (Aryaka Networks), and Beichuan Zhang (University of Arizona)

    • Abstract:

      Despite the close philosophy between content delivery networks (CDN) and named-data networks (NDN), no solution has realized a large-scale NDN-based CDN yet. In this paper, we void the popular belief that "any" NDN network can be expanded to serve as a CDN and introduce iCDN, a scalable, resilient, and high-performance CDN using NDN technology. We evaluate different aspects of iCDN over the Abilene topology against the global NDN testbed solution and show why iCDN is a promising design to build a large-scale NDN-based CDN.

       

  • Discovering in-network Caching Policies in NDN Networks from a Measurement Perspective

    Chengyu Fan (Colorado State University), Susmit Shannigrahi (Tennessee Technological University), and Christos Papadopoulos and Craig Partridge (Colorado State University)

    • Abstract:

      Caching is integral to Named Data Networking (NDN). Routers in NDN networks are encouraged to cache content and to serve later requests for content from their caches.

      As NDN has evolved, researchers have come to realize that different caching schemes work better for different types of content and patterns of content requests. From a measurement perspective, this means that being able to determine the caching schemes in use within an NDN network can be essential to understanding the network’s performance.

      In this paper, we investigate the feasibility of detecting NDN caching schemes via active measurement (i.e. by sending requests into the network and measuring responses) from edge systems (e.g. by users). We show it is possible to determine what algorithms routers are using to decide what content to cache. Furthermore, for stochastic caching schemes with fixed caching probabilities, we show it is possible to infer the caching probability. Finally, while we do not seek to understand routers’ cache replacement policies (which we leave to later work), we do find that the methods for determining the caching algorithm are robust to cross traffic that may impact the content of a router’s cache.

       

  • 4:50pm - 5pm UTC: Virtual Coffee Break

  • 5pm - 5:55pm UTC: Panel: ICN Economics, Societal, and Governance Aspects

  • Emanuele Giovanetti (Anglia Ruskin University)

  • Dirk Kutscher (Emden University)

  • Eve Schooler (Intel)

  • [others TBA]

  • 5:55pm - 6pm UTC: Technological Break

  • 6pm - 7:20pm UTC: Paper Session 5: Architecture

  • PERSIA: a Puzzle-based Interest FloodIng Attack Countermeasure

    Reza Tourani (Saint Louis University), George Torres (New Mexico State university), and Satyajayant Misra (New Mexico State University)

    • Abstract:

      With the proliferation of smart and connected mobile, wireless devices at the edge, Distributed Denial of Service (DDoS) attacks are increasing. Weak security, improper commissioning, and the fast, non-standardized growth of the IoT industry are the major contributors to the recent DDoS attacks, e.g., Mirai Botnet attack on Dyn and Memcached attack on GitHub. Similar to UDP/TCP flooding (common DDoS attack vector), request flooding attack is the primary DDoS vulnerability in the Named-Data Networking (NDN) architecture. In this paper, we propose PERSIA, a distributed request flooding prevention and mitigation framework for NDN-enabled ISPs, to ward-off attacks at the edge. PERSIA’s edge-centric attack prevention mechanism eliminates the possibility of successful attacks from malicious end hosts. In the presence of compromised infrastructure (routers), PERSIA dynamically deploys an in-network mitigation strategy to minimize the attack’s magnitude. Our experimentation demonstrates PERSIA’s resiliency and effectiveness in preventing and mitigating DDoS attacks while maintaining legitimate users’ quality of experience (> 99.92% successful packet delivery rate).

       

  • Liquid Data Networking

    John W. Byers (Boston University) and Michael Luby (ICSI and BitRipple, Inc.)

    • Abstract:

      We introduce Liquid Data Networking (LDN), an ICN architecture that is designed to enable the benefits of erasure-code enabled object delivery. A primary contribution of this work is the introduction of SOPIs, a simple and efficient naming mechanism enabling clients to concurrently download encoded data over multiple interfaces for the same object, to optimize caching efficiency, and to enable seamless mobility. LDN offers a clean separation of security into object security and data packet security. An evaluation of the architecture and its use with various types of erasure codes is provided.

       

  • Named-Data Transport: An End-to-End Approach for an Information-Centric IP Internet

    Abdulazaz Albalawi and J.J Garcia-Luna-Aceves (UC Santa Cruz)

    • Abstract:

      Named-Data Transport (NDT) is introduced to provide efficient content delivery by name over the existing IP Internet. NDT consists of the integration of three end-to-end architectural components: The first connection-free reliable transport protocol, the Named-Data Transport Protocol (NDTP); minor extensions to the Domain Name System (DNS) to include records containing manifests describing content; and transparent caches that track pending requests for content. NDT uses receiver-driven requests (Interests) to request content and NDT proxies that provide transparent caching of content while enforcing privacy. The performance of NDT, the Transmission Control Protocol (TCP), and Named-Data Networking (NDN) is compared using off-the-shelf implementations in the ns-3 simulator. The results demonstrate that NDT outperforms TCP and is as efficient as NDN, but without making any changes to the existing Internet routing infrastructure.

       

  • 7:20pm - 7:45pm UTC: Closing Session

  • Best Paper/Poster Awards