Grid Job Routing Algorithms - Phosphorus

Grid Job Routing Algorithmsarrival the user specified parameters carried by the LSP request are parsed into constraints inside the PCEwhich takes the responsibility to provide the required end to end path if possible. The coordination of Gridapplications requires the rapid discovery of appropriate connections which are the result of very complex andintensive path computations. PCE can assist to this direction through the abstracted information of the globaltopology stored in the TED, of each domain, especially in cases where the network Management Plane is notable to provide this functionality. From the Grid constraints (Grid resource scheduling and coordination)described above the PCE constructs a reduced topology of the network based on which the IA-RWA algorithmsthat are implemented on the PCE proceed to the path calculation taking into consideration physical layerparameters to provide improved performance for the connection requests.Project:PHOSPHORUSDeliverable Number: D.5.3Date of Issue: 31/06/07EC Contract No.: 034115Document Code: Phosphorus-WP5-D5.328