Queueing Networks With Blocking.

The area of classical (product form) queueing networks is briefly discussed. The principal results for classical queueing networks are summarized. The transfer, service and rejection blocking policies are defined, and their use in queueing network models are presented. An overview of the literature in the area of queueing networks with blocking is given, and the relations between the three blocking policies is discussed in general. Duality theorems for open and closed queueing networks with rejection blocking and a single job class are proved. Using a duality theorem, an exact solution is found for closed blocking networks which contain so many jobs that if one station is empty all other stations are full. Algorithms to compute performance measures, in particular throughputs, follow from the way the solution is obtained. It is then proved that for open, mixed and closed networks with rejection blocking, multiple job classes, general service time distributions and reversible routing the equilibrium state probabilities have product form. The reversed process for these networks is examined, and it is proved that it represents a network of the same type. Formulas for throughputs are derived, and algorithms to compute performance measures are outlined. Finally, closed central server models with state-dependent routing, multiple job classes and rejection blocking are investigated. The equilibrium state probabilities have a modified product form, and the reversed process is a network of the same type. Formulas for performance measures are derived for this model and algorithms to compute them are outlined

Efficient resource allocation and call admission control in high capacity wireless networks

Resource Allocation (RA) and Call Admission Control (CAC) in wireless networks are processes that control the allocation of the limited radio resources to mobile stations (MS) in order to maximize the utilization efficiency of radio resources and guarantee the Quality of Service (QoS) requirements of mobile users. In this dissertation, several distributed, adaptive and efficient RA/CAC schemes are proposed and analyzed, in order to improve the system utilization while maintaining the required QoS. Since the most salient feature of the mobile wireless network is that users are moving, a Mobility Based Channel Reservation (MBCR) scheme is proposed which takes the user mobility into consideration. The MBCR scheme is further developed into PMBBR scheme by using the user location information in the reservation making process. Through traffic composition analysis, the commonly used assumption is challenged in this dissertation, and a New Call Bounding (NCB) scheme, which uses the number of channels that are currently occupied by new calls as a decision variable for the CAC, is proposed. This dissertation also investigates the pricing as another dimension for RA/CAC. It is proven that for a given wireless network there exists a new call arrival rate which can maximize the total utility of users, while maintaining the required QoS. Based on this conclusion, an integrated pricing and CAC scheme is proposed to alleviate the system congestion

EUROPEAN CONFERENCE ON QUEUEING THEORY 2016

International audienceThis booklet contains the proceedings of the second European Conference in Queueing Theory (ECQT) that was held from the 18th to the 20th of July 2016 at the engineering school ENSEEIHT, Toulouse, France. ECQT is a biannual event where scientists and technicians in queueing theory and related areas get together to promote research, encourage interaction and exchange ideas. The spirit of the conference is to be a queueing event organized from within Europe, but open to participants from all over the world. The technical program of the 2016 edition consisted of 112 presentations organized in 29 sessions covering all trends in queueing theory, including the development of the theory, methodology advances, computational aspects and applications. Another exciting feature of ECQT2016 was the institution of the Takács Award for outstanding PhD thesis on "Queueing Theory and its Applications"

Methodology for modeling high performance distributed and parallel systems

Performance modeling of distributed and parallel systems is of considerable importance to the high performance computing community. To achieve high performance, proper task or process assignment and data or file allocation among processing sites is essential. This dissertation describes an elegant approach to model distributed and parallel systems, which combines the optimal static solutions for data allocation with dynamic policies for task assignment. A performance-efficient system model is developed using analytical tools and techniques. The system model is accomplished in three steps. First, the basic client-server model which allows only data transfer is evaluated. A prediction and evaluation method is developed to examine the system behavior and estimate performance measures. The method is based on known product form queueing networks. The next step extends the model so that each site of the system behaves as both client and server. A data-allocation strategy is designed at this stage which optimally assigns the data to the processing sites. The strategy is based on flow deviation technique in queueing models. The third stage considers process-migration policies. A novel on-line adaptive load-balancing algorithm is proposed which dynamically migrates processes and transfers data among different sites to minimize the job execution cost. The gradient-descent rule is used to optimize the cost function, which expresses the cost of process execution at different processing sites. The accuracy of the prediction method and the effectiveness of the analytical techniques is established by the simulations. The modeling procedure described here is general and applicable to any message-passing distributed and parallel system. The proposed techniques and tools can be easily utilized in other related areas such as networking and operating systems. This work contributes significantly towards the design of distributed and parallel systems where performance is critical

