Skip to content
University of Maryland LibrariesDigital Repository at the University of Maryland
    • Login
    View Item 
    •   DRUM
    • A. James Clark School of Engineering
    • Institute for Systems Research Technical Reports
    • View Item
    •   DRUM
    • A. James Clark School of Engineering
    • Institute for Systems Research Technical Reports
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Bounding Functions of Markov processes and the Shortest Queue Problem.

    Thumbnail
    View/Open
    TR_87-206.pdf (656.4Kb)
    No. of downloads: 722

    Date
    1987
    Author
    Gubner, John A.
    Gopinath, B.
    Varadhan, S.R.S.
    Metadata
    Show full item record
    Abstract
    In this paper we prove a general lemma which can be used to show that the expectation of a nonnegative function of the state of a time-homogeneous Markov process is uniformly bounded in time. This is reminiscent of the classical theory of nonnegative supermartingales, except that our analog of the supermartingale inequality need not hold almost surely. Consequently, the lemma is suitable for establishing the stability of systems that evolve in a stabilizing mode in most states, though from certain states they may jump to a less stable state. We use this lemma to show that "joining the shortest queue" can bound the expected sum of the squares of the differences between all pairs among N queues, even under arbitrarily heavy traffic.
    URI
    http://hdl.handle.net/1903/4709
    Collections
    • Institute for Systems Research Technical Reports

    DRUM is brought to you by the University of Maryland Libraries
    University of Maryland, College Park, MD 20742-7011 (301)314-1328.
    Please send us your comments.
    Web Accessibility
     

     

    Browse

    All of DRUMCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

    My Account

    LoginRegister
    Pages
    About DRUMAbout Download Statistics

    DRUM is brought to you by the University of Maryland Libraries
    University of Maryland, College Park, MD 20742-7011 (301)314-1328.
    Please send us your comments.
    Web Accessibility