All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Impact of Nodal Centrality Measures to Robustness in Software-Defined Networking

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F14%3A00223196" target="_blank" >RIV/68407700:21230/14:00223196 - isvavai.cz</a>

  • Result on the web

    <a href="http://advances.utc.sk/index.php/AEEE/article/view/1208" target="_blank" >http://advances.utc.sk/index.php/AEEE/article/view/1208</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.15598/aeee.v12i4.1208" target="_blank" >10.15598/aeee.v12i4.1208</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Impact of Nodal Centrality Measures to Robustness in Software-Defined Networking

  • Original language description

    The paper deals with the network robustness from the perspective of nodal centrality measures and its applicability in Software-Defined Networking (SDN). Traditional graph characteristics have been evolving during the last century, and numerous of less-conventional metrics was introduced trying to bring a new view to some particular graph attributes. New control technologies can finally utilize these metrics but simultaneously show new challenges. SDN brings the fine-grained and nearly online view of the underlying network state which allows to implement an advanced routing and forwarding. In such situation, sophisticated algorithms can be applied utilizing pre-computed network measures. Since in recent version of SDN protocol OpenFlow (OF) has been revived an idea of the fast link failover, the authors in this paper introduce a novel metric, Quality of Alternative Paths centrality (QAP). The QAP value quantifies node surroundings and can be with an advantage utilized in algorithms to

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

  • CEP classification

    IN - Informatics

  • OECD FORD branch

Result continuities

  • Project

    <a href="/en/project/VG20132015104" target="_blank" >VG20132015104: Research and development of secure and reliable communications network equipments to support the distribution of electric energy and other critical infrastructures</a><br>

  • Continuities

    S - Specificky vyzkum na vysokych skolach

Others

  • Publication year

    2014

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Name of the periodical

    Advances in Electrical and Electronic Engineering

  • ISSN

    1336-1376

  • e-ISSN

  • Volume of the periodical

    12

  • Issue of the periodical within the volume

    4

  • Country of publishing house

    CZ - CZECH REPUBLIC

  • Number of pages

    8

  • Pages from-to

    252-259

  • UT code for WoS article

  • EID of the result in the Scopus database