ACM SIGCOMM 2017, Los Angeles, CA
MENU

ACM SIGCOMM 2017 1st International Workshop on Hot Topics in Container Networking and Networked Systems (HotConNet’17)

Workshop Program

  • Friday, August 25, 2017, Laureate Room (Luskin Center)

  • 9:15am - 9:30am Opening Remarks

    Room: Laureate Room (Luskin Center)

  • 9:30am - 10:30am Keynote

  • TBD

    Deepak Bansal (Partner Dev Manager in Microsoft Azure)

  • 10:30am - 11:00am Coffee Break (Foyer)

  • 11:00am - 12:30pm Session 1: Container infrastructures

    Session Chair: Xin Jin (John Hopkins University)

    Room: Laureate Room (Luskin Center)

  • Performance of Container Networking Technologies

    Yang Zhao, Nai Xia, Chen Tian, Bo Li, and Yizhou Tang (Nanjing University), Yi Wang and Gong Zhang (Huawei), Rui Li (Dongguan University of Technology), and Alex X. Liu (Michigan State University)

    • Abstract:

      Container networking is now an important part of cloud virtualization architectures. It provides network access for containers by connecting both virtual and physical network interfaces. The performance of container networking has multiple dependencies, and each factor may significantly affect the performance. In this paper, we perform systematic experiments to study the performance of container networking. We qualify influencing factors and explain the cause of overhead.

       

  • The Grand CRU Challenge

    Marcel Blöcher and Malte Viering (TU Darmstadt, Germany), Stefan Schmid (Aalborg University, Denmark and TU Berlin, Germany), and Patrick Eugster (TU Darmstadt, Germany and Purdue University, USA)

    • Abstract:

      One of the main objectives of any cluster management system is the maximization of cluster resource utilization (CRU). In this paper, we argue that there is a dilemma underlying the challenge of maximizing CRU, as soon as network resources enter the picture. In contrast to local resources which can be handled in a more isolated fashion, global network resources are namely shared, and their allocation is intertwined with that of local resources. For effective resource management, either applications thus have to learn more about the infrastructure, or the resource manager has to understand application semantics – both options violate the separation of applications from the underlying infrastructure strived for by resource managers. This paper makes the case for a resource management system that addresses the dilemma, and presents first ideas.

       

  • Contain-ed: An NFV Micro-Service System for Containing e2e Latency

    Amit Sheoran (Purdue University), Puneet Sharma (Hewlett Packard Labs), Sonia Fahmy (Purdue University), and Vinay Saxena (Hewlett Packard Enterprise)

    • Abstract:

      Network Functions Virtualization (NFV) has enabled operators to dynamically place and allocate resources for network services to match workload requirements. However, unbounded end-to-end (e2e) latency of Service Function Chains (SFCs) resulting from distributed Virtualized Network Function (VNF) deployments can severely degrade performance. In particular, SFC instantiations with inter-data center links can incur high e2e latencies and Service Level Agreement (SLA) violations. These latencies can trigger timeouts and protocol errors with latency-sensitive operations.

      Traditional solutions to reduce e2e latency involve physical deployment of service elements in close proximity. These solutions are, however, no longer viable in the NFV era. In this paper, we present our solution that bounds the e2e latency in SFCs and inter-VNF control message exchanges by creating micro-service aggregates based on the affinity between VNFs. Our system, Contain-ed, dynamically creates and manages affinity aggregates using light-weight virtualization technologies like containers, allowing them to be placed in close proximity and hence bounding the e2e latency. We have applied Contain-ed to the Clearwater IP Multimedia System and built a proof-of-concept. Our results demonstrate that, by utilizing application and protocol specific knowledge, affinity aggregates can effectively bound SFC delays and significantly reduce protocol errors and service disruptions.

       

  • Reproducible Distributed Clusters with Mutable Containers: To Minimize Cost and Provisioning Time

    Hooman Peiro Sajjad, Kamal Hakimzadeh, and Shelan Perera (KTH - Royal Institute of Technology)

    • Abstract:

      Reproducible and repeatable provisioning of large-scale distributed systems is laborious. The cost of virtual infrastructure and the provisioning complexity are two of the main concerns. The trade-offs between virtual machines (VMs) and containers, the most popular virtualization technologies, further complicate the problem. Although containers incur little overhead compared to VMs, VMs are required for their certain guarantees such as hardware isolation.

      In this paper, we present a mutable container provisioning solution, enabling users to switch infrastructure between VMs and containers seamlessly. Our solution allows for significant infrastructure-cost optimizations.We discuss that immutable containers come short for certain provisioning scenarios. However, mutable containers can incur a large time overhead. To reduce the time overhead, we propose multiple provisioning-time optimizations.We implement our solution in Karamel, an open-sourced reproducible provisioning system. Based on our evaluation results, we discuss the cost-optimization opportunities and the time-optimization challenges of our new model.

       

  • 12:30pm - 2:00pm Lunch Break (Centennial Terrace)

  • 2:00pm - 3:30pm Session 2: Containerized Systems

    Session Chair: Hongqiang Harry Liu (Microsoft Research)

    Room: Laureate Room (Luskin Center)

  • Container-based Emulation of Network Control Plane

    Hui Kang and Shu Tao (IBM Research)

    • Abstract:

      An ongoing challenge in network system development is in evaluating the design and implementation of its control plane, without actually deploying it at production scale. Existing approaches based on simulation or emulation have various limitations. The emergence of containers offers a new way of emulating network control plane. In this paper, we design a container-based emulation framework, and introduce its implementation with two concrete use cases: a centralized SDN control plane design in Open Virtual Network (OVN) and a decentralized design in Docker’s *libnetwork*. Through sample scalability studies on these two designs, we demonstrate the effectiveness of the proposed approach.

       

  • Characterizing Docker Overhead in Mobile Edge Computing Scenarios

    Giuseppe Avino, Marco Malinverno, Francesco Malandrino, Claudio Casetti, and Carla-Fabiana Chiasserini (Politecnico di Torino)

    • Abstract:

      Mobile Edge Computing (MEC) is an emerging network paradigm that provides cloud and IT services at the point of access of the network. Such proximity to the end user translates into ultra-low latency and high bandwidth, while, at the same time, it alleviates traffic congestion in the network core. Due to the need to run servers on edge nodes (e.g., a an LTE-A macro eNodeB), a key element of MEC architectures is to ensure server portability and low overhead. A possible tool that can be used for this purpose is Docker, a framework that allows easy, fast deployment of Linux containers. This paper addresses the suitability of Docker in MEC scenarios by quantifying the CPU consumed by Docker when running two different containerized services: multiplayer gaming and video streaming. Our tests, run with varying numbers of clients and servers, yield different results for the two case studies: for the gaming service, the overhead logged by Docker increases only with the number of servers; conversely, for the video streaming case, the overhead is not affected by the number of either clients or servers.

       

  • FADES: Fine-Grained Edge Offloading with Unikernels

    Vittorio Cozzolino, Aaron Yi Ding, and Jörg Ott (Technical University of Munich)

    • Abstract:

      FADES is an edge offloading architecture that empowers us to run compact, single purpose tasks at the edge of the network to support a variety of IoT and cloud services. The design principle behind FADES is to efficiently exploit the resources of constrained edge devices through fine-grained computation offloading. FADES takes advantage of MirageOS unikernels to isolate and embed application logic in concise Xen-bootable images. We have implemented FADES and evaluated the system performance under various hardware and network conditions. Our results show that FADES can effectively strike a balance between running complex applications in the cloud and simple operations at the edge. As a solid step to enable fine-grained edge offloading, our experiments also reveal the limitation of existing IoT hardware and virtualization platforms, which shed light on future research to bring unikernel into IoT domain.

       

  • A Framework based on SDN and Containers for Dynamic Service Chains on IoT Gateways

    Roberto Morabito and Nicklas Beijar (Ericsson Research)

    • Abstract:

      In this paper, we describe a new approach for managing service function chains in scenarios where data from Internet of Things (IoT) devices are partially processed at the network edge. Our framework is enabled by two emerging technologies, Software-Defined Networking (SDN) and container based virtualization, which ensure several benefits in terms of flexibility, easy programmability, and versatility. These features are well suitable with the increasingly stringent requirements of IoT applications, and allow a dynamic and automated network service chaining. An extensive performance evaluation, which has been carried out by means of a testbed, seeks to understand how our proposed framework performs in terms of computational overhead, network bandwidth, and energy consumption. By accounting for the constraints of typical IoT gateways, our evaluation tries to shed light on the actual deployability of the framework on low-power nodes.

       

  • 3:30pm - 4:00pm Coffee Break (Foyer)

