DraLCD: Another Traffic Engineering Method for Data Center Networks

YANG Yang; YANG Jia-hai; QIN Dong-hong; WANG Yu-ding; LING Xiao

doi:10.3969/j.issn.0372-2112.2017.05.032

您当前的位置：

首页 >

文章列表页 >

DraLCD: Another Traffic Engineering Method for Data Center Networks

更新时间：2025-07-16

- DraLCD: Another Traffic Engineering Method for Data Center Networks
- Acta Electronica Sinica Vol. 45, Issue 5, Pages: 1261-1267(2017)
- 作者机构：
  
  1. 清华大学网络科学与网络空间研究院,北京,100084
  2. 西安通信学院,陕西,西安,710106
  3. 广西民族大学信息科学与工程学院,广西,南宁,530006
  4. 清华大学网络科学与网络空间研究院,北京,100084
  5. 西安通信学院,陕西,西安,710106
  6. 广西民族大学信息科学与工程学院,广西,南宁,530006
- 作者简介：
- 基金信息：
- DOI：10.3969/j.issn.0372-2112.2017.05.032
  CLC： TP393
- Published：2017
- 稿件说明：
移动端阅览
YANG Yang, YANG Jia-hai, QIN Dong-hong, et al. DraLCD: Another Traffic Engineering Method for Data Center Networks[J]. Acta Electronica Sinica, 2017, 45(5): 1261-1267.
DOI：

YANG Yang, YANG Jia-hai, QIN Dong-hong, et al. DraLCD: Another Traffic Engineering Method for Data Center Networks[J]. Acta Electronica Sinica, 2017, 45(5): 1261-1267. DOI： 10.3969/j.issn.0372-2112.2017.05.032.

摘要

流量均衡是为了避免网络拥塞而作为流量工程中的路由优化目标提出来的，由于数据中心网络的流量特性，使得传统IP网络的流量工程方法不一定适合.为此，本文在SDN（Software Defined Network）的框架下，提出了一种基于链路关键度的自适应负载均衡流量工程方法：DraLCD（Dynamic Routing Algorithm based on Link Critical Degree）.该方法通过对全局视图的网络管控，并充分利用了网络中存在的冗余路径，在完成细粒度流量均衡的同时，能够降低控制器的计算开销以及与交换机之间的通信开销，最终完成路由优化的目标.最后，基于DraLCD设计的原型系统，通过在Mininet仿真平台中部署并进行仿真实验，与现有的等开销多路径路由算法ECMP（Equal-Cost Multi-Path）以及GFF（Global First Fit）路由算法相比较，能够明显地提升网络性能.

Abstract

Traffic balancing is proposed as a routing optimal goal in traffic engineering in order to avoid the network congestion.Because of data center traffic characteristics

traffic engineering of traditional IP networks may be not suitable to the data centers.Thus

we present a dynamic routing algorithm:DralCD (Dynamic Routing Algorithm based on Link Critical Degree)

which is based on the link critical degree within SDN (Software Defined Network) framework.By the global visibility and making full use of the redundant paths in the network

DraLCD can realize the fine-grained traffic balancing while reducing the computing cost of controller and communication overhead between controller and switches

and finally achieves the goal of routing optimal.Furthermore

we design and perform the prototype of DraLCD on Mininet platform

and compare it with two other popular algorithms:ECMP (Equal-Cost Multi-Path) and GFF (Global First Fit).In our evaluations

the results show that DraLCD can significantly improve the network performance compared with the other two algorithms.

关键词

Keywords

references

Views

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

AMR:A Multipath Routing Algorithm Based on Maximum Flow in Ad-Hoc Networks

Related Author

CHEN Yue-quan

GUO Xiao-feng

ZENG Qing-kai

CHEN Gui-hai

Related Institution

State Key Laboratory for Novel Software Technology,Department of Computer Science and Technology,Nanjing University

⁰