{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,15]],"date-time":"2023-11-15T10:10:27Z","timestamp":1700043027429},"reference-count":17,"publisher":"Wiley","issue":"3","license":[{"start":{"date-parts":[[2006,6,12]],"date-time":"2006-06-12T00:00:00Z","timestamp":1150070400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int J Network Mgmt"],"published-print":{"date-parts":[[2007,5]]},"abstract":"Abstract<\/jats:title>This study presents the design and implementation of a robust TCP congestion control algorithm. TCP was originally designed for cooperative environments, and its evolution over the years has been built on the same basis. TCP expects the end hosts to cooperate with the TCP senders in implementing end\u2010to\u2010end congestion control. Therefore, misbehavior of a TCP receiver may result in an unfair division of the available bandwidth between the conforming flows and the irresponsible flows. Accordingly, this study examines the issues arising when conforming TCP connections are obliged to coexist with misbehaving connections. A modification to the TCP protocol is proposed to deal with various types of TCP misbehavior. Copyright \u00a9 2006 John Wiley & Sons, Ltd.<\/jats:p>","DOI":"10.1002\/nem.618","type":"journal-article","created":{"date-parts":[[2006,6,12]],"date-time":"2006-06-12T11:05:23Z","timestamp":1150110323000},"page":"209-218","source":"Crossref","is-referenced-by-count":2,"title":["Protecting TCP from a misbehaving receiver"],"prefix":"10.1002","volume":"17","author":[{"given":"Rung\u2010Shiang","family":"Cheng","sequence":"first","affiliation":[]},{"given":"Hui\u2010Tang","family":"Lin","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2006,6,12]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"crossref","unstructured":"JacobsonV KarelsM.Congestion avoidance and control. InProceedings of ACM SIGCOMM'96 1988;314\u2013329.","DOI":"10.1145\/52325.52356"},{"key":"e_1_2_1_3_2","doi-asserted-by":"crossref","unstructured":"StevensW.TCP slow start congestion avoidance fast retransmit and fast recovery algorithm.RFC 2001 1997.","DOI":"10.17487\/rfc2001"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1145\/505696.505704"},{"key":"e_1_2_1_5_2","unstructured":"AryaV TurlettiT.Dealing with receiver misbehavior in multicast congestion control.INRIA Research Report 2003; no. 4899."},{"key":"e_1_2_1_6_2","unstructured":"KohlerE HandleyM Floyd S.DatagramCongestion Control Protocol (DCCP). Available athttp:\/\/www.icir.org\/kohler\/dcp[30 April 2006]."},{"key":"e_1_2_1_7_2","doi-asserted-by":"crossref","unstructured":"PaxsonV AllmanM StevensW.TCP congestion control.RFC 2581 1999.","DOI":"10.17487\/rfc2581"},{"key":"e_1_2_1_8_2","doi-asserted-by":"publisher","DOI":"10.1145\/205511.205512"},{"key":"e_1_2_1_9_2","doi-asserted-by":"crossref","unstructured":"RamakrishnanKK FloydS.A protocol to add explicit congestion notification (ECN) to IP.RFC 2481 1999.","DOI":"10.17487\/rfc2481"},{"key":"e_1_2_1_10_2","doi-asserted-by":"crossref","unstructured":"MathisM MahdaviJ FloydS RomanowA.TCP selective acknowledgment options.RFC 2018 1996.","DOI":"10.17487\/rfc2018"},{"key":"e_1_2_1_11_2","doi-asserted-by":"publisher","DOI":"10.1145\/303297.303301"},{"key":"e_1_2_1_12_2","doi-asserted-by":"publisher","DOI":"10.1145\/505724.505727"},{"key":"e_1_2_1_13_2","doi-asserted-by":"crossref","unstructured":"LudwigR MeyerM.The Eifel detection algorithm for TCP.RFC 3522 2003.","DOI":"10.17487\/rfc3522"},{"key":"e_1_2_1_14_2","doi-asserted-by":"publisher","DOI":"10.1145\/505688.505692"},{"key":"e_1_2_1_15_2","doi-asserted-by":"crossref","unstructured":"JacobsonV BradenR BormanD.TCP extensions for high performance.RFC 1323 1992.","DOI":"10.17487\/rfc1323"},{"key":"e_1_2_1_16_2","doi-asserted-by":"crossref","unstructured":"RamakrishnanK FloydS BlackD.The addition of explicit congestion notification (ECN) to IP.RFC 3168 2001.","DOI":"10.17487\/rfc3168"},{"key":"e_1_2_1_17_2","unstructured":"FallK Floyd S.NetworkSimulator. Available athttp:\/\/www.isi.edu\/nsnam\/ns"},{"key":"e_1_2_1_18_2","doi-asserted-by":"crossref","unstructured":"FieldingR GettysJ MogulJ FrystykH MasinterL LeachP Berners\u2010Lee T.HypertextTransfer Protocol\u2014HTTP1.1.RFC 2616 1999.","DOI":"10.17487\/rfc2616"}],"container-title":["International Journal of Network Management"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnem.618","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/nem.618","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,15]],"date-time":"2023-11-15T09:52:55Z","timestamp":1700041975000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/nem.618"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,6,12]]},"references-count":17,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2007,5]]}},"alternative-id":["10.1002\/nem.618"],"URL":"https:\/\/doi.org\/10.1002\/nem.618","archive":["Portico"],"relation":{},"ISSN":["1055-7148","1099-1190"],"issn-type":[{"value":"1055-7148","type":"print"},{"value":"1099-1190","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,6,12]]}}}