The successful operation of the present Internet depends mainly upon TCP/IP which employs end-to-end congestion control mechanisms built in the end hosts. In order to further enhance this paradigm of end-to-end control the Random Early Detection algorithm has been proposed, which starts to mark or drop packets at the onset of congestion. The paper addresses issues related to the choice of queue...

We consider a priority queueing system where single processor serves k classes of packets that are generated randomly following Poisson processes. Our objective is to compute the expected Peak Age Information (PAoI) under various scenarios. In particular, we two situations buffer size at each queue one and infinite, in infinite case First Come Serve (FCFS) Last (LCFS) as service disciplines. Fo...

Motivated by the scale and complexity of simulating large-scale networks, recent research has focused on hybrid fluid/packet simulators, where fluid models are combined with packet models in order to reduce simulation complexity. However, these simulators still need to track the queuing dynamics of network routers, which generate considerable simulation time-complexity in a large-scale network ...

We consider a multiserver queuing process speciied by i.i.d. interarrival time, batch size and service time sequences. In the case that diierent servers have diierent service time distributions we say the system is heterogeneous. In this paper we establish conditions for the queuing process to be characterized as a geometrically Harris recurrent Markov chain, and we characterize the stationary ...

We consider an M/G/1 quening system, where batches of customers are assumed to arrive the system according to a compound Poisson process. As soon as the system becomes empty, the server takes a vacation for a random length of time called vacation time to do other jobs, which is uninterruptible. After returning from that vacation, there are two possibilities viz. (i) he keeps on taking vacations...

We consider the following stochastic bin packing process: the items arrive continuously over time to a server and are packed into bins of unit size according to an online algorithm. The unpacked items form a queue. The items have random sizes with symmetric distribution. Our first contribution identifies some monotonicity properties of the queueing system that allow to derive bounds on the queu...

I. THE SETUP At time t, let V (t) be the event {the DN is empty at time t}. If V̄ (t), let C∗(t) be the oldest customer in the DN, let W∗(t) be the time C∗(t) has spent in the DN, and let I∗(t) be the queue in the DN which C∗(t) goes through. For n ≥ 0, let E(t, s, n) = {at least n customers arrived at the DN on the interval (t− s, t], out of which at least n have left the DN by t}. Let the size...

In this paper, we propose an efficient control scheme for active queue management (AQM) supporting TCP flows. The proposed controller consists of two parts: a rate controller and a queue size controller. The rate controller is a proportional-integral (PI) controller, which improves the response to dynamic traffic variation and keeps the packet arrival rate around the link capacity. The queue si...

We consider the problems of online and stochastic packet queuing in a distributed system of n nodes with queues, where the communication between the nodes is done via a multiple access channel. In each round, an arbitrary number of packets can be injected into the system, each to an arbitrary node’s queue. Two measures of performance are considered: the total number of packets in the system, ca...

Active queue management schemes like RED (Random Early Detection) have been suggested when multiple TCP sessions are multiplexed through a bottleneck buffer. The idea is to detect congestion before the buffer overflows and packets are lost. When the queue length reaches a certain threshold RED schemes drop/mark incoming packets with a probability that increases as the queue size increases. The ...