Loss pattern of DBMAP/DMSP/1/K queue and its application in wireless local communications

This paper applies a matrix-analytical approach to analyze the packet loss pattern of finite buffer single server queue with discrete-time batch Markovian arrival process (DBMAP). The service process is correlated and its structure is presented through discrete-time Markovian service process (DMSP). The bursty nature of packet loss pattern will be examined by means of statistics with respect to alternating loss periods and loss distances. The loss period is the period that loss once it starts; loss distance refers to the spacing between the loss periods. All of the two related performance measurement are derived, including probability distributions of a loss period and a loss distance, average length of a loss period and a loss distance. Queueing systems of this type arise in the domain of wireless local communications. Based on the numerical analysis of such a queueing system, some performance measures for the wireless local communication are presented.     

Analyzing the finite buffer batch arrival queue under Markovian service process: GIX/MSP/1/N

We consider a batch arrival finite buffer single server queue with inter-batch arrival times are generally distributed and arrivals occur in batches of random size. The service process is correlated and its structure is presented through Markovian service process (MSP). The model is analyzed for two possible customer rejection strategies: partial batch rejection and total batch rejection policy. We obtain steady-state distribution at pre-arrival and arbitrary epochs along with some important performance measures, like probabilities of blocking the first, an arbitrary, and the last customer of a batch, average number of customers in the system, and the mean waiting times in the system. Some numerical results have been presented graphically to show the effect of model parameters on the performance measures. The model has potential application in the area of computer networks, telecommunication systems, manufacturing system design, etc.      

The discrete-time MAP/PH/1 queue with multiple working vacations

We consider a discrete-time single-server queueing model where arrivals are governed by a discrete Markovian arrival process (DMAP), which captures both burstiness and correlation in the interarrival times, and the service times and the vacation duration times are assumed to have a general phase-type distributions. The vacation policy is that of a working vacation policy where the server serves the customers at a lower rate during the vacation period as compared to the rate during the normal busy period. Various performance measures of this queueing system like the stationary queue length distribution, waiting time distribution and the distribution of regular busy period are derived. Through numerical experiments, certain insights are presented based on a comparison of the considered model with an equivalent model with independent arrivals, and the effect of the parameters on the performance measures of this model are analyzed.     

基于pena距离的非线性回归模型的影响分析

基于pena距离统计量对非线性回归模型的影响分析进行了讨论,得到了非线性回归模型的pena距离公式,并对公式的分析性质以及其对高杠异常点的检测作用做出了相应的结论,得出了在一定条件下pena距离对异常点的检测优于Cook距离的结论,特别是对高杠杆异常点的检验,pena距离的效果更加明显,给出了实际数据检验结果,对方法的有效性进行了验证。     

Diffusion approximation for an overloaded X model via a stochastic averaging principle

In previous papers we developed a deterministic fluid approximation for an overloaded Markovian queueing system having two customer classes and two service pools, known in the call-center literature as the X model. The system uses the fixed-queue-ratio-with-thresholds (FQR-T) control, which we proposed as a way for one service system to help another in face of an unexpected overload. Under FQR-T, customers are served by their own service pool until a threshold is exceeded. Then, one-way sharing is activated with customers from one class allowed to be served in both pools. The control aims to keep the two queues at a pre-specified fixed ratio. We supported the fluid approximation by establishing a functional weak law of large numbers involving a stochastic averaging principle. In this paper we develop a refined diffusion approximation for the same model based on a many-server heavy-traffic functional central limit theorem.     

Optimal control of a queue under a quality-of-service constraint with bounded and unbounded rates

We consider a simple Markovian queue with Poisson arrivals and exponential service times for jobs. The controller chooses state-dependent service rates from an action space. The queue has a finite buffer, and when full, new jobs get rejected. The controller’s objective is to choose optimal service rates that meet a quality-of-service constraint. We solve this problem analytically and compute it numerically under two cases: When the action space is unbounded and when it is bounded.     

基于多目标属性权重优化的犹豫模糊语言TOPSIS决策方法

犹豫模糊语言术语集作为一种有效的信息表达形式,能够很好的反映出人们的定性且犹豫的决策信息。传统的距离测度会导致犹豫模糊语言信息的流失,因此,本文首先提出了一种新的犹豫模糊语言距离测度,并研究了该距离测度的性质。其次,针对属性权重完全未知的犹豫模糊语言多属性决策问题,考虑方案和属性两个层面,构建了多目标优化的属性权重确定模型。进而,基于多目标权重优化模型和犹豫模糊语言距离测度,提出了一种改进的犹豫模糊语言TOPSIS法。最后通过实例说明了所提出的TOPSIS法的实用性和有效性,并进行了灵敏度和比较分析。     

