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!
cited_by
cites
container_end_page 625
container_issue 4
container_start_page 622
container_title ETRI journal
container_volume 32
creator Perelló, Jordi
Hernández‐Sola, Guillem
Agraz, Fernando
Spadaro, Salvatore
Comellas, Jaume
description 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.
doi_str_mv 10.4218/etrij.10.0210.0063
format article
fullrecord <record><control><sourceid>wiley_nrf_k</sourceid><recordid>TN_cdi_nrf_kci_oai_kci_go_kr_ARTI_917849</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>ETR20622</sourcerecordid><originalsourceid>FETCH-LOGICAL-c2802-ba8c4b14926e24a95f906ab771980b78aff32e2d69d73f6d02cbf49cdfe3f50f3</originalsourceid><addsrcrecordid>eNqNkNFOwjAUhhujiYi-gFe79GbanXZde4kLKAkqAbxuuq2FwlhJN0K48xF8Rp_EDXwAb86fP_m_c_EhdB_hRwoRf9KNt-vHtmHoDmbkAvUACAkTAuwS9SKAOGSUkWt0U9drjAHTmPfQfJ6rUmWlDqaqWQWp2-72jWqsq4JR6Vxhq2Uw2O28U_kqMM4H03T48_X9rGpdBG_7srFtK9xW2Sp4183B-U19i66MKmt995d99DkaLtLXcPLxMk4HkzAHjiHMFM9pFlEBTANVIjYCM5UlSSQ4zhKujCGgoWCiSIhhBYY8M1TkhdHExNiQPno4_628kZvcSqfsKZdObrwczBZjKaKEU9FO4TzNvatrr43cebtV_igjLDuD8mSwa51B2RlsIX6GDrbUx38QcriYAWat919p-Hi3</addsrcrecordid><sourcetype>Open Website</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Scalable Path Computation Flooding Approach for PCE‐Based Multi‐domain Networks</title><source>Alma/SFX Local Collection</source><creator>Perelló, Jordi ; Hernández‐Sola, Guillem ; Agraz, Fernando ; Spadaro, Salvatore ; Comellas, Jaume</creator><creatorcontrib>Perelló, Jordi ; Hernández‐Sola, Guillem ; Agraz, Fernando ; Spadaro, Salvatore ; Comellas, Jaume</creatorcontrib><description>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.</description><identifier>ISSN: 1225-6463</identifier><identifier>EISSN: 2233-7326</identifier><identifier>DOI: 10.4218/etrij.10.0210.0063</identifier><language>eng</language><publisher>한국전자통신연구원</publisher><subject>BRPC ; domain sequence ; Multi‐domain ; PCE ; 전자/정보통신공학</subject><ispartof>ETRI Journal, 2010, 32(4), , pp.622-625</ispartof><rights>2010 ETRI</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,27924,27925</link.rule.ids><backlink>$$Uhttps://www.kci.go.kr/kciportal/ci/sereArticleSearch/ciSereArtiView.kci?sereArticleSearchBean.artiId=ART001467334$$DAccess content in National Research Foundation of Korea (NRF)$$Hfree_for_read</backlink></links><search><creatorcontrib>Perelló, Jordi</creatorcontrib><creatorcontrib>Hernández‐Sola, Guillem</creatorcontrib><creatorcontrib>Agraz, Fernando</creatorcontrib><creatorcontrib>Spadaro, Salvatore</creatorcontrib><creatorcontrib>Comellas, Jaume</creatorcontrib><title>Scalable Path Computation Flooding Approach for PCE‐Based Multi‐domain Networks</title><title>ETRI journal</title><description>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.</description><subject>BRPC</subject><subject>domain sequence</subject><subject>Multi‐domain</subject><subject>PCE</subject><subject>전자/정보통신공학</subject><issn>1225-6463</issn><issn>2233-7326</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2010</creationdate><recordtype>article</recordtype><recordid>eNqNkNFOwjAUhhujiYi-gFe79GbanXZde4kLKAkqAbxuuq2FwlhJN0K48xF8Rp_EDXwAb86fP_m_c_EhdB_hRwoRf9KNt-vHtmHoDmbkAvUACAkTAuwS9SKAOGSUkWt0U9drjAHTmPfQfJ6rUmWlDqaqWQWp2-72jWqsq4JR6Vxhq2Uw2O28U_kqMM4H03T48_X9rGpdBG_7srFtK9xW2Sp4183B-U19i66MKmt995d99DkaLtLXcPLxMk4HkzAHjiHMFM9pFlEBTANVIjYCM5UlSSQ4zhKujCGgoWCiSIhhBYY8M1TkhdHExNiQPno4_628kZvcSqfsKZdObrwczBZjKaKEU9FO4TzNvatrr43cebtV_igjLDuD8mSwa51B2RlsIX6GDrbUx38QcriYAWat919p-Hi3</recordid><startdate>201008</startdate><enddate>201008</enddate><creator>Perelló, Jordi</creator><creator>Hernández‐Sola, Guillem</creator><creator>Agraz, Fernando</creator><creator>Spadaro, Salvatore</creator><creator>Comellas, Jaume</creator><general>한국전자통신연구원</general><scope>AAYXX</scope><scope>CITATION</scope><scope>ACYCR</scope></search><sort><creationdate>201008</creationdate><title>Scalable Path Computation Flooding Approach for PCE‐Based Multi‐domain Networks</title><author>Perelló, Jordi ; Hernández‐Sola, Guillem ; Agraz, Fernando ; Spadaro, Salvatore ; Comellas, Jaume</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c2802-ba8c4b14926e24a95f906ab771980b78aff32e2d69d73f6d02cbf49cdfe3f50f3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2010</creationdate><topic>BRPC</topic><topic>domain sequence</topic><topic>Multi‐domain</topic><topic>PCE</topic><topic>전자/정보통신공학</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Perelló, Jordi</creatorcontrib><creatorcontrib>Hernández‐Sola, Guillem</creatorcontrib><creatorcontrib>Agraz, Fernando</creatorcontrib><creatorcontrib>Spadaro, Salvatore</creatorcontrib><creatorcontrib>Comellas, Jaume</creatorcontrib><collection>CrossRef</collection><collection>Korean Citation Index</collection><jtitle>ETRI journal</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Perelló, Jordi</au><au>Hernández‐Sola, Guillem</au><au>Agraz, Fernando</au><au>Spadaro, Salvatore</au><au>Comellas, Jaume</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Scalable Path Computation Flooding Approach for PCE‐Based Multi‐domain Networks</atitle><jtitle>ETRI journal</jtitle><date>2010-08</date><risdate>2010</risdate><volume>32</volume><issue>4</issue><spage>622</spage><epage>625</epage><pages>622-625</pages><issn>1225-6463</issn><eissn>2233-7326</eissn><abstract>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.</abstract><pub>한국전자통신연구원</pub><doi>10.4218/etrij.10.0210.0063</doi><tpages>4</tpages></addata></record>
fulltext fulltext
identifier ISSN: 1225-6463
ispartof ETRI Journal, 2010, 32(4), , pp.622-625
issn 1225-6463
2233-7326
language eng
recordid cdi_nrf_kci_oai_kci_go_kr_ARTI_917849
source Alma/SFX Local Collection
subjects BRPC
domain sequence
Multi‐domain
PCE
전자/정보통신공학
title Scalable Path Computation Flooding Approach for PCE‐Based Multi‐domain Networks
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-28T12%3A20%3A18IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-wiley_nrf_k&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Scalable%20Path%20Computation%20Flooding%20Approach%20for%20PCE%E2%80%90Based%20Multi%E2%80%90domain%20Networks&rft.jtitle=ETRI%20journal&rft.au=Perell%C3%B3,%20Jordi&rft.date=2010-08&rft.volume=32&rft.issue=4&rft.spage=622&rft.epage=625&rft.pages=622-625&rft.issn=1225-6463&rft.eissn=2233-7326&rft_id=info:doi/10.4218/etrij.10.0210.0063&rft_dat=%3Cwiley_nrf_k%3EETR20622%3C/wiley_nrf_k%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c2802-ba8c4b14926e24a95f906ab771980b78aff32e2d69d73f6d02cbf49cdfe3f50f3%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true