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 20 of 39 for “"Shortest Path Routing"”.

  1. Shortest Path Routing on the Hypercube with Faulty Nodes

    … networks. There are a variety of different routing paradigms that need to be investigated on the hypercube. In this thesis we investigate the shortest path routing between two nodes on the hypercube when some nodes are faulty and cannot be used. In this thesis the shortest path between two …

    brock Repository record for Shortest Path Routing on the Hypercube with Faulty Nodes (opens in a new tab)

  2. Compact routing in fault-tolerant distributed systems

    A compact routing algorithm is a routing algorithm which reduces the space complexity of all-pairs shortest path routing. Compact routing protocols in distributed systems have been studied extensively as an attractive alternative to the traditional method of all-pairs shortest path routing. The use …

    unlv Repository record for Compact routing in fault-tolerant distributed systems (opens in a new tab) Download PDF for Compact routing in fault-tolerant distributed systems (opens in a new tab)

  3. A distributed, compact routing protocol for the Internet

    … about the scalability of the current BGP routing system, as the routing state at each router in a shortest-path routing protocol will grow at a supra-linearly rate as the network grows. The concerns are that the memory capacity of routers will not be able to keep up with demands, and that …

    glasgow Download PDF for A distributed, compact routing protocol for the Internet (opens in a new tab)

  4. Compact routing for the future internet

    The Internet relies on its inter-domain routing system to allow data transfer between any two endpoints regardless of where they are located. This routing system currently uses a shortest path routing algorithm (modified by local policy constraints) called the Border Gateway Protocol. The massive …

    glasgow Download PDF for Compact routing for the future internet (opens in a new tab)

  5. Traffic Control in Packet Switched Networks

    … control options available in two existing routing solutions in packet-switched networks. The first solution is the shortest path hop-by-hop routing deployed with the OSPF or IS-IS routing protocol and the IP forwarding protocol. This is the initially deployed and still the most popular …

    dcu Download PDF for Traffic Control in Packet Switched Networks (opens in a new tab)

  6. Self-stabilizing distributed algorithms for acyclic graphs

    … topology and uses this information to build a shortest path routing table in each node in the system to all accessible nodes from that node. The second protocol determines the rank of the individual processors in a distributed tree network based on the values possessed by them. Due to the …

    unlv Repository record for Self-stabilizing distributed algorithms for acyclic graphs (opens in a new tab) Download PDF for Self-stabilizing distributed algorithms for acyclic graphs (opens in a new tab)

  7. Cognitive routing for wireless ad hoc networks

    This thesis examines the design of cognitive routing to improve wireless ad hoc network performance in terms of throughput and delay, as well as reducing the impact of relaying on the network, without deteriorating end-to-end capacity. Routing metrics are designed to replace the conventional …

    whiterose Download PDF for Cognitive routing for wireless ad hoc networks (opens in a new tab)

  8. Inferring network topology for distributed machine learning model training

    … of the underlying topology under the shortest-path routing strategy of the underlying network. Experimentally, resource allocation using the inferred topology improves the model training efficiency significantly compared to random allocation.

    uvic Repository record for Inferring network topology for distributed machine learning model training (opens in a new tab)

  9. Optimizing the router configurations within a nominal Air Force base

    Routing information is a delicate balance between theoretical ideas, such as optimization of flow, shortest path routing, and the reality of threats to the security of the network. The way information is routed can be massaged to give the best solution-that being one that aptly satisfies both of …

    nps Repository record for Optimizing the router configurations within a nominal Air Force base (opens in a new tab)

  10. Network-level Modeling of Transit Riders and Pedestrians' Thermal Comfort

    … future climate scenarios. The second applies shortest path routing for hypothetical walk trips in Downtown Lawrenceville during an extreme heat event, offering insights into potential changes in travel behavior when individuals are informed about their thermal exposure. This research …

    gatech Repository record for Network-level Modeling of Transit Riders and Pedestrians' Thermal Comfort (opens in a new tab)

  11. Traffic engineering in multi-service networks: routing, flow control and provisioning perspectives

    … of systems. The ability to perform a flexible routing of traffic loads across network resources is a key to enable providers to support a wide range of typically time varying loads. Nevertheless due to possible instabilities and unpredictability, operators have for the most part been unwilling …

    texas Repository record for Traffic engineering in multi-service networks: routing, flow control and provisioning perspectives (opens in a new tab)

  12. A Microsimulation Approach Assessing the Impact of Connected Vehicle on Work Zone Traffic Safety

    … system based on decaying average-travel-time and shortest path routing was developed and tested in a microscopic traffic simulation environment to avoid routes with work zones. To account for the unpredictable behaviour and psychology of driver’s response to information, three behaviour models, in …

    mcmaster Repository record for A Microsimulation Approach Assessing the Impact of Connected Vehicle on Work Zone Traffic Safety (opens in a new tab)

  13. Adaptive Routing Using SDN and NFV

    … implementation of network monitoring and QoS routing algorithm is inevitable. Also, several modifications occur while network planning especially in managing physical devices to host network services required to achieve QoS routing. Dynamic routing in physical network hardware is not suitable …

    umkc Repository record for Adaptive Routing Using SDN and NFV (opens in a new tab)

  14. Optimal clustering and inter-cluster routing in large-scale wireless ad hoc and sensor networks

    … the most optimal routes, we have analyzed the paths that minimize the inter-cluster routing delay. A low-delay, energy-balancing distributed algorithm for routing across clusters and between levels is developed, which outperforms shortest path routing in high throughput networks. Also, as a …

    gatech Repository record for Optimal clustering and inter-cluster routing in large-scale wireless ad hoc and sensor networks (opens in a new tab)

  15. Model-Based Deep Reinforcement Learning for Optimal Fuel-Efficient Routing and Traffic Signal Control

    … that the framework generalizes its learned routing policy to previously unseentraffic conditions and achieves meaningful reductions in vehicle-level fuel consumption relativeto conventional shortest-path routing. In the second application, the same framework is extendedto the infrastructure …

    alabama Repository record for Model-Based Deep Reinforcement Learning for Optimal Fuel-Efficient Routing and Traffic Signal Control (opens in a new tab)

  16. Multi-Core Parallel Routing

    … possible, particularly in the key function of routing. Our main goal is to find a way so we can use these cores more effectively and efficiently in routing the big data transfers. In this dissertation, we propose a novel approach to parallelize data transfers by leveraging the multi-core CPUs …

    unr Repository record for Multi-Core Parallel Routing (opens in a new tab)

  17. Self-stabilizing interval routing algorithm with low stretch factor

    A compact routing scheme is a routing strategy which suggests routing tables that are space efficient compared to traditional all-pairs shortest path routing algorithms. An Interval Routing algorithm is a compact routing algorithm which uses a routing table at every node in which a set of …

    unlv Repository record for Self-stabilizing interval routing algorithm with low stretch factor (opens in a new tab) Download PDF for Self-stabilizing interval routing algorithm with low stretch factor (opens in a new tab)

  18. Spatial modelling and analysis of wireless ad-hoc and sensor networks: an energy perspective

    … we investigate the use of proactive multipath routing in ad hoc wireless networks. The focus is on optimizing tradeoffs between the increased energy cost associated with spreading traffic and the improved spatial balance of energy burdens. We show how its optimization depends on the …

    texas Repository record for Spatial modelling and analysis of wireless ad-hoc and sensor networks: an energy perspective (opens in a new tab)

  19. Design of Multi-layer Telecommunication Networks: Fairness, Resilience, and Load Balancing

    … options are discussed, and an integrated routing, recovery, and load balancing strategy is developed. It combines failure dependent backup path protection, shortest path routing, and load balancing according to proportional fairness principle. The thesis presents both theoretical findings, …

    lund Repository record for Design of Multi-layer Telecommunication Networks: Fairness, Resilience, and Load Balancing (opens in a new tab) Download PDF for Design of Multi-layer Telecommunication Networks: Fairness, Resilience, and Load Balancing (opens in a new tab)

  20. Routing Strategies for Capacity Enhancement in Multi-hop Wireless Ad Hoc Networks

    … using a novel cross-layer Minimum Impact Routing (MIR) protocol. Perfonnance is judged in tenns of interference reduction ratio, efficiency, and system and user capacity, which are calculated based on the measurement of Disturbed Nodes (DN). A large number of routing algorithms have been …

    whiterose Download PDF for Routing Strategies for Capacity Enhancement in Multi-hop Wireless Ad Hoc Networks (opens in a new tab)

Page 1 of 2