As the cornerstone of future information security,quantum key distribution(QKD)is evolving towards large-scale hybrid discrete-variable/continuous-variable(DV/CV)multi-domain quantum networks.Meanwhile,multicast-orien...As the cornerstone of future information security,quantum key distribution(QKD)is evolving towards large-scale hybrid discrete-variable/continuous-variable(DV/CV)multi-domain quantum networks.Meanwhile,multicast-oriented multi-party key negotiation is attracting increasing attention in quantum networks.However,the efficient key provision for multicast services over hybrid DV/CV multi-domain quantum networks remains challenging,due to the limited probability of service success and the inefficient utilization of key resources.Targeting these challenges,this study proposes two key-resource-aware multicast-oriented key provision strategies,namely the link distance-resource balanced key provision strategy and the maximum shared link key provision strategy.The proposed strategies are applicable to hybrid DV/CV multi-domain quantum networks,which are typically implemented by GG02-based intra-domain connections and BB84-based inter-domain connections.Furthermore,the multicast-oriented key provision model is formulated,based on which two heuristic algorithms are designed,i.e.,the shared link distance-resource(SLDR)dependent and the maximum shared link distance-resource(MSLDR)dependent multicast-oriented key provision algorithms.Simulation results verify the applicability of the designed algorithms across different multi-domain quantum networks,and demonstrate their superiority over the benchmark algorithms in terms of the success probability of multicast service requests,the number of shared links,and the key resource utilization.展开更多
Beginning with the simple introduction of socket which is the most commonly used application program interfaces in UNIX/LINUX communication domain, the concrete programming procedures to realize multicast and broadcas...Beginning with the simple introduction of socket which is the most commonly used application program interfaces in UNIX/LINUX communication domain, the concrete programming procedures to realize multicast and broadcast based on socket is provided, according to TCP/IP protocol in LINUX system. The acquiring and converting of broadcast destination address and multicast address, the setting of multicast options, the joining in and withdrawing from the multicast group, and the receiving and sending of datagram are all demonstrated in it, the related system calls and simple explication of C programming are also included.展开更多
To meet the bandwidth requirement for the multicasting data flow in ad hoc networks, a distributed on- demand bandwidth-constrained multicast routing （BCMR） protocol for wireless ad hoc networks is proposed. With th...To meet the bandwidth requirement for the multicasting data flow in ad hoc networks, a distributed on- demand bandwidth-constrained multicast routing （BCMR） protocol for wireless ad hoc networks is proposed. With this protocol, the resource reservation table of each node will record the bandwidth requirements of data flows, which access itself, its neighbor nodes and hidden nodes, and every node calculates the remaining available bandwidth by deducting the bandwidth reserved in the resource reservation table from the total available bandwidth of the node. Moreover, the BCMR searches in a distributed manner for the paths with the shortest delay conditioned by the bandwidth constraint. Simulation results demonstrate the good performance of BCMR in terms of packet delivery reliability and the delay. BCMR can meet the requirements of real time communication and can be used in the multicast applications with low mobility in wireless ad hoc networks.展开更多
To solve the load balancing problem in a triplet-based hierarchical interconnection network（THIN） system, a dynamic load balancing （DLB）algorithm--THINDLBA, which adopts multicast tree （MT）technology to improve ...To solve the load balancing problem in a triplet-based hierarchical interconnection network（THIN） system, a dynamic load balancing （DLB）algorithm--THINDLBA, which adopts multicast tree （MT）technology to improve the efficiency of interchanging load information, is presented. To support the algorithm, a complete set of DLB messages and a schema of maintaining DLB information in each processing node are designed. The load migration request messages from the heavily loaded node （HLN）are spread along an MT whose root is the HLN. And the lightly loaded nodes（LLNs） covered by the MT are the candidate destinations of load migration; the load information interchanged between the LLNs and the HLN can be transmitted along the MT. So the HLN can migrate excess loads out as many as possible during a one time execution of the THINDLBA, and its load state can be improved as quickly as possible. To avoid wrongly transmitted or redundant DLB messages due to MT overlapping, the MT construction is restricted in the design of the THINDLBA. Through experiments, the effectiveness of four DLB algorithms are compared, and the results show that the THINDLBA can effectively decrease the time costs of THIN systems in dealing with large scale computeintensive tasks more than others.展开更多
基金supported by the National Natural Science Foundation of China(Grant Nos.62201276,62350001,U22B2026,and 62425105)the Innovation Program for Quantum Science and Technology(Grant No.2021ZD0300701)the Key R&D Program(Industry Foresight and Key Core Technologies)of Jiangsu Province(Grant No.BE2022071)。
文摘As the cornerstone of future information security,quantum key distribution(QKD)is evolving towards large-scale hybrid discrete-variable/continuous-variable(DV/CV)multi-domain quantum networks.Meanwhile,multicast-oriented multi-party key negotiation is attracting increasing attention in quantum networks.However,the efficient key provision for multicast services over hybrid DV/CV multi-domain quantum networks remains challenging,due to the limited probability of service success and the inefficient utilization of key resources.Targeting these challenges,this study proposes two key-resource-aware multicast-oriented key provision strategies,namely the link distance-resource balanced key provision strategy and the maximum shared link key provision strategy.The proposed strategies are applicable to hybrid DV/CV multi-domain quantum networks,which are typically implemented by GG02-based intra-domain connections and BB84-based inter-domain connections.Furthermore,the multicast-oriented key provision model is formulated,based on which two heuristic algorithms are designed,i.e.,the shared link distance-resource(SLDR)dependent and the maximum shared link distance-resource(MSLDR)dependent multicast-oriented key provision algorithms.Simulation results verify the applicability of the designed algorithms across different multi-domain quantum networks,and demonstrate their superiority over the benchmark algorithms in terms of the success probability of multicast service requests,the number of shared links,and the key resource utilization.
文摘Beginning with the simple introduction of socket which is the most commonly used application program interfaces in UNIX/LINUX communication domain, the concrete programming procedures to realize multicast and broadcast based on socket is provided, according to TCP/IP protocol in LINUX system. The acquiring and converting of broadcast destination address and multicast address, the setting of multicast options, the joining in and withdrawing from the multicast group, and the receiving and sending of datagram are all demonstrated in it, the related system calls and simple explication of C programming are also included.
基金The Natural Science Foundation of Zhejiang Province(No.Y1090232)
文摘To meet the bandwidth requirement for the multicasting data flow in ad hoc networks, a distributed on- demand bandwidth-constrained multicast routing （BCMR） protocol for wireless ad hoc networks is proposed. With this protocol, the resource reservation table of each node will record the bandwidth requirements of data flows, which access itself, its neighbor nodes and hidden nodes, and every node calculates the remaining available bandwidth by deducting the bandwidth reserved in the resource reservation table from the total available bandwidth of the node. Moreover, the BCMR searches in a distributed manner for the paths with the shortest delay conditioned by the bandwidth constraint. Simulation results demonstrate the good performance of BCMR in terms of packet delivery reliability and the delay. BCMR can meet the requirements of real time communication and can be used in the multicast applications with low mobility in wireless ad hoc networks.
基金The National Natural Science Foundation of China(No.69973007).
文摘To solve the load balancing problem in a triplet-based hierarchical interconnection network（THIN） system, a dynamic load balancing （DLB）algorithm--THINDLBA, which adopts multicast tree （MT）technology to improve the efficiency of interchanging load information, is presented. To support the algorithm, a complete set of DLB messages and a schema of maintaining DLB information in each processing node are designed. The load migration request messages from the heavily loaded node （HLN）are spread along an MT whose root is the HLN. And the lightly loaded nodes（LLNs） covered by the MT are the candidate destinations of load migration; the load information interchanged between the LLNs and the HLN can be transmitted along the MT. So the HLN can migrate excess loads out as many as possible during a one time execution of the THINDLBA, and its load state can be improved as quickly as possible. To avoid wrongly transmitted or redundant DLB messages due to MT overlapping, the MT construction is restricted in the design of the THINDLBA. Through experiments, the effectiveness of four DLB algorithms are compared, and the results show that the THINDLBA can effectively decrease the time costs of THIN systems in dealing with large scale computeintensive tasks more than others.
