Fig 5 - available via license: Creative Commons Attribution 3.0 Unported
Content may be subject to copyright.
Source publication
Software-defined networking (SDN) has received tremendous attention from both industry and academia. The centralized control plane in SDN has a global view of the network and can be used to provide more effective solutions for complex problems, such as traffic engineering. This study is motivated by recent advancement in SDN and increasing populari...
Contexts in source publication
Context 1
... which can be calculated based on the distance and added to the total recovery time. The propagation delay, however, would not be significant if the network topology is not very large or multiple controllers are used for the SDN. Table 2 shows the results for the average failure recovery time for the failures between different pairs of switches. Fig. 5 illustrates the distribution of failure localization time and controller response time after a failure in the multicast tree is located till the time flow table entries in corresponding switches have been updated. The result is the average based on our experimental measurements. As shown in Fig. 5, after a failure in the multicast tree ...
Context 2
... the failures between different pairs of switches. Fig. 5 illustrates the distribution of failure localization time and controller response time after a failure in the multicast tree is located till the time flow table entries in corresponding switches have been updated. The result is the average based on our experimental measurements. As shown in Fig. 5, after a failure in the multicast tree is located (T L ), the time required to determine if it is a link or node failure and to modify or install flow tables to the corresponding switches (T C ) dominates the failure recovery process. As a whole, however, the total recovery time falls below 0.5 ms on average (even if POX is not a ...
Citations
... An architecture exploiting cached multicast trees for fast deployment is proposed by Kotani et al. in [13]. Similarly, Renganathan et al. develop a subtree based approach, with precomputed segment reroutes in [14]. ...
For audiovisual network operators, end-users satisfaction is a major issue. This is the case for TDF who operates a nationwide network in France whose main purpose is to carry Digital Terrestrial Television streams. Such audiovisual content is forwarded through multicast real-time streams which require continuity of service. Therefore, the main goal of this work is to define a new architecture to prevent impact during network healing time. The proposed architecture aims to use a pair of redundant multicast trees, and ensure their seamless resiliency. This architecture called “Seamless Multicast” takes advantage of the network-end equipment’s ability to receive and combine two identical streams, complete or not. The main contribution of this paper is the development and evaluation of an algorithm for the computation of a pair of multicast trees and the associated hitless deployment scheme. Implementation requires an Software-Defined Networking architecture, in which performance knowledge and bandwidth management are centralized in a controller. A proof of concept controller has been used for validation of the architecture’s global behaviour using a virtualized environment in multiple scenarios.
... [71] propose une sécurisation par sous-arbres comme évoqué en 2.3.1, en exploitant des chemins de secours pré-calculés au sein des arbres.L'approche présentée dans[72] consiste à répartir les destinations sur plusieurs arbres de multidiffusion, et de préparer des inter-connexions de secours entre les arbres. Ainsi en cas de panne, les parties d'un arbre qui sont déconnectées de la source se raccordent rapidement à un autre arbre.Ces travaux de thèse proposent une implémentation des concepts et algorithmes présentés aux chapitres 2 et 3, dont l'approche diffère des solutions disponibles dans la littérature, car elle exploite à la fois redondance et routage dynamique. ...
Dans les réseaux de distribution de contenu, la Qualité d'Expérience (QoE) est principalement évaluée par un indicateur de performance : la continuité de service. C'est pourquoi la robustesse des réseaux est une problématique majeure pour les opérateurs. La société TDF opère un réseau traditionnel de transport de flux audiovisuels en temps réel à l'aide de protocoles de multidiffusion. Toute panne réseau provoque cependant un temps de convergence non-nul, qui implique des pertes et des impacts sur le contenu. Ceci illustre que la continuité de service est une conséquence directe de la disponibilité de réseau. L'objectif des travaux de cette thèse est de définir une architecture pour inhiber les impacts sur le contenu lors des phases de cicatrisation du réseau. Cette architecture établit des paires d’arbres de multidiffusion redondants disjoints et dynamiques sur le réseau de transport. Les équipements de restitution pouvant exploiter cette redondance de chemins, il est possible de pallier à d'éventuelles pertes de paquet. L'essentiel des travaux porte sur le développement et l'évaluation de différents algorithmes de calcul des arbres de distribution destinés à alimenter le moteur de routage de l’architecture. La spécification des protocoles et processus de mise en œuvre sur le réseau est également abordée. L'implémentation de l'ensemble s'appuie sur une architecture de type Software Defined Networking (SDN), dans laquelle un contrôleur centralisé exploite la connaissance des performances et de la planification en bande passante pour établir et maintenir les paires d’arbres de multidiffusion.
... The approach taken by Vignesh Renganathan Raja et al. is similar [30]. They proposed dividing the multicast tree into subtrees and installing backup paths for these subtrees instead of for the complete tree. ...
With the rapid growth of services that stream to groups of users comes an increased importance of and demand for reliable multicast. In this paper, we turn to software-defined networking and develop a novel general-purpose multi-failure protection algorithm to provide quick failure recovery, via Fast Failover (FF) groups, for dynamic multicast groups. This extends previous research, which either could not realize fast failover, worked only for single link failures, or was only applicable to static multicast groups. However, while FF is know to be fast, it requires pre-installing back-up rules. These additional memory requirements, which in a multicast setting are even more pronounced than for unicast, are often mentioned as a big disadvantage of using FF. We develop an OpenFlow application for resilient multicast, with which we study FF resource usage, in an attempt to better understand the trade-off between recovery time and resource usage. Our tests on a realistic network suggest that using FF groups can reduce the recovery time of the network significantly compared to other methods, especially when the latency between the controller and the switches is relatively large.
We present the first completely orchestrated and automatic failure recovery scheme employed various services utilizing the intelligence of SDN. Our proposed three step mechanism can safeguard controllers from failures with a recovery time of 11ms.
Existing surveys of research into Software-Defined Networking (SDN) make only minimal mention of multicasting. We present a survey of existing multicast routing protocols in IP multicast, and a survey of existing and proposed multicast routing algorithms in SDN multicast. Each of these protocols/algorithms is designed to optimize a slightly different metric, under specific constraints, so we contrast the approaches based on the optimization goal. We then present a survey of existing and proposed approaches to security for IP multicast and SDN multicast. This reveals a striking lack of breadth in the research in the topic of SDN multicast security.
