2019 International Conference on Communication Technologies (ComTech) 2019
DOI: 10.1109/comtech.2019.8737826
|View full text |Cite
|
Sign up to set email alerts
|

Traffic Intensity Based Efficient Packet Schedualing

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
3
1
1

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(2 citation statements)
references
References 11 publications
0
2
0
Order By: Relevance
“…The delay(d) and jitter(j) calculations are performed as per the following system of Eqs. ( 7)- (11) [33] where i and j represent the packet sequence number and pc is the packet count. The delay d the time difference between packets is calculated using the timestamp values.…”
Section: Comparisonmentioning
confidence: 99%
“…The delay(d) and jitter(j) calculations are performed as per the following system of Eqs. ( 7)- (11) [33] where i and j represent the packet sequence number and pc is the packet count. The delay d the time difference between packets is calculated using the timestamp values.…”
Section: Comparisonmentioning
confidence: 99%
“…To prevent the aforementioned situation, a backpressure mechanism is introduced to the front end of the stream processor. In the cluster monitoring center for railway scheduling, the arrival of data shows certain time regularity [31,32]. From 06:00-24:00, high-speed and normal-speed railways are all busy, with large data sets generated.…”
Section: Plos Onementioning
confidence: 99%