Open AccessScalable Path Computation Flooding Approach for PCE‐Based Multi‐domain Networks
Author(s) -
Perelló Jordi,
HernándezSola Guillem,
Agraz Fernando,
Spadaro Salvatore,
Comellas Jaume
Publication year - 2010
Publication title -
etri journal
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.295
H-Index - 46
eISSN - 2233-7326
pISSN - 1225-6463
DOI - 10.4218/etrij.10.0210.0063
Subject(s) - scalability , computation , flooding (psychology) , overhead (engineering) , computer science , path (computing) , blocking (statistics) , domain (mathematical analysis) , reduction (mathematics) , distributed computing , algorithm , computer network , mathematics , psychology , geometry , database , psychotherapist , operating system , mathematical analysis
In this letter, we assess the scalability of a path computation flooding (PCF) approach to compute optimal end‐to‐end inter‐domain paths in a path computation element‐based multi‐domain network. PCF yields a drastically reduced network blocking probability compared to a blind per‐domain path computation but introduces significant network control overhead and path computation complexity. In view of this, we introduce and compare an alternative low overhead PCF (LoPCF) solution. From the obtained results, LoPCF leads to similar blocking probabilities to PCF while exhibiting around 50% path computation complexity and network control overhead reduction.