Name
Abstract | ||
|---|---|---|
In this paper, we study the two-dimensional tri-diagonal quasi-birth-and-death (QBD) process with infinite blocks and the blocks are infinite double sides tri-diagonal matrices, which has an important application in queue theory such as joining the shortest queue problem. Our objective is to develop an accurate and easily implementable algorithmic approach to compute the stationary probabilities of the process. We also give the computational complexity for the algorithm and some numerical examples. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1007/978-3-642-11842-5_50 | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
Keywords | Field | DocType |
queue theory,implementable algorithmic approach,important application,double-sides qbd process,infinite block,numerical example,infinite double side,bri algorithm,computational complexity,tri-diagonal matrix,shortest queue problem,two-dimensional tri-diagonal quasi-birth-and-death,bri,queueing theory | Bulk queue,Matrix (mathematics),Computer science,Queue,Parallel computing,Algorithm,Queueing theory,Computational complexity theory | Conference |
Volume | Issue | ISSN |
5938 LNCS | null | 16113349 |
ISBN | Citations | PageRank |
3-642-11841-0 | 1 | 0.39 |
References | Authors | |
3 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Dinghua Shi | 1 | 10 | 2.82 |
| Hongbo Zhang | 2 | 14 | 5.68 |