Serial production line performance under random variation:Dealing with the ‘Law of Variability’

Many Queueing Theory and Production Management studies have investigated specific effects of variability on the performance of serial lines since variability has a significant impact on performance. To date, there has been no single summary source of the most relevant research results concerned with variability, particularly as they relate to the need to better understand the ‘Law of Variability’. This paper fills this gap and provides readers the foundational knowledge needed to develop intuition and insights on the complexities of stochastic simple serial lines, and serves as a guide to better understand and manage the effects of variability and design factors related to improving serial production line performance, i.e. throughput, inter-departure time and flow time, under random variation

Hierarchical Multiobjective Routing Model in MPLS Networks with Two Service Classes – A Comparison Case Study, Journal of Telecommunications and Information Technology, 2012, nr 2

A two-level hierarchical multicriteria routing model for multiprotocol label switching networks with two service classes (QoS, i.e., with quality of service requirements, and best effort services) and alternative routing is reviewed in this paper. A heuristic resolution approach, where nondominated solutions are obtained throughout the heuristic run and kept in an archive for further analysis is also reviewed. In this paper, an extensive analysis of the application of this procedure to two reference test networks for various traffic matrices is presented. Also a comparison of the results of our method with a lexicographic optimization approach based on a multicommodity flow formulation using virtual networks is carried out. Finally, results of a stochastic discrete event simulation model developed for these networks will be shown to illustrate the effectiveness of the resolution approach and to assess the inaccuracies of the analytic results

Analytical modeling of HSUPA-enabled UMTS networks for capacity planning

In recent years, mobile communication networks have experienced significant evolution. The 3G mobile communication system, UMTS, employs WCDMA as the air interface standard, which leads to quite different mobile network planning and dimensioning processes compared with 2G systems. The UMTS system capacity is limited by the received interference at NodeBs due to the unique features of WCDMA, which is denoted as `soft capacity'. Consequently, the key challenge in UMTS radio network planning has been shifted from channel allocation in the channelized 2G systems to blocking and outage probabilities computation under the `cell breathing' effects which are due to the relationship between network coverage and capacity. The interference characterization, especially for the other-cell interference, is one of the most important components in 3G mobile networks planning. This monograph firstly investigates the system behavior in the operation of UMTS uplink, and develops the analytic techniques to model interference and system load as fully-characterized random variables, which can be directly applicable to the performance modeling of such networks. When the analysis progresses from single-cell scenario to multi-cell scenario, as the target SIR oriented power control mechanism is employed for maximum capacity, more sophisticated system operation, `feedback behavior', has emerged, as the interference levels at different cells depend on each other. Such behaviors are also captured into the constructed interference model by iterative and approximation approaches. The models are then extended to cater for the features of the newly introduced HSUPA, which provides enhanced dedicated channels for the packet switched data services such that much higher bandwidth can be achieved for best-effort elastic traffic, which allows network operators to cope with the coexistence of both circuit-switched and packet-switched traffic and guarantee the QoS requirements. During the derivation, we consider various propagation models, traffic models, resource allocation schemes for many possible scenarios, each of which may lead to different analytical models. All the suggested models are validated with either Monte-Carlo simulations or discrete event simulations, where excellent matches between results are always achieved. Furthermore, this monograph studies the optimization-based resource allocation strategies in the UMTS uplink with integrated QoS/best-effort traffic. Optimization techniques, both linear-programming based and non-linear-programming based, are used to determine how much resource should be assigned to each enhanced uplink user in the multi-cell environment where each NodeB possesses full knowledge of the whole network. The system performance under such resource allocation schemes are analyzed and compared via Monte-Carlo simulations, which verifies that the proposed framework may serve as a good estimation and optimal reference to study how systems perform for network operators

Analytical modeling of HSUPA-enabled UMTS networks for capacity planning

