.png){kind=icon}
.png){kind=icon}
Return
Distributed Multicast Traffic Engineering for Multi-Domain Software-Defined Networks
.png){kind=icon}
PRE
AI
DOI：10.1109/TPDS.2022.3205219.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Previous research on SDN multicast traffic engineering mainly focused on intra-domain optimization. However, the main traffic on the Internet is inter-domain, and the selection of border nodes and sharing of network information between domains are usually distributed but ignored in previous works. In this article, we explore multi-domain online distributed multicast traffic engineering (MODMTE). To effectively solve MODMTE, we first prove that MODMTE is inapproximable within IDmaxI, which indicates that it is impossible to find any algorithm with a ratio better than IDmaxI for MODMTE, and IDmaxI is the maximum number of destinations for a multicast tree. Then, we design a IDmaxI-competitive distributed algorithm with the ideas of Domain Tree, Dual Candidate Forest Construction, and Forest Rerouting to achieve the tightest performance bound for MODMTE. Experiments on a real SDN with YouTube traffic manifest that the proposed distributed algorithm can reduce more than 30% of the total cost of bandwidth consumption and rule updates for multicast tree rerouting compared with the state-of-the-art algorithms.
Keywords:
Forestry
Costs
Bandwidth
Unicast
Routing
Distributed algorithms
Network topology
Competitive ratio
distributed algorithm
multi-domain SDN
Journal
IF:
6
Papers:
5.2K
Citations:
1.1W
Organization
View more organizations