Keywords
Software-Defined Networking, Reinforcement Learning, Traffic Flows, Low-latency Applications
Abstract
Software-Defined Networking (SDN) separates the control and data planes, enabling better programmability of the control plane to predict, route, and schedule traffic at the data plane. Reactive SDN dynamically installs flow rules when a new flow arrives, making it adaptable to application dynamics. This design is well-suited for emerging low-latency applications like online gaming and AR/VR, which require millisecond-level response times for an acceptable quality of experience. However, Reactive SDN faces limitations, as each new flow triggers a miss, sending a Packet-in message from the switch to the SDN controller, increasing latency. To reduce delay, it's crucial to predict flow arrivals and install the necessary rules in advance. Reinforcement Learning (RL), where agents make decisions based on rewards, can help by learning to predict flow arrivals and installing flow rules ahead of time. We propose a Speculative SDN design to address the limitations of Reactive SDN for low-latency applications. This approach uses RL to predict and install unseen flows, reducing delays and improving overall performance. By speculatively installing flow rules, we enhance SDN's ability to meet the fast-response demands of emerging applications.
Completion Date
2025
Semester
Spring
Committee Chair
Yuksel, Murat
Degree
Doctor of Philosophy (Ph.D.)
College
College of Engineering and Computer Science
Department
Computer Science
Identifier
DP0029315
Document Type
Dissertation/Thesis
Campus Location
Orlando (Main) Campus
Subjects
Software-defined networking (Computer network technology); Reinforcement learning; Traffic flow--Forecasting; Adaptive routing (Computer network management); Computer networks--Technological innovations
STARS Citation
Hariri, Ahmad, "Towards an Intelligent Speculative Software-Defined Networking" (2025). Graduate Thesis and Dissertation post-2024. 147.
https://stars.library.ucf.edu/etd2024/147
Accessibility Statement
This item was created or digitized prior to April 24, 2027, or is a reproduction of legacy media created before that date. It is preserved in its original, unmodified state specifically for research, reference, or historical recordkeeping. In accordance with the ADA Title II Final Rule, the University Libraries provides accessible versions of archival materials upon request. To request an accommodation for this item, please submit an accessibility request form.