%0 Conference Proceedings
%T Segmented Source Routing for Handling Link Failures in Software Defined Network
%+ Department of Computer Science [San Antonio] (CS)
%A Komajwar, Sharvari
%A Korkmaz, Turgay
%Z Part 3: Network Deployment
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B International Conference on Wired/Wireless Internet Communication (WWIC)
%C Boston, MA, United States
%Y Kaushik Roy Chowdhury
%Y Marco Di Felice
%Y Ibrahim Matta
%Y Bo Sheng
%I Springer International Publishing
%3 Wired/Wireless Internet Communications
%V LNCS-10866
%P 146-158
%8 2018-06-18
%D 2018
%R 10.1007/978-3-030-02931-9_12
%K SDN
%K Link failure
%K Source routing
%K Segment routing
%Z Computer Science [cs]
%Z Computer Science [cs]/Networking and Internet Architecture [cs.NI]Conference papers
%X When a link fails in Software Defined Networks (SDN), the flows that use the failed link need to be rerouted over other paths. To achieve this rerouting task, researchers have proposed reactive and proactive recovery approaches. In reactive approach, upon failure, SDN controller computes new paths for the affected flows and installs them on demand. In proactive approach, the SDN controller pre-calculates backup paths and installs them on the switches in advance. While proactive approach minimizes packet loss and delay, it introduces a new problem, namely excessive usage of limited TCAM memory at SDN switches. In this paper, we consider two promising techniques (namely source routing and segment routing), and propose a new proactive technique called Segmented Source Routing (SSR). SSR uses source routing but in a segmented manner: one from the failure detecting node to an emergency node and one from emergency node to the destination. After addressing various challenges in placing emergency nodes and assigning emergency nodes to flows, our simulations shows that SSR maintains the same level of performance of pure source routing while significantly reducing the memory overhead, computation overhead, and the packet sizes as it shortens the source routes and avoids storing them at every node.
%G English
%Z TC 6
%Z WG 6.2
%2 https://inria.hal.science/hal-02269737/document
%2 https://inria.hal.science/hal-02269737/file/470666_1_En_12_Chapter.pdf
%L hal-02269737
%U https://inria.hal.science/hal-02269737
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-TC6
%~ IFIP-WG6-2
%~ IFIP-WWIC
%~ IFIP-LNCS-10866