A reactive resource defragmentation method for Virtual Links Mapping in software-defined networks
| Autor: | A. F. Simo Tegueu, Pascal Berthou, Thierry Villemur, Slim Abdellatif |
|---|---|
| Přispěvatelé: | Équipe Services et Architectures pour Réseaux Avancés (LAAS-SARA), Laboratoire d'analyse et d'architecture des systèmes (LAAS), Université Toulouse - Jean Jaurès (UT2J)-Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées-Université Fédérale Toulouse Midi-Pyrénées-Centre National de la Recherche Scientifique (CNRS)-Université Toulouse III - Paul Sabatier (UT3), Université Fédérale Toulouse Midi-Pyrénées-Institut National des Sciences Appliquées - Toulouse (INSA Toulouse), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse - Jean Jaurès (UT2J)-Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées, Institut National des Sciences Appliquées - Toulouse (INSA Toulouse), Institut National des Sciences Appliquées (INSA), Université Toulouse - Jean Jaurès (UT2J), Université Toulouse III - Paul Sabatier (UT3), IEEE LANMAN, ANR-13-ASTR-0024,ADN,Réseau guidé par les Applications dans les environnements DyNamiques(2013), Université Toulouse Capitole (UT Capitole), Université de Toulouse (UT)-Université de Toulouse (UT)-Institut National des Sciences Appliquées - Toulouse (INSA Toulouse), Institut National des Sciences Appliquées (INSA)-Université de Toulouse (UT)-Institut National des Sciences Appliquées (INSA)-Université Toulouse - Jean Jaurès (UT2J), Université de Toulouse (UT)-Université Toulouse III - Paul Sabatier (UT3), Université de Toulouse (UT)-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université de Toulouse (UT)-Université Toulouse Capitole (UT Capitole), Université de Toulouse (UT), Institut National des Sciences Appliquées (INSA)-Université de Toulouse (UT) |
| Rok vydání: | 2017 |
| Předmět: |
VNE
OpenFlow Computer science Distributed computing Network virtualization 050801 communication & media studies 02 engineering and technology Network topology computer.software_genre SDN Network hypervisor [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI] 0508 media and communications 0202 electrical engineering electronic engineering information engineering resources defragmentation Resources management and sharing business.industry Quality of service 05 social sciences reactive network management 020206 networking & telecommunications Virtualization virtual links mapping Resource allocation Defragmentation Software-defined networking business computer Computer network |
| Zdroj: | 2017 IEEE International Symposium on Local and Metropolitan Area Networks (LANMAN) Local and Metropolitan Area Networks (LANMAN), 2017 IEEE International Symposium on 23rd IEEE International Symposium on Local and Metropolitan Area Networks (LANMAN 2017) 23rd IEEE International Symposium on Local and Metropolitan Area Networks (LANMAN 2017), IEEE LANMAN, Jun 2017, Osaka, Japan. 6p., ⟨10.1109/LANMAN.2017.7972143⟩ LANMAN |
| DOI: | 10.1109/LANMAN.2017.7972143 |
| Popis: | International audience; Assigning network resources to Virtual Links (VLs) efficiently and on-demand is a challenging problem for any network virtualization solution. Known as the Virtual Link Mapping (VLM) problem, its objective is to compute the appropriate network paths with the required network resources that meet the quality of service expectations of arriving VLs while spreading the load over all nodes to maximise the admissibility of forthcoming VLs. Despite the efficiency of existing VL mapping algorithms, when resources are allocated and released over time due to the arrivals and departures of VLs, the network inevitably drift into a fragmented state (with nodes with very different loads) often causing a VLs request rejection that could have been avoided with a different resource allocation. In practice, defrag-mentation algorithms are used in complement to VL mapping algorithms to proactively or reactively (on the event of a VLs request refusal) trigger some VLs reallocation (or migration). In this paper, we propose an Integer-Linear program (ILP) based reactive defragmentation and VLs mapping algorithm for an SDN/OpenFlow network. In addition to selecting the VLs that should be migrated to reduce network defragmentation, our algorithm also computes the paths (and the associated resources) that support the previously rejected VLs. Our solution was evaluated on a real network topology and the experiments showed that our proposal outperforms existing approaches from the literature by about 12% in terms of acceptance rate with a gain on migration costs around 40%. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|