The DOI matches its Crossref record; 25 of the 25 references it cites were found in a registry or an index.
Concurrent Multipath Transfer Using SCTP Multihoming Over Independent End-to-End Paths
Abstract
Concurrent multipath transfer (CMT) uses the Stream Control Transmission Protocol's (SCTP) multihoming feature to distribute data across multiple end-to-end paths in a multihomed SCTP association. We identify three negative side-effects of reordering introduced by CMT that must be managed before efficient parallel transfer can be achieved: (1) unnecessary fast retransmissions by a sender; (2) overly conservative congestion window (cwnd) growth at a sender; and (3) increased ack traffic due to fewer delayed acks by a receiver. We propose three algorithms which augment and/or modify current SCTP to counter these side-effects. Presented with several choices as to where a sender should direct retransmissions of lost data, we propose five retransmission policies for CMT. We demonstrate spurious retransmissions in CMT with all five policies and propose changes to CMT to allow the different policies. CMT is evaluated against AppStripe, which is an idealized application that stripes data over multiple paths using multiple SCTP associations. The different CMT retransmission policies are then evaluated with varied constrained receive buffer sizes. In this foundation work, we operate under the strong assumption that the bottleneck queues on the end-to-end paths used in CMT are independent
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Allman, M., Paxson, V., & Blanton, E. (2009) · doi:10.17487/rfc5681 · Cited by 2,523
Stream Control Transmission Protocol
Stewart, R., Tüxen, M., & Nielsen, K. (2022) · doi:10.17487/rfc9260 · Cited by 1,922
Self-citationAndersen, D., Balakrishnan, H., Kaashoek, F., & Morris, R. (2001) · Proceedings of the eighteenth ACM symposium on Operating systems principles · doi:10.1145/502034.502048 · Cited by 1,868
Packet reordering is not pathological network behavior
Bennett, J. C. R., Partridge, C., & Shectman, N. (1999) · IEEE/ACM Transactions on Networking · doi:10.1109/90.811445 · Cited by 402
The Eifel algorithm: making TCP robust against spurious retransmissions
Ludwig, R., & Katz, R. H. (2000) · ACM SIGCOMM Computer Communication Review · doi:10.1145/505688.505692 · Cited by 393
An Extension to the Selective Acknowledgement (SACK) Option for TCP
Floyd, S., Mahdavi, J., Mathis, M., & Podolsky, M. (2000) · doi:10.17487/rfc2883 · Cited by 370
Andersen, D., Balakrishnan, H., Kaashoek, F., & Morris, R. (2001) · ACM SIGOPS Operating Systems Review · doi:10.1145/502059.502048 · Cited by 271
On making TCP more robust to packet reordering
Blanton, E., & Allman, M. (2002) · ACM SIGCOMM Computer Communication Review · doi:10.1145/510726.510728 · Cited by 257
Sivakumar, H., Bailey, S. N., & Grossman, R. L. (2000) · Conference on High Performance Computing (Supercomputing) · doi:10.5555/370049.370413 · Cited by 237
The end-to-end performance effects of parallel TCP sockets on a lossy wide-area network
Hacker, T. J., Athey, B. D., & Noble, B. (2002) · Proceedings 16th International Parallel and Distributed Processing Symposium · doi:10.1109/ipdps.2002.1015527 · Cited by 235
Designing DCCP: congestion control without reliability
Kohler, E., Handley, M., & Floyd, S. (2006) · ACM SIGCOMM Computer Communication Review · doi:10.1145/1151659.1159918 · Cited by 223
A transport layer approach for achieving aggregate bandwidths on multi-homed mobile hosts
Hsieh, H.-Y., & Sivakumar, R. (2002) · Proceedings of the 8th annual international conference on Mobile computing and networking · doi:10.1145/570645.570656 · Cited by 207
RR-TCP: a reordering-robust TCP with DSACK
Zhang, M., Karp, B., Floyd, S., & Peterson, L. (2004) · 11th IEEE International Conference on Network Protocols, 2003. Proceedings. · doi:10.1109/icnp.2003.1249760 · Cited by 192
In search of path diversity in ISP networks
Teixeira, R., Marzullo, K., Savage, S., & Voelker, G. M. (2003) · ACM Internet Measurement Conference (IMC) · doi:10.1145/948205.948247 · Cited by 156
A Conservative Selective Acknowledgment (SACK)-based Loss Recovery Algorithm for TCP
Blanton, E., Allman, M. C., Fall, K., & Wang, L. (2003) · doi:10.17487/rfc3517 · Cited by 151
LS-SCTP: a bandwidth aggregation technique for stream control transmission protocol
Al, A. A. E., Saadawi, T., & Lee, M. J. (2004) · Computer Communications · doi:10.1016/j.comcom.2004.01.021 · Cited by 133
Sivakumar, H., Bailey, S., & Grossman, R. L. (2000) · Proceedings - Supercomputing · doi:10.1109/sc.2000.10040 · Cited by 131
Concurrent Multipath Transfer Using SCTP Multihoming
Iyengar, J. R. (2012) · CRC Press eBooks · doi:10.1201/b13087-7 · Cited by 101
Self-citationRetransmission policies for concurrent multipath transfer using SCTP multihoming
Iyengar, J. R., Amer, P. D., & Stewart, R. (2005) · The ... IEEE International Conference on Networks/The IEEE International Conference on Networks · doi:10.1109/icon.2004.1409269 · Cited by 76
Self-citationReceive buffer blocking in concurrent multipath transfer
Iyengar, J. R., Amer, P. D., & Stewart, R. (2005) · Globecom · doi:10.1109/glocom.2005.1577365 · Cited by 66
Self-citationTCP-PR: TCP for persistent packet reording
Bohacek, S. K., Hespanha, J. P., Lee, J., Lim, C., & Obraczka, K. (2004) · Proceedings of the ... International Conference on Distributed Computing Systems/Proceedings of the International Conference on Distributed Computing Systems · doi:10.1109/icdcs.2003.1203469 · Cited by 64
A wavelet-based approach to detect shared congestion
Kim, M., Kim, T., Shin, Y., Lam, S. S., & Powers, E. J. (2004) · ACM SIGCOMM Conference (SIGCOMM) · doi:10.1145/1015467.1015500 · Cited by 49
Retransmission policies for multihomed transport protocols
Caro, A. L., Amer, P. D., & Stewart, R. (2005) · Computer Communications · doi:10.1016/j.comcom.2005.10.017 · Cited by 30
Self-citationOn making SCTP robust to spurious retransmissions
Ladha, S., Baucke, S., Ludwig, R., & Amer, P. D. (2004) · ACM SIGCOMM Computer Communication Review · doi:10.1145/997150.997161 · Cited by 28
Self-citationThe impact of false sharing on shared congestion management
Akella, A., Seshan, S., & Balakrishnan, H. (2004) · IEEE International Conference on Network Protocols (ICNP) · doi:10.1109/icnp.2003.1249759 · Cited by 24
Cited by
The QUIC Transport Protocol: Design and Internet-Scale Deployment
Langley, A., Riddoch, A., Wilk, A., Vicente, A., Krasic, C., Zhang, D., Yang, F., Kouranov, F., Swett, I., Iyengar, J., et al. (2017) · Proceedings of the Conference of the ACM Special Interest Group on Data Communication · doi:10.1145/3098822.3098842 · Cited by 823
Self-citationDesign, implementation and evaluation of congestion control for multipath TCP
Wischik, D., Raiciu, C., Greenhalgh, A., & Handley, M. J. (2011) · doi:10.5555/1972457.1972468 · Cited by 586
Multipath TCP: Analysis, Design, and Implementation
Peng, Q., Walid, A., Hwang, J., & Low, S. H. (2016) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2014.2379698 · Cited by 293
Metadata
- Authors
- Iyengar, J. R., Amer, P. D., & Stewart, R.
- Venue
- IEEE/ACM Transactions on Networking
- Published
- 2006-10
- Volume
- 14
- Issue
- 5
- Pages
- 951-964
- ISSN
- 1063-6692 (ISSN-L)
- OpenAlex
- W2161624011
- Cited by
- 652
- References
- 25
- FWCI
- 32.47
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.