short-paper

Path switching: reduced-state flow handling in SDN using path information

Authors:

T. V. Lakshman,

Gordon WilfongAuthors Info & Claims

CoNEXT '15: Proceedings of the 11th ACM Conference on Emerging Networking Experiments and Technologies

Article No.: 36, Pages 1 - 7

https://doi.org/10.1145/2716281.2836121

Published: 01 December 2015 Publication History

Abstract

The advent of virtualization, containerization and the Internet of Things (IoT) is leading to an explosive growth in the number of endpoints. Ideally with Software Defined Networking (SDN), one would like to customize packet handling for each of these endpoints or applications. However this typically leads to a large growth in forwarding state. This growth is avoided in current networks by using aggregation which trades off fine-grained control of micro-flows for reduced forwarding state. It is worthwhile to ask whether the benefits of micro-flow control can be retained without a large growth in forwarding state and without using aggregation. In this paper we describe an incrementally deployable SDN-friendly packet forwarding mechanism called Path Switching that achieves this by compactly encoding a packet's path through the network in the packet's existing address fields. Path Switching provides the same reduction in forwarding state as source routing while retaining the benefits and use of fixed size packet headers and existing protocols.

We have extended Open vSwitch (OVS) to transparently support Path Switching as well as an inline service component for folding middlebox services into OVS. The extensions include advanced failover mechanisms like fast reroute. These extensions require no protocol changes as Path Switching leaves header formats unchanged.

References

[1]

http://en.wikipedia.org/wiki/Internet_of_Things.

[2]

http://www.etsi.org/technologies-clusters/technologies/nfv.

[3]

https://tools.ietf.org/html/draft-ashwood-sdnrg-state-reduction-00.

[4]

D. Awduche, L. Berger, D. Gan, T. Li, V. Srinivasan, and G. Swallow. RSVP-TE: Extensions to RSVP for LSP Tunnels. RFC 3209, December 2001.

Digital Library

[5]

A. Hari et. al. Optimal Path Encoding for Software-Defined Networks. In ISIT, 2015.

[6]

A. Schwabe et. al. Using MAC Addresses As Efficient Routing Labels in Data Centers. In HotSDN, 2014.

Digital Library

[7]

Al-Shabibi et. al. OpenVirteX: A network hypervisor. In Open Networking Summit, 2014.

[8]

C. Guo et. al. SecondNet: A Data Center Network Virtualization Architecture with Bandwidth Guarantees. In Co-NEXT, 2010.

Digital Library

[9]

K. Agarwal et. al. Shadow MACs: Scalable Label-switching for Commodity Ethernet. In HotSDN, 2014.

Digital Library

[10]

M. Casado et. al. Fabric: A Retrospective on Evolving SDN. In HotSDN, 2012.

Digital Library

[11]

M. Motiwala et. al. Path Splicing. In SIGCOMM, 2008.

Digital Library

[12]

N. Mysore et. al. PortLand: A Scalable Fault-Tolerant Layer 2 Data Center Network Fabric. In SIGCOMM, 2009.

Digital Library

[13]

P. B. Godfrey et. al. Pathlet Routing. In SIGCOMM, 2009.

Digital Library

[14]

R. Hartert et. al. A Declarative and Expressive Approach to Control Forwarding Paths in Carrier-Grade Networks. In SIGCOMM, 2015.

Digital Library

[15]

Rob Sherwood et. al. FlowVisor: A Network Virtualization Layer. Technical report, 2009.

[16]

S. Fayazbakhsh et. al. FlowTags: Enforcing Network-wide Policies in the Presence of Dynamic Middlebox Actions. In HotSDN, 2013.

Digital Library

[17]

S. Jyothi et. al. Towards a Flexible Data Center Fabric with Source Routing. In SOSR, 2015.

Digital Library

[18]

V. Srinivasan et. al. Fast Address Lookups Using Controlled Prefix Expansion. In ACM Trans. Comput. Syst., 1999.

