检索结果-内蒙古大学图书馆

25th IEEE/ACM International Symposium on Quality of Service (IWQoS)

作者： Li, Guozhi Guo, Songtao Yang, Yuanyuan Southwest Univ Coll Elect & Informat Engn Chongqing 400715 Peoples R China SUNY Stony Brook Dept Elect & Comp Engn Stony Brook NY 11794 USA

ISBN: (纸本)9781538627044

multicast can not only shorten task completion time of applications, but also effectively reduce overall bandwidth consumption in data center networks (DCNs). However, load imbalance and sudden link blocking will seriously impact the network performance owing to the fundamental characteristics of huge traffic in DCNs. To address this problem, in this paper, we propose a novel multicast scheduling algorithm in software defined fat-tree DCNs, which can improve network performance by reducing the blocking of multicast traffic. In particular, the multicast scheduling algorithm selects the minimum blocking cost of links as optimal paths. By our scheduling algorithm, multicast flows are evenly distributed over the available links so as to achieve load balance. In addition, the DCNs are controlled globally by the software defined networking (SDN) technology, therefore, the multicast traffic cannot be interfered by the unexpected flow requests. Furthermore, the multicast scheduling algorithm can lead to asymptotically minimum network blocking probability, and has a low time complexity. Simulation results verify the effectiveness of our proposed multicast scheduling algorithm in different network traffic intensities.

关键词： Fat-tree data center networks load balancing link blocking cost multicast scheduling algorithm

来源：评论

学校读者我要写书评

暂无评论

multicast scheduling with Markov Chains in Fat-tree Data Center Networks

Multicast Scheduling with Markov Chains in Fat-tree Data Cen...

引用

12th International Conference on Networking, Architecture, and Storage (NAS)

作者： Li, Guozhi Guo, Songtao Liu, Guiyan Yang, Yuanyuan Southwest Univ Coll Elect & Informat Engn Chongqing 400715 Peoples R China SUNY Stony Brook Dept Elect & Comp Engn Stony Brook NY 11794 USA

ISBN: (纸本)9781538634868

multicast can improve network performance by eliminating sending unnecessary duplicated flows in the data center networks (DCNs), thus it can significantly save network bandwidth and improve the network Quality of Service (QoS). However, the network multicast blocking causes the retransmission of a large number of data packets, and seriously influences the traffic efficiency of data center networks, especially for the multicast traffic in the fat-tree DCNs owing to multi-rooted tree structure. In this paper, we propose a novel multicast scheduling strategy to reduce the network multicast blocking. In order to decrease the operation time of the proposed algorithm, therefore, the remaining bandwidth the selected uplink connecting to available core switch should be close to and greater the three times than the bandwidth of multicast requests. Then the blocking probability of downlink at next time-slot is calculated by using markov chain theory. Furthermore, we select the downlink with minimum blocking probability as the optimal path at next time slot. In addition, theoretical analysis shows that the blocking probability of scheduling algorithm is close to zero and has lower time complexity. Simulation results verify the effectiveness of our proposed multicast scheduling algorithm.

关键词： Fat-tree data center networks markov chains multicast blocking multicast scheduling algorithm

来源：评论

学校读者我要写书评

暂无评论

Blocking cost-driven multicast scheduling in fat-tree data center networks

引用

CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE 2017年第19期29卷 e4166.1-e4166.10页

作者： Li, Guozhi Guo, Songtao Yang, Yuanyuan Southwest Univ Chongqing Key Lab Nonlinear Circuits & Intelligen Coll Elect & Informat Engn Chongqing 400715 Peoples R China SUNY Stony Brook Dept Elect & Comp Engn Stony Brook NY 11794 USA

multicast traffic scheduling in data center networks can not only improve network efficiency but also save network resources. However, the existing multicast scheduling algorithms cannot appropriately schedule flows to achieve traffic load balance so that the network may occur heavy blocking. This prevents the full utilization of high degree of link parallelism and causes unpredictable reduction of network performance. To address the problem, in this paper, we propose a blocking cost-driven multicast scheduling algorithm by using optimization theory in fat-tree data center networks. In particular, a model of multicast traffic subnetwork is established on the basis of the blocking probability of available paths at next time slot, which can reflect the blocking characteristics of multicast network and predict network state at next time slot. With the multicast blocking model, we derive the minimum blocking probability of multicast subnetworks, denoted as blocking cost. In addition, the algorithm can select the multicast subnetwork with minimum blocking cost to transfer multicast flows. Time complexity analysis and simulation results demonstrate the effectiveness and efficiency of our proposed multicast scheduling algorithm for different network traffic intensities.

关键词： blocking probability cloud computing fat-tree data center networks multicast scheduling algorithm

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：