About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
Queueing Systems
Paper
The stability of the deterministic Skorokhod problem is undecidable
Abstract
The Skorokhod problem arises in studying reflected Brownian motion (RBM) and the associated fluid model on the non-negative orthant. This problem specifically arises in the context of queueing networks in the heavy traffic regime. One of the key problems is that of determining, for a given deterministic Skorokhod problem, whether for every initial condition all solutions of the problem staring from the initial condition are attracted to the origin. The conditions for this attraction property, called stability, are known in dimension up to three, but not for general dimensions. In this paper we explain the fundamental difficulties encountered in trying to establish stability conditions for general dimensions. We prove the existence of dimension (Formula presented.) such that stability of the Skorokhod problem associated with a fluid model of an RBM in dimension (Formula presented.) is an undecidable property, when the starting state is a part of the input. Namely, there does not exist an algorithm (a constructive procedure) for identifying stable Skorokhod problem in dimensions (Formula presented.).