Digital Library

[19]

X. Jin et. al. SoftCell: Scalable and Flexible Cellular Core Network Architecture. In CoNEXT, 2013.

Digital Library

[20]

Y. Wang et. al. Virtual Routers on the Move: Live Router Migration as a Network-Management Primitive. In SIGCOMM, 2008.

Digital Library

[21]

Z. Qazi et. al. SIMPLE-fying Middlebox Policy Enforcement Using SDN. In SIGCOMM, 2013.

Digital Library

[22]

IETF. Segment Routing. https://datatracker.ietf.orf/doc/draft-ietf-spring-segment-routing/.

[23]

M. Reitblatt et. al. Abstractions for Network Update. In SIGCOMM, 2012.

Digital Library

Cited By

Deshmukh ABendale SHundekari SChitre AWanjale KDhumane AChopra GRani S(2025)Enhancing Scalability and Performance in Networked Applications Through Smart Computing Resource AllocationCurrent and Future Cellular Systems10.1002/9781394256075.ch12(227-250)Online publication date: 3-Jan-2025
https://doi.org/10.1002/9781394256075.ch12
KARAKUŞ M(2023)Implementation of Blockchain-Assisted Source Routing for Traffic Management in Software-Defined NetworksYazılım Tanımlı Ağlarda Trafik Yönetimi İçin Blokzincir Destekli Kaynak Yönlendirmesinin UygulanmasıDüzce Üniversitesi Bilim ve Teknoloji Dergisi10.29130/dubited.120965611:3(1250-1268)Online publication date: 31-Jul-2023
https://doi.org/10.29130/dubited.1209656
Nandha Kumar GKatsalis KPapadimitriou PPop PCarle G(2023)SRv6‐based Time‐Sensitive Networks (TSN) with low‐overhead reroutingInternational Journal of Network Management10.1002/nem.221533:4Online publication date: 9-Jul-2023
https://dl.acm.org/doi/10.1002/nem.2215
Show More Cited By

Index Terms

Path switching: reduced-state flow handling in SDN using path information
1. Networks
  1. Network components
    1. Intermediate nodes
    2. Middle boxes / network appliances
  2. Network services
    1. Programmable networks
2. Security and privacy
  1. Database and storage security
    1. Data anonymization and sanitization

Recommendations

QoS-aware path switching for VoIP traffic using SCTP

Voice over Internet protocol (VoIP) has been a prevalent multimedia service nowadays. It allows us to transmit voice data over IP networks. However, quality of service (QoS) is a major challenge to VoIP services. It must provide similar quality to ...
Elmo: source routed multicast for public clouds
SIGCOMM '19: Proceedings of the ACM Special Interest Group on Data Communication

We present Elmo, a system that addresses the multicast scalability problem in multi-tenant datacenters. Modern cloud applications frequently exhibit one-to-many communication patterns and, at the same time, require sub-millisecond latencies and high ...
Efficient Internet Multicast Routing Using Anycast Path Selection

A novel efficient and dynamic multicast routing protocol based on anycast routing techniques is presented. The contributions of the protocol differ from well-known shared-tree systems in two aspects: (1) Off-tree anycast routing : The nodes in the ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

CoNEXT '15: Proceedings of the 11th ACM Conference on Emerging Networking Experiments and Technologies

December 2015

483 pages

ISBN:9781450334129

DOI:10.1145/2716281

General Chairs:
Felipe Huici
NEC Europe Ltd
,
Giuseppe Bianchi
University of Rome Tor Vergata

Copyright © 2015 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

Sponsors

SIGCOMM: ACM Special Interest Group on Data Communication

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 December 2015

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Short-paper

Conference

CoNEXT '15

Sponsor:

SIGCOMM

CoNEXT '15: Conference on emerging Networking Experiments and Technologies

December 1 - 4, 2015

Heidelberg, Germany

Acceptance Rates

Overall Acceptance Rate 198 of 789 submissions, 25%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

