نتایج جستجو برای: discrete time queue

تعداد نتایج: 2007033  

2010
Annunziata Cascone Rosanna Manzo Alexander V. Pechinkin Sergey Ya. Shorgin

Consideration is given to a discretetime queueing system with inverse discipline, service interruption and resumption, second-order geometrical demand arrival, arbitrary (discrete) distribution of demand length and finite storage. Each demand entering the queue has random volume besides its length. The total volume of the demands in the queue is limited by a certain number. Formulae for the sta...

2000
Ad Ridder

This paper describes a discrete-time retrial queue and shows how importance sampling simulations can be applied for estimating the probability of large orbit content and the overflow fraction of primary calls.

Journal: :Annals OR 2008
Tom Maertens Joris Walraevens Herwig Bruneel

In this paper, we consider several discrete-time priority queues with priority jumps. In a priority scheduling scheme with priority jumps, real-time and non-real-time packets arrive in separate queues, i.e., the highand low-priority queue respectively. In order to deal with possibly excessive delays however, non-real-time packets in the low-priority queue can in the course of time jump to the h...

2007
Jesus R. Artalejo Antonis Economou Antonio Gómez-Corral

In this paper, we consider a discrete-time queue of Geo/Geo/c type with geometric repeated attempts. It is known that its continuous counterpart, namely the M/M/c queue with exponential retrials, is analytically intractable due to the spatial heterogeneity of the underlying Markov chain, caused from the retrial feature. In discrete-time, the occurrence of multiple events at each slot increases ...

Journal: :Queueing Syst. 2004
Ivan Atencia Pilar Moreno

We consider a discrete-time Geo/G/1 retrial queue in which the retrial time has a general distribution and the server, after each service completion, begins a process of search in order to find the following customer to be served. We study the Markov chain underlying the considered queueing system and its ergodicity condition. We find the generating function of the number of customers in the or...

Journal: :J. Network and Computer Applications 2008
Hussein Abdel-jaber Michael E. Woodward Fadi A. Thabtah Amer Abu-Ali

Due to the rapid development in computer networks, congestion becomes a critical issue. Congestion usually occurs when the connection demands on network resources, i.e. buffer spaces, exceed the available ones. We propose in this paper a new discrete-time queueing network analytical model based on dynamic random early drop (DRED) algorithm to control the congestion in early stages. We apply our...

ژورنال: :مکانیک سازه ها و شاره ها 2013
محمد مهدی فاتح مریم بلوچ زاده

optimal discrete-time control of linear systems has been presented already. there are some difficulties to design an optimal discrete-time control of robot manipulator since the robot manipulator is highly nonlinear and uncertain. this paper presents a novel robust optimal discrete-time control of electrically driven robot manipulators for performing repetitive tasks. the robot performs repetit...

Journal: :Computers & Mathematics with Applications 2009
Veena Goswami G. B. Mund

This paper analyzes a discrete-time finite-buffer multi-server bulk-service queueing system in which the interarrival-and service-times are, respectively, arbitrarily and geometrically distributed. Using the supplementary variable and the imbedded Markov-chain techniques, the queue is analyzed for the early arrival system. We obtain state probabilities at prearrival, arbitrary and outside obser...

Journal: :Journal of Circuits, Systems, and Computers 2002
Peter H. Bauer Mihail L. Sichitiu Kamal Premaratne

This paper introduces a discrete time model for time-variant delays and investigates the very nature of such a delay. It is shown that a linear system-delay interface is a system theoretic necessity for the construction of composite linear systems with time-variant delays. Based on this analysis, two interfaces of particular importance are presented and used to obtain new, simple to check stabi...

Journal: :CoRR 2008
M. Süzen Z. Süzen

This paper proposes an adaptive variant of Random Early Detection (RED) gateway queue management for packet-switched networks via a discrete state analog of the non-stationary Master Equation i.e. Markov process. The computation of average queue size, which appeared in the original RED algorithm, is altered by introducing a probability P (l, t), which defines the probability of having l number ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید