The systematical and scalable frameworks were provided for estimating the blocking probabilities under asynchronous traffic in optical burst switching(OBS) nodes with limited wavelength conversion capability(LWCC) . T...The systematical and scalable frameworks were provided for estimating the blocking probabilities under asynchronous traffic in optical burst switching(OBS) nodes with limited wavelength conversion capability(LWCC) . The relevant system architectures of limited range and limited number of wavelength converters(WCs) deployed by a share-per-fiber(SPF) mode were developed,and the novel theoretical analysis of node blocking probability was derived by combining the calculation of discouraged arrival rate in a birth-death process and two-dimensional Markov chain model of SPF. The simulation results on single node performance verify the accuracy and effectiveness of the analysis models. Under most scenarios,it is difficult to distinguish the plots generated by the analysis and simulation. As the conversion degree increases,the accuracy of the analysis model worsens slightly. However,the utmost error on burst loss probability is far less than one order of magnitude and hence,still allows for an accurate estimate. Some results are of actual significance to the construction of next-generation commercial OBS backbones.展开更多
In secure multicast, one of the challenging problems is the authentication of multicast packets. This paper presents a novel scheme to address this problem, which combines ideas in both the hash tree schemes and the h...In secure multicast, one of the challenging problems is the authentication of multicast packets. This paper presents a novel scheme to address this problem, which combines ideas in both the hash tree schemes and the hash chain schemes. In this scheme, a group of packets is partitioned into equal-sized subgroups. Then a Merkle hash tree is built for each subgroup of packets, and the hash value of every root is appended to preceding packets to form hash chains. Its performance is analyzed and simulated using Biased Coin Toss loss model and 2-state Markov Chain loss model, respectively. Compared with the original hash chain schemes, results show that this scheme is much more efficient in term of communication overhead.展开更多
基金Project(60632010) supported by the National Natural Science Foundation of China
文摘The systematical and scalable frameworks were provided for estimating the blocking probabilities under asynchronous traffic in optical burst switching(OBS) nodes with limited wavelength conversion capability(LWCC) . The relevant system architectures of limited range and limited number of wavelength converters(WCs) deployed by a share-per-fiber(SPF) mode were developed,and the novel theoretical analysis of node blocking probability was derived by combining the calculation of discouraged arrival rate in a birth-death process and two-dimensional Markov chain model of SPF. The simulation results on single node performance verify the accuracy and effectiveness of the analysis models. Under most scenarios,it is difficult to distinguish the plots generated by the analysis and simulation. As the conversion degree increases,the accuracy of the analysis model worsens slightly. However,the utmost error on burst loss probability is far less than one order of magnitude and hence,still allows for an accurate estimate. Some results are of actual significance to the construction of next-generation commercial OBS backbones.
基金Supported by the Natural Science Foundation of China (No. 60173066)
文摘In secure multicast, one of the challenging problems is the authentication of multicast packets. This paper presents a novel scheme to address this problem, which combines ideas in both the hash tree schemes and the hash chain schemes. In this scheme, a group of packets is partitioned into equal-sized subgroups. Then a Merkle hash tree is built for each subgroup of packets, and the hash value of every root is appended to preceding packets to form hash chains. Its performance is analyzed and simulated using Biased Coin Toss loss model and 2-state Markov Chain loss model, respectively. Compared with the original hash chain schemes, results show that this scheme is much more efficient in term of communication overhead.
