Uncertain multicast under dynamic behaviors
作者机构：Science and Technology on Information System Engineering LaboratoryNational University of Defense TechnologyChangsha 410073China
出 版 物：《Frontiers of Computer Science》 (中国计算机科学前沿（英文版）)
年 卷 期：2020年第14卷第1期
页 面：130-145页
核心收录：
学科分类：08[工学] 0812[工学-计算机科学与技术（可授工学、理学学位）]
基 金：supported by the National Natural Science Foundation for Outstanding Excellent Young Scholars of China 国家自然科学基金 国家973计划 the Hunan Provincial Natural Science Fund for Distinguished Young Scholars the Guangxi Cooperative Innovation Center of Cloud Computing and Big Data
主 题：uncertain multicast dynamic behaviors routing forest approximation algorithm Steiner tree
摘 要：Multicast transfer can efficiently save the bandwidth consumption and reduce the load on the source node than a series of independent unicast ***,many applications employ the content replica strategy to improve the robustness and efficiency;hence each file and its replicas are usually distributed among multiple *** such scenarios,the traditional deterministic multicast develops into the Uncertain multicast,which has more flexibility in the source *** this paper,we focus on building and maintaining a minimal cost forest(MCF)for any uncertain multicast,whose group members(source nodes and destination nodes)may join or leave after constructing a *** formulate this dynamic minimal cost forest(DMCF)problem as a mixed integer programming *** then design three dedicated methods to approximate the optimal *** them,our a-MCF aims to efficiently construct an MCF for any given uncertain multicast,without dynamic behaviors of multicast group *** d-MCF method motivates to slightly update the existing MCF via local modifications once appearing a dynamic *** can achieve the balance between the minimal cost and the minimal modifications to the existing *** last r-MCF is a supplement method to the d-MCF method,since many rounds of local modifications maymake the resultant forest far away from the optimal ***,our r-MCF method monitors the accumulated degradation and triggers the rearrangement process to reconstruct an new MCF when *** comprehensive evaluation results demonstrate that our methods can well tackle the proposed DMCF problem.
维普期刊数据库