检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]通信抗干扰技术国家级重点实验室(电子科技大学),成都611731 [2]四川师范大学物理与电子工程学院,成都610101 [3]重庆邮电大学通信与信息工程学院,重庆400065
出 处:《计算机应用》2016年第7期1784-1788,共5页journal of Computer Applications
基 金:四川省教育厅基金资助项目(13ZB0159)~~
摘 要:针对传统数据中心网络极易发生拥塞的问题,提出了在软件定义网络(SDN)的架构下设计基于流调度代价的拥塞控制路由算法加以解决。首先,进行拥塞链路上的大小流区分,并对所有大流的各条等价路径进行路径开销权重的计算,选择权重最小的路径作为可用调度路径;然后,使用调度后路径开销变化量和流占用带宽比例来共同定义流调度代价;最终选择调度代价最小的流进行调度。仿真结果表明,所提算法能在网络发生拥塞时降低了拥塞链路上的负荷,并且与仅进行流路径选择的拥塞控制算法相比,提高了链路利用率,减少了流传输时间,使得网络链路资源得到更好的利用。To alleviate the congestion of traditional data center network, the flow scheduling cost based congestion control routing algorithm on Software Defined Network( SDN) architecture was proposed. Firstly, the maximum flows and minimum flows on congestion links were differentiated. Secondly, the cost of each equivalent route for maximum flows was calculated,and the routes with minimum cost were selected as available scheduling routes for maximum flows. Then, the flow scheduling cost of each available scheduling route was defined by considering the cost change of rerouting operation and the occupancy ratio of bandwidth together. Finally, the maximum flows with minimum scheduling cost were scheduled to related available scheduling routes. The experimental results show that, the proposed algorithm is qualified to reduce the load of congestion links when network congestion occurs. Moreover, compared with the previous congestion control algorithm which taking into account the flow route selection only, the proposed algorithm improves the link utilization and reduces the transmission time of flow, which make the network link resources to be better used.
关 键 词:数据中心网络 软件定义网络 拥塞控制 链路负荷 流调度代价
分 类 号:TP393.2[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:13.59.111.209