By Topic

A spanning tree-based QoS aggregation algorithm in hierarchical ASON

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Lei Lei ; Sch. of Telecommun. Eng., Beijing Univ. of Posts & Telecommun., China ; Yuefeng Ji

This letter proposes a new way of minimizing QoS parameters distortion caused by spanning tree topology aggregation in hierarchical automatic switched optical networks. It encodes the divide point information of the missing logical links in the spanning tree with a single float number. Based on this new method, an approximation algorithm is presented. Simulation results show that the proposed method and algorithm perform much better than the traditional way of decoding the spanning tree with upper or lower bounds.

Published in:

Communications Letters, IEEE  (Volume:9 ,  Issue: 5 )