Equilibrium customer strategies in a single server Markovian queue with setup times

We consider a single server Markovian queue with setup times. Whenever this system becomes empty, the server is turned off. Whenever a customer arrives to an empty system, the server begins an exponential setup time to start service again. We assume that arriving customers decide whether to enter the system or balk based on a natural reward-cost structure, which incorporates their desire for service as well as their unwillingness to wait. We examine customer behavior under various levels of information regarding the system state. Specifically, before making the decision, a customer may or may not know the state of the server and/or the number of present customers. We derive equilibrium strategies for the customers under the various levels of information and analyze the stationary behavior of the system under these strategies. We also illustrate further effects of the information level on the equilibrium behavior via numerical experiments.      

A Partially Observable Markov Decision Process with Lagged Information

In actuality, we face lots of uncertainty in the application of a Markov process. In order to reduce such uncertainty, it is indispensable to use additional information concerning the state of the process.Among various kinds of additional information, this paper focuses on how to use uncertain delayed observation in a partially observable Markovian decision process (POMDP). This study develops a basic information structure, adding lagged observations to a general POMDP, and derives a rule for updating the state vector based on the information structure. This POMDP model is solved on the basis of a modified one-pass algorithm. An example is also given.     

Sequential clinical scheduling with service criteria

This study investigates sequential appointment scheduling with service criteria. It uses a constraint-based approach with service criteria bounded in a constraint set in contrast to the more typical weighted linear objective function. Properties are derived and a sequential scheduling algorithm is developed. Fairness properties of generated schedules are considered in detail, where fairness is the uniformity of performance across patients. New unfairness measures are proposed and used to capture the inequity among patients assigned to different slots. Other criteria such as expectation and variance of patient waiting time, queue length, and overtime are also considered. The fairness/revenue tradeoff is investigated as is the flexibility of the constraint-based approach in handling unavailable time periods.     

Equilibrium balking strategies for a clearing queueing system in alternating environment

We consider a Markovian clearing queueing system, where the customers are accumulated according to a Poisson arrival process and the server removes all present customers at the completion epochs of exponential service cycles. This system may represent the visits of a transportation facility with unlimited capacity at a certain station. The system evolves in an alternating environment that influences the arrival and the service rates. We assume that the arriving customers decide whether to join the system or balk, based on a natural linear reward-cost structure. We study the balking behavior of the customers and derive the corresponding Nash equilibrium strategies under various levels of information.     

Optimale Produktionsplanung bei Frischprodukten mit dem Programm FORTUNA — Eine Fallstudie

The production rate of perishable goods depends heavily on the actual stock level and the daily demand. Production planning is therefore short-term. The production of curd (cottage cheese), with which the case study deals, is a typical example. When the daily production process is started, the demand is still unknown. When planning is non-computerized, this causes considerable fluctuations in the stock level and increases the danger of perishing. It also necessitates an over capacity for production to maintain a high level of service. The computer software package FORTUNA is a result of this problem being studied. It is based on a Markovian decision process of the type of a AHM-Inventory Production model. The computer program makes forecasts of the daily demand, computes optimal decision rules for short-term tuning of the daily production rate and produces weekly or monthly labour schedules. The second part of this paper contains the application of FORTUNA in a dairy. It reports about the analysis of the demand pattern, the identification of the parameters of the cost structure, the performance criteria of non-monetary goals, the comparison with manual planning and the long term effects.     

The Transit Route Arc-Node Service Maximization problem

This article presents a new method for determining optimal transit routes. The Transit Route Arc-Node Service Maximization model is a mathematical model that maximizes the service value of a route, rather than minimizing cost. Cost (distance) is considered as a budget constraint on the extent of the route. The mathematical formulation modifies and exploits the structure of linear programming problems designed for the traveling salesman problem. An innovative divide-and-conquer solution procedure is presented that not only makes the transit routing problem tractable, but also provides a range of high-quality alternate routes for consideration, some of which have substantially varying geometries. Variant formulations are provided for several common transit route types. The model is tested through its application to an existing street network in Richardson, TX. Optimal numeric results are obtained for several problem instances, and these results demonstrate that increased route cost is not correlated with increased service provision.     

基于排队的库存服务系统最优控制策略

