2005
DOI: 10.1007/11499169_20
|View full text |Cite
|
Sign up to set email alerts
|

Preemptive Packet-Mode Scheduling to Improve TCP Performance

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

1
2
0

Year Published

2007
2007
2008
2008

Publication Types

Select...
1
1

Relationship

1
1

Authors

Journals

citations
Cited by 2 publications
(3 citation statements)
references
References 18 publications
1
2
0
Order By: Relevance
“…According to Little's law, latency is T = L/ , where L is the average queue length of the system. From (22) and (23), we can get the overall latency for both FLS and VLS, which is illustrated in Table III. The results indicate that the overall latency for VLS is significantly smaller than that for FLS.…”
Section: Spn Model For Variable Length Switchingsupporting
confidence: 71%
See 2 more Smart Citations
“…According to Little's law, latency is T = L/ , where L is the average queue length of the system. From (22) and (23), we can get the overall latency for both FLS and VLS, which is illustrated in Table III. The results indicate that the overall latency for VLS is significantly smaller than that for FLS.…”
Section: Spn Model For Variable Length Switchingsupporting
confidence: 71%
“…When the proportion of short packets increases, short packets may experience smaller latency than that of FLS. This problem of VLS has been overcome by short packet first (SPF) [21] and preemptive short packet first (P-SPF) [22] proposed in our pre-works. The main idea of SPF algorithm is to buffer short packets in different VOQs, and then always schedule these short packets first.…”
Section: Packet Latencymentioning
confidence: 99%
See 1 more Smart Citation