检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:黄昭文[1] 冯穗力[1] 叶梧[1] 庄宏成[2]
机构地区:[1]华南理工大学电子与信息学院,广东广州510640 [2]华为技术有限公司,广东深圳518129
出 处:《华南理工大学学报(自然科学版)》2009年第10期34-38,43,共6页Journal of South China University of Technology(Natural Science Edition)
基 金:粤港关键领域重点突破项目(20060104-2)
摘 要:文中在分析现有WiMAX网状网络(WMN)多种服务质量(QoS)保障机制的基础上,指出了该领域现有的相关研究主要集中在路由算法和逐跳QoS保证的局限性以及其难以保障QoS的原因,提出了一种有效的、动态的WMNQoS保障算法.该算法把WMN视为一个整体,在全局最优的目标下定义了WMN各节点在处理数据包时所应遵循的约束条件,给出了各节点对网络流量的处理算法.该算法既提高了WMN的网络吞吐量,也确保了各节点对带宽使用的比例公平性.同时还开发了WMN仿真平台,仿真结果也表明了此算法的有效性与灵活性.In this paper, several existing QoS (Quality of Service) -guaranteeing mechanisms for WiMAX mesh network (WMN) are analyzed, and the limitations of the existing mechanisms relating to the routing algorithms and the per-hop QoS guarantee are pointed out. Moreover, the reasons for the difficulty in guaranteeing the QoS are dis- cussed, and an effective and dynamic QoS-guaranteeing algorithm for WMN is proposed. In this algorithm, WMN is considered as an integer to determine some constraints for the data packet processing of each WMN node in a view of integrity, and the traffic-handling algorithm for each node is presented. By using the proposed algorithm, the throughput of WMN is significantly improved and the fairness of bandwidth sharing by nodes is well guaranteed. Simulated results on a self-developed WMN platform show that the proposed algorithm is both effective and flexible.
关 键 词:WiMAX网状网络 吞吐量 服务质量 算法 公平性
分 类 号:TN913.2[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.117