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 47 for “"path selection"”.

  1. An architecture for network path selection

    Traditional routing protocols select paths based on static link weights and converge to new paths only when there is an outright reachability failure (such as a link or router failure). This design allows routing scale to hundreds of thousands of nodes, but it comes at the cost of functionality: …

    gatech Repository record for An architecture for network path selection (opens in a new tab)

  2. Crack Path Selection in Adhesively Bonded Joints

    … to obtain an overall understanding of the crack path selection in adhesively bonded joints. Using Dow Chemical epoxy resin DER 331® with various levels of rubber concentration as an adhesive, and aluminum 6061-T6 alloy with different surface pretreatments as the adherends, both symmetric and …

    vt Repository record for Crack Path Selection in Adhesively Bonded Joints (opens in a new tab)

  3. Crack path selection in microstructurally tailored inhomogeneous polymers

    … that can help us experimentally study crack path selection problems. The model material which we are using is a polyethylene co-polymer, ECO, whose photosensitive behavior allows alterations in its mechanical properties when subjected to ultraviolet (UV) irradiation. It is seen that ECO …

    uiuc Repository record for Crack path selection in microstructurally tailored inhomogeneous polymers (opens in a new tab)

  4. Path Selection for Performance- and Security-Improved Onion Routing

    … communication networks through the use of multipath routing is introduced. Practical techniques are presented allowing implementation in current networks without fundamental architectural changes. Analysis of the performance of multipath routing in combination with the previously presented …

    uiuc Repository record for Path Selection for Performance- and Security-Improved Onion Routing (opens in a new tab)

  5. High throughput path selection for unstructured data center networks

    … the cause of inefficiency and study methods of path selection that may help bridge the gap between optimal throughput and packet level throughput. The difference in throughput can be attributed to inefficiency due to path selection and inefficiency due to protocol overhead; we quantify the …

    uiuc Repository record for High throughput path selection for unstructured data center networks (opens in a new tab)

  6. Finite Sample Bounds and Path Selection for Sequential Monte Carlo

    … is that the bounds provide insight into the selection of efficient sequences of SMC distributions. When the target distribution is spherical Gaussian or log-concave, we show that judicious selection of interpolating distributions results in an SMC algorithm with a smaller complexity bound …

    duke Repository record for Finite Sample Bounds and Path Selection for Sequential Monte Carlo (opens in a new tab)

  7. Towards the design of an energy-aware path selection metric for IEEE 802.11s wireless mesh network

    … Layer-2 routing is also referred to as the mesh path selection and forwarding. Devices that are compliant to the IEEE 802.11s standard will be able to use this path selection protocol. Devices that are manufactured by different vendors will therefore be interoperable. Even though significant …

    zulu Repository record for Towards the design of an energy-aware path selection metric for IEEE 802.11s wireless mesh network (opens in a new tab)

  8. Path Selection to Minimize Energy Consumption of an Electric Vehicle using Synthetic Speed Profiles and Predictive Terminal Energy

    … origin and destination when there are multiple paths available. These alternatives are commonly weighted on the basis of minimizing either total travel time (TTT) or trip distance. Eco-routing offers an alternative criterion – minimizing route energy consumption. Calculation of the energy …

    vt Repository record for Path Selection to Minimize Energy Consumption of an Electric Vehicle using Synthetic Speed Profiles and Predictive Terminal Energy (opens in a new tab)

  9. Transition Faults and Transition Path Delay Faults: Test Generation, Path Selection, and Built-In Generation of Functional Broadside Tests

    … testing in scan-based circuits: test generation, path selection and built-in test generation.</p> <p>We first describe a deterministic broadside test generation procedure for a path delay fault model named the transition path delay fault model, which captures both large and small delay defects. …

    purdue-thes Repository record for Transition Faults and Transition Path Delay Faults: Test Generation, Path Selection, and Built-In Generation of Functional Broadside Tests (opens in a new tab)

  10. Crack path selection and shear toughening effects due to mixed mode loading and varied surface properties in beam-like adhesively bonded joints

    … or debonds can initiate near an interface. The paths taken by propagating cracks can affect the resistance to failure and the subsequent service lives of the bonded structures. The behavior of propagating cracks in adhesive joints remains of interest, including when some critical environments, …

    vt Repository record for Crack path selection and shear toughening effects due to mixed mode loading and varied surface properties in beam-like adhesively bonded joints (opens in a new tab)

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

    … use of the links assigned to the shortest path retaining most of the network loads is regarded as a major problem for best effort service. Localised QoS routing, where the source nodes use statistics collected locally, is already described in contemporary sources as more advantageous. …

    bradford Repository record for 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. (opens in a new tab)

  12. High-fidelity simulation of load balancing methods in Tor

    … simulation framework. The first is Tightrope, a path selection algorithm for improving the load balancing of Tor circuits across the Tor network. The second is using the maximum likelihood estimation (MLE) scheme to accurately estimate the true capacity of relay capacities with minimal prior …

    uiuc Repository record for High-fidelity simulation of load balancing methods in Tor (opens in a new tab)

  13. Privacy-preserving network congestion control

    … routed across a series of servers; each user's path going through the network transits three of them. This process of path selection creates a load balancing problem that could lead to network congestion. Congestion may deteriorate the network performance and service quality resulting in queuing …

    uiuc Repository record for Privacy-preserving network congestion control (opens in a new tab)

  14. Cooperative resource pooling in multihomed mobile networks

    … Secondly, we leverage the benefits of multipath communications, providing the mobile device with increased throughput, additional resilience and seamless mobility. Finally, we provide a multihomed framework, enabling policy driven network resource management and path selection on a per …

    lancaster Repository record for Cooperative resource pooling in multihomed mobile networks (opens in a new tab)

  15. Data-driven path filtering in ConceptNet

    … can still be described in terms of the paths that connect them. Unfortunately, many of these paths are uninformative and noisy, meaning that the success of applications that use such path features crucially relies on their ability to select high-quality paths. In existing applications, …

    mit Repository record for Data-driven path filtering in ConceptNet (opens in a new tab)

  16. Mechanism of Fatigue Crack Growth at Polymer/metal Interface

    … in a gradual transition of the crack growth path from interfacial, at the low $\rm G\sb{II}/G\sb{I}$ ratio, to cohesive at the high $\rm G\sb{II}/G\sb{I}$ ratio. This effect of crack path selection on crack growth resistance was further explored in the study of fatigue crack growth in double …

    uiuc Repository record for Mechanism of Fatigue Crack Growth at Polymer/metal Interface (opens in a new tab)

  17. Protecting anonymity in the presence of autonomous system and internet exchange level adversaries

    … of a single AS or IX point observing both the path from the client to the entry node and the path from the exit node to the nal destination. Experimental results indicate that a non-trivial number of circuits are vulnerable to such compromise. A novel AS-level path prediction algorithm is …

    uiuc Repository record for Protecting anonymity in the presence of autonomous system and internet exchange level adversaries (opens in a new tab)

  18. Self-stabilizing wormhole routing in hypercubes

    … achieves optimality in terms of routing path length by following only the preferred dimensions. In an n-dimensional hypercube, those dimensions in which source and destination address bits differ are called preferred dimensions. Our second algorithm handles topological changes. We propose …

    unlv Repository record for Self-stabilizing wormhole routing in hypercubes (opens in a new tab)

  19. Reliability improvement and assessment of safety critical software

    … the testing process. The methodology provides path selection criteria and stopping criteria for the testing process with the aim to achieve maximum reliability improvement using available testing resources. Secondly, it can be used to assess and quantify the reliability of the software after …

    mit Repository record for Reliability improvement and assessment of safety critical software (opens in a new tab)

Page 1 of 3