Distributed Throughput-Based Fair Queueing for Wired and Wireless Packet Communication Networks(QoS, 無線ネットワーク,アドホックネットワーク,センサネットワーク及び一般)

概要

論文の詳細を見る
In this paper, we propose a new, computationally efficient, distributed fair queueing scheme, which we call Throughput Fair Queueing (TFQ), that is applicable to both wired and wireless packet networks. In our TFQ scheme, each flow is equipped with a counter that measures the weighted throughput achievement while it has a backlog of packets. At the end of every service to a packet, the scheduler simply selects a flow with the minimum counter value as the one from which a packet is served next. We show that the difference between any two throughput counters is bounded. Our scheme significantly reduces the scheduler's computational overhead and guarantees fair throughput for all flows. In addition, for wireless networks our scheme suppresses the service for leading flows, brings short-term fairness for flows without errors, and achieves long-term fairness for all flows. These merits are verified by simulation.
社団法人電子情報通信学会の論文
2006-05-11