Scheduled System Maintenance:
On Monday, April 27th, IEEE Xplore will undergo scheduled maintenance from 1:00 PM - 3:00 PM ET (17:00 - 19:00 UTC). No interruption in service is anticipated.
By Topic

Adaptive shortest path routing in GMPLS-based optical networks using fuzzy link costs

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)
Bin Zhou ; Dept. of Electr. & Comput. Eng., Queen''s Univ., Kingston, Ont., Canada ; Mouftah, H.T.

The single static routing metric, which is used broadly nowadays is not flexible and adaptive to support the versatile optical networks. Previous adaptive routing algorithms using crisp adaptive link cost function are not scalable to the multiple metrics, which are essential for multi-service networks. Fuzzy link costs offer an excellent opportunity to take all desirable aspects into consideration when evaluating possible routes. In this paper, an adaptive fuzzy shortest path (AFSP) routing scheme is proposed and designed to add to existing and developmental routing protocols (and their extensions) enabling them to use complex heterogeneous metric data simply and fairly. Simulation results show that the AFSP routing scheme can efficiently support multi-service traffic with elegant scalability.

Published in:

Electrical and Computer Engineering, 2004. Canadian Conference on  (Volume:3 )

Date of Conference:

2-5 May 2004