Priority and fair scheduling in a wireless LAN

被引：0
作者：
Dugar, A
Vaidya, N
Bahl, P
机构：
来源：
2001 MILCOM, VOLS 1 AND 2, PROCEEDINGS: COMMUNICATIONS FOR NETWORK-CENTRIC OPERATIONS: CREATING THE INFORMATION FORCE | 2001年
关键词：
wireless LAN; weighted fairness; priority scheduling;
D O I：
暂无
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
In recent years, fair scheduling and quality of service (QoS) in wireless LANs have received significant attention from the networking research community. This paper presents a distributed protocol for priority and fair scheduling in a wireless LAN. The proposed protocol supports multiple priorities, as well as a mechanism (using weights) for controlling the way bandwidth is shared by flows within a given priority level.
引用
收藏
页码：993 / 997
页数：5
相关论文
共 13 条
[1]  
ANASTASI G, 1998, P IEEEINFOCOM
[2]  
[Anonymous], 1997, 80211 IEEE
[3]  
[Anonymous], NS NOTES DOCUMENTATI
[4]  
BENNETT JCR, 1996, INFOCOM 96 MARCH
[5]   PRIORITY ACCESS SCHEMES USING CSMA-CD [J].
CHOUDHURY, GL ;
RAPPAPORT, SS .
IEEE TRANSACTIONS ON COMMUNICATIONS, 1985, 33 (07) :620-626
[6]  
DUGAR A, 2001, THESIS TEXAS A M U
[7]   Start-time fair queueing: A scheduling algorithm for integrated services packet switching networks [J].
Goyal, P ;
Vin, HM ;
Cheng, PC .
IEEE-ACM TRANSACTIONS ON NETWORKING, 1997, 5 (05) :690-704
[8]  
Jain R., 1996, ATMFORUM961173
[9]  
LUO H, 2001, IEEE INFOCOM AL APR
[10]  
Sobrinho J. L., 1996, Bell Labs Technical Journal, V1, P172, DOI 10.1002/bltj.2023
12