Abstract

Software-defined network (SDN) is a new paradigm that decouples the control plane and data plane. This offered a more flexible way to efficiently manage the network. However, the increasing number of traffics due to the proliferation of the Internet of Things (IoT) devices also increase the number of flow arrival which in turn causes flow rules to change more often, and similarly, path setup requests increased. These events required route path computation activities to take place immediately to cope with the new network changes. Searching for an optimal route might be costly in terms of the time required to calculate a new path and update the corresponding switches. However, the current path selection schemes considered only single routing metrics either link or switch operation. Incorporating link quality and switch’s role during path selection decisions have not been considered. This paper proposed Route Path Selection Optimization (RPSO) with multi-constraint. RPSO introduced joint parameters based on link and switches such as Link Latency (LL), Link Delivery Ratio (LDR), and Critical Switch Frequency Score (CWFscore). These metrics encourage path selection with better link quality and a minimal number of critical switches. The experimental results show that the proposed scheme reduced path stretch by 37%, path setup latency by 73% thereby improving throughput by 55.73%, and packet delivery ratio by 12.5% compared to the baseline work.

Highlights

  • Software-defined network (SDN) decouples the control plane from the data plane [1]

  • The SDN controllers acted as a central network intelligent while the data plane is released from control function and focus on forwarding packets to the hop

  • The proposed Route Path Selection Optimization (RPSO) scheme selects a path with optimized links quality and switches resources from source to destination in SDN

Read more

Summary

Introduction

SDN decouples the control plane (networking logic) from the data plane (forwarding logic) [1]. The SDN controller used either a restoration or protection approach to compute a path and update the switch flow table [10]. In other words, searching for an optimal route might be costly in terms of the time required to calculate a new path and update the corresponding switches flow table [12]. The existing routing schemes overlook a set of critical switches during route path selection decisions Such a set of switches have many flow table entries more often, which further augment the convergence time, and may cause update operation to yield a non-optimum path. This paper proposed an optimized route path selection scheme by incorporating new routing metrics considering link and switch parameters.

Related Works
Limitation
Design of the Proposed Solution
Initial Network Discovery and Path Setup
Critical Switch Detection and Expected Load
Route Path Selection with Link Quality and Critical Switch Aware
Experimental Results
Average Path Setup Latency
Throughput
Packet Delivery Ratio
Path Stretch
Flow Table Occupancy Rate
Conclusions
Full Text
Published version (Free)

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 call