9 In this paper, we propose the use of a control theoretical approach in the design of fair queueing algorithms based on 10 the scalable core (SCORE)/dynamic packet state (DPS) architecture. In particular, we make use of the linear quadratic 11 control method from optimal control theory to design stable and robust systems that are simple to implement. Sim12 ulation results show that this approa...

This paper presents an analysis for an queueing system with customer behaviour, balking and reneging. Arriving customers balk with a probability and renege (leave the queue after entering) according to some distribution. Balking means that customers do not enter in the system, when queue is too long. Reneging means that a customer enter in the system, wait for some time and leave the system wit...

This paper uses submodularity to obtain monotonicity results for a class of Markovian queueing network service rate control problems. Nonlinear costs of queueing and service are allowed. In contrast to Weber and Stidham [14], our monotonicity theorem considers arbitrary directions in the state space (not just control directions), arrival routing problems, and certain uncontrolled service rates....

In this note we identify a phenomenon for processor sharing queues that is unique to ones with time-varying rates. This property was discovered while correcting a proof in Hampshire, Harchol-Balter and Massey [5]. If the arrival rate for processor sharing queue has unbounded growth over time, then it is possible for the number of customers in a processor sharing queue to grow so quickly that a ...

For a K-stage cyclic queueing network with N customers and general service times we provide bounds on the n departure time from each stage. Furthermore, we analyze the asymptotic tail behavior of cycle times and waiting times given that at least one service time distribution is subexponential.

................................................................................................................................................I ACKNOWLEDGEMENTS.....................................................................................................................III PUBLICATIONS ........................................................................................................