CAJ | 학술논문

针对无线局域网中上行链路TCP流之间存在严重的无线信道资源分配不公平问题,提出一种上行链路TCP流的调度算法UFWFQ.该算法在接入节点上对上行TCP流采用与WFQ算法相同的轮询机制,根据流的传送速率动态计算其服务概率,分配给高速发送流较大的权重,使各上行TCP流占用的信道时间相等,以保证各流的加权公平性,提高网络的总吞吐率.仿真实验结果验证了该算法的有效性.
침대무선국역망중상행련로TCP류지간존재엄중적무선신도자원분배불공평문제,제출일충상행련로TCP류적조도산법UFWFQ.해산법재접입절점상대상행TCP류채용여WFQ산법상동적륜순궤제,근거류적전송속솔동태계산기복무개솔,분배급고속발송류교대적권중,사각상행TCP류점용적신도시간상등,이보증각류적가권공평성,제고망락적총탄토솔.방진실험결과험증료해산법적유효성.
Aiming at the problem that the wireless channel resources are significantly unfairly allocated among the uplink TCP flows in WLAN, this paper proposes an uplink TCP flow schedule algorithm named UFWFQ(Up Fair WFQ). It uses the same polling as Weighted Fair Queuing (WFQ) at Access Point(AP). The service weights are dynamically set according to the transmission rate of flows. Flows with high transmission rate get more opportunities, and each flow occupies the same channel time. As a result, UFWFQ achieves the weighted fairness between single flow and total network efficiency. Simulation result proves that UFWFQ is effective.