| The global Internet is effectively a loose collection of semi-autonomous constituent networks. Each of these operates with its own policies, services, prices, and customers making independent decisions about where and how to secure supply of various components that are needed to create the network service.;In this thesis, we propose several novel schemes and heuristics that are suitable for the implementation in multi-domain hierarchical networks. The proposed schemes address the dynamic provisioning of service constrained and/or failure-disjoint paths for point-to-point, as well as point-to-multipoint TE LSPs.;The next generation network is about convergence of multiple services onto a single multilayered network. A service or quality offered by the network is envisaged as a concatenation of dissimilar services offered at multiple switching layers and domains. Consequently, control plane mechanisms must support the routing of service requests through a series of regions using dissimilar convergence layers. Generalized Multi-Protocol Label Switching (GMPLS) protocol suite has been extensively deployed to provide consistent quality of service (QoS) within intra-domain boundaries. This process is simple and efficient when a GMPLS Label Switched Path (LSP) involves only one domain, but can potentially become severely resource heavy, complex, and inefficient when multiple domains are involved. The Path Computation Element (PCE) has been introduced as a candidate solution to solve this. A PCE collects link-state information and performs path computation on behalf of other network nodes. Since the PCE is completely devoted to path computation, the visibility of network resources can be extended including a higher number of network nodes and layers. |
