The deflection routing protocol is an effective contention resolution in Optical Burst Switching network, However, it can worsen loss performance of non-deflected burst on the deflection route. To improve the burst lo...The deflection routing protocol is an effective contention resolution in Optical Burst Switching network, However, it can worsen loss performance of non-deflected burst on the deflection route. To improve the burst loss performance, a limited deflection routing scheme based on burst loss threshold is proposed to prevent injudicious deflection routing. By using threshold check function, it restrainedly allows the deflected burst to preemptive network resource, consequently, improve the QoS performance of non-deflected burst. Simulation results show that the scheme can efficiently prevent deflected burst contending with non-deflected burst on deflection route, and effectively improve the burst loss performance of entire networks.展开更多
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.展开更多
The issue of burst losses imposes a constraint on the development of Optical Burst Switching （OBS） networks. Heavy burst losses strongly affect the Quality of Service （QoS） intended by end users. This article pres...The issue of burst losses imposes a constraint on the development of Optical Burst Switching （OBS） networks. Heavy burst losses strongly affect the Quality of Service （QoS） intended by end users. This article presents a QoS aware Routing and Wavelength Allocation （RWA） technique for burst switching in OBS networks. The RWA problem is modeled as a bi-objective Integer Linear Programming （ILP） problem, where objective functions are based on minimizing the number of wavelengths used and the number of hops traversed to fulfill the burst transmission requests for a given set of node pairs. The ILP model is solved using a novel approach based on a Differential Evolution （DE） algorithm. Analytical results show that the DE algorithm provides a better performance compared to shortest path routing, which is a widely accepted routing strategy for OBS networks.展开更多
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.展开更多
基金This workis supported by project of National Science Foundation of China (No.90304004) , National"863"Project Plan (No.2005AA122310) , Keyproject of Science and Technology of National Education Department (No.204125) , project of Science Foundation of Chongqing Science and Technology Commission(No.2005BB2062) , Youth Science and Technology Grant of CQUPT(No.A2005-28) .
文摘The deflection routing protocol is an effective contention resolution in Optical Burst Switching network, However, it can worsen loss performance of non-deflected burst on the deflection route. To improve the burst loss performance, a limited deflection routing scheme based on burst loss threshold is proposed to prevent injudicious deflection routing. By using threshold check function, it restrainedly allows the deflected burst to preemptive network resource, consequently, improve the QoS performance of non-deflected burst. Simulation results show that the scheme can efficiently prevent deflected burst contending with non-deflected burst on deflection route, and effectively improve the burst loss performance of entire networks.
基金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.
文摘The issue of burst losses imposes a constraint on the development of Optical Burst Switching （OBS） networks. Heavy burst losses strongly affect the Quality of Service （QoS） intended by end users. This article presents a QoS aware Routing and Wavelength Allocation （RWA） technique for burst switching in OBS networks. The RWA problem is modeled as a bi-objective Integer Linear Programming （ILP） problem, where objective functions are based on minimizing the number of wavelengths used and the number of hops traversed to fulfill the burst transmission requests for a given set of node pairs. The ILP model is solved using a novel approach based on a Differential Evolution （DE） algorithm. Analytical results show that the DE algorithm provides a better performance compared to shortest path routing, which is a widely accepted routing strategy for OBS networks.
基金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.
