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

  1. 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 Repository record for Traffic Control in Packet Switched Networks (opens in a new tab)

  2. 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)

  3. Towards a cognitive network management and control system

    … this context we will focus on the problem of shortest path routing, and identify pragmatic schemes that allow a central controller to collect relevant delay statistics from various links and nodes within the network. We present Significant Sampling as an adaptive monitoring technique to …

    mit Repository record for Towards a cognitive network management and control system (opens in a new tab)

  4. Optimal Control for Wireless Software Defined Networks: Theory and Implementation

    … sub-optimal in throughput due to quasi-static shortest path routing. Though throughput-optimal and well-established in the literature, the BackPressure (BP) algorithm is not compatible with wireless SDN architecture. In contrast, the recently developed Universal Max-Weight (UMW) policy also …

    mit Repository record for Optimal Control for Wireless Software Defined Networks: Theory and Implementation (opens in a new tab)

  5. Learning to route efficiently with end-to-end feedback : the value of (identifiable) networked structure

    … regrets for the problem of stochastic online shortest path routing with end-to-end feedback. The setting is a natural application of the combinatorial stochastic bandits problem, a special case of the linear stochastic bandits problem. We show how the difficulties posed by the large scale …

    mit Repository record for Learning to route efficiently with end-to-end feedback : the value of (identifiable) networked structure (opens in a new tab)

  6. 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)

  7. 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)

  8. 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)

  9. 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)

  10. Efficient admission control and routing for resilient communication networks

    … areas: resilient admission control and resilient routing. The work gives an overview of the state of the art of quality of service mechanisms in communication networks and proposes a categorization of admission control (AC) methods. These approaches are investigated regarding performance, more …

    wurz-thes Repository record for Efficient admission control and routing for resilient communication networks (opens in a new tab)

  11. Location Privacy In Emerging Network-Based Applications

    … is directly related with the pattern of the routing protocol. Thus to completely remove that pattern, we propose to use a random walk to defeat the threat.</p> <p>Second, authentication is generally required to establish the identities of interacting parties in an electronical communication. …

    wayne-thes Repository record for Location Privacy In Emerging Network-Based Applications (opens in a new tab)

  12. Optimization based nonlinear feedback control for pedestrian evacuation from a network of corridors

    … is divided into two basic problems of flow routing and flow control. In this study the solutions of these two basic problems are developed. The proposed solution for the flow routing problem is based on the concept of shortest paths on a graph wherein the shortest paths are determined by the …

    vt Repository record for Optimization based nonlinear feedback control for pedestrian evacuation from a network of corridors (opens in a new tab)

  13. Video Communications over Dynamic Ad Hoc Networks

    … fading, and so forth). Existing ad hoc routing protocols work well for data communications, but are not optimized for video, which is sensitive to latency and packet loss. Moreover, traditional end system based error control mechanisms alone cannot guarantee a sustainable video quality. …

    vt Repository record for Video Communications over Dynamic Ad Hoc Networks (opens in a new tab)