Statistical multiplexing and connection admission control in ATM networks

Asynchronous Transfer Mode (ATM) technology is widely employed for the transport of network traffic, and has the potential to be the base technology for the next generation of global communications. Connection Admission Control (CAC) is the effective traffic control mechanism which is necessary in ATM networks in order to avoid possible congestion at each network node and to achieve the Quality-of-Service (QoS) requested by each connection. CAC determines whether or not the network should accept a new connection. A new connection will only be accepted if the network has sufficient resources to meet its QoS requirements without affecting the QoS commitments already made by the network for existing connections. The design of a high-performance CAC is based on an in-depth understanding of the statistical characteristics of the traffic sources

Proceedings of the First Karlsruhe Service Summit Workshop - Advances in Service Research, Karlsruhe, Germany, February 2015 (KIT Scientific Reports ; 7692)

Since April 2008 KSRI fosters interdisciplinary research in order to support and advance the progress in the service domain. KSRI brings together academia and industry while serving as a European research hub with respect to service science. For KSS2015 Research Workshop, we invited submissions of theoretical and empirical research dealing with the relevant topics in the context of services including energy, mobility, health care, social collaboration, and web technologies

Impact of Mobility and Wireless Channel on the Performance of Wireless Networks

This thesis studies the impact of mobility and wireless channel characteristics, i. e. , variability and high bit-error-rate, on the performance of integrated voice and data wireless systems from network, transport protocol and application perspectives. From the network perspective, we study the impact of user mobility on radio resource allocation. The goal is to design resource allocation mechanisms that provide seamless mobility for voice calls while being fair to data calls. In particular, we develop a distributed admission control for a general integrated voice and data wireless system. We model the number of active calls in a cell of the network as a Gaussian process with time-dependent mean and variance. The Gaussian model is updated periodically using the information obtained from neighboring cells about their load conditions. We show that the proposed scheme guarantees a prespecified dropping probability for voice calls while being fair to data calls. Furthermore, the scheme is stable, insensitive to user mobility process and robust to load variations. From the transport protocol perspective, we study the impact of wireless channel variations and rate scheduling on the performance of elastic data traffic carried by TCP. We explore cross-layer optimization of the rate adaptation feature of cellular networks to optimize TCP throughput. We propose a TCP-aware scheduler that switches between two rates as a function of TCP sending rate. We develop a fluid model of the steady-state TCP behavior for such a system and derive analytical expressions for TCP throughput that explicitly account for rate variability as well as the dependency between the scheduler and TCP. The model is used to choose RF layer parameters that, in conjunction with the TCP-aware scheduler, improve long-term TCP throughput in wireless networks. A distinctive feature of our model is its ability to capture variability of round-trip-time, channel rate and packet error probability inherent to wireless communications. From the application perspective, we study the performance of wireless messaging systems. Two popular wireless applications, the short messaging service and multimedia messaging service are considered. We develop a mathematical model to evaluate the performance of these systems taking into consideration the fact that each message tolerates only a limited amount of waiting time in the system. Using the model, closed-form expressions for critical performance parameters such as message loss, message delay and expiry probability are derived. Furthermore, a simple algorithm is presented to find the optimal temporary storage size that minimizes message delay for a given set of system parameters

Message-driven dynamics

Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1997.Includes bibliographical references (p. 251-260).by Richard Anton Lethin.Ph.D

Stability Problems for Stochastic Models: Theory and Applications II

Most papers published in this Special Issue of Mathematics are written by the participants of the XXXVI International Seminar on Stability Problems for Stochastic Models, 21­25 June, 2021, Petrozavodsk, Russia. The scope of the seminar embraces the following topics: Limit theorems and stability problems; Asymptotic theory of stochastic processes; Stable distributions and processes; Asymptotic statistics; Discrete probability models; Characterization of probability distributions; Insurance and financial mathematics; Applied statistics; Queueing theory; and other fields. This Special Issue contains 12 papers by specialists who represent 6 countries: Belarus, France, Hungary, India, Italy, and Russia