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 31 for “"Queueing network"”.

  1. XSnap : a queueing network analysis package

    … be used to solve product-form mixed multi-class queueing networks. A Graphical User Interface allows interactive network specification, whilst the modeller can also define complex network experiments and request customised output through the use of a language called SnapL. The solution modules …

    cape-town Repository record for XSnap : a queueing network analysis package (opens in a new tab)

  2. Queueing Network Analysis of Semiconductor Manufacturing Plants

    We show how the performance bounds can be used to design wafer fabs. Specifically, one may formulate the problem as one of maximizing the performance subject to a capital cost constraint. Software has been developed both for performance bounds (called BoundFab) and for design (called DesignFab).

    uiuc Repository record for Queueing Network Analysis of Semiconductor Manufacturing Plants (opens in a new tab)

  3. Control of servers in a two node queueing network

    Server control in a two-node Markovian queueing network with a limited total number of servers is considered. Two problems have been studied; the first problem is to find a quasi-steady-state control policy for a periodic review of server allocation. This policy can be regarded as a feedback …

    carleton Repository record for Control of servers in a two node queueing network (opens in a new tab)

  4. Port capacity modeling by GERT and queueing network approaches.

    Thesis. 1977. M.S.--Massachusetts Institute of Technology. Dept. of Civil Engineering.

    mit Repository record for Port capacity modeling by GERT and queueing network approaches. (opens in a new tab)

  5. Asymptotic approach to the performance analysis of closed queueing network.

    … approach to the performance analysis of closed queueing network.

    uic

  6. General queueing network models for computer system performance analysis. A maximum entropy method of analysis and aggregation of general queueing network models with application to computer systems.

    … suggested as an alternative theory for general queueing systems of computer performance analysis. The motivation is to overcome some of the problems arising in this field and to extend the scope of the results derived in the context of Markovian queueing theory. For the M/G/l model a unique …

    bradford Repository record for General queueing network models for computer system performance analysis. A maximum entropy method of analysis and aggregation of general queueing network models with application to computer systems. (opens in a new tab)

  7. Generalised analytic queueing network models. The need, creation, development and validation of mathematical and computational tools for the construction of analytic queueing network models capturing more critical system behaviour.

    … comprehension and management of complex systems. Queueing network models capture most relevant information from computer system and network behaviour. The construction and resolution of these models is constrained by many factors. Approximations contain detail lost for exact solution and/or …

    bradford Repository record for Generalised analytic queueing network models. The need, creation, development and validation of mathematical and computational tools for the construction of analytic queueing network models capturing more critical system behaviour. (opens in a new tab)

  8. Simulation and queueing network model formulation of mixed automated and non-automated traffic in urban settings

    … Mixed traffic is simulated in a simple network featuring traffic flowing through an isolated signalized intersection. The green phase length, autonomous vehicle penetration rate, and demand rate are varied. We observe an increase in network capacity and a decrease in average delay as …

    mit Repository record for Simulation and queueing network model formulation of mixed automated and non-automated traffic in urban settings (opens in a new tab)

  9. Performance Study of Two Phase Locking in Single-Site and Distributed Database Systems (Concurrency Control, Queueing Network, Pre-Claim, Ordering)

    Two phase locking (2PL) as a concurrency control mechanism (CCM) is studied in the contexts of single-site database systems (SDBSs) and distributed database systems (DDBSs).

    uiuc Repository record for Performance Study of Two Phase Locking in Single-Site and Distributed Database Systems (Concurrency Control, Queueing Network, Pre-Claim, Ordering) (opens in a new tab)

  10. Performance Modelling of Database Designs using a Queueing Networks Approach. An investigation in the performance modelling and evaluation of detailed database designs using queueing network models.

    … evaluation method for database designs based on queueing network models. The method is targeted at designs of large databases in which I/O is the dominant cost factor. The database design queueing network performance model is suitable in providing what if comparisons of database designs before …

    bradford Repository record for Performance Modelling of Database Designs using a Queueing Networks Approach. An investigation in the performance modelling and evaluation of detailed database designs using queueing network models. (opens in a new tab)

  11. General queueing networks with priorities. Maximum entropy analysis of general queueing network models with priority preemptive resume or head-of-line and non-priority based service disciplines.

    … compatible with exact product form solutions of queueing network models (QNM's). It is therefore, necessary to employ credible approximate techniques for solving QNM's with priority classes. The principle of maximum entropy (ME) is a method of inference for estimating a probability distribution …

    bradford Repository record for General queueing networks with priorities. Maximum entropy analysis of general queueing network models with priority preemptive resume or head-of-line and non-priority based service disciplines. (opens in a new tab)

  12. Reversibility and flows in queueing networks

    … between the flows of customers in a queueing network whose queue length process is a Markov process. A flow is a stochastic process formed by embedding the queue length process at transitions corresponding to: customers arriving to the network at a node; customers departing the …

    vt Repository record for Reversibility and flows in queueing networks (opens in a new tab)

  13. Development and enhancement of Computer Performance Modeling Tool (CPMT)

    … Computer Performance Modeling Tool (CPMT) is a queueing network simulator to be used in support of Computer Performance and Evaluation courses like CS4400. This thesis is a continuation of the CPMT development project and consists of adaptive and perfective maintenance work to modify the …

    nps Repository record for Development and enhancement of Computer Performance Modeling Tool (CPMT) (opens in a new tab)

  14. Approximation of the transient joint queue-length distribution in tandem networks

    This work considers an urban traffic network, and represents it as a Markovian queueing network. This work proposes an analytical approximation of the time-dependent joint queue-length distribution of the network. The challenge is to provide an accurate analytical description of between and within …

    mit Repository record for Approximation of the transient joint queue-length distribution in tandem networks (opens in a new tab)

  15. Analysis of networks with dynamic topologies

    Dynamic hierarchical networks represent an architectural strategy for employing adaptive behavior in applications sensitive to highly variable external demands or uncertain internal conditions. The characteristics of such architectures are described, and the significance of adaptive capability is …

    vt Repository record for Analysis of networks with dynamic topologies (opens in a new tab)

  16. Investigating cost effective communication alternatives for geographically hostile regions

    … under a common packet switched communication network. Using Zambia as a case study, the cost effectiveness of three design scenarios which involve a hybrid of radio and microwave, radio and satellite, and radio and optic fibre were evaluated. The communication links in each scenario were …

    cape-town Repository record for Investigating cost effective communication alternatives for geographically hostile regions (opens in a new tab)

  17. Robust fluid control of multiclass queueing networks

    … to the optimal control of multiclass queueing networks. We develop models that take into account the uncertainty of interarrival and service time in multiclass queueing network problems without assuming a specific probability distribution, while remaining highly tractable and providing …

    mit Repository record for Robust fluid control of multiclass queueing networks (opens in a new tab)

  18. Queueing System Analysis in Oil and Gas Abandonment Operations

    … process is further characterized as a queueing system and a queueing network model is developed. The study introduces four job prioritization classes to explore the impact of prioritization and priority queues on the defined system performance metrics. Due to the complexity of the …

    mit Repository record for Queueing System Analysis in Oil and Gas Abandonment Operations (opens in a new tab)

Page 1 of 2