Call For Papers

Containerization technology is being adopted quickly by the software industry because it offers fast deployment, good portability, and high resource efficiency to run large-scale and distributed systems. For example, many large Internet companies, e.g. Google, Yelp and AirBnB, etc., have intensively used containers to speed up the development of their applications and platform. The ecosystem of containerization is also rapidly growing. For instance, operating system providers like Microsoft and RedHat have released features to support Docker/container in Windows and Linux respectively; cloud providers like AWS, Azure and OpenStack all release their own services and solutions for containerized applications; there are about 400,000 public container images on Docker Hub with roughly 4~5 thousand new ones per week, and the number of pulls from Docker Hub reached 1 billion from Aug to Oct, 2016.

However, containerization is still in its early stage, and one of the major challenges it is facing is networking. Current container networking solutions mainly rely on the OS kernel to provide basic reachability and security among containers, while failing to meet various requirements needed by practical applications. For example, performance sensitive applications demand high networking performance (e.g. high bandwidth and low latency), while security sensitive applications usually rely on the network to implement firewalls, Intrusion detection system (IDS) or traffic scrubbers. Moreover, there are application demands for privacy, fairness, mobility, high availability, and so on and so forth. It is still challenging to provide the network functions above in container networking due to concerns such as scalability with the number of containers, containers portability, the underlying environments containers depend on (on physical machines or virtual machines) and the heterogeneity of end points (e.g. containers, VMs and physical machines).