In recent years, mobile communication networks have experienced significant evolution. The 3G mobile communication system, UMTS, employs WCDMA as the air interface standard, which leads to quite different mobile network planning and dimensioning processes compared with 2G systems. The UMTS system capacity is limited by the received interference at NodeBs due to the unique features of WCDMA, which is denoted as `soft capacity'. Consequently, the key challenge in UMTS radio network planning has been shifted from channel allocation in the channelized 2G systems to blocking and outage probabilities computation under the `cell breathing' effects which are due to the relationship between network coverage and capacity. The interference characterization, especially for the other-cell interference, is one of the most important components in 3G mobile networks planning. This monograph firstly investigates the system behavior in the operation of UMTS uplink, and develops the analytic techniques to model interference and system load as fully-characterized random variables, which can be directly applicable to the performance modeling of such networks. When the analysis progresses from single-cell scenario to multi-cell scenario, as the target SIR oriented power control mechanism is employed for maximum capacity, more sophisticated system operation, `feedback behavior', has emerged, as the interference levels at different cells depend on each other. Such behaviors are also captured into the constructed interference model by iterative and approximation approaches. The models are then extended to cater for the features of the newly introduced HSUPA, which provides enhanced dedicated channels for the packet switched data services such that much higher bandwidth can be achieved for best-effort elastic traffic, which allows network operators to cope with the coexistence of both circuit-switched and packet-switched traffic and guarantee the QoS requirements. During the derivation, we consider various propagation models, traffic models, resource allocation schemes for many possible scenarios, each of which may lead to different analytical models. All the suggested models are validated with either Monte-Carlo simulations or discrete event simulations, where excellent matches between results are always achieved. Furthermore, this monograph studies the optimization-based resource allocation strategies in the UMTS uplink with integrated QoS/best-effort traffic. Optimization techniques, both linear-programming based and non-linear-programming based, are used to determine how much resource should be assigned to each enhanced uplink user in the multi-cell environment where each NodeB possesses full knowledge of the whole network. The system performance under such resource allocation schemes are analyzed and compared via Monte-Carlo simulations, which verifies that the proposed framework may serve as a good estimation and optimal reference to study how systems perform for network operators

Performance analysis of an asynchronous transfer mode multiplexer with Markov modulated inputs

Ankara : Department of Electrical and Electronics Engineering and the Institute of Engineering and Science of Bilkent University, 1993.Thesis (Ph.D.) -- Bilkent Iniversity, 1993.Includes bibliographical references leaves 108-113.Asynchronous Transfer Mode (ATM) networks have inputs which consist of superpositions of correlated cell streams. Markov modulated processes are commonly used to characterize this correlation. The first step through gaining an analytical insight in the performance issues of an ATM network is the analysis of a single channel. One objective of this study is the performance analysis of an ATM multiplexer whose input is a Markov modulated periodic arrival process. Based on the transient behavior of the nD/D/1 queue, we present an approximate method to compute the queue length distribution accurately. The method reduces to the solution of a linear differential equation with variable coefficients. Another general traffic model is the Markov Modulated Poisson Process (MMPP). We employ Pade approximations in transform domain for the deterministic service time distribution in an M MPP/D/1 queue so as to compute the distribution of the buffer occupancy. For both models, we also provide algorithms for analysis in the case of finite queue capacities and for computation of effective bandwidth.Akar, NailPh.D

Preemption control of multi-class loss networks

