Closed queueing networks under congestion: non-bottleneck independence and bottleneck convergence

We analyze the behavior of closed product-form queueing networks when the number of customers grows to infinity and remains proportionate on each route (or class). First, we focus on the stationary behavior and prove the conjecture that the stationary distribution at non-bottleneck queues converges weakly to the stationary distribution of an ergodic, open product-form queueing network. This open network is obtained by replacing bottleneck queues with per-route Poissonian sources whose rates are determined by the solution of a strictly concave optimization problem. Then, we focus on the transient behavior of the network and use fluid limits to prove that the amount of fluid, or customers, on each route eventually concentrates on the bottleneck queues only, and that the long-term proportions of fluid in each route and in each queue solve the dual of the concave optimization problem that determines the throughputs of the previous open network.Comment: 22 page

Two-sided reflected Markov-modulated Brownian motion with applications to fluid queues and dividend payouts

In this paper we study a reflected Markov-modulated Brownian motion with a two sided reflection in which the drift, diffusion coefficient and the two boundaries are (jointly) modulated by a finite state space irreducible continuous time Markov chain. The goal is to compute the stationary distribution of this Markov process, which in addition to the complication of having a stochastic boundary can also include jumps at state change epochs of the underlying Markov chain because of the boundary changes. We give the general theory and then specialize to the case where the underlying Markov chain has two states. Moreover, motivated by an application of optimal dividend strategies, we consider the case where the lower barrier is zero and the upper barrier is subject to control. In this case we generalized earlier results from the case of a reflected Brownian motion to the Markov modulated case.Comment: 22 pages, 1 figur

Discounted optimal stopping of a Brownian bridge, with application to American options under pinning

Mathematically, the execution of an American-style financial derivative is commonly reduced to solving an optimal stopping problem. Breaking the general assumption that the knowledge of the holder is restricted to the price history of the underlying asset, we allow for the disclosure of future information about the terminal price of the asset by modeling it as a Brownian bridge. This model may be used under special market conditions, in particular we focus on what in the literature is known as the "pinning effect", that is, when the price of the asset approaches the strike price of a highly-traded option close to its expiration date. Our main mathematical contribution is in characterizing the solution to the optimal stopping problem when the gain function includes the discount factor. We show how to numerically compute the solution and we analyze the effect of the volatility estimation on the strategy by computing the confidence curves around the optimal stopping boundary. Finally, we compare our method with the optimal exercise time based on a geometric Brownian motion by using real data exhibiting pinning.Comment: 29 pages, 9 figures. Supplementary material: 5 R scripts, 4 RData file

Sojourn time in a single server queue with threshold service rate control

We study the sojourn time in a queueing system with a single exponential server, serving a Poisson stream of customers in order of arrival. Service is provided at low or high rate, which can be adapted at exponential inspection times. When the number of customers in the system is above a given threshold, the service rate is upgraded to the high rate, and otherwise, it is downgraded to the low rate. The state dependent changes in the service rate make the analysis of the sojourn time a challenging problem, since the sojourn time now also depends on future arrivals. We determine the Laplace transform of the stationary sojourn time and describe a procedure to compute all moments as well. First we analyze the special case of continuous inspection, where the service rate immediately changes once the threshold is crossed. Then we extend the analysis to random inspection times. This extension requires the development of a new methodological tool, that is "matrix generating functions". The power of this tool is that it can also be used to analyze generalizations to phase-type services and inspection times.Comment: 16 pages, 13 figure

Optimal portfolio with insider information on the stochastic interest rate

We consider the optimal portfolio problem where the interest rate is stochastic and the agent has insider information on its value at a finite terminal time. The agent's objective is to optimize the terminal value of her portfolio under a logarithmic utility function. Using techniques of initial enlargement of filtration, we identify the optimal strategy and compute the value of the information. The interest rate is first assumed to be an affine diffusion, then more explicit formulas are computed for the Vasicek interest rate model where the interest rate moves according to an Ornstein-Uhlenbeck process. Incidentally we show that an affine process conditioned to its future value is still an affine process. When the interest rate process is correlated with the price process of the risky asset, the value of the information is proved to be infinite, as is usually the case for initial-enlargement-type problems. However, weakening the information own by the agent and assuming that she only knows a lower-bound or both, a lower and an upper bound, for the terminal value of the interest rate process, we show that the value of the information is finite. This solves by an analytical proof a conjecture stated in Pikovsky and Karatzas (1996).Comment: 17 pages (excluding appendix, 5 pages

A short note on the monotonicity of the Erlang C formula in the Halfin-Whitt regime

We prove a monotonicity condition satisfied by the Erlang C formula when computed in the Halfin-Whitt regime. This property was recently conjectured in Janssen et al. [2011

First passage process of a Markov additive process, with applications to reflection problems

In this paper we consider the first passage process of a spectrally negative Markov additive process (MAP). The law of this process is uniquely characterized by a certain matrix function, which plays a crucial role in fluctuation theory. We show how to identify this matrix using the theory of Jordan chains associated with analytic matrix functions. Importantly, our result also provides us with a technique, which can be used to derive various further identities. We then proceed to show how to compute the stationary distribution associated with a one-sided reflected (at zero) MAP for both the spectrally positive and spectrally negative cases as well as for the two sided reflected Markov-modulated Brownian motion; these results can be interpreted in terms of queues with MAP input.Comment: 16 page

First passage of a Markov additive process and generalized Jordan chains

In this paper we consider the first passage process of a spectrally negative Markov additive process (MAP). The law of this process is uniquely characterized by a certain matrix function, which plays a crucial role in fluctuation theory. We show how to identify this matrix using the theory of Jordan chains associated with analytic matrix functions. This result provides us with a technique, which can be used to derive various further identities.Lévy processes, Fluctuation theory, Markov Additive Processes

Proportional switching in FIFO networks

We consider a family of discrete time multihop switched queueing networks where each packet movesalong a xed route. In this setting, BackPressure is the canonical choice of scheduling policy; this policy hasthe virtues of possessing a maximal stability region and not requiring explicit knowledge of tra c arrival rates.BackPressure has certain structural weaknesses because implementation requires information about each route,and queueing delays can grow super-linearly with route length. For large networks, where packets over manyroutes are processed by a queue, or where packets over a route are processed by many queues, these limitationscan be prohibitive.In this article, we introduce a scheduling policy for FIFO networks, the Proportional Scheduler, which isbased on the proportional fairness criterion. We show that, like BackPressure, the Proportional Scheduler hasa maximal stability region and does not require explicit knowledge of tra c arrival rates. The ProportionalScheduler has the advantage that information about the network's route structure is not required for scheduling,which substantially improves the policy's performance for large networks. For instance, packets can be routedwith only next-hop information and new nodes can be added to the network with only knowledge of thescheduling constraintsThe research of the rst author was partially supported by NSF grants DMS-1105668 and DMS-1203201. The research of the second author was partially supported by the Spanish Ministry of Economy and Competitiveness Grants MTM2013-42104-P via FEDER funds; he thanks the ICMAT (Madrid, Spain) Research Institute that kindly hosted him while developing this project