Search results for "Queue"
showing 10 items of 64 documents
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).
Proposal of a neuro-fuzzy model of a WWW server
2005
This paper presents the ways of designing simulation models of Web servers. At the beginning queuing network models are introduced, those models are generally known and often used in the initial phase of research on particular technical solutions. Next, an entirely new approach to the issue discussed is presented - neuro-fuzzy models, thanks to which, it is possible to automate the process of designing simulation models. The results of comparative tests of these two models are presented. Based on these results it can be concluded that neuro-fuzzy models are accurate and can be used in simulation research.
Providing QOS in 3G-WLAN environment with RSVP and DIFFSERV
2006
Here we present the end-to-end QoS mechanism in 3G-multiaccess network environment. As multi-access wireless WLAN and wired xDSL wideband multi-access technologies has emerge and become more popular a need for interoperability with different technologies and domains has become necessity. There is also a need for end-to-end QoS management. We show a scenario where the UE-GGSN connection is covered by RSVP and RAN network part uses partial over dimensioning and real-time controlled ATM queuing. DiffServ covers WLAN-Core QoS and radio interface between WLAN AP and WLAN UE uses IEEE's 802.11e. Our interest is to find out how well 3G traffic classes can survive in different traffic conditions in…
AQM generalized nyquist stability in multiple bottleneck networks
2005
Abstract The influence of multiple bottlenecks on the stability of Active Queue Management (AQM) controllers, usually configured on a single bottleneck basis is discussed. We consider a network scenario where RED is configured at each router according to previously developed control theoretic techniques. These configuration rules assure stability in a single bottleneck scenario. We show that instability may arise when two links become congested. We justify this result through a multiple bottleneck model using the Generalized Nyquist stability criterion.
An API for Advanced Traffic Control in Diffserv Routers
2003
Distributed per-flow admission control is a promising solution for Differentiated Services networks. Its deployment in DiffSery domains requires the ability to suitably configure, in each network router, low-level packet forwarding mechanisms, such as packet dropping algorithms driven by traffic measurements. In this paper we first show that performance effectiveness is achieved by means of non traditional configuration of the forwarding mechanisms. Hence, we propose a modular Application Program Interface that allows to flexibly and adaptively configure the forwarding/dropping behavior associated to a router’s output queue, well beyond the traditional RED/RIO active queue management scheme…