Name
Abstract | ||
|---|---|---|
Recent Internet traffic measurement shows that the majority of the TCP flows are short lived. Use of short flow highest priority scheduling provides the performance improvement in the internet traffic. However, long lived flows competing against the short flows starve at some point. We propose a novel two class Queue State Packet Scheduling mechanism, namely QSPS which treats long flows fairly without degrading the performance of short flows. We studied the performance of long flows competing against short flows and our results are more efficient than the short flow highest priority scheduling. We observe that the mean transmission time and the loss rate of short flows are significantly reduced. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1109/ARTCom.2009.221 | Kottayam, Kerala |
Keywords | Field | DocType |
short flow,class queue state packet,differentiated tcp flows,loss rate,tcp flow,long flow,performance improvement,recent internet traffic measurement,qsps-psr approach,highest priority scheduling,internet traffic,scheduling mechanism,scheduling algorithm,scheduling,protocols,data mining,internet,transport protocols | Scheduling (computing),Computer science,Packet scheduling,Queue,Computer network,Priority scheduling,Transmission time,Internet traffic,Performance improvement,The Internet,Distributed computing | Conference |
ISBN | Citations | PageRank |
978-0-7695-3845-7 | 0 | 0.34 |
References | Authors | |
11 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Y. Suresh | 1 | 21 | 4.25 |
| S. Arumugam | 2 | 16 | 2.07 |
| M. Chandrasekaran | 3 | 18 | 2.77 |
| J. Senthilkumar | 4 | 21 | 6.28 |
| V. Mohanraj | 5 | 18 | 6.46 |