Sweep-Line Analysis of TCP Connection Management
Despite the widespread use of the Transmission Control Protocol (TCP) as the main transport protocol in the Internet, the procedures for connection establishment and release are still not fully understood. This paper extends the analysis of a Coloured Petri net model of TCP’s Connection Management p...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Tagungsbericht |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 172 |
|---|---|
| container_issue | |
| container_start_page | 156 |
| container_title | |
| container_volume | |
| creator | Gallasch, Guy Edward Han, Bing Billington, Jonathan |
| description | Despite the widespread use of the Transmission Control Protocol (TCP) as the main transport protocol in the Internet, the procedures for connection establishment and release are still not fully understood. This paper extends the analysis of a Coloured Petri net model of TCP’s Connection Management procedures by applying the state explosion alleviation technique known as the sweep-line method. The protocol is assumed to be operating over a reordering lossless channel. Termination and absence of deadlock properties are investigated for many scenarios, including client-server and simultaneous connection establishment, orderly release and abortion. The sweep-line method provides a reduction in memory usage of around a factor of 10 and allows investigation of many scenarios that were previously out of the reach of conventional methods. |
| doi_str_mv | 10.1007/11576280_12 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>pascalfrancis_sprin</sourceid><recordid>TN_cdi_pascalfrancis_primary_17415763</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>17415763</sourcerecordid><originalsourceid>FETCH-LOGICAL-p219t-1fdd538c45efbb120fd741121807bce7ab02b9523fcf1f720503813cfab398143</originalsourceid><addsrcrecordid>eNpNkE1LAzEUReMXONSu_AOzceFi9L28pJksy2BVqChY10OSJmW0zQyTgvTfG6iId3MX93AXh7FrhDsEUPeIUs14DS3yEzbVqiYpgDiXIE5ZgTPEikjos7-Na6UVnLMCCHillaBLNk3pE3IIlQJRMHj_9n6oll305Tya7SF1qexDuWreyqaP0bt918fyxUSz8Tsf91fsIpht8tPfnrCPxcOqeaqWr4_PzXxZDRz1vsKwXkuqnZA-WIscwloJRI41KOu8Mha41ZJTcAGD4iCBaiQXjCVdo6AJuzn-DiY5sw2jia5L7TB2OzMeWsxvWQdl7vbIpTzFjR9b2_dfqcXsKVtr_1mjH_bTVvo</addsrcrecordid><sourcetype>Index Database</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Sweep-Line Analysis of TCP Connection Management</title><source>Springer Books</source><creator>Gallasch, Guy Edward ; Han, Bing ; Billington, Jonathan</creator><contributor>Banach, Richard ; Lau, Kung-Kiu</contributor><creatorcontrib>Gallasch, Guy Edward ; Han, Bing ; Billington, Jonathan ; Banach, Richard ; Lau, Kung-Kiu</creatorcontrib><description>Despite the widespread use of the Transmission Control Protocol (TCP) as the main transport protocol in the Internet, the procedures for connection establishment and release are still not fully understood. This paper extends the analysis of a Coloured Petri net model of TCP’s Connection Management procedures by applying the state explosion alleviation technique known as the sweep-line method. The protocol is assumed to be operating over a reordering lossless channel. Termination and absence of deadlock properties are investigated for many scenarios, including client-server and simultaneous connection establishment, orderly release and abortion. The sweep-line method provides a reduction in memory usage of around a factor of 10 and allows investigation of many scenarios that were previously out of the reach of conventional methods.</description><identifier>ISSN: 0302-9743</identifier><identifier>ISBN: 9783540297970</identifier><identifier>ISBN: 3540297979</identifier><identifier>EISSN: 1611-3349</identifier><identifier>EISBN: 9783540322504</identifier><identifier>EISBN: 3540322507</identifier><identifier>DOI: 10.1007/11576280_12</identifier><language>eng</language><publisher>Berlin, Heidelberg: Springer Berlin Heidelberg</publisher><subject>Applied sciences ; Coloured Petri Nets ; Computer science; control theory; systems ; Computer systems and distributed systems. User interface ; Exact sciences and technology ; Reachability analysis ; Software ; Software engineering ; State Space methods ; Sweep-line analysis ; TCP Connection Management ; Verification</subject><ispartof>Formal Methods and Software Engineering, 2005, p.156-172</ispartof><rights>Springer-Verlag Berlin Heidelberg 2005</rights><rights>2006 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/11576280_12$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/11576280_12$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>309,310,775,776,780,785,786,789,4036,4037,27902,38232,41418,42487</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=17415763$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><contributor>Banach, Richard</contributor><contributor>Lau, Kung-Kiu</contributor><creatorcontrib>Gallasch, Guy Edward</creatorcontrib><creatorcontrib>Han, Bing</creatorcontrib><creatorcontrib>Billington, Jonathan</creatorcontrib><title>Sweep-Line Analysis of TCP Connection Management</title><title>Formal Methods and Software Engineering</title><description>Despite the widespread use of the Transmission Control Protocol (TCP) as the main transport protocol in the Internet, the procedures for connection establishment and release are still not fully understood. This paper extends the analysis of a Coloured Petri net model of TCP’s Connection Management procedures by applying the state explosion alleviation technique known as the sweep-line method. The protocol is assumed to be operating over a reordering lossless channel. Termination and absence of deadlock properties are investigated for many scenarios, including client-server and simultaneous connection establishment, orderly release and abortion. The sweep-line method provides a reduction in memory usage of around a factor of 10 and allows investigation of many scenarios that were previously out of the reach of conventional methods.</description><subject>Applied sciences</subject><subject>Coloured Petri Nets</subject><subject>Computer science; control theory; systems</subject><subject>Computer systems and distributed systems. User interface</subject><subject>Exact sciences and technology</subject><subject>Reachability analysis</subject><subject>Software</subject><subject>Software engineering</subject><subject>State Space methods</subject><subject>Sweep-line analysis</subject><subject>TCP Connection Management</subject><subject>Verification</subject><issn>0302-9743</issn><issn>1611-3349</issn><isbn>9783540297970</isbn><isbn>3540297979</isbn><isbn>9783540322504</isbn><isbn>3540322507</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2005</creationdate><recordtype>conference_proceeding</recordtype><recordid>eNpNkE1LAzEUReMXONSu_AOzceFi9L28pJksy2BVqChY10OSJmW0zQyTgvTfG6iId3MX93AXh7FrhDsEUPeIUs14DS3yEzbVqiYpgDiXIE5ZgTPEikjos7-Na6UVnLMCCHillaBLNk3pE3IIlQJRMHj_9n6oll305Tya7SF1qexDuWreyqaP0bt918fyxUSz8Tsf91fsIpht8tPfnrCPxcOqeaqWr4_PzXxZDRz1vsKwXkuqnZA-WIscwloJRI41KOu8Mha41ZJTcAGD4iCBaiQXjCVdo6AJuzn-DiY5sw2jia5L7TB2OzMeWsxvWQdl7vbIpTzFjR9b2_dfqcXsKVtr_1mjH_bTVvo</recordid><startdate>2005</startdate><enddate>2005</enddate><creator>Gallasch, Guy Edward</creator><creator>Han, Bing</creator><creator>Billington, Jonathan</creator><general>Springer Berlin Heidelberg</general><general>Springer</general><scope>IQODW</scope></search><sort><creationdate>2005</creationdate><title>Sweep-Line Analysis of TCP Connection Management</title><author>Gallasch, Guy Edward ; Han, Bing ; Billington, Jonathan</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-p219t-1fdd538c45efbb120fd741121807bce7ab02b9523fcf1f720503813cfab398143</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2005</creationdate><topic>Applied sciences</topic><topic>Coloured Petri Nets</topic><topic>Computer science; control theory; systems</topic><topic>Computer systems and distributed systems. User interface</topic><topic>Exact sciences and technology</topic><topic>Reachability analysis</topic><topic>Software</topic><topic>Software engineering</topic><topic>State Space methods</topic><topic>Sweep-line analysis</topic><topic>TCP Connection Management</topic><topic>Verification</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Gallasch, Guy Edward</creatorcontrib><creatorcontrib>Han, Bing</creatorcontrib><creatorcontrib>Billington, Jonathan</creatorcontrib><collection>Pascal-Francis</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Gallasch, Guy Edward</au><au>Han, Bing</au><au>Billington, Jonathan</au><au>Banach, Richard</au><au>Lau, Kung-Kiu</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Sweep-Line Analysis of TCP Connection Management</atitle><btitle>Formal Methods and Software Engineering</btitle><date>2005</date><risdate>2005</risdate><spage>156</spage><epage>172</epage><pages>156-172</pages><issn>0302-9743</issn><eissn>1611-3349</eissn><isbn>9783540297970</isbn><isbn>3540297979</isbn><eisbn>9783540322504</eisbn><eisbn>3540322507</eisbn><abstract>Despite the widespread use of the Transmission Control Protocol (TCP) as the main transport protocol in the Internet, the procedures for connection establishment and release are still not fully understood. This paper extends the analysis of a Coloured Petri net model of TCP’s Connection Management procedures by applying the state explosion alleviation technique known as the sweep-line method. The protocol is assumed to be operating over a reordering lossless channel. Termination and absence of deadlock properties are investigated for many scenarios, including client-server and simultaneous connection establishment, orderly release and abortion. The sweep-line method provides a reduction in memory usage of around a factor of 10 and allows investigation of many scenarios that were previously out of the reach of conventional methods.</abstract><cop>Berlin, Heidelberg</cop><pub>Springer Berlin Heidelberg</pub><doi>10.1007/11576280_12</doi><tpages>17</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0302-9743 |
| ispartof | Formal Methods and Software Engineering, 2005, p.156-172 |
| issn | 0302-9743 1611-3349 |
| language | eng |
| recordid | cdi_pascalfrancis_primary_17415763 |
| source | Springer Books |
| subjects | Applied sciences Coloured Petri Nets Computer science control theory systems Computer systems and distributed systems. User interface Exact sciences and technology Reachability analysis Software Software engineering State Space methods Sweep-line analysis TCP Connection Management Verification |
| title | Sweep-Line Analysis of TCP Connection Management |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-10T03%3A47%3A21IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-pascalfrancis_sprin&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Sweep-Line%20Analysis%20of%20TCP%20Connection%20Management&rft.btitle=Formal%20Methods%20and%20Software%20Engineering&rft.au=Gallasch,%20Guy%20Edward&rft.date=2005&rft.spage=156&rft.epage=172&rft.pages=156-172&rft.issn=0302-9743&rft.eissn=1611-3349&rft.isbn=9783540297970&rft.isbn_list=3540297979&rft_id=info:doi/10.1007/11576280_12&rft_dat=%3Cpascalfrancis_sprin%3E17415763%3C/pascalfrancis_sprin%3E%3Curl%3E%3C/url%3E&rft.eisbn=9783540322504&rft.eisbn_list=3540322507&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |