{"id":209,"date":"2008-06-01T01:04:51","date_gmt":"2008-05-31T22:04:51","guid":{"rendered":"https:\/\/www.cs.ubbcluj.ro\/~bufny\/?p=209"},"modified":"2022-01-10T00:39:10","modified_gmt":"2022-01-09T22:39:10","slug":"a-new-method-for-macroflows-delimitation-from-a-receivers-perspective","status":"publish","type":"post","link":"https:\/\/www.cs.ubbcluj.ro\/~bufny\/a-new-method-for-macroflows-delimitation-from-a-receivers-perspective\/","title":{"rendered":"A New Method for Macroflows Delimitation from a Receiver&#8217;s Perspective"},"content":{"rendered":"<p>published in the International Journal of Computer, Communication &amp; Control &#8211; proceedings of the IEEE 2<sup>nd<\/sup> International Conference on Computers, Communications &amp; Control (ICCCC 2008), Felix Spa, Romania, Vol. III (2008), ISSN 1841-9836, pp. 201-205.<\/p>\n<p>Indexed in: Thomson Reuters ISI proceedings, Scopus<\/p>\n<p><strong>Cite as<\/strong><\/p>\n<pre class=\"nums:false wrap:on highlight:false\">D. Bufnea, \"A New Method for Macroflows Delimitation from a Receiver's Perspective\", in the International Journal of Computer, Communication & Control \u2013 proceedings of the IEEE 2nd International Conference on Computers, Communications & Control (ICCCC 2008), Felix Spa, Romania, Vol. III (2008), ISSN 1841-9836, pp. 201-205<\/pre>\n<p><strong>Full paper<\/strong><\/p>\n<p><img decoding=\"async\" style=\"border: none; vertical-align: text-bottom;\" src=\"https:\/\/www.cs.ubbcluj.ro\/~bufny\/wp-content\/uploads\/pdf.png\" alt=\"\" \/> <a href=\"https:\/\/www.cs.ubbcluj.ro\/~bufny\/wp-content\/uploads\/2008\/06\/ICCCC_Bufnea.pdf\" target=\"_blank\" rel=\"noopener\">A New Method for Macroflows Delimitation from a Receiver&#8217;s Perspective<\/a><\/p>\n<p><strong>Authors<\/strong><\/p>\n<p>Darius Bufnea<br \/>\nDepartment of Computer Science, Faculty of Mathematics and Computer Science,<br \/>\nBabe\u015f-Bolyai University of Cluj-Napoca<\/p>\n<p><strong>Abstract<\/strong><\/p>\n<p>This paper presents a new approach for shared bottlenecks detection from a receiver&#8217;s perspective. This approach uses flow clustering at the receiver, based on passive observations of inter-packet arrival time intervals. We also suggest a new cost function useful in the flows clusterization process into macroflows. The proposed method can be used in the discovery of path patterns or for extending the macroflow granularity in an improved Congestion Manager.<\/p>\n<p><strong>Key words<\/strong><\/p>\n<p>congestion control, bottleneck, congestion manager, macroflow<\/p>\n<p><strong>BibTeX bib file<\/strong><\/p>\n<p><img decoding=\"async\" style=\"border: none; vertical-align: text-bottom;\" src=\"https:\/\/www.cs.ubbcluj.ro\/~bufny\/wp-content\/uploads\/bib.png\" alt=\"\" \/> <a href=\"https:\/\/www.cs.ubbcluj.ro\/~bufny\/wp-content\/uploads\/bufnea-2008.bib\" target=\"_blank\" rel=\"noopener\">bufnea-2008.bib<\/a><\/p>\n<pre class=\"lang:tex url:wp-content\/uploads\/bufnea-2008.bib nums:false\"><\/pre>\n<p><strong>EndNote enw file<\/strong><\/p>\n<p><img decoding=\"async\" style=\"border: none; vertical-align: text-bottom;\" src=\"https:\/\/www.cs.ubbcluj.ro\/~bufny\/wp-content\/uploads\/enw.png\" alt=\"\" \/> <a href=\"https:\/\/www.cs.ubbcluj.ro\/~bufny\/wp-content\/uploads\/bufnea-2008.enw\" target=\"_blank\" rel=\"noopener\">bufnea-2008.enw<\/a><\/p>\n<p><strong>References<\/strong><\/p>\n<ul>\n<li>S. Floyd, V. Jacobson, <em>Random Early Detection Gateways for Congestion Avoidance<\/em>, IEEE\/ACM Transactions on Networking, 1(4), pp. 379-413, 1993.<\/li>\n<li>W. Stevens, <em>TCP Slow Start, Congestion Avoidance, Fast Retransmit, and Fast Recovery<\/em>, IETF RFC 2001, January 1997.<\/li>\n<li>M. Allman, V. Paxson, W. Stevens, <em>TCP Congestion Control<\/em>, IETF RFC 2581, April 1999.<\/li>\n<li>H. Balakrishnan, S. Seshan, <em>The Congestion Manager<\/em>, IETF RFC 3124, June 2001.<\/li>\n<li>V. Paxson, <em>Measurements and Analysis of End-to-end Internet Dynamics<\/em>, Thesis Dissertation, 1997.<\/li>\n<li>A. Downey, <em>Using Pathchar to Estimate Link Characteristics<\/em>, Computer Communication Review, a publication of ACM SIGCOMM, volume 29, number 4, October 1999.<\/li>\n<li>D. V. Bufnea, A. Campan, A. S. Darabant, <a href=\"https:\/\/www.cs.ubbcluj.ro\/~bufny\/fine-grained-macroflow-granularity-in-congestion-control-management\/\"><em>Fine-Grained Macroflow Granularity in Congestion Control Management<\/em><\/a>, in Studia Universitatis, Vol. L(1), pp. 79-88, 2005.<\/li>\n<li>A. Campan, D. V. Bufnea, <a href=\"https:\/\/www.cs.ubbcluj.ro\/~bufny\/delimitation-of-macroflows-in-congestion-control-management-using-data-mining-techniques\/\" rel=\"noopener\"><em>Delimitation of Macroflows in Congestion Control Management Using Data Mining Techniques<\/em><\/a>, 4<sup>th<\/sup> ROEDUNET International Conference, Education\/Training and Information\/Communication Technologies &#8211; ROEDUNET &#8217;05, Romania, pp. 225-234, 2005.<\/li>\n<li>D. Katabi, I. Bazzi, X. Yang, <em>An Information Theoretic Approach for Shared Bottleneck Inference Based on End-to-end Measurements<\/em>, Laboratory for Computer Science, MIT, 2001.<\/li>\n<li>M. Devera, <em>Hierarchical Token Bucket Theory<\/em>, <a href=\"http:\/\/luxik.cdi.cz\/~devik\/qos\/htb\/manual\/theory.htm\" target=\"_blank\" rel=\"noopener nofollow\">http:\/\/luxik.cdi.cz\/~devik\/qos\/htb\/manual\/theory.htm<\/a>, May 2002.<\/li>\n<\/ul>\n","protected":false},"excerpt":{"rendered":"<p>This paper presents a new approach for shared bottlenecks detection from a receiver\u2019s perspective. This approach uses flow clustering at the receiver, based on passive observations of inter-packet arrival time intervals. We also suggest a new cost function useful in the flows clusterization process into macroflows. The proposed method can be used in the discovery of path patterns or for extending the macroflow granularity in an improved Congestion Manager. <a href=\"https:\/\/www.cs.ubbcluj.ro\/~bufny\/a-new-method-for-macroflows-delimitation-from-a-receivers-perspective\/\" class=\"more-link\">Continue Reading <span class=\"meta-nav\">&rarr;<\/span><\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":[],"categories":[110],"tags":[134,132,133,131],"_links":{"self":[{"href":"https:\/\/www.cs.ubbcluj.ro\/~bufny\/wp-json\/wp\/v2\/posts\/209"}],"collection":[{"href":"https:\/\/www.cs.ubbcluj.ro\/~bufny\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.cs.ubbcluj.ro\/~bufny\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.cs.ubbcluj.ro\/~bufny\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.cs.ubbcluj.ro\/~bufny\/wp-json\/wp\/v2\/comments?post=209"}],"version-history":[{"count":15,"href":"https:\/\/www.cs.ubbcluj.ro\/~bufny\/wp-json\/wp\/v2\/posts\/209\/revisions"}],"predecessor-version":[{"id":2236,"href":"https:\/\/www.cs.ubbcluj.ro\/~bufny\/wp-json\/wp\/v2\/posts\/209\/revisions\/2236"}],"wp:attachment":[{"href":"https:\/\/www.cs.ubbcluj.ro\/~bufny\/wp-json\/wp\/v2\/media?parent=209"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.cs.ubbcluj.ro\/~bufny\/wp-json\/wp\/v2\/categories?post=209"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.cs.ubbcluj.ro\/~bufny\/wp-json\/wp\/v2\/tags?post=209"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}