Topics of Interest

Authors are encouraged to submit full papers describing original, previously unpublished, complete research, not currently under review by another conference or journal, addressing state-of-the-art research and development in all areas of container networking and networked systems.

  • Large-scale containerized systems and applications
  • Architecture of containerized applications and systems
  • Measurement of containerized systems and applications
  • Security and privacy in containerized systems and applications
  • Measurement of containerized systems and applications
  • User behavior analysis and modeling in containerized applications
  • Software-defined container networking
  • High Performance container networking
  • Middleboxes for containerized systems and applications
  • Network function virtualization in containerized systems and applications
  • Containers in clouds and edge clouds
  • Mobility of containers
  • Containers for Internet of Things
  • Experiences of containers in productions architectures

Contact workshop co-chairs.

Submission Instructions

Papers must be submitted electronically. The length of papers must be no more than 6 pages, including tables and figures, (in two-column, 10-point format) including references, following the provided LaTeX style file. The cover page must contain an abstract of about 150 words, 3-5 keywords, name and affiliation of author(s) as well as the corresponding author’s e-mail and postal address. Each submission will receive at least three independent blind reviews from the TPC. At least one of the authors of every accepted paper must register and present their work at the workshop. 

Paper registration and submission can be done via HotCRP at: https://sigcomm17hotconnet.hotcrp.com/.

Important Dates

  • March 24, 2017 March 31st, 2017 9:00pm PST

    Submission deadline

  • April 30, 2017

    Acceptance notification

  • May 29th, 2017 9:00pm PST

    Camera ready deadline

Authors Take Note

The official publication date is the date the proceedings are made available in the ACM Digital Library. This date may be up to TWO WEEKS prior to the first day of your conference. The official publication date affects the deadline for any patent filings related to published work.

Committees

  • Workshop Co-Chairs
  • Minlan Yu

    Yale University

  • Hongqiang Harry Liu

    Microsoft Research

  • Technical Program Committee
  • Deepak Bansal

    Microsoft Azure

  • Theophilus Benson

    Duke

  • Dongluo Chen

    Docker

  • Yang Chen

    Fudan

  • Bruce Davie

    VMWare

  • Haggai Eran

    Mellanox

  • Benjamin Hindman

    Mesosphere

  • Tim Hockin

    Google

  • Chi-Yao Hong

    Google

  • Charlie Hu

    Purdue

  • Ryan Huang

    JHU

  • Xin Jin

    JHU

  • Thomas Knauth

    TU Dresden

  • Jeongkeun Lee

    Barefoot

  • Ben Pfaff

    VMWare

  • Peter Pietzuch

    Imperial College London

  • George Porter

    UCSD

  • Wei Xu

    Tsinghua

  • Ennan Zhai

    Yale

  • Nicholas Zhang

    Huawei