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 28 for “"Dynamic Routing"”.

  1. Optimal dynamic routing in an unreliable queuing system

    Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1981.

    mit Repository record for Optimal dynamic routing in an unreliable queuing system (opens in a new tab)

  2. Dynamic routing in an unreliable manufacturing network with limited storage

    Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1981.

    mit Repository record for Dynamic routing in an unreliable manufacturing network with limited storage (opens in a new tab)

  3. Dynamic routing on stochastic time-dependent networks using real-time information

    … the key performance measures for dispatching and routing of freight vehicles. Both the travel time delay and its variability impact the efficiency of JIT logistics operations, that are becoming more and more common in many industries, and in particular, the automotive industry. In this …

    wayne-thes Repository record for Dynamic routing on stochastic time-dependent networks using real-time information (opens in a new tab)

  4. The application of optimal control theory to dynamic routing in data communication networks.

    Thesis. 1977. Ph.D.--Massachusetts Institute of Technology. Dept. of Aeronautics and Astronautics.

    mit Repository record for The application of optimal control theory to dynamic routing in data communication networks. (opens in a new tab)

  5. Models and algorithms for the optimization of traffic flows and emissions using dynamic routing and pricing

    … optimization of traffic flows and emissions via routing and pricing in dynamic traffic networks. A set of problems that arise in this context are studied. These include: (1) the development of a probabilistic approach to model acceleration, (2) the study of the dynamic capacitated minimum cost …

    mit Repository record for Models and algorithms for the optimization of traffic flows and emissions using dynamic routing and pricing (opens in a new tab)

  6. Resource management for dynamic optical networks

    … for higher bandwidth at lower cost. New dynamic optical networks greatly improve the reconfigurability of optical terminal systems and support unprecedented flexibility for high-traffic resource sharing. However, managing dynamic networks poses challenging problems related to scale and …

    uiuc Repository record for Resource management for dynamic optical networks (opens in a new tab)

  7. An integrated framework for freight forwarders:exploitation of dynamic information for multimodal transportation

    … mid-size freight forwarder. </p> <p>We develop a routing algorithm for congestion avoidance on air-network based on historical data and introduce an innovative approach to incorporate real-time information to enable dynamic routing of cargo on a stochastic air-network. In the road network, we …

    wayne-thes Repository record for An integrated framework for freight forwarders:exploitation of dynamic information for multimodal transportation (opens in a new tab)

  8. Practical algorithms for distributed network control

    Optimal routing and scheduling algorithms have been studied for decades, however several practical issues prevent the adoption of these network control policies on the Internet. This thesis considers two distinct topics in distributed network control: (i) maximizing throughput in wireless networks …

    mit Repository record for Practical algorithms for distributed network control (opens in a new tab)

  9. Inverse Reinforcement Learning and Routing Metric Discovery

    … of discovering a composite metric used by a dynamic routing algorithm on an Internet Protocol (IP) network. The network and routing algorithm are modeled as a reinforcement learning (RL) agent and a Markov decision process (MDP). The problem of routing metric discovery is then posed as a …

    vt Repository record for Inverse Reinforcement Learning and Routing Metric Discovery (opens in a new tab)

  10. Optimizing Routing Strategy in Software Defined Networking

    … rates. This project aims to develop an optimized routing strategy for Software Defined Networking (SDN) that leverages machine learning techniques to enhance network traffic management's adaptability and efficiency. The project employs a combination of Dueling Deep Q-Networks (Dueling DQN) and …

    uwtsd Repository record for Optimizing Routing Strategy in Software Defined Networking (opens in a new tab)

  11. Development of a GIS-based routing model

    … optimization problems. The basic objectives of routing problems include transport cost and risk affects. An improved model presented in this thesis addresses a new optimization model, "Range Optimization Model". Although the core of the route optimization tools adopted is still the conventional …

    unlv Repository record for Development of a GIS-based routing model (opens in a new tab)

  12. New Security Paradigms for Spacecraft and Networks: Metrics, Testbeds, and Scalable Solutions

    … that enables scalable and resilient dynamic routing, significantly reducing network and computational overhead in large-scale satellite networks. Second, it introduces techniques for enabling robust, secure communication on energy-harvesting spacecraft, balancing security requirements …

    vt Repository record for New Security Paradigms for Spacecraft and Networks: Metrics, Testbeds, and Scalable Solutions (opens in a new tab)

  13. A proposal for an improved version of EigenAnt algorithm with performance evaluation on combinatorial optimization problems

    … the shortest path between two nodes by using dynamics involving local pheromone evaporation. This algorithm has a mathematical proof of convergence to the shortest path between two nodes. In this thesis, the stability and parameter impact analysis of EigenAnt algorithm applied to N-node Binary …

    brazil-uerj Repository record for A proposal for an improved version of EigenAnt algorithm with performance evaluation on combinatorial optimization problems (opens in a new tab)

  14. Dynamic traffic congestion pricing mechanism with user-centric considerations

    … the problem of designing real-time traffic routing systems in urban areas. Optimal dynamic routing for multiple passengers is known to be computationally hard due to its combinatorial nature. To overcome this difficulty, we propose a novel mechanism called User-Centric Dynamic Pricing (UCDP) …

    mit Repository record for Dynamic traffic congestion pricing mechanism with user-centric considerations (opens in a new tab)

  15. Distributed Contention-Free Access for Multi-hop IEEE 802.15.4 Wireless Sensor Networks

    … completely distributed manner. Assuming optimal routing, our simulation experiments reveal perfect delivery ratios as long as the traffic load does not reach or surpass its saturation threshold. dGTS sustains at least twice the delivery ratio of contention access under sub-optimal dynamic

    queens Repository record for Distributed Contention-Free Access for Multi-hop IEEE 802.15.4 Wireless Sensor Networks (opens in a new tab)

  16. Network routing problems in stochastic-state networks

    Network Routing problems focus on exploiting the network-based struc- ture of a mathematical optimization problem to establish e cient solutions that are tailored to the problem at hand. The topic of this dissertation relates to a speci c class of network routing problems, those in which the …

    texas Repository record for Network routing problems in stochastic-state networks (opens in a new tab)

  17. Analysis and Optimization of Networks in Overload

    … (ii) quantifying the capability of malicious routing attacks to induce network overload. We first investigate network policy design to optimize multiple network performance metrics including delay, fairness, and stability. We leverage a deterministic fluid queueing model which regards packets …

    mit Repository record for Analysis and Optimization of Networks in Overload (opens in a new tab)

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

  19. OneSwitch Data Center Architecture

    … Data centers today have evolved to support dynamic resources such as virtual machines and storage volumes from any physical location within the data center. This has led to highly volatile and unpredictable traffic patterns. Also The emergence of "Big Data" applications that exchange large …

    vt Repository record for OneSwitch Data Center Architecture (opens in a new tab)

Page 1 of 2