Table 1 Algorithm of RDM TELIC

•

A graph consisting of multiple node connected through links. Each link specifies the amount of bandwidth available, delay, Reliability and colour. For better understanding node are represented by N, links by M links, bandwidth B, delay D, reliability R and color by C

Output

•

An establishment of LSP between the designated ingress router and the egress router satisfying the minimum cost criteria and meeting the FEC criteria

Algorithm steps: (domain topology is loaded)

•

(1) Read the next request

•

(2) Determine the Diffserv class of service

•

(3) For EF, compare against available limit on the subgraphs that includes silver, white and green links in order. Check if it is used by lower classes, if yes then go for pre-emption and route the LSP with a subgraphs that includes silver, white and green links in that order otherwise queue the request at lower position

•

(4) For AF, compare against available limit on the subgraphs that includes green, yellow, white & silver links in order. If the limit is available, then check if it is used by lower classes, if yes then go for pre-emption and route the LSP with a subgraphs that includes silver, white and green links in that order otherwise queue the request at the lower position. Route the LSP with a subgraphs that includes green, yellow white in that order

•

(5) If it is DF, route the LSP with a subgraphs that includes red, yellow and green links in that order

•

(6) Output the LSP, store it in the LSP table in the ingress router and reduce the available bandwidth, increasing the CD of the link

•

(7) Update the colors of the links included in the new LSP as per the color table in the ingress node