Asymptotically optimal importance sampling for tandem queues with Markov fluid input

被引:0
|
作者
Mandjes, Michel [1 ]
机构
[1] KPN Research, Leidschendam, Netherlands
来源
关键词
Asynchronous transfer mode - Broadband networks - Estimation - Probability - Queueing theory;
D O I
暂无
中图分类号
学科分类号
摘要
引用
收藏
页码:152 / 161
相关论文
共 50 条
  • [41] OPTIMAL-CONTROL OF SERVICE IN TANDEM QUEUES
    ROSBERG, Z
    VARAIYA, PP
    WALRAND, JC
    IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 1982, 27 (03) : 600 - 610
  • [42] On the Optimal Input Rate in Queues with Batch Service
    Pagano, Michele
    Tananko, Igor
    Stankevich, Elena
    AXIOMS, 2023, 12 (07)
  • [43] ASYMPTOTICS OF HYBRID FLUID QUEUES WITH LEVY INPUT
    Debicki, Krzysztof
    Sierpinska, Iwona
    Zwart, Bert
    JOURNAL OF APPLIED PROBABILITY, 2013, 50 (01) : 103 - 113
  • [44] On the Effective Envelopes for Fluid Queues with Gaussian Input
    Lukashenko, Oleg
    Morozov, Evsey
    Pagano, Michele
    DISTRIBUTED COMPUTER AND COMMUNICATION NETWORKS, 2014, 279 : 178 - 189
  • [45] ASYMPTOTICALLY OPTIMAL RULE FOR FORMING QUEUES FROM INDIRECT OBSERVATIONS
    NAZAROV, AA
    ENGINEERING CYBERNETICS, 1978, 16 (06): : 87 - 93
  • [46] ASYMPTOTICALLY OPTIMAL TESTS FOR FINITE MARKOV CHAINS
    BOZA, LB
    ANNALS OF MATHEMATICAL STATISTICS, 1970, 41 (03): : 1153 - &
  • [47] ASYMPTOTICALLY OPTIMAL TESTS FOR FINITE MARKOV CHAINS
    BOZA, LB
    ANNALS OF MATHEMATICAL STATISTICS, 1971, 42 (06): : 1992 - &
  • [48] Generalizing Informed Sampling for Asymptotically-Optimal Sampling-based Kinodynamic Planning via Markov Chain Monte Carlo
    Yi, Daqing
    Thakker, Rohan
    Gulino, Cole
    Salzman, Oren
    Srinivasa, Siddhartha
    2018 IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION (ICRA), 2018, : 7063 - 7070
  • [49] Transient analysis of Markov-fluid-driven queues
    Es-Saghouani, Abdelghafour
    Mandjes, Michel
    TOP, 2011, 19 (01) : 35 - 53
  • [50] Transient analysis of Markov-fluid-driven queues
    Abdelghafour Es-Saghouani
    Michel Mandjes
    TOP, 2011, 19 : 35 - 53