Chiang, Sheng HaoSheng HaoChiangWang, Chih HangChih HangWangYang, De NianDe NianYangWANJIUN LIAOChen, Wen TsuenWen TsuenChen2023-06-262023-06-262023-02-0110459219https://scholars.lib.ntu.edu.tw/handle/123456789/633091Previous 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 |D max | |Dmax|, which indicates that it is impossible to find any algorithm with a ratio better than |D max | |Dmax| for MODMTE, and |D max | |Dmax| is the maximum number of destinations for a multicast tree. Then, we design a |D max | |Dmax|-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.Competitive ratio | distributed algorithm | multi-domain SDNjournal article10.1109/TPDS.2022.32052192-s2.0-85139523784WOS:000902093700003https://api.elsevier.com/content/abstract/scopus_id/85139523784