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 90 for “"routing algorithms"”.
-
Routing algorithms for electronic design automation
In electronic design automation (EDA), routing is one of the most important tasks for both printed circuit boards (PCB) and integration circuits (IC). After placement, which determines the location of each component on a PCB or element of an IC, the routing step adds wires needed to properly …
-
Performance-driven placement and routing algorithms
… track permutation algorithm for gridded channel routing problems. We also developed a wire segment assignment algorithm for both channel routing problems and switchbox routing problems. The experimental results indicate that our algorithms are very promising.
-
Routing algorithms for optimisation of transportation systems
… to vehicle drivers, hence the need for optimised routing. Another concept gaining popularity is the collaboration in logistics between several companies. Collaboration is thought to be an enabler for a sustainable and efficient SCM. One important improvement of modern logistics is the frequent …
-
Distributed routing algorithms for interconnected FDDI LANS
… one LAN to another across the leased line, a routing algorithm is required. Much research has been done on the Bellman-Ford algorithm and many implementations of it exist in computer networks. However, due to its instability and problems with routing table loops it is an unsatisfactory …
-
Routing Algorithms for High-Performance VLSI Packaging
As the package densities are increasing, escape routing is becoming the main bottleneck in terms of overall routability. For this, we propose novel models and algorithms to solve the escape routing problem in multiple components simultaneously, such that the number of crossings in the intermediate …
-
Routing Algorithms for Dynamic, Intelligent Transportation Networks
… of time-dependent shortest path (TDSP) algorithms and k-shortest path (k-SP) algorithms as a practical routing tool in such intelligent transportation networks. Similar algorithms have been used to solve routing problems in computer networks. The similarities and differences between …
-
ENERGY-EFFICIENT ROUTING ALGORITHMS FOR WIRELESS SENSOR NETWORKS
… addressing these problems is by implementing a routing protocol that efficiently uses these limited resources and hence reduces errors, improves scalability and increases the network lifetime. The topology of any network is important and wireless sensor networks (WSNs) are no exception. In order …
-
GPS based localized routing algorithms for wireless networks.
We discuss routing algorithms for wireless networks with the goal of achieving high (or guaranteed) delivery rate and increasing the node life in the network. Some know methods were studied: Most Forward within Radius (MFR) and directional algorithm (DIR). We propose some new location based routing …
-
Bio-inspired routing algorithms for Software Defined Networking
… parameter to take into account when a new routing strategy is designed, just as with latency, bandwidth or error rate. In such scenarios network connectivity is one of the key factors. SDN technologies represent a good solution to face this challenge. By separating the control plane from …
-
Analytic modelling of agent-based network routing algorithms.
Interest in adaptive and distributed systems for routing control in networks has led to the development of a new class of algorithms, which is inspired by the shortest path finding behaviours observed in biological ant colonies. This class utilizes ant-like agents, which autonomously traverse the …
-
Simulating underwater sensor networks and routing algorithms in MATLAB
… network construction from discovery to advanced routing are all well established. Due to the unique constraints of operating in an underwater environment, many of these tried-and-true approaches need modification if they function at all. Peer discovery and lowlevel networking have been dealt with …
-
Routing algorithms in the physical design of VLSI circuits
In this thesis, we solve several important routing problems in the physical design of VLSI circuits. We successfully apply combinatorial optimization techniques to these problems and obtain very effective and efficient algorithms. The experimental results presented in this thesis show that these …
-
Management and routing algorithms for ad-hoc and sensor networks
… datacentric sensor networks. A plethora of routing and data management algorithms have been proposed for the network path discovery ranging from broadcasting/floodingbased approaches to those using global positioning systems (GPS). We studied WGrid, a novel decentralized infrastructure that …
-
Application Platforms, Routing Algorithms and Mobility Behavior in Mobile Disruption-Tolerant Networks
… challenges for the design and validation of routing protocols and applications. We investigate challenges of mobile DTNs from three different viewpoints: the application layer, a routing perspective, and by studying mobility patterns. In the application layer, we have built 7DS (7th Degree of …
-
Novel localised quality of service routing algorithms. Performance evaluation of some new localised quality of service routing algorithms based on bandwidth and delay as the metrics for candidate path selection.
… networks by efficient Quality of Service (QoS) routing, which considerably contributes to the QoS architecture. The biggest contemporary drawback in the maintenance and distribution of the global state is the increase in communication overheads. Unbalancing in the network, due to the frequent …
-
New quality of service routing algorithms based on local state information. The development and performance evaluation of new bandwidth-constrained and delay-constrained quality of service routing algorithms based on localized routing strategies.
… services. It is desirable to find efficient routing strategies that can meet the strict routing requirements of these applications. QoS routing is considered as one of the major components of the QoS framework in communication networks. In QoS routing, paths are selected based upon the …
-
Autonomous routing algorithms for networks with wide-spread failures : a case for differential backlog routing
… study the performance of a differential backlog routing algorithm in a network with random failures. Differential Backlog routing is a novel routing algorithm where packets are routed through multiple paths to their destinations based on queue backlog information. It is known that Differential …
Page 1 of 5