In partial fulfillment of the Requirements for the Degree of
Master of Science
SATISH VARMA DANDU
will defend his thesis
PERFORMANCE ANALYSIS OF A NEW DYNAMIC PATH COMPUTATION ALGORITHM FOR MULTI-DOMAIN OPTICAL NETWORKS
Abstract
In the recent years, service providers and carriers are focusing on several revenue-generated applications such as multimedia, video, digital services etc. These applications demand high bandwidth. Although optical networks are deployed to provide high bandwidth at reduced costs, they are not flexible and efficiently utilized to support such applications. Such applications require end to end delivery of information and flexible bandwidth allocation; therefore provisioning in optical networks need to be dynamic, flexible and consider provisioning in multiple domains.
This thesis presents a novel dynamic path computation algorithm for optical multi-domain networks. This algorithm updates the inter-domain paths and domain’s egress node dynamically after visiting an intermediate domain between the source and the destination. Experimental results show that the performance of the proposed algorithm is better than existing source routing algorithm for provisioning circuits in optical multi-domain networks.
Date: 1, DECEMBER, 2005
Time: 02:30 PM
Place: 648-PGH
Faculty, students, and the general public are invited.
Thesis Advisor: Dr. Jaspal Subhlok