Search results for "Queueing theory"
showing 10 items of 33 documents
Systematic study of shell-model effective interaction insdshell
2014
The spin-tensor decomposition method has been used to analyse the shell model effective interactions in sd shell systematically. Almost all the interactions have been studied, including the microscopic interactions and phenomenological ones. It can be noticed that the discrepancies between the central force of microscopic interactions with the ones of empirical interactions are remarkable.
Active queue management stability in multiple bottleneck networks
2004
In this paper, we show that the active queue management (AQM) controllers, usually configured on a single bottleneck basis, may not prevent instability in the presence of multiple bottlenecks. We justify this result through a multiple bottleneck model.
Measurement and Modeling of the Origins of Starvation in Congestion Controlled Mesh Networks
2008
Significant progress has been made in understanding the behavior of TCP and congestion-controlled traffic over multi- hop wireless networks. Despite these advances, however, no prior work identified severe throughput imbalances in the basic scenario of mesh networks, in which one-hop flows contend with two-hop flows for gateway access. In this paper, we demonstrate via real network measurements, test-bed experiments, and an analytical model that starvation exists in such a scenario, i.e., the one-hop flow receives most of the bandwidth while the two- hop flow starves. Our analytical model yields a solution consisting of a simple contention window policy that can be implemented via mechanism…
Pilot Prototype of Autonomous Pallets and Employing Little’s Law for Routing
2015
Application of autonomous control for shop-floor scheduling by considering real-time control of material flows is advantageous to those assembly lines with dynamic and uncertain circumstances. Among several potential processors with computing and communication capabilities—for representing autonomous material carriers—wireless sensor nodes seem as promising objects to be applied in practice. For realizing autonomy in making scheduling and routing-control decisions some methodologies need to be embedded in the nodes. Among several experimented methodologies, e.g., artificial intelligence, genetic algorithm, etc., in the context of a doctoral research, in this current special case of assembly…
Statistical performance of a multiclass bulk production queueing system
2004
Abstract In this paper, we discuss how to statistically analyze a make-to-stock production system the behaviour of which depends on a multiclass bulk queueing system. The performance of the system is evaluated in terms of the different demands of products, processing times and, mainly, through the finished product inventory and other related measures that quantify the queueing effects in the system. A numerical example which illustrates the applicability of the results in an inventory scenario is also discussed.
Comparison and analysis of the revenue-based adaptive queuing models
2006
This paper presents several adaptive resource sharing models that use a revenue criterion to allocate bandwidth in an optimal way. The models ensure QoS requirements of data flows and, at the same time, maximize the total revenue by adjusting parameters of the underlying schedulers. Besides, the adaptive models eliminate the need to find the optimal static weight values because they are calculated dynamically. The simulation consists of several cases that analyse the models and the way they provide the required QoS guarantees. The simulation reveals that the installation of the adaptive model increases the total revenue and ensures the QoS requirements for all service classes. The paper als…
Random Early Detection for Congestion Avoidance in Wired Networks: A Discretized Pursuit Learning-Automata-Like Solution
2010
Published version of an article in the journal: IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics. Personal use of this material is permitted. Permission from IEEE must be obtained for all other users, including reprinting/ republishing this material for advertising or promotional purposes, creating new collective works for resale or redistribution to servers or lists, or reuse of any copyrighted components of this work in other works In this paper, we present a learning-automata-like (LAL) mechanism for congestion avoidance in wired networks. Our algorithm, named as LAL random early detection (LALRED), is founded on the principles of the operations of existing RED con…
Queuing transitions in the asymmetric simple exclusion process
2003
Stochastic driven flow along a channel can be modeled by the asymmetric simple exclusion process. We confirm numerically the presence of a dynamic queuing phase transition at a nonzero obstruction strength, and establish its scaling properties. Below the transition, the traffic jam is macroscopic in the sense that the length of the queue scales linearly with system size. Above the transition, only a power-law shaped queue remains. Its density profile scales as $\delta \rho\sim x^{-\nu}$ with $\nu={1/3}$, and $x$ is the distance from the obstacle. We construct a heuristic argument, indicating that the exponent $\nu={1/3}$ is universal and independent of the dynamic exponent of the underlying…
Inference and prediction in bulk arrival queues and queues with service in stages
1998
This paper deals with the statistical analysis from a Bayesian point of view, of bulk arrival queues where the batch size is considered as a fixed constant. The focus is on prediction of the usual measures of performance of the system in the steady state. The probability generating function of the posterior predictive distribution of the number of customers in the system and the Laplace transform of the posterior predictive distribution of the waiting time in the system are obtained. Numerical inversion of these transforms is considered. Inference and prediction of its equivalent single queue with service in stages is also discussed.
Markov Chain and Stationary Distribution
2019
MC has been a valuable tool for analyzing the performance of complex stochastic systems since it was introduced by the Russian mathematician A. A. Markov (1856–1922) in the early 1900s. More and more system analyses have been carried out by using MC, including the analysis on CA and CF. In this chapter, we will briefly review the essential ingredients of MC that are necessary for the performance analysis presented in this book. A more comprehensive introduction of MC and its applications can be found in Nelson (2013, Probability, stochastic processes, and queueing theory: the mathematics of computer performance modeling).