Abstract | ||
---|---|---|
We propose a new fair queueing scheme which we call Channel-Independent Throughput-based Fair Queueing (CITFQ) without using virtual time system. In our CITFQ scheme, each flow is equipped with a counter that measures the weighted throughput achievement if it has a backlog of packets. Our CITFQ scheme achieves fairness guarantees, short term fairness for error-free flows, long term fairness for error flows, and graceful degradation for flows which have received extra service. |
Year | DOI | Venue |
---|---|---|
2016 | 10.1016/j.orl.2016.06.002 | Oper. Res. Lett. |
Keywords | Field | DocType |
Fair queueing,Generalized processor sharing,Packet scheduling,Wireless packet network,Virtual clock | Computer science,Computer network,Layered queueing network,Network congestion,Fairness measure,Maximum throughput scheduling,Generalized processor sharing,Throughput,Weighted fair queueing,Fair queuing,Distributed computing | Journal |
Volume | Issue | ISSN |
44 | 4 | 0167-6377 |
Citations | PageRank | References |
0 | 0.34 | 9 |
Authors | ||
2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Sang-Yong Kim | 1 | 0 | 0.34 |
Joohyun Kim | 2 | 292 | 22.75 |