Detecting shared congestion of flows via end-to-end measurement. Rubenstein, D., Kurose, J., & Towsley, D. IEEE/ACM Transactions on Networking, 10:381-395 , ACM, New York, NY, USA, 06/2002, 2002. ![Detecting shared congestion of flows via end-to-end measurement [link]](https://bibbase.org/img/filetypes/link.svg "link")
Paper doi abstract bibtex Current Internet congestion control protocols operate independently on a per-flow basis. Recent work has demonstrated that cooperative congestion control strategies between flows can improve performance for a variety of applications, ranging from aggregated TCP transmissions to multiple-sender multicast applications. However, in order for this cooperation to be effective, one must first identify the flows that are congested at the same set of resources. We present techniques based on loss or delay observations at end hosts to infer whether or not two flows experiencing congestion are congested at the same network resources. Our novel result is that such detection can be achieved for unicast flows, but the techniques can also be applied to multicast flows. We validate these techniques via queueing analysis, simulation and experimentation within the Internet. In addition, we demonstrate preliminary simulation results that show that the delay-based technique can determine whether two TCP flows are congested at the same set of resources. We also propose metrics that can be used as a measure of the amount of congestion sharing between two flows
@article {Rubenstein:2000:DSC:345063.339410,
title = {Detecting shared congestion of flows via end-to-end measurement},
journal = {IEEE/ACM Transactions on Networking},
volume = {10},
year = {2002},
month = {06/2002},
pages = {381-395 },
publisher = {ACM},
address = {New York, NY, USA},
abstract = {Current Internet congestion control protocols operate independently on a per-flow basis. Recent work has demonstrated that cooperative congestion control strategies between flows can improve performance for a variety of applications, ranging from aggregated TCP transmissions to multiple-sender multicast applications. However, in order for this cooperation to be effective, one must first identify the flows that are congested at the same set of resources. We present techniques based on loss or delay observations at end hosts to infer whether or not two flows experiencing congestion are congested at the same network resources. Our novel result is that such detection can be achieved for unicast flows, but the techniques can also be applied to multicast flows. We validate these techniques via queueing analysis, simulation and experimentation within the Internet. In addition, we demonstrate preliminary simulation results that show that the delay-based technique can determine whether two TCP flows are congested at the same set of resources. We also propose metrics that can be used as a measure of the amount of congestion sharing between two flows},
keywords = {end-to-end measurement, flow, internet congestion protocols, per-flow, shared congestion},
issn = {1063-6692 },
doi = {http://dx.doi.org/10.1109/TNET.2002.1012369},
url = {http://dx.doi.org/10.1109/TNET.2002.1012369},
author = {Rubenstein, Dan and Kurose, Jim and Don Towsley}
}
Downloads: 0
{"_id":"5ShgbETDEYAJLb42s","bibbaseid":"rubenstein-kurose-towsley-detectingsharedcongestionofflowsviaendtoendmeasurement-2002","downloads":0,"creationDate":"2018-07-03T04:50:29.467Z","title":"Detecting shared congestion of flows via end-to-end measurement","author_short":["Rubenstein, D.","Kurose, J.","Towsley, D."],"year":2002,"bibtype":"article","biburl":"https://gnunet.org/bibliography/export/bibtex","bibdata":{"bibtype":"article","type":"article","title":"Detecting shared congestion of flows via end-to-end measurement","journal":"IEEE/ACM Transactions on Networking","volume":"10","year":"2002","month":"06/2002","pages":"381-395 ","publisher":"ACM","address":"New York, NY, USA","abstract":"Current Internet congestion control protocols operate independently on a per-flow basis. Recent work has demonstrated that cooperative congestion control strategies between flows can improve performance for a variety of applications, ranging from aggregated TCP transmissions to multiple-sender multicast applications. However, in order for this cooperation to be effective, one must first identify the flows that are congested at the same set of resources. We present techniques based on loss or delay observations at end hosts to infer whether or not two flows experiencing congestion are congested at the same network resources. Our novel result is that such detection can be achieved for unicast flows, but the techniques can also be applied to multicast flows. We validate these techniques via queueing analysis, simulation and experimentation within the Internet. In addition, we demonstrate preliminary simulation results that show that the delay-based technique can determine whether two TCP flows are congested at the same set of resources. We also propose metrics that can be used as a measure of the amount of congestion sharing between two flows","keywords":"end-to-end measurement, flow, internet congestion protocols, per-flow, shared congestion","issn":"1063-6692 ","doi":"http://dx.doi.org/10.1109/TNET.2002.1012369","url":"http://dx.doi.org/10.1109/TNET.2002.1012369","author":[{"propositions":[],"lastnames":["Rubenstein"],"firstnames":["Dan"],"suffixes":[]},{"propositions":[],"lastnames":["Kurose"],"firstnames":["Jim"],"suffixes":[]},{"firstnames":["Don"],"propositions":[],"lastnames":["Towsley"],"suffixes":[]}],"bibtex":"@article {Rubenstein:2000:DSC:345063.339410,\n\ttitle = {Detecting shared congestion of flows via end-to-end measurement},\n\tjournal = {IEEE/ACM Transactions on Networking},\n\tvolume = {10},\n\tyear = {2002},\n\tmonth = {06/2002},\n\tpages = {381-395 },\n\tpublisher = {ACM},\n\taddress = {New York, NY, USA},\n\tabstract = {Current Internet congestion control protocols operate independently on a per-flow basis. Recent work has demonstrated that cooperative congestion control strategies between flows can improve performance for a variety of applications, ranging from aggregated TCP transmissions to multiple-sender multicast applications. However, in order for this cooperation to be effective, one must first identify the flows that are congested at the same set of resources. We present techniques based on loss or delay observations at end hosts to infer whether or not two flows experiencing congestion are congested at the same network resources. Our novel result is that such detection can be achieved for unicast flows, but the techniques can also be applied to multicast flows. We validate these techniques via queueing analysis, simulation and experimentation within the Internet. In addition, we demonstrate preliminary simulation results that show that the delay-based technique can determine whether two TCP flows are congested at the same set of resources. We also propose metrics that can be used as a measure of the amount of congestion sharing between two flows},\n\tkeywords = {end-to-end measurement, flow, internet congestion protocols, per-flow, shared congestion},\n\tissn = {1063-6692 },\n\tdoi = {http://dx.doi.org/10.1109/TNET.2002.1012369},\n\turl = {http://dx.doi.org/10.1109/TNET.2002.1012369},\n\tauthor = {Rubenstein, Dan and Kurose, Jim and Don Towsley}\n}\n","author_short":["Rubenstein, D.","Kurose, J.","Towsley, D."],"key":"Rubenstein:2000:DSC:345063.339410","id":"Rubenstein:2000:DSC:345063.339410","bibbaseid":"rubenstein-kurose-towsley-detectingsharedcongestionofflowsviaendtoendmeasurement-2002","role":"author","urls":{"Paper":"http://dx.doi.org/10.1109/TNET.2002.1012369"},"keyword":["end-to-end measurement","flow","internet congestion protocols","per-flow","shared congestion"],"downloads":0},"search_terms":["detecting","shared","congestion","flows","via","end","end","measurement","rubenstein","kurose","towsley"],"keywords":["end-to-end measurement","flow","internet congestion protocols","per-flow","shared congestion"],"authorIDs":[],"dataSources":["FWsPTwsmjtrBtRS3B"]}