Browsing by Author "Hemkumar, D."

Filter results by typing the first few letters
Now showing 1 - 2 of 2
  • Thumbnail Image
    Item
    Aggregate TCP congestion management for internet QoS
    (2012) Hemkumar, D.; Vinaykumar, K.
    In 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.
  • No Thumbnail Available
    Item
    Aggregate TCP congestion management for internet QoS
    (2012) Hemkumar, D.; VinayKumar, K.
    In 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.