Please use this identifier to cite or link to this item: https://idr.l3.nitk.ac.in/jspui/handle/123456789/7221
Full metadata record
DC FieldValueLanguage
dc.contributor.authorHemkumar, D.-
dc.contributor.authorVinaykumar, K.-
dc.date.accessioned2020-03-30T09:58:39Z-
dc.date.available2020-03-30T09:58:39Z-
dc.date.issued2012-
dc.identifier.citationProceedings: Turing 100 - International Conference on Computing Sciences, ICCS 2012, 2012, Vol., , pp.375-378en_US
dc.identifier.urihttp://idr.nitk.ac.in/jspui/handle/123456789/7221-
dc.description.abstractIn this project we study the one of the most important performance in aggregate congestion control is fairness, i.e. the equal use of resources. The objective of Aggregate TCP congestion management is to achieve the fair sharing of the bottleneck bandwidth between the aggregate and other background TCP flows. There are many existing mechanism to prove the fairness property but none of mechanism proves fair share of the aggregated flows even where the number of flows in the aggregate is large. To solve this problem, unlike existing mechanism there are two congestion window loops, one is that loss event rate loop and other one is throughput control loop. Throughput control loop is used to adjust its window size with a weight N. Finally our simulation results prove an algorithm providing for fairly services to TCP flows that share a bottleneck link between the aggregate and other background TCP flows even where the number of flows in the aggregate is large. � 2012 IEEE.en_US
dc.titleAggregate TCP congestion management for internet QoSen_US
dc.typeBook chapteren_US
Appears in Collections:2. Conference Papers

Files in This Item:
File Description SizeFormat 
7221.pdf148.33 kBAdobe PDFThumbnail
View/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.