skip to main content
10.1145/3373360acmconferencesBook PagePublication PagescommConference Proceedingsconference-collections
SOSR '20: Proceedings of the Symposium on SDN Research
ACM2020 Proceeding
Publisher:
  • Association for Computing Machinery
  • New York
  • NY
  • United States
Conference:
SOSR '20: Symposium on SDN Research San Jose CA USA 3 March 2020
ISBN:
978-1-4503-7101-8
Published:
04 March 2020
Sponsors:
Recommend ACM DL
ALREADY A SUBSCRIBER?SIGN IN

Reflects downloads up to 03 Mar 2025Bibliometrics
Abstract

No abstract available.

Skip Table Of Content Section
research-article
Automated Bootstrapping of A Fault-Resilient In-Band Control Plane

Adoption of Software-defined Networking (SDN) in critical environments, such as factory automation, avionics and smart-grid networks, will require in-band control. In such networks, the out-of-band control model, prevalent in data center deployments, is ...

research-article
Enabling Event-Triggered Data Plane Monitoring

We propose a push-based approach to network monitoring that allows the detection, within the dataplane, of traffic aggregates. Notifications from the switch to the controller are sent only if required, avoiding the transmission or processing of ...

research-article
Public Access
Automatic Inference of High-Level Network Intents by Mining Forwarding Patterns

There is a semantic gap between the high-level intents of network operators and the low-level configurations that achieve the intents. Previous works tried to bridge the gap using verification or synthesis techniques, both requiring formal ...

research-article
Redundant Logic Elimination in Network Functions

Network functions (NFs) are critical components in the network data plane. Their efficiency is important to the whole network's end-to-end performance. We identify three types of runtime redundant logic in NFs when they are deployed with concrete ...

research-article
Towards In-network Acceleration of Erasure Coding

In distributed storage systems, erasure coding (EC) is a crucial technology to enable high fault tolerance with lower storage overheads than data replication. EC can reconstruct missing data by downloading parity data from survived machines. However, ...

research-article
Full-stack SDN: The Next Big Challenge?

This paper challenges the common assumption that SDN networks shall be run only at lowest layers of the stack, i.e., L2 and L3. Using as use case data center networks providing virtualized services, we show how state-of-the-art solutions already employ ...

research-article
Public Access
Grasp the Root Causes in the Data Plane: Diagnosing Latency Problems with SpiderMon

Unexplained performance degradation is one of the most severe problems in data center networks. The increasing scale of the network makes it even harder to maintain good performance for all users with a low-cost solution. Our system SpiderMon monitors ...

research-article
Can we exploit buggy P4 programs?

Recent verification works have found numerous bugs in P4 programs. While it is obvious bugs are undesirable, it is currently not known what effects these bugs have in practice? In this paper we take a first look at the potential of exploitation for such ...

research-article
Cache-Friendly IP Reassembly Network Function

In the emerging SD-WAN environments, network packets are heavily encapsulated to support various policy-driven network slices and secure connectivity. While such heavy encapsulation increases the chance of IP fragmentation in SD-WAN traffic, existing ...

research-article
PacketScope: Monitoring the Packet Lifecycle Inside a Switch

As modern switches become increasingly more powerful, flexible, and programmable, network operators have an ever greater need to monitor their behavior. Many existing systems provide the ability to observe and analyze traffic that arrives at switches, ...

research-article
TurboEPC: Leveraging Dataplane Programmability to Accelerate the Mobile Packet Core

Recent architectures of the mobile packet core advocate the separation of the control and dataplane components, with all signaling messages being processed by the control plane entities. This paper presents the design, implementation, and evaluation of ...

research-article
OptFlow: A Flow-based Abstraction for Programmable Topologies

The rapid adoption of Reconfigurable Optical Add-Drop Multiplexers (ROADMs) is setting the stage for the dynamic reconfiguration of the network topology in optical backbones. The conventional approach to enable programmability in the physical layer ...

research-article
Adaptive Weighted Traffic Splitting in Programmable Data Planes

Recent work introduced load-balancing algorithms that dynamically pick the best path entirely in the data plane, to react to traffic dynamics on a small timescale. This paper takes the next step to balance load dynamically across multiple paths in the ...

research-article
Memory-Efficient Membership Encoding in Switches

Network applications often define policies to manage network traffic based on its attributes (e.g., a service chain, valid next-hops, permission flags). These policies match against packets' attributes in switches before being applied. However, the ...

research-article
Tracking P4 Program Execution in the Data Plane

While programmable switches provide operators with much-needed control over the network, they also increase the potential sources of packet-processing errors. Bugs can happen anywhere: in the P4 program, the controller installing rules into tables, or ...

research-article
Towards Transforming OpenFlow Rulesets to Fit Fixed-Function Pipelines

OpenFlow feature support differs between devices due to device-specific hardware constraints. OpenFlow places the burden of addressing these differences on the controller, which increases development cost and restricts device interoperability. This ...

research-article
Constructions and Applications for Accurate Counting of the Bloom Filter False Positive Free Zone

Bloom filters are used in many networking applications to answer set membership queries at low cost but suffer from false positives. We study Bloom filter constructions that when representing a set of size up to d taken from a finite universe of size n, ...

Recommendations

Acceptance Rates

Overall Acceptance Rate 7 of 43 submissions, 16%
YearSubmittedAcceptedRate
SOSR '1543716%
Overall43716%