1988
DOI: 10.1016/0166-5316(88)90030-2
|View full text |Cite
|
Sign up to set email alerts
|

On some queueing models of time division multiple access communication system

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

1990
1990
1993
1993

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 17 publications
0
1
0
Order By: Relevance
“…In the basic and most common TDMA scheme every user has exactly one slot assigned in every frame in which a single packet can be transmitted, result- ing in a system that operates in a round robin mode. Queueing models of this scheme with various variations have been introduced and analyzed in numerous papers [1][2][3][4][5][6][7][8][9][10][11][12][13]. The basic scheme operates reasonably well if the set of users is relatively homogeneous with respect to the traffic they generate.…”
Section: Introductionmentioning
confidence: 99%
“…In the basic and most common TDMA scheme every user has exactly one slot assigned in every frame in which a single packet can be transmitted, result- ing in a system that operates in a round robin mode. Queueing models of this scheme with various variations have been introduced and analyzed in numerous papers [1][2][3][4][5][6][7][8][9][10][11][12][13]. The basic scheme operates reasonably well if the set of users is relatively homogeneous with respect to the traffic they generate.…”
Section: Introductionmentioning
confidence: 99%