MIT Libraries logoDSpace@MIT

MIT
View Item 
  • DSpace@MIT Home
  • MIT Open Access Articles
  • MIT Open Access Articles
  • View Item
  • DSpace@MIT Home
  • MIT Open Access Articles
  • MIT Open Access Articles
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Stability of Skorokhod problem is undecidable

Author(s)
Gamarnik, David; Katz, Dmitriy
Thumbnail
DownloadGamarnik_The stability.pdf (225.2Kb)
OPEN_ACCESS_POLICY

Open Access Policy

Creative Commons Attribution-Noncommercial-Share Alike

Alternative title
The stability of the deterministic Skorokhod problem is undecidable
Terms of use
Creative Commons Attribution-Noncommercial-Share Alike http://creativecommons.org/licenses/by-nc-sa/4.0/
Metadata
Show full item record
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 d[subscript 0] such that stability of the Skorokhod problem associated with a fluid model of an RBM in dimension d ≥ d[subscript 0] 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 d ≥ d[subscript 0].
Date issued
2014-10
URI
http://hdl.handle.net/1721.1/98836
Department
Massachusetts Institute of Technology. Operations Research Center; Sloan School of Management
Journal
Queueing Systems
Publisher
Springer-Verlag
Citation
Gamarnik, David, and Dmitriy Katz. “The Stability of the Deterministic Skorokhod Problem Is Undecidable.” Queueing Systems 79, no. 3–4 (October 19, 2014): 221–249.
Version: Original manuscript
ISSN
0257-0130
1572-9443

Collections
  • MIT Open Access Articles

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

Login

Statistics

OA StatisticsStatistics by CountryStatistics by Department
MIT Libraries
PrivacyPermissionsAccessibilityContact us
MIT
Content created by the MIT Libraries, CC BY-NC unless otherwise noted. Notify us about copyright concerns.