Queue Length Recursions

Queue Length Recursions is a mathematical framework within queueing theory that characterizes the evolution of queue length distributions over time through recursive relations, distinguishing itself by expressing the probability distribution of customers in a queue at a given time in terms of its previous states under specific arrival and service processes.

17

Publications

744

Citations

34

Authors

24

Institutions

Publications per year

2017–2026

2

Authors

34

  1. TT
    Tetsuya Takine

    Kyoto University, Japan

    3 publications · 73 citations

    3

    h-index

  2. NK
    Nikolai Krivulin

    St Petersburg University, Russia

    2 publications · 34 citations

    2

    h-index

  3. HW
    Ho Woo Lee

    Sungkyunkwan University, South Korea

    2 publications · 57 citations

    2

    h-index

  4. DM
    Dongfang Ma

    Zhejiang University, China

    1 publications · 54 citations

    1

    h-index

  5. KX
    Kaili Xiang

    Southwestern University of Finance and Economics, China

    1 publications · 14 citations

    1

    h-index

1–5 of 34

Venues

  1. IEEE Communications Letters

    2 publications · 23 citations

    2

    h-index

  2. Communications in Statistics Stochastic Models

    2 publications · 127 citations

    2

    h-index

  3. Mathematical and Computer Modelling

    1 publications · 284 citations

    1

    h-index

  4. IEEE Transactions on Computers

    1 publications · 21 citations

    1

    h-index

  5. Performance Evaluation

    1 publications · 26 citations

    1

    h-index

1–5