To better understand how to interpret birth-and-death (BD) processes fit to service system data, we investigate the consequences of fitting a BD process to a multi-server queue with a periodic time-varying arrival rate function. We study how this fitted BD process is related to the original queue-length process. If a BD process is fit to a segment of the sample path of the queue-length process,...

Traffic flows on networks have been the subject of intensive study [1]. We study this problem in the context of a two dimensional lattice of nodes and hubs. When many messages flow on the lattice, hubs which lie on many message paths tend to get congested. We rank the hubs by their coefficient of betweenness centrality (CBC) [2] which is defined as the number of messages Nk running through a gi...

ABSTRACT Understanding the detailed queueing behavior of a networking session is critical in enabling low-latency services over the Internet. Especially when the packet arrival and service rates at the queue of a link vary over time and moreover when the session is short-lived, analyzing the corresponding queue behavior as a function of time, which involves a transient analysis, becomes extreme...

In this paper, we study the optimization of traffic light controllers and present an adaptive, predictive, and statistical optimization algorithm that performs dynamic queue length estimation. The system presented focuses on low power consumption, easy maintenance, and simple construction. The highlights of the system are (1) dynamic queue length estimation for timer delay computation and (2) t...

Mobile Ad hoc network [MANET] consists of mobile nodes without any fixed infrastructure, communicating through wireless medium. In MANET, Congestion occurs in any intermediate nodes when data packets travel from source to destination and they incur higher packet loss rate and long delay, which cause the degradations in performance of a network. Congestion can be controlled by Active Queue Manag...

This paper proposes a rate-based active queue management algorithm or RAQM. It uses the aggregated traffic input rate to calculate packet drop probability according to an exponential rule. The proposed RAQM algorithm works in two modes: queue-independent and queuedependent. In the queue-independent mode, it only relies on the aggregate traffic input rate to regulate the input rate to the expect...

In recent years, AQM (Active Queue Management) mechanisms, which support the end-to-end congestion control mechanism of TCP (Transmission Control Protocol), have been widely studied. The AQM mechanism is a congestion control mechanism at a router to control its queue length by actively discarding arriving packets. Many AQM mechanisms such as RED (Random Early Detection) have been proposed. Howe...

In this paper we consider the MMAP/PH/1 priority queue, both the case of preemptive resume and the case of non-preemptive service. The main idea of the presented analysis procedure is that the sojourn time of the low priority jobs in the preemptive case (and the waiting time distribution in the nonpreemptive case) can be represented by the duration of the busy period of a special Markovian flui...

Abstract In this paper, a new discrete-time GeomX /G/1 queue model with multiple vacations is analyzed. The Probability Generating Function (P.G.F.) of the queue length is obtained by using the method of an embedded Markov chain, and the mean of the queue length is obtained by using L’Hospital rule. Then the P.G.F. of the busy period is derived, and the probabilities for the system being in a b...

A standard method of solving queueing network control MDPs with uncontrolled arrivals is to truncate the state space by turning o¤ arrivals at some queue length. However, this method requires large queue lengths to be accurate. This paper formulates approximate linear programs (ALPs) that give lower bounds average cost. Any di¤erential cost is allowed below some queue length but it is approxima...