Abstract
Software‐defined networking (SDN) decouples the control plane and data forwarding plane to overcome the limitations of traditional networking infrastructure. Among several communication protocols employed for SDN, OpenFlow is most widely used for the communication between the controller and switch. In this paper two packet scheduling schemes, FCFS‐Pushout (FCFS‐PO) and FCFS‐Pushout‐Priority (FCFS‐PO‐P), are proposed to effectively handle the overload issue of multiple‐switch SDN targeting the edge computing environment. Analytical models on their operations are developed, and extensive experiment based on a testbed is carried out to evaluate the schemes. They reveal that both of them are better than the typical FCFS‐Block (FCFS‐BL) scheduling algorithm in terms of packet wait time. Furthermore, FCFS‐PO‐P is found to be more effective than FCFS‐PO in the edge computing environment.
Highlights
Nowadays, the traditional IP network can hardly deal with the huge volume of traffic generated in the rapidly growing Internet of Things (IoT)
The FCFS-PO and FCFS-PO-P scheduling scheme are proposed for coping with this issue (ii) Analytical model of the proposed scheduling scheme is developed using queueing theory, which can be applied to the evaluation of priority-based scheduling scheme (iii) The scheduling for solving the packet scheduling problem of software-defined networking (SDN) controller in edge computing environment is revealed by comparing the proposed method with existing methods
Some switches might be overloaded if the packet arrival rate is high, and the proposed FCFS-PO and FCFS-PO-P mechanism are able to effectively deal with the situation
Summary
The traditional IP network can hardly deal with the huge volume of traffic generated in the rapidly growing Internet of Things (IoT). A variety of network traffics are needed to be considered for accurately estimating the performance [5], allowing early identification of a potential traffic hotspot or bottleneck This is a fundamental issue in the deployment of SDN for edge computing. To the best of our knowledge, little explorations exist for the performance of SDN switches with priority scheduling This is an undoubtedly important issue for edge computing since the edge nodes deal with the received data based on the priority. The FCFS-PO and FCFS-PO-P scheduling scheme are proposed for coping with this issue (ii) Analytical model of the proposed scheduling scheme is developed using queueing theory, which can be applied to the evaluation of priority-based scheduling scheme (iii) The scheduling for solving the packet scheduling problem of SDN controller in edge computing environment is revealed by comparing the proposed method with existing methods.
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
