Characterizing the effects of TCP's initial window

Barik, Runa; Divakaran, Dinil Mon; Welzl, Michael

doi:10.1109/infcomw.2017.8116493

2017 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) 2017

DOI: 10.1109/infcomw.2017.8116493

|View full text |Cite

Characterizing the effects of TCP's initial window

Runa Barik

Dinil Mon Divakaran

Michael Welzl

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2020

Publication Types

Select...

Other1

Relationship

Self Cite1

Independent0

Authors

Journals

Cited by 1 publication

(1 citation statement)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Notations They proposed the method to predict the optimal buffer size using pre-defined design parameters. Barik et al[17] used a stochastic model for deciding an optimal choice of the initial window of TCP flows depending on the bottleneck router's buffer size, number of active TCP connections, bottleneck router's link capacity, RTT, and flow size. Chandrayana et al[18] proposed a mechanism to configure RED parameters by analyzing of an M X /M/1/B queuing model.…”

mentioning

confidence: 99%

Performance Evaluation of In-network Packet Retransmissions using Markov Chains

Barik

Welzl

Teymoori

et al. 2020

2020 International Conference on Computing, Networking and Communications (ICNC)

Self Cite

View full text Add to dashboard Cite

We consider the retransmission of packets inside the network on a segment of an end-to-end path. Using a Markov chain formulation of the problem, we evaluate the effect of the loss probability in the network segment that is responsible for retransmission as well as the ratio between the local RTT and the end-to-end timeout. We also obtain the optimal cache size required for retransmission depending on the packet loss and cache blocking probabilities. Our study reveals that the local RTT of the path segment for retransmission as a function of the end-to-end timeout significantly influences the packet caching time. We also observe that a small increment in the packet loss probability above a threshold can severely affect the percentage of cache filling irrespective of the cache size. Use cases to which our findings apply include a recent IETF proposal called "LOOPS", recursive network architectures and proposals that use hopby-hop retransmissions in special network scenarios, e.g. for Information-Centric Networking (ICN).

show abstract

mentioning

confidence: 99%

Performance Evaluation of In-network Packet Retransmissions using Markov Chains

Barik

Welzl

Teymoori

et al. 2020

2020 International Conference on Computing, Networking and Communications (ICNC)

Self Cite

View full text Add to dashboard Cite

show abstract

scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.

Contact Info

customersupport@researchsolutions.com

10624 S. Eastern Ave., Ste. A-614

Henderson, NV 89052, USA

This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.

Blog Terms and Conditions API Terms Privacy Policy Contact Cookie Preferences Do Not Sell or Share My Personal Information

Made with 💙 for researchers

Part of the Research Solutions Family.

Characterizing the effects of TCP's initial window

Cited by 1 publication

References 22 publications

Performance Evaluation of In-network Packet Retransmissions using Markov Chains

Performance Evaluation of In-network Packet Retransmissions using Markov Chains

Contact Info

Product

Resources

About