Achieving Fast and Lightweight SDN Updates with Segment Routing
Open accessAbstract
In SDN, forwarding rules are frequently updated to adapt to network dynamics. During the procedure, path consistency needs to be preserved; otherwise, in-flight packets might meet with forwarding errors such as loops and black holes. Despite a large number of suggestions have been proposed, they take either a long duration or have high rule-space overheads, thus fail to be practical for large-scale high dynamic networks. In this paper, we propose FLUS, a Segment Routing (SR) based mechanism, to achieve fast and lightweight path updates. Basically, when a route needs a change, FLUS instantly employs SR to construct its desired new path by concatenating some fragments of the already existing paths. After the actual paths are established, FLUS then shifts incoming packets to them and disables the transitional ones. Such a design helps packets enjoy their new paths immediately without introducing rule-space overheads. This paper presents FLUS's segment allocation, path construction, and the corresponding optimal algorithms in detail. Our evaluation based on real and synthesized networks shows: FLUS can handle up to 92-100% updates using SR in real-time and save 72-88% rule overhead compared to prior methods.
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
SDN switches are incapable of handling a large volume of flow rules because complex rule matching in SDN/NFV, such as wildcards, requires switches to store rules in TCAM, which is expensive and limited in size.
“In fact, SDN switches are incapable of handling a large volume of flow rules because the complex rule matching in SDN/NFV, such as wildcards, requires switches to store rules in Ternary Content Addressable Memory (TCAM), which is expensive [228] and limited in size (e.g., practically supporting 2k-20k rules as demonstrated by [229]).”
From QoE Management of Multimedia Streaming Services in Future Networks: A Tutorial and Survey (2020) · cites this paper as [228]
Cites
Emergence of Scaling in Random Networks
Barabási, A.-L., & Albert, R. (1999) · Science · doi:10.1126/science.286.5439.509 · Cited by 36,135 · see citing works
Measuring ISP topologies with rocketfuel
Spring, N. T., Mahajan, R., & Wetherall, D. J. (2002) · ACM SIGCOMM Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SIGCOMM) · doi:10.1145/633025.633039 · Cited by 1,269 · see citing works
Abstractions for network update
Reitblatt, M., Foster, N., Rexford, J., Schlesinger, C., & Walker, D. (2012) · Proceedings of the ACM SIGCOMM 2012 conference on Applications, technologies, architectures, and protocols for computer communication · doi:10.1145/2342356.2342427 · Cited by 584 · see citing works
Dynamic scheduling of network updates
Jin, X., Liu, H. H., Gandhi, R., et al. (2014) · doi:10.1145/2619239.2626307 · Cited by 332 · see citing works
What You Need to Know About SDN Flow Tables
Kuźniar, M., Perešíni, P., & Kostić, D. (2015) · Lecture notes in computer science · doi:10.1007/978-3-319-15509-8_26 · Cited by 234 · see citing works
Incremental consistent updates
Katta, N. P. K., Rexford, J., & Walker, D. (2013) · doi:10.1145/2491185.2491191 · Cited by 197 · see citing works
Optimized network traffic engineering using segment routing
Bhatia, R., Hao, F., Kodialam, M. S., et al. (2015) · doi:10.1109/infocom.2015.7218434 · Cited by 175 · see citing works
A Declarative and Expressive Approach to Control Forwarding Paths in Carrier-Grade Networks
Hartert, R., Vissicchio, S., Schaus, P., Bonaventure, O., Filsfils, C., Telkamp, T., & François, P. (2015) · ACM Special Interest Group on Data Communication · doi:10.1145/2785956.2787495 · Cited by 133 · see citing works
Efficient synthesis of network updates
McClurg, J., Hojjat, H., Černý, P., et al. (2015) · Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation · doi:10.1145/2737924.2737980 · Cited by 99 · see citing works
FLIP the (Flow) table: Fast lightweight policy-preserving SDN updates
Vissicchio, S., & Cittadini, L. (2016) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infocom.2016.7524419 · Cited by 77 · see citing works
TimeFlip: Scheduling network updates with timestamp-based TCAM ranges
Mizrahi, T., Rottenstreich, O., & Moses, Y. (2015) · doi:10.1109/infocom.2015.7218645 · Cited by 67 · see citing works
SCMon: Leveraging segment routing to improve network monitoring
Aubry, F., Lebrun, D., Vissicchio, S., et al. (2016) · doi:10.1109/infocom.2016.7524410 · Cited by 61 · see citing works
Cupid: Congestion-free consistent data plane update in software defined networks
Wang, W., He, W., Su, J., et al. (2016) · doi:10.1109/infocom.2016.7524420 · Cited by 52 · see citing works
Fast lossless traffic migration for SDN updates
Luo, L., Yu, H., Luo, S., et al. (2015) · International Conference on Communications · doi:10.1109/icc.2015.7249247 · Cited by 21 · see citing works
Self-citationArrange your network updates as you wish
Luo, S., Yu, H., Luo, L., et al. (2016) · IFIP Networking Conference (IFIP Networking) · doi:10.1109/ifipnetworking.2016.7497214 · Cited by 16 · see citing works
Self-citation
Flagged first, then by citations
Cited by
Sorted by citations
QoE Management of Multimedia Streaming Services in Future Networks: A Tutorial and Survey
Barakabitze, A. A., Barman, N., Ahmad, A., Zadtootaghaj, S., Sun, L., Martini, M. G., & Atzori, L. (2020) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2019.2958784 · Cited by 239 · see citing works
- Authors
- Luo, L., Yu, H., Luo, S., Zhang, M., & Yu, S.
- Affiliations
- University of Electronic Science and Technology of China (CN)
- Huawei Technologies (China) (CN)
- Deakin University (AU)
- Venue
- 2016 IEEE Global Communications Conference (GLOBECOM)
- Publisher
- IEEE
- Published
- 2016-12
- Volume
- 2016
- Pages
- 1-6
- ISSN
- 1930-529X (ISSN-L)
- OpenAlex
- W2584263584
- Cited by
- 14
- References
- 15
- Citations by year
- 2024: 1 · 2022: 1 · 2021: 1 · 2020: 1 · 2019: 6 · 2018: 3 · 2017: 1
- FWCI
- 2.85
- Type
- conference paper
- Language
- en
- Open access
- green
- figshare.com
- Licence
- cc-by
- Locations
- Globecom (publishedVersion)
- Figshare (submittedVersion, cc-by)
- IEEE Conference Proceedings
- Topics
- Physical Sciences › Computer Science › Computer Networks and Communications › Software-Defined Networks and 5G
- Physical Sciences › Engineering › Electrical and Electronic Engineering › Advanced Optical Network Technologies
- Physical Sciences › Computer Science › Computer Networks and Communications › Caching and Content Delivery
- Keywords
- software-defined networking, segment routing, path consistency, loop avoidance, black holes, path construction
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
