Learn More
The deterministic network calculus offers an elegant framework for determining delays and backlog in a network with deterministic service guarantees to individual traffic flows. This paper addresses the problem of extending the network calculus to a probabilistic framework with statistical service guarantees. Here, the key difficulty relates to expressing,(More)
We consider a class of undiscounted terminating Markov decision processes with a risk-averse exponential objective function and compact constraint sets. After assuming the existence of an absorbing cost-free terminal state , positive transition costs away from , and continuity of the transition probability and cost functions, we establish (i) the existence(More)
BACKGROUND In 2008-2009, the first multinational study was completed comparing closed-loop control (artificial pancreas) to state-of-the-art open-loop therapy in adults with type 1 diabetes mellitus (T1DM). METHODS The design of the control algorithm was done entirely in silico, i.e., using computer simulation experiments with N=300 synthetic "subjects"(More)
BACKGROUND Hypoglycemia has been identified as a primary barrier to optimal management of diabetes. This observation, in conjunction with the introduction of continuous glucose monitoring (CGM) devices, has set the stage for achieving tight glycemic control with systems that adjust the insulin pump settings based on measured glucose concentrations. Because(More)
BACKGROUND Closed-loop control of type 1 diabetes is receiving increasing attention due to advancement in glucose sensor and insulin pump technology. Here the function and structure of a class of control algorithms designed to exert control to range, defined as insulin treatment optimizing glycemia within a predefined target range by preventing extreme(More)
Modularity plays a key role in many engineering systems, allowing for plug-and-play integration of components, enhancing flexibility and adaptability, and facilitating standardization. In the control of diabetes, i.e., the so-called "artificial pancreas," modularity allows for the step-wise introduction of (and regulatory approval for) algorithmic(More)
The network calculus offers an elegant framework for determining worst-case bounds on delay and backlog in a network. This paper extends the network calculus to a probabilistic framework with statistical service guarantees. The notion of a statistical service curve is presented as a probabilistic bound on the service received by an individual flow or an(More)