Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 7 of 7 for “"Path Computation"”.
-
Performing Distance Queries on Social Networks in Sublinear Time
Shortest path computation is an important base task in many applications. While there have been improvements to the shortest path algorithms, all require preprocessing the entirety of the graph, creating inefficiencies, especially when applied to large social networks. Considering that social …
-
End-to-end provisioning in multi-domain/multi-layer networks
… are needed in the area of inter- domain routing, path computation, and signaling. The work in this thesis addresses these very challenges. Namely, a hierarchical routing framework is first developed to incorporate the multiple link types/granularities encountered in different network domains. …
-
Link failure protection and restoration in WDM optical networks
… much study. Existing algorithms use either path-based method or link-based method to protect a dynamic connection; the former suffers slow restoration speed while the latter requires complicated online backup path computation. We propose a new dynamic restorable connection establishment …
-
Auto-bandwidth control in dynamically reconfigured hybrid-SDN MPLS networks
… of SDN with the robust MPLS label switched path features along with traffic engineering enhancements introduced by routing protocols such as Border Gateway Patrol-Traffic Engineering (BGP-TE) and Open Shortest Path First-Traffic Engineering (OSPF-TE). The implemented mixed-integer linear …
-
Enhancing OSPF to provide adaptive traffic distribution with networks for improved QoS performance
… such as OSPF in the main only use shortest-path algorithms and an arbitrarysingle metric such as hop count, for optimal path computation. Therefore, routingprotocols need to have a more complex model to support QoS requirements. The basicproblem of QoS-based routing is then to find a path …
-
Efficient cross-layer routing and congestion control architectures for distributed systems
… a common known challenge of finding an optimal path to transfer content from a source to a destination and the optimal rate at which content is transmitted. In general networks such as the Internet, per user, there is usually one possible content source/destination such as a web server. There …