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 37 for “"queueing networks"”.
-
Stability of queueing networks
In this thesis, the stability of queueing networks is studied. The use of test functions is a unifying thread. Tools are provided to construct appropriate test functions for complex networks, and the structure of such test functions is examined for specific network models. The analysis of queueing …
-
Dynamic scheduling of queueing networks
Thesis (Ph. D.)--Massachusetts Institute of Technology, Sloan School of Management, 1991.
-
High speed round robin queueing networks
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1990.
-
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 …
-
Stability and performance of multiclass queueing networks
Thesis (Ph. D.)--Massachusetts Institute of Technology, Sloan School of Management, 1997.
-
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 …
-
Policy robustness : robust stability of multiclass queueing networks
… models, particularly stochastic processing networks. A reason for this late adoption might be that “non-robust” analysis of general stochastic networks has already presented significant mathematical challenges. This dissertation focuses on the robust stability of stochastic processing …
-
Techniques for the performance analysis of queueing networks
ETDs are only available to UIUC Users without author permission
-
Learning-NUM: Utility Maximization in Stochastic Queueing Networks
… paradigm of utility maximization in stochastic queueing networks where the utility functions are unknown in advance but function values corresponding to the traffic rates decisions are observable after the traffic reaches the destination. The paradigm is called Learning-NUM as it requires …
-
Optimization of queueing networks : an optimal control appraoch
Thesis (Ph. D.)--Massachusetts Institute of Technology, Sloan School of Management, 1995.
-
Scheduling in switched queueing networks with heavy-tailed trac
We study scheduling problems arising in switched queueing networks, a class of stochastic systems that are often used to model data communication networks, such as uplinks and downlinks of cellular networks, networks of data switches, and ad hoc wireless networks. Motivated by empirical evidence of …
-
Scheduling of multiclass queueing networks : bounds on achievable performance
Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1993.
-
Scheduling multiclass queueing networks and job shops using fluid and semidefinite relaxations
Queueing networks serve a& useful models for a variety of problems arising in modern communications, computer, and manufacturing systems. Since the optimal control problem for queueing networks is well-known to be intractable, an important theme of research during the last two decades has been the …
-
Adaptive Control of Markov Chains: An Optimization Oriented Approach (Queueing Networks, Stochastic Models, Computer)
In this thesis we consider the control of a dynamic system modeled as a Markov chain. The transition probability matrix of the Markov chain depends on the control u and also on an unknown parameter (alpha)('o). The unknown parameter belongs to a given finite set A. The performance of the system is …
-
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 …
-
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 …
-
Stochastic analysis via robust optimization
… of our methodology to analyze the performance of queueing networks and optimize the inventory policy for supply chain networks. In Part I, we study the case of a single queue. We develop a robust theory to study multi-server queues with possibly heavy-tailed primitives. Our methodology (a) …
-
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 …
-
Decomposition of general queueing network models. An investigation into the implementation of hierarchical decomposition schemes of general closed queueing network models using the principle of minimum relative entropy subject to fully decomposable constraints.
… hierarchical partitioning of the state space of queueing network models offer powerful evaluation tools for the performance analysis of computer systems and communication networks. These methods being conventionally implemented capture the exact solution of separable queueing network models but …
-
Tractable stochastic analysis in high dimensions via robust optimization
… the underlying systems become multidimensional: Queueing networks, auction design in multi-item, multi-bidder auctions, network information theory, pricing multi-dimensional financial contracts, among others. We propose a new approach to analyze stochastic systems based on robust optimization. …
Page 1 of 2