![]() |
|
|
Spring 2006 Colloquium Series Bijan Jabbari Bijan Jabbari, will talk about A Scalable Dynamic Path
Computation Framework for Inter-Domain IP and Optical Networks. With
the growing demand in using traffic engineered label switched paths
(LSPs) across multiple domains, the need for dynamic path computation
has become unavoidable. The constraint based routing based on CSPF (constrained
shortest path first) which determines whether a link meets the traffic
engineering constraints within a domain is found to be no longer effective.
Path computation Element (PCE) has been introduced to address the present
shortcomings and examine more complex set of constraints. This, in particular,
has become important when the optical transport attributes are considered
in conjunction with the IP links. This talk will review some of the
problems with the existing Internet architecture and will provide a
framework to augment it with more general and routing and path computation
techniques. Our focus will then be on a scalable dynamic fast path computation
algorithm. We will present the suitability and effectiveness of this
algorithm in dynamically provisioning resources for the end-to-end guaranteed
services. IS&T Colloquium Committee Host: Ben Kobler, Sign language interpreter upon request: 301-286-8313 |
|||||||||||||||||||||||||||||||||
|
|
||||||||||||||||||||||||||||||||||
|
|
||||||||||||||||||||||||||||||||||
| Information Science & Technology Colloquium Series Responsible NASA Official: Paul Hunter Curator: Patrick Healey + Privacy Policy and Important Notices This file was last modified on Friday, 04-Apr-2008 15:09:34 EDT |
||||||||||||||||||||||||||||||||||