MARBEN Routing Controller
The routing controller is defined in ITU-TG.8080 to:- respond to requests from connection controllers for path (route) information needed to set up connections. This information can vary from end-to-end (e.g., source routing) to next hop;
- respond to requests for topology (SNPs and their abstractions) information for network management purposes.
Addressing information about other subnetworks at the same layer (peer subnets) is also maintained. It may also maintain knowledge of SNP state to enable constraint based routing. Using this view, a possible route can be determined between two or more (sets of ) SNPs taking into account some routing constraints. There are varying levels of routing detail that span the following.
MARBEN Routing Controller provides path computation capabilities as listed:
- A simple Dijkstra shortest-path-first algorithm;
- A cost-optimized node-diverse path computation algorithm;
- A number-of-hops-optimized node-diverse path computation algorithm;
- A cost-optimized link-diverse path computation algorithm;
- A number-of-hops-optimized link-diverse path computation algorithm.
MARBEN Routing Controller can also acts a PCE Client getting its explicit route from a PCE server. The Policy - local computation vs PCE server is selected by the policy enforcement point agent.
Here after 2 different path results for a simple one metric cost network:

Node disjoint, optimal cost but not hop count

Link Diverse Node algorithm