# A Distributed Multicast QoS Routing Construction Approach in Information-Centric Networking
21, North Fourth Ring Road, Haidian District, Beijing 100190, China; [EMAIL_ADDRESS] (J.S. ); [EMAIL_ADDRESS] (H.N. )1 National Network New Media Engineering Research Center, Institute of Acoustics, Chinese Academy of Sciences, No. 21, North Fourth Ring Road, Haidian District, Beijing 100190, China; [EMAIL_ADDRESS] (J.S. ); [EMAIL_ADDRESS] (H.N. )1 National Network New Media Engineering Research Center, Institute of Acoustics, Chinese Academy of Sciences, No. 21, North Fourth Ring Road, Haidian District, Beijing 100190, China; [EMAIL_ADDRESS] (J.S. ); [EMAIL_ADDRESS] (H.N. )1 National Network New Media Engineering Research Center, Institute of Acoustics, Chinese Academy of Sciences, No. 21, North Fourth Ring Road, Haidian District, Beijing 100190, China; [EMAIL_ADDRESS] (J.S. ); [EMAIL_ADDRESS] (H.N. )1 National Network New Media Engineering Research Center, Institute of Acoustics, Chinese Academy of Sciences, No. 21, North Fourth Ring Road, Haidian District, Beijing 100190, China; [EMAIL_ADDRESS] (J.S. ); [EMAIL_ADDRESS] (H.N. )1 National Network New Media Engineering Research Center, Institute of Acoustics, Chinese Academy of Sciences, No. 21, North Fourth Ring Road, Haidian District, Beijing 100190, China; [EMAIL_ADDRESS] (J.S. ); [EMAIL_ADDRESS] (H.N. )1 National Network New Media Engineering Research Center, Institute of Acoustics, Chinese Academy of Sciences, No. 21, North Fourth Ring Road, Haidian District, Beijing 100190, China; [EMAIL_ADDRESS] (J.S. ); [EMAIL_ADDRESS] (H.N. )1 National Network New Media Engineering Research Center, Institute of Acoustics, Chinese Academy of Sciences, No. 21, North Fourth Ring Road, Haidian District, Beijing 100190, China; [EMAIL_ADDRESS] (J.S. ); [EMAIL_ADDRESS] (H.N. )1 National Network New Media Engineering Research Center, Institute of Acoustics, Chinese Academy of Sciences, No. 21, North Fourth Ring Road, Haidian District, Beijing 100190, China; [EMAIL_ADDRESS] (J.S. ); [EMAIL_ADDRESS] (H.N. )1 National Network New Media Engineering Research Center, Institute of Acoustics, Chinese Academy of Sciences, No. 21, North Fourth Ring Road, Haidian District, Beijing 100190, China; [EMAIL_ADDRESS] (J.S. ); [EMAIL_ADDRESS] (H.N. )1 National Network New Media Engineering Research Center, Institute of Acoustics, Chinese Academy of Sciences, No. 21, North Fourth Fourth Ring Road, Haidian District, Beijingdistribution tree under certain performance-related constraints. This process aims to optimize network resources and fulfill the QoS requirements of applications. Therefore, the design of QoS-driven (or constraint-based) multicast routing methods holds paramount significance. To ensure QoS support for packet transmission, several fundamental techniques are required: the design of QoS-driven multicast routing protocols, packet classification techniques, packet scheduling algorithms, and resource reservation techniques. The specific operations of resource reservation or priority configuration are typically integrated into the process of configuring multicast routing information in routers. For instance, the traditional RSVP [10] protocol comprises two primary components: firstly, the establishment of a path, and secondly, the reservation of resources along the path during the path setup process. Concerns, such as resource reservation in routers, have been extensively studied in the unicast domain. Through straightforward adjustments, these techniques can be easily integrated with routing algorithms. Therefore, our research is dedicated to addressing multicast routing issues with latency constraints, with a focus on the construction of multicast trees. To enable QoS routing, network nodes require accurate information about network resource states, such as latency and bandwidth. Owing to the dynamic fluctuations in network status, obtaining precise real-time network status information poses a challenge. In a large, distributed network, the network state information available for routing decisions at each node is often imprecise [11; 12].