Conference Paper

Bounds on the tail distributions of Markov-modulated stochastic max-plus systems

Inst. Nat. de Recherche en Inf. et Autom., Sophia Antipolis
DOI: 10.1109/CDC.1995.480295 Conference: Decision and Control, 1995., Proceedings of the 34th IEEE Conference on, Volume: 2
Source: IEEE Xplore

ABSTRACT

Considers a particular class of linear systems under the max-plus
algebra and derive exponential upper bounds for the tail distribution of
each component of the state vector in the case of Markov modulated input
sequences. The authors' results are then applied to tandem queues with
infinite buffers, Markov modulated arrivals and deterministic service
times

Full-text preview

Available from: www-sop.inria.fr
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: In this paper we develop a framework for computing upper and lower bounds of an exponential form for a large class of single resource systems with non-renewal inputs. Specifically, the bounds are on quantities such as backlog, queue length, and response time. The exponential upper bound is shown to exist if the process describing the system is stable. 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 admission control to multimedia systems such as high speed networks and video servers.
    Preview · Article · May 1995
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: In this paper we develop a framework for computing upper and lower bounds of an exponential form for a large class of single resource systems with Markov additive inputs. Specifically, the bounds are on quantities such as backlog, queue length, and response time. Explicit or computable expressions for our bounds are given in the context of queueing theory and numerical comparisons with other bounds are presented. The paper concludes with two applications to admission control in multimedia systems.
    Preview · Article · May 1997 · Journal of the ACM
  • [Show abstract] [Hide abstract]
    ABSTRACT: This paper is concerned with quality of service guarantees in an environment with bursty traffic streams, such as those in the emerging ATM-based broadband ISDN. For virtually any traffic stream, new performance bounds are obtained in terms of effective bandwidths and burstiness constraints. The new bounds are tighter than those previously available and are asymptotically achievable, potentially resulting in better performance when used in traffic management. Various performance measures are considered. It is shown that the effective bandwidth of a departing traffic is bounded by that of the incoming traffic. For traffic streams having independent increments and Markov-modulated processes, the bounds are further refined to a point close to the exact values in some cases. Computationally, evaluation of the bounds requires less effort than finding effective bandwidths and burstiness constraints. Finally, the bounds are applied to routing control to find the near-optimal probabilistic routing policy.
    No preview · Conference Paper · Jan 1998
Show more