Application and Analysis of Multicast Blocking Modelling in Fat-Tree Data Center Networks
Multicast can improve network performance by eliminating unnecessary duplicated flows in the data center networks (DCNs). Thus it can significantly save network bandwidth. However, the network multicast blocking may cause the retransmission of a large number of data packets and seriously influence t...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2018-01-01
|
| Series: | Complexity |
| Online Access: | http://dx.doi.org/10.1155/2018/7563170 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832563877496225792 |
|---|---|
| author | Guozhi Li Songtao Guo Guiyan Liu Yuanyuan Yang |
| author_facet | Guozhi Li Songtao Guo Guiyan Liu Yuanyuan Yang |
| author_sort | Guozhi Li |
| collection | DOAJ |
| description | Multicast can improve network performance by eliminating unnecessary duplicated flows in the data center networks (DCNs). Thus it can significantly save network bandwidth. However, the network multicast blocking may cause the retransmission of a large number of data packets and seriously influence the traffic efficiency in data center networks, especially in the fat-tree DCNs with multirooted tree structure. In this paper, we build a multicast blocking model and apply it to solve the problem of network blocking in the fat-tree DCNs. Furthermore, we propose a novel multicast scheduling strategy. In the scheduling strategy, we select the uplink connecting to available core switch whose remaining bandwidth is close to and greater than the three times of bandwidth multicast requests so as to reduce the operation time of the proposed algorithm. Then the blocking probability of downlink in the next time-slot is calculated in multicast subnetwork by using Markov chains theory. With the obtained probability, we select the optimal downlink based on the available core switch. In addition, theoretical analysis shows that the multicast scheduling algorithm has close to zero network blocking probability as well as lower time complexity. Simulation results verify the effectiveness of our proposed multicast scheduling algorithm. |
| format | Article |
| id | doaj-art-e6ca498f0bc14aff8e536ce7a14cf327 |
| institution | Kabale University |
| issn | 1076-2787 1099-0526 |
| language | English |
| publishDate | 2018-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Complexity |
| spelling | doaj-art-e6ca498f0bc14aff8e536ce7a14cf3272025-02-03T01:12:24ZengWileyComplexity1076-27871099-05262018-01-01201810.1155/2018/75631707563170Application and Analysis of Multicast Blocking Modelling in Fat-Tree Data Center NetworksGuozhi Li0Songtao Guo1Guiyan Liu2Yuanyuan Yang3College of Electronic and Information Engineering, Southwest University, Chongqing 400715, ChinaCollege of Electronic and Information Engineering, Southwest University, Chongqing 400715, ChinaCollege of Electronic and Information Engineering, Southwest University, Chongqing 400715, ChinaCollege of Electronic and Information Engineering, Southwest University, Chongqing 400715, ChinaMulticast can improve network performance by eliminating unnecessary duplicated flows in the data center networks (DCNs). Thus it can significantly save network bandwidth. However, the network multicast blocking may cause the retransmission of a large number of data packets and seriously influence the traffic efficiency in data center networks, especially in the fat-tree DCNs with multirooted tree structure. In this paper, we build a multicast blocking model and apply it to solve the problem of network blocking in the fat-tree DCNs. Furthermore, we propose a novel multicast scheduling strategy. In the scheduling strategy, we select the uplink connecting to available core switch whose remaining bandwidth is close to and greater than the three times of bandwidth multicast requests so as to reduce the operation time of the proposed algorithm. Then the blocking probability of downlink in the next time-slot is calculated in multicast subnetwork by using Markov chains theory. With the obtained probability, we select the optimal downlink based on the available core switch. In addition, theoretical analysis shows that the multicast scheduling algorithm has close to zero network blocking probability as well as lower time complexity. Simulation results verify the effectiveness of our proposed multicast scheduling algorithm.http://dx.doi.org/10.1155/2018/7563170 |
| spellingShingle | Guozhi Li Songtao Guo Guiyan Liu Yuanyuan Yang Application and Analysis of Multicast Blocking Modelling in Fat-Tree Data Center Networks Complexity |
| title | Application and Analysis of Multicast Blocking Modelling in Fat-Tree Data Center Networks |
| title_full | Application and Analysis of Multicast Blocking Modelling in Fat-Tree Data Center Networks |
| title_fullStr | Application and Analysis of Multicast Blocking Modelling in Fat-Tree Data Center Networks |
| title_full_unstemmed | Application and Analysis of Multicast Blocking Modelling in Fat-Tree Data Center Networks |
| title_short | Application and Analysis of Multicast Blocking Modelling in Fat-Tree Data Center Networks |
| title_sort | application and analysis of multicast blocking modelling in fat tree data center networks |
| url | http://dx.doi.org/10.1155/2018/7563170 |
| work_keys_str_mv | AT guozhili applicationandanalysisofmulticastblockingmodellinginfattreedatacenternetworks AT songtaoguo applicationandanalysisofmulticastblockingmodellinginfattreedatacenternetworks AT guiyanliu applicationandanalysisofmulticastblockingmodellinginfattreedatacenternetworks AT yuanyuanyang applicationandanalysisofmulticastblockingmodellinginfattreedatacenternetworks |