Abstract
In distributed lightpath restoration in wavelength-routed
networks, different restoration operations may compete for the same wavelength
on the same link and get blocked though there are still plenty of idle capacities
on the link. In this paper, we propose two different wavelength assignment
methods within the same framework for lowering such type of blocking. Simulation
results show that the proposed methods significantly outperform the existing
ones. Theoretical analysis confirms the optimality of the proposed methods
for a special case; while for a few most important more general cases, it
is shown that the optimal performance cannot be guaranteed by any distributed
wavelength assignment method with a predefined wavelength searching sequence.
For different cases where the original lightpath establishment has adopted
random and first-fit wavelength assignments respectively, we discuss the different
concerns in developing efficient distributed restoration schemes.
© 2009 IEEE
PDF Article
More Like This
Cited By
You do not have subscription access to this journal. Cited by links are available to subscribers only. You may subscribe either as an Optica member, or as an authorized user of your institution.
Contact your librarian or system administrator
or
Login to access Optica Member Subscription