Please use this identifier to cite or link to this item: http://hdl.handle.net/10773/28815
Full metadata record
DC FieldValueLanguage
dc.contributor.authorSantos, Dorabellapt_PT
dc.contributor.authorSousa, Amaro dept_PT
dc.contributor.authorMas Machuca, Carmenpt_PT
dc.date.accessioned2020-07-10T13:26:24Z-
dc.date.available2020-07-10T13:26:24Z-
dc.date.issued2019-10-
dc.identifier.issn0003-4347pt_PT
dc.identifier.urihttp://hdl.handle.net/10773/28815-
dc.description.abstractIn software-defined networking (SDN), the control plane is separated from the data plane. For scalability and robustness reasons, the logically centralized control plane is implemented by physically distributing different controllers throughout the network. The determination of the number and location of the SDN controllers is known as the controller placement problem (CPP). For given maximum switch-controller (SC) and controller controller (CC) delays in the regular (failure-free) state, we aim to find a CPP solution that maximizes the control plane robustness against a given number of malicious node attacks. We describe an ILP-based method aiming to enumerate all CPP solutions that guarantee the existence of a data plane path from every switch to any controller if all other controller nodes are shut down (worst-case scenario). Then, for different malicious node attacks, based on node centrality metrics and corresponding to different attacker’s strategies, we evaluate the previous solutions to determine the ones that maximize the network robustness, considering the SDN control plane operating with or without split-brain. In the computational results, we compare the robustness and the average SC and CC delays of the best CPP solutions. Since a control plane with split-brain requires more controllers, the average SC and CC delays in the regular state of its CPP solutions are significantly better, on average. Concerning robustness, split-brain does not always provide the best robust CPP solutions due to its feature of requiring a minimum number of connected controllers (which must be over half of the total number of them) to be operational.pt_PT
dc.language.isoengpt_PT
dc.publisherSpringerpt_PT
dc.relationCENTRO-01-0145-FEDER-029312pt_PT
dc.relationCOST-CA15127(RECODIS)pt_PT
dc.relationSFRH/BPD/111503/2015pt_PT
dc.rightsrestrictedAccesspt_PT
dc.rights.urihttps://creativecommons.org/licenses/by/4.0/pt_PT
dc.subjectSDNpt_PT
dc.subjectController placement problempt_PT
dc.subjectMalicious node attackspt_PT
dc.subjectInteger linear programmingpt_PT
dc.subjectNode centralitypt_PT
dc.titleThe controller placement problem for robust SDNs against malicious node attacks considering the control plane with and without split-brainpt_PT
dc.typearticlept_PT
dc.description.versionpublishedpt_PT
dc.peerreviewedyespt_PT
degois.publication.firstPage575pt_PT
degois.publication.issue9-10pt_PT
degois.publication.lastPage591pt_PT
degois.publication.titleAnnals of Telecommunicationspt_PT
degois.publication.volume74pt_PT
dc.identifier.doi10.1007/s12243-019-00725-7pt_PT
dc.identifier.essn1958-9395pt_PT
Appears in Collections:DETI - Artigos

Files in This Item:
File Description SizeFormat 
Santos2019_Article_TheControllerPlacementProblemF.pdfpublished online version10.4 MBAdobe PDFrestrictedAccess


FacebookTwitterLinkedIn
Formato BibTex MendeleyEndnote Degois 

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.