Queueing Theory deals with problems where some restricted resource should be shared between competitive flow of requests. In this paper we use Queueing Theory methods to perform a quantitative analysis of a single-level single-mediator multi-agent system. In the system, several agents, coordinated by the mediator process user queries. We adopt matrix analytic methods to compute performance char...

Within the combinatorial scheduling community, there has been an increasing interest in modelling and solving scheduling problems in dynamic environments. Such problems have also been considered in the field of queueing theory, but very few papers take advantage of developments in both areas, and literature surveys on dynamic scheduling usually make no mention of queueing approaches. In this pa...

Time dependent behavior has an impact on the performance of telecommunication models. Examples include: staffing a call center, pricing the inventory of private line services for profit maximization, and measuring the time lag between the peak arrivals and peak load for a system. These problems and more motivate the development of a queueing theory with time varying rates. Queueing theory as di...

In this paper, the use of queueing theory for modeling uninterrupted traffic flows is evaluated. Empirical data on speeds and flows are used to evaluate speeds generated by the different queueing models. Using the Theil inequality coefficient as evaluation criterion, the speeds generated by the queueing models are compared to the empirical speeds. Queueing models that best fit the observed spee...

This paper presents a new approach to real-time system scheduling. The approach, called real-time queueing theory, includes customer timing requirements into queueing models. With real-time queueing models, one is able to explicitly characterize the dynamic behavior of the customer lead-tame profile process where lead-time = deadline minus current time. In spite of the injinite dimensionality o...

APPENDIX A: ELEMENTS OF QUEUEING THEORY In a packet radio network, packets/messages are forwarded from node to node through the network by entering a buffer (queue) of a certain length in each node and waiting for their turn to be transmitted to the next node. Also, call access to a network with a given capacity is modeled as a process with certain distribution of call arrival times and certain...

In the today’s Internet and TCP/IPnetworks, the queueing of packets is commonly implemented using the protocol FIFO (First In First Out). Unfortunately, FIFO performs poorly in the Adversarial Queueing Theory. Other queueing strategies are researched in this model and better results are performed by alternative queueing strategies, e.g. LIS (Longest In System). This article introduces a new que...