This thesis addresses the analysis and optimization of preemption in multi-class loss networks. Preemption, admission control and rate adaptation, are control mechanisms that enable loss network operators to provide quality of service (QoS) guarantees for admitted calls. This research includes two parts: i) performance characterization of a two parallel link loss network servicing multiple classes of calls under a speci c preemption and admission policy, and ii) preemption and admission control policy analysis for a single loss link servicing two classes of calls.In Part I, we consider a two parallel link multi-class loss network, where a call may preempt, if necessary, any calls with lower priorities and may in turn be preempted by any calls with higher priorities. The preemption policy permits both preemption from a preferred link to a backup link if possible, and eviction from either link if necessary. Our contributions in this part include: i) characterizing the rates of each class causing preemption of active lower priority calls, and therates of each class being preempted by an arriving higher priority call in Erlang-B functions when all classes share a common service rate; ii) simple expressions of these preemption rates through uniform asymptotic approximation; and iii) asymptotic approximation of these preemption rates using nearly completely decomposable (NCD) Markov chain techniques when classes have individual service rates.After analyzing the performance of a typical policy, we would also like to study various policies. In Part II, we analyze di erent preemption and admission control policies for a two-class loss link where per-class revenue is earned per unit time for each active call, and an instantaneous preemption cost is incurred whenever the preemption mechanism is employed. Our contributions in this part include: i) showing that under reasonable reward models, if we always preempt when the link is full, then it is better not to preempt at non-full states; ii) a su cient condition under which the average revenue of optimal preemption policy without admission control exceeds that of optimal admission control policy without preemption, which are established via policy improvement theorems fromstochastic dynamic programming.Ph.D., Computer Engineering -- Drexel University, 201

On the effective bandwidth for resource management in ATM networks

