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 66 for “"Network State"”.

  1. Minimizing Multi-Hop Wireless Routing State under Application-Based Accuracy Constraints

    … of rich routing building blocks to mobile ad-hoc networking applications has been of high interest. Several MANET applications need flexibility in describing paths their traffic will follow. To accommodate this need, previous work has proposed several viable routing schemes such as Dynamic Source …

    unr Repository record for Minimizing Multi-Hop Wireless Routing State under Application-Based Accuracy Constraints (opens in a new tab)

  2. Gene regulatory networks controlling an epithelial-mesenchymal transition

    … embryos. However, much less is known about how states of the sequentially progressing PMC gene regulatory network (GRN) controls the EMT process during PMC ingression. Transcriptional regulators such as Snail and Twist have emerged as important molecules for controlling EMTs in many model …

    duke Repository record for Gene regulatory networks controlling an epithelial-mesenchymal transition (opens in a new tab)

  3. Towards a cognitive network management and control system

    Future networks have to accommodate an increase of 3-4 orders of magnitude in data rates with heterogeneous session sizes and strict time deadline requirements. The dynamic nature of scheduling of large transactions and the need for rapid actions by the network management and control system, …

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

  4. Localised Routing Algorithms in Communication Networks with Quality of Service Constraints. Performance Evaluation and Enhancement of New Localised Routing Approaches to Provide Quality of Service for Computer and Communication Networks.

    … services beyond those supported by best-effort networks. Quality of service routing is an essential part in any QoS architecture in communication networks. QoS routing aims to select a path among the many possible choices that has sufficient resources to accommodate the QoS requirements. QoS …

    bradford Repository record for Localised Routing Algorithms in Communication Networks with Quality of Service Constraints. Performance Evaluation and Enhancement of New Localised Routing Approaches to Provide Quality of Service for Computer and Communication Networks. (opens in a new tab)

  5. Optical Flow Switching with time deadlines for high-performance applications

    … slightly longer than one roundtrip time with networks at moderate to high loading. In this work, we propose three possible scheduling mechanisms for OFS connection setup in a WDM network: (i) a simple algorithm, which awards pre-emptive priority to applications requiring time deadline …

    mit Repository record for Optical Flow Switching with time deadlines for high-performance applications (opens in a new tab)

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

  7. Scalable, repeatable, and contention-free parallelization of traffic simulation

    … choices. These incentives depend on the current network state, and the ability to estimate the state of a given road network in real time is crucial. It relies on the DynaMIT system to determine what these incentives ought to be in order to optimize traffic flow on the network. Developed by the …

    mit Repository record for Scalable, repeatable, and contention-free parallelization of traffic simulation (opens in a new tab)

  8. Analysis and Design of Cognitive Radio Networks and Distributed Radio Resource Management Algorithms

    … scenarios, radios react to measurements of the network state and change their operation according to some goal driven algorithm. Ideally this flexibility and reactivity yields tremendous gains in performance. However, when the adaptations of the radios also change the network state, an …

    vt Repository record for Analysis and Design of Cognitive Radio Networks and Distributed Radio Resource Management Algorithms (opens in a new tab)

  9. Quo Vadis - a framework for intelligent routing in large communication networks

    <p>Modern communication networks contain hundreds if not thousands of interconnected nodes. Traffic management mechanisms must be able to support a cost-effective, responsive, flexible, robust, customer-oriented high speed communication environment while minimizing the overhead associated with …

    iastate Repository record for Quo Vadis - a framework for intelligent routing in large communication networks (opens in a new tab)

  10. The significance of transients following failures and repairs in packet-switched networks

    … level of performance measured for each system state by the probability that the system is in that state and then sum across all system states. Many performance measures have a transient behavior following a change in the state of the system. Because of the difficulty associated with transient …

    vt Repository record for The significance of transients following failures and repairs in packet-switched networks (opens in a new tab)

  11. Real-time data flow models and congestion management for wire and wireless IP networks

    In video streaming, network congestion compromises the video throughput performance and impairs its perceptual quality and may interrupt the display. Congestion control may take the form of rate adjustment through mechanisms by attempt to minimize the probability of congestion by adjusting the rate …

    cape-town Repository record for Real-time data flow models and congestion management for wire and wireless IP networks (opens in a new tab)

  12. A Method for PMU-Based Reconfigurable Monitoring

    … very good observation of a small area of a network, but their relatively high cost prevents them from being deployed at every point. Therefore, to monitor an entire network, State Estimation is still required. By combining these two techniques, the accuracy and speed of power network

    vt Repository record for A Method for PMU-Based Reconfigurable Monitoring (opens in a new tab)

  13. Design and Implementation of a Neocortical Visualization Tool

    … the available hardware, and view the current network state in 3D. It provides an intuitive and extensible simulation platform with a reduced learning curve, abstracting away the complex setup and analysis of neural simulations and allowing neuroscientists to focus on neuroscience.

    unr Repository record for Design and Implementation of a Neocortical Visualization Tool (opens in a new tab)

  14. Transmission scheduling with deadline and throughput constraints

    Today wireless networks are increasingly used to perform applications with Quality of Service constraints (QoS) such as delay, delivery ratio, and channel reliability. Especially, as demand for real-time transmissions increases, transmitting packets with hard delivery deadlines poses an important …

    mit Repository record for Transmission scheduling with deadline and throughput constraints (opens in a new tab)

  15. Securing the software-defined networking control plane by using control and data dependency techniques

    Software-defined networking (SDN) fundamentally changes how network and security practitioners design, implement, and manage their networks. SDN decouples the decision-making about traffic forwarding (i.e., the control plane) from the traffic being forwarded (i.e., the data plane). SDN also allows …

    uiuc Repository record for Securing the software-defined networking control plane by using control and data dependency techniques (opens in a new tab)

  16. Dynamic-parinet (D-parinet) : indexing present and future trajectories in networks

    … and to predict a MO's movement or the underlying network state at a future time. The cornerstone of D-PARINET is PARINET, an efficient index for historical trajectory data. The structure of PARINET is based on a combination of graph partitioning and a set of composite B+-tree local indexes tuned …

    njit Repository record for Dynamic-parinet (D-parinet) : indexing present and future trajectories in networks (opens in a new tab)

  17. Diagnose network failures via data-plane analysis

    Diagnosing problems in networks is a time-consuming and error-prone process. Previous tools to assist operators primarily focus on analyzing control plane configuration. Configuration analysis is limited in that it cannot find bugs in router software, and is harder to generalize across protocols …

    uiuc Repository record for Diagnose network failures via data-plane analysis (opens in a new tab)

  18. A Personal Virtual Computer Recorder

    … through their computers. However, existing state-of-the-art web and desktop search tools fail to provide a suitable solution, as they focus on static, accessible documents in isolation. Thus, finding the information one has viewed among the ever-increasing and chaotic sea of data available …

    columbia-diss Repository record for A Personal Virtual Computer Recorder (opens in a new tab)

  19. Evaluating and Forecasting the Operational Performance of Road Intersections

    … configurations encountered when traversing road networks. It is therefore of vital importance to improve their operational performance, as that can significantly contribute towards the efficiency of the whole transport network. Traditional approaches to improve the efficiency of intersections are …

    york Repository record for Evaluating and Forecasting the Operational Performance of Road Intersections (opens in a new tab)

Page 1 of 4