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 1621 for “"routing"”.
-
Distributed routing
Thesis (Ph.D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1981.
-
Meta-Routing: Synergistic Merging of Message Routing and Link Maintenance
… subject to be raised quickly. Although various routing protocols for wireless <em>ad hoc</em> networks have been proposed, they solve the problems of message routing and link maintenance separately, resulting in additional overhead costs and long latency in network communication. Traditional …
-
Dynamic selfish routing
This thesis deals with dynamic, load-adaptive rerouting policies in game theoretic settings. In the Wardrop model, which forms the basis of our dynamic population model, each of an infinite number of agents injects an infinitesimal amount of flow into a network, which in turn induces latency on the …
-
Optimal ship routing
… the problem of deterministic minimum fuel routing by applying optimal control theory in conjunction with state of the art hydrodynamic and weather forecasting tools. A fictitious trans-Atlantic route is established and the optimal combination of speed and heading is determined, so that fuel …
-
Self-stabilizing wormhole routing
… processors must cooperate to ensure proper routing; Wormhole routing is most common in parallel architectures in which messages are sent in small fragments called flits. We assume that each processor will contain a single fixed-size flit buffer for each incoming link. A processor must …
-
Self-stabilizing routing protocols
… on application of self-stabilization to routing problems, in particular path identification, connectivity and methods involved in destinational routing. Traditional methods for creation of rooted paths to multiple destinations in a computer network involve the creation of spanning trees, …
-
Optimizing Pollution Routing Problem
… A basic model is created using the Vehicle Routing Problem (VRP) which is further extended to the Pollution Routing Problem (PRP). The basic model is updated using a Monte Carlo Algorithm (MCA). The data set contains 180 data files with a combination of 10, 15, 20, 25, 50, 75, 100, 150, and …
-
General Direction Routing Protocol
The General Direction Routing Protocol (GDRP) is a Wireless Sensor Network (WSN) multi-path routing protocol which abstracts localization information (commonly GPS coordinates) into relative direction information in order to perform routing decisions. By generating relative direction information …
-
Algorithms for VLSI routing
… thesis considers the problems arising from VLSI routing design. Algorithms are proposed for solving both global and local routing problems.
-
Resilient routing for MANETs
… cycle. Secondly, I present the Reactive Gossip Routing family of protocols, designed to provide reliable and scalable routing by mitigating the MANET properties that lead to faults. Using MeshSim, I evaluate these protocols experimentally under increasingly harsher conditions and compare their …
-
Probabilistic vehicle routing problems
Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Civil Engineering, 1985.
-
Bandwidth-sensitive oblivious routing
Traditional oblivious routing algorithms either do not take into account the bandwidth demand, or assume that each flow has its own private channel to guarantee deadlock freedom. Though adaptive routing schemes can react to varying network traffic, they require complicated router designs. In this …
-
Routing in unreliable networks
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1986.
-
Routing in probabilistic networks
This thesis considers tlhe problem of routing in a network where the travel times along the arcs are modeled as independent random variables. A standard approach to routing in such networks is to select a path with the least expected travel time. One of the problems with this approach is that it …
-
Single-layer wire routing
Bibliography: v. 2, leaves 358-361.
-
Chain Routing: A novel routing framework for increasing resilience and stability in the Internet
… by the mismatch of its topological state and routing information. A first numerical analysis proves that the Internet possesses unused path diversity which could be employed to strengthen its resilience to failures. Therefore, a new routing framework called Chain Routing, which takes advantage …
-
Routing Problems in the Physical Design of Integrated Circuits (Cad, Simulated Annealing, Channel Routing)
… design flexibilities are incorporated into the routing step via suitable generalizations of the routing model. Better layouts are obtained using this approach since the router can make use of these flexibilities to reduce the wiring area.
-
On some generalized routing problems
… rural postman problem (GDRPP)(ii) the vehicle routing problem with trailers and transshipments (VRPTT)(iii) the truck-and-trailer routing problem (TTRP)The paper describes the numerous applications of these problems in economic reality, explains how such problems can be mathematically modelled, …
-
TinyTermite: A Secure Routing Algorithm
… TinyTermite is a novel probabilistic routing algorithm that is secure against selective forwarding and replay attacks. We use suspicion pheromone to build a flexible map of possible compromised neighbors. As suspicion builds up and decays for each neighbor, TinyTermite is able to deal …
-
Compass routing on geometric graphs.
In this thesis, we introduce a novel routing algorithm which we call "compass routing" to find paths between pairs of points in planar geometric graphs. Our main goal was that of developing, whenever possible, routing algorithms that, using only "local information", the position of our destination …
Page 1 of 82