2020 International Conference on Innovative Trends in Communication and Computer Engineering (ITCE) 2020
DOI: 10.1109/itce48509.2020.9047804
|View full text |Cite
|
Sign up to set email alerts
|

Unfinished work & waiting time of general discrete-time communication systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
1
0

Year Published

2020
2020
2021
2021

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 5 publications
0
1
0
Order By: Relevance
“…The waiting time is defined as the time between arrival point and the beginning of message transmission. Waiting time distribution has been studied in[12] and we have proved that the PGF of the waiting time (including the service time) is given byW(z) = [1 − A (1)S (1)] × [z − 1]S (z)[1 − A(S (z))] [z − A(S (z))][1 − S (z))]A (1) . (26)LettingE[A] = A (1), E[S ] = S (1),and excluding the service time, we can writeW(z) = [1 − E[A]E[S ]] × [z − 1][1 − A(S (z))] [z − A(S (z))][1 − S (z))]E[A].…”
mentioning
confidence: 99%
“…The waiting time is defined as the time between arrival point and the beginning of message transmission. Waiting time distribution has been studied in[12] and we have proved that the PGF of the waiting time (including the service time) is given byW(z) = [1 − A (1)S (1)] × [z − 1]S (z)[1 − A(S (z))] [z − A(S (z))][1 − S (z))]A (1) . (26)LettingE[A] = A (1), E[S ] = S (1),and excluding the service time, we can writeW(z) = [1 − E[A]E[S ]] × [z − 1][1 − A(S (z))] [z − A(S (z))][1 − S (z))]E[A].…”
mentioning
confidence: 99%