Scalable Path Computation Flooding Approach for PCE‐Based Multi‐domain Networks

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 computa...

Full description

Saved in:
Bibliographic Details
Published in:ETRI journal 2010, 32(4), , pp.622-625
Main Authors: Perelló, Jordi, Hernández‐Sola, Guillem, Agraz, Fernando, Spadaro, Salvatore, Comellas, Jaume
Format: Article
Language:English
Subjects:
BRPC
domain sequence
Multi‐domain
PCE
전자/정보통신공학
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:1225-6463
2233-7326
DOI:10.4218/etrij.10.0210.0063