32
Total Citations
View Citations
249
Total Downloads

Downloads (Last 12 months)3
Downloads (Last 6 weeks)0

Reflects downloads up to 02 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

Deshmukh ABendale SHundekari SChitre AWanjale KDhumane AChopra GRani S(2025)Enhancing Scalability and Performance in Networked Applications Through Smart Computing Resource AllocationCurrent and Future Cellular Systems10.1002/9781394256075.ch12(227-250)Online publication date: 3-Jan-2025
https://doi.org/10.1002/9781394256075.ch12
KARAKUŞ M(2023)Implementation of Blockchain-Assisted Source Routing for Traffic Management in Software-Defined NetworksYazılım Tanımlı Ağlarda Trafik Yönetimi İçin Blokzincir Destekli Kaynak Yönlendirmesinin UygulanmasıDüzce Üniversitesi Bilim ve Teknoloji Dergisi10.29130/dubited.120965611:3(1250-1268)Online publication date: 31-Jul-2023
https://doi.org/10.29130/dubited.1209656
Nandha Kumar GKatsalis KPapadimitriou PPop PCarle G(2023)SRv6‐based Time‐Sensitive Networks (TSN) with low‐overhead reroutingInternational Journal of Network Management10.1002/nem.221533:4Online publication date: 9-Jul-2023
https://dl.acm.org/doi/10.1002/nem.2215
Zheng QTang SChen BZhu Z(2021)Highly-Efficient and Adaptive Network Monitoring: When INT Meets Segment RoutingIEEE Transactions on Network and Service Management10.1109/TNSM.2021.306900018:3(2587-2597)Online publication date: Sep-2021
https://doi.org/10.1109/TNSM.2021.3069000
Komajwar SKorkmaz T(2021)SPRM: Source Path Routing Model and Link Failure Handling in Software-Defined NetworksIEEE Transactions on Network and Service Management10.1109/TNSM.2021.306615618:3(2873-2887)Online publication date: Sep-2021
https://doi.org/10.1109/TNSM.2021.3066156
Kumar GKatsalis KPapadimitriou PPop PCarle G(2021)Failure Handling for Time-Sensitive Networks using SDN and Source Routing2021 IEEE 7th International Conference on Network Softwarization (NetSoft)10.1109/NetSoft51509.2021.9492666(226-234)Online publication date: 28-Jun-2021
https://doi.org/10.1109/NetSoft51509.2021.9492666
Kushwaha ASharma SBazard NGumaste AMukherjee B(2021)Design, Analysis, and a Terabit Implementation of a Source-Routing-Based SDN Data PlaneIEEE Systems Journal10.1109/JSYST.2020.299560515:1(56-67)Online publication date: Mar-2021
https://doi.org/10.1109/JSYST.2020.2995605
Guo DZhang Y(2020)Towards optimal path encoding using SAT solverProceedings of the SIGCOMM '20 Poster and Demo Sessions10.1145/3405837.3411389(52-54)Online publication date: 10-Aug-2020
https://dl.acm.org/doi/10.1145/3405837.3411389
Gopalakrishnan AManju Bala PAnanth Kumar T(2020)An Advanced Bio-Inspired Shortest Path Routing Algorithm for SDN Controller over VANET2020 International Conference on System, Computation, Automation and Networking (ICSCAN)10.1109/ICSCAN49426.2020.9262276(1-5)Online publication date: 3-Jul-2020
https://doi.org/10.1109/ICSCAN49426.2020.9262276
Wang SSun CMeng ZWang MCao JXu MBi JHuang QMoshref MYang THu HZhang G(2020)Martini: Bridging the Gap between Network Measurement and Control Using Switching ASICs2020 IEEE 28th International Conference on Network Protocols (ICNP)10.1109/ICNP49622.2020.9259415(1-12)Online publication date: 13-Oct-2020
https://doi.org/10.1109/ICNP49622.2020.9259415
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten