We analyze the dynamic behavior of a single RED controlled queue interacting with a large population of idealized TCP sources, i.e., sources obeying the rules of linear increase and multiplicative decrease. The aggregate traffic from this population is modeled in terms of the time dependent expected value of the packet arrival rate which reacts to the packet loss taking place in the queue. The ...

A customer in a service system and an outside observer (manager or designer of the system) estimate the system performance differently. Unlike the outside observer, the customer can never find himself in an empty system. Therefore, the sets of scenarios, relevant for the two at a given time, differ. So differ the meanings and values of the performance measures of the queue: expected queue lengt...

Queueing systems in which an arriving job is blocked and lost with a probability that depends on the queue size are studied. The study is motivated by the popularity of Active Queue Management (AQM) algorithms proposed for packet queueing in Internet routers. AQM algorithms often exploit the idea of queue-size based packet dropping. The main results include analytical solutions for queue size d...

In this paper, we analyze a bulk input Geom/Geom/1 queue with single working vacation. Using the matrix analysis method, highly complicated PGF of the stationary queue size is firstly derived, from which we got the stochastic decomposition result for the PGF of the stationary queue size. It is important that we find the biparameter addition theorems of the conditional negative binomial distribu...

We de…ne pessimistic, respectively optimistic, investors as CEU (Choquet expected utility) decision makers who update their pessimistic, respectively optimistic, beliefs according to a pessimistic (Dempster-Shafer), respectively optimistic, update rule. This paper then demonstrates that, in contrast to optimistic investors, pessimistic investors may strictly prefer investing in an illiquid asse...

We describe a scalable priority queue manager that implements deadline-ordered service disciplines in an output-buffered ATM switch, which can be used as a switching node in high-speed packet switched networks to provide quality of service (QoS) guarantees. The priority queue manager can handle a range of priority levels from to , a buffer size of 64K ATM cells, and 16 input links at 2.5 Gb/s. ...

We consider the dispatching problem in a sizeand state-aware multi-queue system with Poisson arrivals and queue-specific job sizes. By sizeand state-awareness, we mean that the dispatcher knows the size of an arriving job and the remaining service times of the jobs in each queue. By queue-specific job sizes, we mean that the time to process a job may depend on the chosen server. We focus on min...

We consider the problem of implementing shared objects in uniprocessor and multiprocessor real-time systems in which tasks are executed using a scheduling quantum. In most quantum-based systems, the size of the quantum is quite large in comparison to the length of an object call. As a result, most object calls can be expected to execute without preemption. A good object-sharing scheme should op...

This paper deals with bi-level control policy and queuing analysis of a machine repair problem. The model is developed by incorporating mixed standbys (cold and warm), reneging, set up and vacation time. The repair facility consists of two heterogeneous repairmen in the system. The life and repair time of the failed units and also their set up times are assumed to be exponentially distributed. ...

Fast Congestion Notification (FN) is one of the proactive queue management mechanisms that practices congestion avoidance to help avoid the beginning of congestion by marking/dropping packets before the router’s queue gets full; and exercises congestion control, when congestion avoidance fails, by increasing the rate of packet marking/dropping. Technically, FN avoids the queue overflows by cont...