Latest revision as of 17:53, 28 January 2021

Abstract

This paper presents and compares different TE information dissemination strategies between Path Computation Elements (PCEs) in multi-domain optical networks. In such network context, recent studies have found that path computation only with local domain visibility yields poor network performance. Accordingly, certain visibility between domains seems necessary. Aiming to fit the confidentiality requirements of the composing domains while improving the final network blocking probability, novel link aggregation techniques have been proposed, which summarize the state of network domains resources efficiently. This aggregated link information is afterwards disseminated to all the remainder domains in the network. To this end, we introduce different update triggering policies to make a good trade-off between routing information scalability and inaccuracy. The performance of all contributions has been supported by illustrative simulation results.

Original document

The different versions of the original document can be found in:

• http://hdl.handle.net/2117/10737

• https://upcommons.upc.edu/bitstream/2117/10737/1/05549261.pdf

• http://xplorestaging.ieee.org/ielx5/5521357/5548932/05549261.pdf?arnumber=5549261,

http://dx.doi.org/10.1109/icton.2010.5549261

• https://upcommons.upc.edu/handle/2117/10737,

http://yadda.icm.edu.pl/yadda/element/bwmeta1.element.ieee-000005549261,

https://upcommons.upc.edu/bitstream/handle/2117/10737/05549261.pdf;sequence=1,

http://ieeexplore.ieee.org/document/5549261,

https://ieeexplore.ieee.org/document/5549261,

https://academic.microsoft.com/#/detail/2104086986