研究一个连续盘点的(s,Q)补货的库存服务系统。基于排队理论建立库存水平状态平衡方程,并推导出库存水平稳态概率分布以及作为库存控制的系统稳态性能指标。以库存成本最小化为目标,构建服务水平约束的库存控制模型。针对模型的非线性约束与整数型变量的特征,采用一种改进的遗传算法(IGA)用于决策变量的寻优。数值实验表明,当目标服务水平大于库存系统内生的服务水平时,实施服务水平约束能够降低库存控制成本。     

Analysis of a Queueing Model with Batch Markovian Arrival Process and General Distribution for Group Clearance

In this paper we consider a single server queueing model with under general bulk service rule with infinite upper bound on the batch size which we call group clearance. The arrivals occur according to a batch Markovian point process and the services are generally distributed. The customers arriving after the service initiation cannot enter the ongoing service. The service time is independent on the batch size. First, we employ the classical embedded Markov renewal process approach to study the model. Secondly, under the assumption that the services are of phase type, we study the model as a continuous-time Markov chain whose generator has a very special structure. Using matrix-analytic methods we study the model in steady-state and discuss some special cases of the model as well as representative numerical examples covering a wide range of service time distributions such as constant, uniform, Weibull, and phase type.

     

A game theoretic approach to option valuation under Markovian regime-switching models

In this paper, we consider a game theoretic approach to option valuation under Markovian regime-switching models, namely, a Markovian regime-switching geometric Brownian motion (GBM) and a Markovian regime-switching jump-diffusion model. In particular, we consider a stochastic differential game with two players, namely, the representative agent and the market. The representative agent has a power utility function and the market is a “fictitious” player of the game. We also explore and strengthen the connection between an equivalent martingale measure for option valuation selected by an equilibrium state of the stochastic differential game and that arising from a regime switching version of the Esscher transform. When the stock price process is governed by a Markovian regime-switching GBM, the pricing measures chosen by the two approaches coincide. When the stock price process is governed by a Markovian regime-switching jump-diffusion model, we identify the condition under which the pricing measures selected by the two approaches are identical.     

Analysis of stationary discrete-time GI/D-MSP/1 queue with finite and infinite buffers

This paper considers a single-server queueing model with finite and infinite buffers in which customers arrive according to a discrete-time renewal process. The customers are served one at a time under discrete-time Markovian service process (D-MSP). This service process is similar to the discrete-time Markovian arrival process (D-MAP), where arrivals are replaced with service completions. Using the imbedded Markov chain technique and the matrix-geometric method, we obtain the system-length distribution at a prearrival epoch. We also provide the steady-state system-length distribution at an arbitrary epoch by using the supplementary variable technique and the classical argument based on renewal-theory. The analysis of actual-waiting-time (in the queue) distribution (measured in slots) has also been investigated. Further, we derive the coefficient of correlation of the lagged interdeparture intervals. Moreover, computational experiences with a variety of numerical results in the form of tables and graphs are discussed.     

任意信源与马氏信源比较及小偏差定理

设{X_n,n≥0}是在S={1,2,…N}中取值的可测函数列,P、Q是测度空间上的两个概率测度,其中Q关于{X_n,n≥0}是马氏测度.本文引进了P关于Q的样本散度率距离的概念,并利用这个概念得到了任意信源二元函数一类平均值的小偏差定理,作为推论得到了任意信源熵密度的小偏差定理.最后我们将Shannon-McMillan定理推广到非齐次马氏信源情形.     

Analysis of the MAP/PH/1/K queue with service control

We consider a finite capacity queue with Markovian arrivals, in which the service rates are controlled by two pre-determined thresholds, M and N. The service rate is increased when the buffer size exceeds N and then brought back to normal service rate when the buffer size drops to M. The normal and fast service times are both assumed to be of phase type with representations (β, S), and β θS), respectively, where θ>1. For this queueing model, steady state analysis is performed. The server duration in normal as well as fast periods is shown to be of phase type. The departure process is modelled as a MAP and the parameter matrices of the MAP are identified. Efficient algorithms for computing system performance measures are presented. We also discuss an optimization problem and present an efficient algorithm for arriving at an optimal solution. Some numerical examples are discussed.     

An integral LP relaxation for a drayage problem

This paper investigates a drayage problem, where a fleet of trucks must ship container loads from a port to importers and from exporters to the same port, without separating trucks and containers during customer service. We present three formulations for this problem that are valid when each truck carries one container. For the third formulation, we also assume that the arc costs are equal for all trucks, and then we prove that its continuous relaxation admits integer optimal solutions by checking that its constraint matrix is totally unimodular. Under the same hypothesis on costs, even the continuous relaxations of the first two models are proved to admit an integer optimal solution. Finally, the third model is transformed into a circulation problem, that can be solved by efficient network algorithms.