Publications
Chosen filters:
Chosen filters:
Tail behaviour of a finite-/infinite-capacity priority queue Ghent University
Priority queues have been studied extensively throughout the last few decades. One of the main performance measures of interest is the loss probability, caused by the evident finiteness of queues. From analytical point of view, finite-capacity queues are more complex to study than queues with infinite capacity. Therefore, the most common approach for studying the loss probability is to analyze the tail behaviour of the corresponding ...
Modelling queue sizes in an expedited forwarding DiffServ router with service differentiation Ghent University
This paper studies a single-server non-preemptive priority queue with two traffic classes in order to model Expedited Forwarding Per-Hop Behaviour in the Differentiated Services (DiffServ) architecture. Generally, queueing models assume infinite queue capacity but in a DiffServ router the capacity for high priority traffic is typically small to prevent this traffic from monopolizing the output link and hence causing starvation of low-priority ...
Road splits: smooth or rough passage? Ghent University
No one likes to wait in line. Even worse is having to wait in a line that has nothing to do with your own interests. Take for instance a road split, for example a T junction. Cars on that T junction heading straight ahead may be hindered or even blocked by cars wanting to turn left, even when the road ahead is free. This is simply because they have to wait in line in a rst-come-rst-served (FCFS) manner on the road leading to the T junction. Or ...
Delay analysis of a queue with general service demands and correlated service capacities Ghent University
We present the study of a non-classical discrete-time queueing model in which the customers each request a variable amount of service, called their “service demand”, from a server which is able to execute a variable amount of work, called its “service capacity”, during each time slot. We assume that the numbers of arrivals in consecutive time slots and the service demands of consecutive customers form two independent and identically distributed ...
Overflow probabilities for Markov-modulated infinite-server queues: a large-deviations approach Ghent University
In this paper we consider an infinite-server queue in a random environment. The distinguishing feature of the model is the presence of two irreducible Markov chains: one Markov chain modulates the arrival rates, while the other modulates the service times. We are interested in the probability that the number of jobs in the system becomes unusually large, i.e. we are interested in overflow. Because arrival rates and service times are ...