A new TCP for persistent packet reordering
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Bohacek, S | - |
dc.contributor.author | Hespanha, JP | - |
dc.contributor.author | Lee, J | - |
dc.contributor.author | Lim, C | - |
dc.contributor.author | Obraczka, K | - |
dc.date.available | 2021-02-22T15:31:01Z | - |
dc.date.issued | 2006-04 | - |
dc.identifier.issn | 1063-6692 | - |
dc.identifier.issn | 1558-2566 | - |
dc.identifier.uri | https://scholarworks.sookmyung.ac.kr/handle/2020.sw.sookmyung/15158 | - |
dc.description.abstract | Most standard implementations of TCP perform poorly when packets are reordered. In this paper, we propose a new version of TCP that maintains high throughput when reordering occurs and yet, when packet reordering does not occur, is friendly to other versions of TCP. The proposed TCP variant, or TCP-PR, does not rely on duplicate acknowledgments to detect a packet loss. Instead, timers are maintained to keep track of how long ago a packet was transmitted. In case the corresponding acknowledgment has not yet arrived and the elapsed time since the packet was sent is larger than a given threshold, the packet is assumed lost. Because TCP-PR does not rely on duplicate acknowledgments, packet reordering (including out-or-order acknowledgments) has no effect on TCP-PR's performance. Through extensive simulations, we show that TCP-PR performs consistently better than existing mechanisms that try to make TCP more robust to packet reordering. In the case that packets are not reordered, we verify that TCP-PR maintains the same throughput as typical implementations of TCP (specifically, TCP-SACK) and shares network resources fairly. Furthermore, TCP-PR only requires changes to the TCP sender side making it easier to deploy. | - |
dc.format.extent | 14 | - |
dc.language | 영어 | - |
dc.language.iso | ENG | - |
dc.publisher | IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC | - |
dc.title | A new TCP for persistent packet reordering | - |
dc.type | Article | - |
dc.publisher.location | 미국 | - |
dc.identifier.doi | 10.1109/TNET.2006.873366 | - |
dc.identifier.scopusid | 2-s2.0-33645984553 | - |
dc.identifier.wosid | 000237033500011 | - |
dc.identifier.bibliographicCitation | IEEE-ACM TRANSACTIONS ON NETWORKING, v.14, no.2, pp 369 - 382 | - |
dc.citation.title | IEEE-ACM TRANSACTIONS ON NETWORKING | - |
dc.citation.volume | 14 | - |
dc.citation.number | 2 | - |
dc.citation.startPage | 369 | - |
dc.citation.endPage | 382 | - |
dc.type.docType | Article | - |
dc.description.isOpenAccess | N | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalResearchArea | Engineering | - |
dc.relation.journalResearchArea | Telecommunications | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Hardware & Architecture | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Theory & Methods | - |
dc.relation.journalWebOfScienceCategory | Engineering, Electrical & Electronic | - |
dc.relation.journalWebOfScienceCategory | Telecommunications | - |
dc.subject.keywordAuthor | congestion control | - |
dc.subject.keywordAuthor | packet reordering | - |
dc.subject.keywordAuthor | transport protocols | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
Sookmyung Women's University. Cheongpa-ro 47-gil 100 (Cheongpa-dong 2ga), Yongsan-gu, Seoul, 04310, Korea02-710-9127
Copyright©Sookmyung Women's University. All Rights Reserved.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.