Ankara : Department of Electrical and Electronics Engineering and the Institute of Engineering and Sciences of Bilkent University, 1997.Thesis (Master's) -- Bilkent University, 1997.Includes bibliographical references leaves 81-84.Chahed, TijaniM.S

Interference suppression and diversity for CDMA systems

In code-division multiple-access (CDMA) systems, due to non-orthogonality of the spreading codes and multipath channels, the desired signal suffers interference from other users. Signal fading due to multipath propagation is another source of impairment in wireless CDMA systems, often severely impacting performance. In this dissertation, reduced-rank minimum mean square error (MMSE) receiver and reduced-rank minimum variance receiver are investigated to suppress interference; transmit diversity is applied to multicarrier CDMA (MC-CDMA) systems to combat fading; packet combing is studied to provide both interference suppression and diversity for CDMA random access systems. The reduced-rank MMSE receiver that uses a reduced-rank estimated covariance matrix is studied to improve the performance of MMSE receiver in CDMA systems. It is shown that the reduced-rank MMSE receiver has much better performance than the full-rank MMSE receiver when the covariance matrix is estimated by using a finite number of data samples and the desired signal is in a low dimensional subspace. It is also demonstrated that the reduced-rank minimum variance receiver outperforms the full-rank minimum variance receiver. The probability density function of the output SNR of the full-rank and reduced-rank linear MMSE estimators is derived for a general linear signal model under the assumption that the signals and noise are Gaussian distributed. Space-time coding that is originally proposed for narrow band systems is applied to an MC-CDMA system in order to get transmit diversity for such a wideband system. Some techniques to jointly decode the space-time code and suppress interference are developed. The channel estimation using either pilot channels or pilot symbols is studied for MC-CDMA systems with space-time coding. Performance of CDMA random access systems with packet combining in fading channels is analyzed. By combining the current retransmitted packet with all its previous transmitted copies, the receiver obtains a diversity gain plus an increased interference and noise suppression gain. Therefore, the bit error rate dramatically decreases with the number of transmissions increasing, which in turn improves the system throughput and reduces the average delay

Behavioural Types: from Theory to Tools

This book presents research produced by members of COST Action IC1201: Behavioural Types for Reliable Large-Scale Software Systems (BETTY), a European research network that was funded from October 2012 to October 2016. The technical theme of BETTY was the use of behavioural type systems in programming languages, to specify and verify properties of programs beyond the traditional use of type systems to describe data processing. A significant area within behavioural types is session types, which concerns the use of type-theoretic techniques to describe communication protocols so that static typechecking or dynamic monitoring can verify that protocols are implemented correctly. This is closely related to the topic of choreography, in which system design starts from a description of the overall communication flows. Another area is behavioural contracts, which describe the obligations of interacting agents in a way that enables blame to be attributed to the agent responsible for failed interaction. Type-theoretic techniques can also be used to analyse potential deadlocks due to cyclic dependencies between inter-process interactions. BETTY was organised into four Working Groups: (1) Foundations; (2) Security; (3) Programming Languages; (4) Tools and Applications. Working Groups 1–3 produced “state-of-the-art reports”, which originally intended to take snapshots of the field at the time the network started, but grew into substantial survey articles including much research carried out during the network [1–3]. The situation for Working Group 4 was different. When the network started, the community had produced relatively few implementations of programming languages or tools. One of the aims of the network was to encourage more implementation work, and this was a great success. The community as a whole has developed a greater interest in putting theoretical ideas into practice. The sixteen chapters in this book describe systems that were either completely developed, or substantially extended, during BETTY. The total of 41 co-authors represents a significant proportion of the active participants in the network (around 120 people who attended at least one meeting). The book is a report on the new state of the art created by BETTY in xv xvi Preface the area of Working Group 4, and the title “Behavioural Types: from Theory to Tools” summarises the trajectory of the community during the last four years. The book begins with two tutorials by Atzei et al. on contract-oriented design of distributed systems. Chapter 1 introduces the CO2 contract specifi- cation language and the Diogenes toolchain. Chapter 2 describes how timing constraints can be incorporated into the framework and checked with the CO2 middleware. Part of the CO2 middleware is a monitoring system, and the theme of monitoring continues in the next two chapters. In Chapter 3, Attard et al. present detectEr, a runtime monitoring tool for Erlang programs that allows correctness properties to be expressed in Hennessy-Milner logic. In Chapter 4, which is the first chapter about session types, Neykova and Yoshida describe a runtime verification framework for Python programs. Communication protocols are specified in the Scribble language, which is based on multiparty session types. The next three chapters deal with choreographic programming. In Chap- ter 5, Debois and Hildebrandt present a toolset for working with dynamic condition response (DCR) graphs, which are a graphical formalism for choreography. Chapter 6, by Lange et al., continues the graphical theme with ChorGram, a tool for synthesising global graphical choreographies from collections of communicating finite-state automata. Giallorenzo et al., in Chapter 7, consider runtime adaptation. They describe AIOCJ, a choreographic programming language in which runtime adaptation is supported with a guarantee that it doesn’t introduce deadlocks or races. Deadlock analysis is important in other settings too, and there are two more chapters about it. In Chapter 8, Padovani describes the Hypha tool, which uses a type-based approach to check deadlock-freedom and lock-freedom of systems modelled in a form of pi-calculus. In Chapter 9, Garcia and Laneve present a tool for analysing deadlocks in Java programs; this tool, called JaDA, is based on a behavioural type system. The next three chapters report on projects that have added session types to functional programming languages in order to support typechecking of communication-based code. In Chapter 10, Orchard and Yoshida describe an implementation of session types in Haskell, and survey several approaches to typechecking the linearity conditions required for safe session implemen- tation. In Chapter 11, Melgratti and Padovani describe an implementation of session types in OCaml. Their system uses runtime linearity checking. In Chapter 12, Lindley and Morris describe an extension of the web programming language Links with session types; their work contrasts with the previous two chapters in being less constrained by an existing language design. Continuing the theme of session types in programming languages, the next two chapters describe two approaches based on Java. Hu’s work, presented in Chapter 13, starts with the Scribble description of a multiparty session type and generates an API in the form of a collection of Java classes, each class containing the communication methods that are available in a particular state of the protocol. Dardha et al., in Chapter 14, also start with a Scribble specification. Their StMungo tool generates an API as a single class with an associated typestate specification to constrain sequences of method calls. Code that uses the API can be checked for correctness with the Mungo typechecker. Finally, there are two chapters about programming with the MPI libraries. Chapter 15, by Ng and Yoshida, uses an extension of Scribble, called Pabble, to describe protocols that parametric in the number of runtime roles. From a Pabble specification they generate C code that uses MPI for communication and is guaranteed correct by construction. Chapter 16, by Ng et al., describes the ParTypes framework for analysing existing C+MPI programs with respect to protocols defined in an extension of Scribble. We hope that the book will serve a useful purpose as a report on the activities of COST Action IC1201 and as a survey of programming languages and tools based on behavioural types