By Topic

Exponential bounds for a class of stochastic processes with application to call admission control in networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Liu, Z. ; Inst. Nat. de Recherche en Inf. et Autom., Sophia Antipolis, France ; Nain, P. ; Towsley, D.

Obtains computable upper and lower bounds of an exponential form for the tail distribution of a class of stochastic processes satisfying a Lindley's type recursion with non-renewal inputs. The exponential upper bound is shown to exist if the process is ergodic. The optimum decay rate for the bound is obtained by establishing a large deviation result for this process. The paper concludes with several applications including one to the problem of controlling the admission of new sessions into a network

Published in:

Decision and Control, 1994., Proceedings of the 33rd IEEE Conference on  (Volume:1 )

Date of Conference:

14-16 Dec 1994