Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Control under Intermittent Network Partitions
RISE - Research Institutes of Sweden, ICT, SICS. (Network Intelligence group (DNA))
RISE - Research Institutes of Sweden, ICT, SICS. (Network Intelligence group (DNA))ORCID iD: 0000-0002-5893-7774
RISE - Research Institutes of Sweden, ICT, SICS. KTH Royal Institute of Technology, Sweden. (Network Intelligence group)ORCID iD: 0000-0002-1256-1070
2018 (English)In: Proceedings of the IEEE International Conference on Communications (ICC), 2018, p. 1-7Conference paper, Published paper (Refereed)
Abstract [en]

We propose a novel distributed leader election algorithm to deal with the controller and control service availability issues in programmable networks, such as Software Defined Networks (SDN) or programmable Radio Access Network (RAN).  Our approach can deal with a wide range of network failures, especially intermittent network partitions, where splitting and merging of a network repeatedly occur. 

In contrast to traditional leader election algorithms that mainly focus on the (eventual) consensus on one leader, the proposed algorithm aims at optimizing control service availability, stability and reducing the controller state synchronization effort during intermittent network partitioning situations. To this end, we design a new framework that enables dynamic leader election based on real-time estimates acquired from statistical monitoring. With this framework, the proposed leader election algorithm has the capability of being flexibly configured to achieve different optimization objectives, while adapting to various failure patterns. Compared with two existing algorithms,  our approach can significantly reduce the synchronization overhead (up to 12x) due to controller state updates, and maintain up to twice more nodes under a controller.

Place, publisher, year, edition, pages
2018. p. 1-7
National Category
Computer Sciences
Identifiers
URN: urn:nbn:se:ri:diva-33304OAI: oai:DiVA.org:ri-33304DiVA, id: diva2:1185511
Conference
IEEE International Conference on Communications (ICC)
Available from: 2018-02-25 Created: 2018-02-25 Last updated: 2018-05-24Bibliographically approved

Open Access in DiVA

fulltext(1063 kB)0 downloads
File information
File name FULLTEXT01.pdfFile size 1063 kBChecksum SHA-512
1b41c3177dfdaab6a83b61b527735cea33144ec9070c9635a2c9c2cf8fd2be473ed3a51163b055ee0676780e9cee77b6e6425706daea0c6232620dcd93c0f78e
Type fulltextMimetype application/pdf

Authority records BETA

Steinert, RebeccaKostic, Dejan

Search in DiVA

By author/editor
Steinert, RebeccaKostic, Dejan
By organisation
SICS
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

urn-nbn

Altmetric score

urn-nbn
Total: 110 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
v. 2.33.0