2019
DOI: 10.1007/978-3-030-36614-8_3
|View full text |Cite
|
Sign up to set email alerts
|

Adaptive Cyclic Polling Systems: Analysis and Application to the Broadband Wireless Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

1
10
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
3
1
1

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(11 citation statements)
references
References 16 publications
1
10
0
Order By: Relevance
“…where 1 = (1, ..., 1) we get a system of linear equations to calculate the first and second moments of the queue lengths at the polling moments. Similar results for exhaustive service are obtained by Vishnevsky et al [65]. The mean waiting time W i in queue Q i is calculated as…”
Section: Cyclic Adaptive Pollingsupporting
confidence: 69%
See 4 more Smart Citations
“…where 1 = (1, ..., 1) we get a system of linear equations to calculate the first and second moments of the queue lengths at the polling moments. Similar results for exhaustive service are obtained by Vishnevsky et al [65]. The mean waiting time W i in queue Q i is calculated as…”
Section: Cyclic Adaptive Pollingsupporting
confidence: 69%
“…The study of adaptive polling systems is continued by Semenova and Bui [64] and Vishnevsky et al [65] where the queue length distribution at an arbitrary polling moment is obtained by the PGF method.…”
Section: Cyclic Adaptive Pollingmentioning
confidence: 99%
See 3 more Smart Citations