# A Distributed Multicast QoS Routing Construction Approach in Information-Centric Networking
## 5 Conclusions  
This paper introduces a distributed method for constructing delay-constrained multicast trees in Information-Centric Networking (ICN). The ICN system utilized in this work operates on a name-based lookup mechanism, using globally unique names to identify multicast services. The Name Resolution Service (NRS) is responsible for managing the mappings between multicast identifiers and the Network Addresses (NAs) of the tree nodes.  
We proposed a receiver-initiated distributed multicast path construction mechanism. The receiver node retrieves the nodes in the multicast tree through NRS, detects real-time delay information along the path with a join message, and constructs a multicast path from the tree node to the receiver in real-time based on the network status. To circumvent acquiring accurate information regarding the status of the complete network, we design a path construction algorithm that makes decisions based on precise path state information and imprecise routing information. Furthermore, to facilitate the selection of suitable tree nodes, we have designed a tree node registration and resolution mechanism based on NRS. This enables receivers to obtain a feasible node set within the multicast tree via NRS. Additionally, we introduced a cost-effective method to build a Neighborhood State Information Base (NSIB) to achieve more accurate path delay estimation. Simulation results  
Figure 17: The impact of topology size on success ratio and message processing overhead. (**a**) Success Ratio; (**b**) Message Processing Overhead.  
Figure 18: The impact of Group Member on success ratio and message processing overhead. (**a**) Success Ratio; (**b**) Message Processing Overhead.  
demonstrate that our approach outperforms some other methods in terms of both success rates and low message-processing overhead.  
Moreover, we have observed that fluctuations in network state may lead to violations of QoS metrics. To address this challenge, it is imperative to consider the dynamic adjustment of multicast trees and the establishment of fault-tolerant paths. This issue resides within the research domain of multicast tree fault recovery, which surpasses the scope of this paper. Prospective solutions to this matter will be pursued in forthcoming research endeavors.  
Additionally, our future research will delve deeper into the prospect of minimizing the cost of multicast trees while concurrently maintaining a high success rate in QoS multicast tree construction. Concurrently, our focus will shift towards extending the proposed methodology to encompass a broader range of constraint parameters. These explorations will form the basis for our forthcoming research endeavors.  
Conceptualization, J.S., H.N. and X.Z.; Funding acquisition, H.N.; Methodology, J.S., H.N. and X.Z.; Project administration, X.Z.; Software, J.S.; Supervision, H.N.; Writing--original draft, J.S.; Writing--review & editing, J.S., H.N. and X.Z. All authors have read and agreed to the published version of the manuscript.  
This work was funded by Frontier Exploration Project Independently Deployed by Institute of Acoustics, Chinese Academy of Sciences: Research on transmission technology for information center network (Project No. QYTS202112).  
Not applicable.  
The data presented in this study are available in the article.  
The authors declare no conflict of interest.