检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《清华大学学报(自然科学版)》2008年第7期1131-1134,共4页Journal of Tsinghua University(Science and Technology)
摘 要:为了改进亏空公平优先队列算法,提出一种成比例带宽分配算法。基站将服务连接的带宽请求按照优先级排队,根据服务质量参数先分配部分带宽,超出的请求基于子站总请求带宽的大小成比例分配给服务连接。仿真采用2维离散时间Markov调制Poisson过程的模型产生实时轮询服务和非实时轮询服务连接的数据源。与亏空公平优先队列算法相比,该算法不仅满足各类服务连接的服务质量要求,而且改善子站总的吞吐量和流量突发增加的问题。该算法还提高了子站间及不同优先级服务连接间的公平性。A proportional bandwidth allocation algorithm was developed to improve the deficit fair priority queue (DFPQ) algorithm. The base station services the bandwidth requests of the service connections in queue according to the priorities and grants some bandwidth to the service connections based on the quality of service (QoS) parameters. The excess requests are proportionally allocated relative to the total bandwidth requests of the subscriber stations. Simulations used data for the real-time and non-real-time polling service connections generated using a two-dimension discrete-time Markov ,modulated Poisson process model. The algorithm not only satisfies the QoS requirements of the service connections, but also improves the total throughputs of the subscriber stations and the problems caused by sudden traffic increases compared with the DFPQ algorithm. Furthermore, the algorithm improves the fairness between the subscribers and the fairness between the service connections for different priorities.
关 键 词:无线接入网 媒体接入控制 服务质量(QoS) 带宽分配
分 类 号:TN925.93[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.15