Feasibility Analysis of the Algorithms: Secured and Efficient Routing Path Update in Software Defined Networking (SDN)

Software-defined networking is the talk of the town in today’s networking industry. Because of the limitations of traditional networking, SDN is getting more popular every year. Lots of researches are taking place to improve the efficiency and overcome the challenges of SDN though it has many advantages. Hence one key problem of SDN is the network update. If the route update does not perform well, it causes congestion and inconsistencies in the network system whereas bandwidth utilization and security is our main concern. We have compared two pre-built algorithms especially for routing path update and proposed a new algorithm with maximum security and loop-free network

Distributed Consistent Network Updates in SDNs: Local Verification for Global Guarantees

While SDNs enable more flexible and adaptive network operations, (logically) centralized reconfigurations introduce overheads and delays, which can limit network reactivity. This paper initiates the study of a more distributed approach, in which the consistent network updates are implemented by the switches and routers directly in the data plane. In particular, our approach leverages concepts from local proof labeling systems, which allows the data plane elements to locally check network properties, and we show that this is sufficient to obtain global network guarantees. We demonstrate our approach considering three fundamental use cases, and analyze its benefits in terms of performance and fault-tolerance.Comment: Appears in IEEE NCA 201

Seamless SDN Route Updates

International audienceSoftware-Defined Networking (SDN) decouples the control and data planes, enabling limitless possibilities for implementing services and applications on top of the network abstraction layer. The centralized controller provides a real-time view of the entire underlying network infrastructure and therefore, management of the agile network becomes more simplified. This flexibility requires online routing updates, but during these updates, consistency has to be preserved, i.e., No packet losses or unrecognized duplications should occur. Moreover, routing updates should be done on the fly in an application-seamless fashion. Where no significant irregular delays or "communication hiccups" in packet arrivals are introduced due to the (frequent) updates. In this paper we present the first seamless consistency during on-the-fly routing updates, allowing the sender to send packets in an unchanged rate during the entire process, rate that is identical to the rate prior and after the update. The main idea is to use multicast on portions of the route, i.e., To send a packet both in the old and the new routes and only when the controller verifies the establishment and operation of the specific portion of the new route, it can remove the corresponding portion from the old route

Make&activate-before-break for seamless SDN route updates

International audienceSoftware-Defined Networking (SDN) decouples the control and data planes, enabling limitless possibilities for implementing services and applications on top of the network abstraction layer. The centralized controller provides a real-time view of the entire underlying network infrastructure, and therefore, management of the agile network becomes more simplified. This flexibility requires online routing updates. However, during these updates consistency has to be preserved, i.e., no packet losses or unrecognized duplicates should occur. Moreover, routing updates should be done on the fly in an application-seamless fashion such that no significant irregular delays or “communication hiccups” in packet arrivals are introduced due to the (frequent) updates. In this paper, we are the first to present methods for seamlessly preserving consistency during on-the-fly routing updates. We utilize the make-before-break paradigm, in fact, the make&activate-before-break (MABB) paradigm. We propose two methods for implementing such paradigm. In the first method, the new route is created and activated by duplicating packets along the corresponding portions of both new and old routes, without exceeding bandwidth demands on network links. Only when the controller verifies the correct establishment and operation of the specific portion of the new route, the corresponding portion of the old route is removed. This allows the sender to continue sending packets at an unchanged rate during the entire update process, a rate that is identical to the rate prior and after the update. In the second method, we propose a technique that utilizes the controller for verifying the correctness of the new portion of a route before its activation and the safeness of dismantling the current portion of a route, while keeping the connection operational