Time-slotted optical burst switched network is a potential technique to support IP over Wavelength Division Multiplexing (WDM) by introduce Time Division Multiplexing (TDM) channel to Optical Burst Switching (OBS) tec...Time-slotted optical burst switched network is a potential technique to support IP over Wavelength Division Multiplexing (WDM) by introduce Time Division Multiplexing (TDM) channel to Optical Burst Switching (OBS) technology. This paper presents a framework to evaluate blocking performance of time-slot-ted OBS networks with multi-fiber wavelength channels. The proposed model is efficient for not only single class traffic such as individual circuit switch traffics or best-effort traffics but also mixed multi-class traffics. The effectiveness of the proposed model is validated by simulation results. The study shows that blocking per-formance of multi-fiber TS-OBS network is acceptable for future Internet services.展开更多
The analysis of WDM (Wavelength-Division Multiplexing) optical network is essential to have the routed wavelength blocking probability with the conversion of wavelength using techniques. In this paper, an enhanced ana...The analysis of WDM (Wavelength-Division Multiplexing) optical network is essential to have the routed wavelength blocking probability with the conversion of wavelength using techniques. In this paper, an enhanced analytical model is proposed to evaluate the blocking performances in topology network and to improve the performances of reduction of blocking probability. The variation of probability is based on the wavelength and load used in the network. The conversion is carried out with the support of optical backbone of the inherent flexibility of the network using the proposed IMCA in Sparse-Partial Wavelength Conversion (SPWC) architecture. It reduces the number of converters significantly with efficient process and provides placement scheme of wavelength converters in the network. The proposed model utilizes the network with the assignment and routing of wavelength using dynamic process of assignment algorithm. The proposed model provides dynamic and static routing process with the range limit to have a minimum conversion for the same probabilities of blocking. The proposed system analysis and the simulation results show the better performances in faster coverage, minimum number of conversions, blocking probability improvement for high load.展开更多
The assessment of the completeness of earthquake catalogs is a prerequisite for studying the patterns of seismic activity.In traditional approaches,the minimum magnitude of completeness(MC)is employed to evaluate cata...The assessment of the completeness of earthquake catalogs is a prerequisite for studying the patterns of seismic activity.In traditional approaches,the minimum magnitude of completeness(MC)is employed to evaluate catalog completeness,with events below MC being discarded,leading to the underutilization of the data.Detection probability is a more detailed measure of the catalog's completeness than MC;its use results in better model compatibility with data in seismic activity modeling and allows for more comprehensive utilization of seismic observation data across temporal,spatial,and magnitude dimensions.Using the magnitude-rank method and Maximum Curvature(MAXC)methods,we analyzed temporal variations in earthquake catalog completeness,finding that MC stabilized after 2010,which closely coincides with improvements in monitoring capabilities and the densification of seismic networks.Employing the probability-based magnitude of completeness(PMC)and entire magnitude range(EMR)methods,grounded in distinct foundational assumptions and computational principles,we analyzed the 2010-2023 earthquake catalog for the northern margin of the Ordos Block,aiming to assess the detection probability of earthquakes and the completeness of the earthquake catalog.The PMC method yielded the detection probability distribution for 76 stations in the distance-magnitude space.A scoring metric was designed based on station detection capabilities for small earthquakes in the near field.From the detection probabilities of stations,we inferred detection probabilities of the network for diff erent magnitude ranges and mapped the spatial distribution of the probability-based completeness magnitude.In the EMR method,we employed a segmented model fitted to the observed data to determine the detection probability and completeness magnitude for every grid point in the study region.We discussed the sample dependency and low-magnitude failure phenomena of the PMC method,noting the potential overestimation of detection probabilities for lower magnitudes and the underestimation of MC in areas with weaker monitoring capabilities.The results obtained via the two methods support these hypotheses.The assessment results indicate better monitoring capabilities on the eastern side of the study area but worse on the northwest side.The spatial distribution of network monitoring capabilities is uneven,correlating with the distribution of stations and showing significant diff erences in detection capabilities among diff erent stations.The truncation eff ects of data and station selection aff ected the evaluation results at the edges of the study area.Overall,both methods yielded detailed descriptions of the earthquake catalog,but careful selection of calculation parameters or adjustments based on the strengths of diff erent methods is necessary to correct potential biases.展开更多
Maximize the resource utilization efficiency and guarantee the quality of service(QoS)of users by selecting the network are the key issues for heterogeneous network operators,but the resources occupied by users in dif...Maximize the resource utilization efficiency and guarantee the quality of service(QoS)of users by selecting the network are the key issues for heterogeneous network operators,but the resources occupied by users in different networks cannot be compared directly.This paper proposes a network selection algorithm for heterogeneous network.Firstly,the concept of equivalent bandwidth is proposed,through which the actual resources occupied by users with certain QoS requirements in different networks can be compared directly.Then the concept of network applicability is defined to express the abilities of networks to support different services.The proposed network selection algorithm first evaluates whether the network has enough equivalent bandwidth required by the user and then prioritizes network with poor applicability to avoid the situation that there are still residual resources in entire network,but advanced services can not be admitted.The simulation results show that the proposed algorithm obtained better performance than the baselines in terms of reducing call blocking probability and improving network resource utilization efficiency.展开更多
In this paper, we consider the optimal problem of channels sharing with het-erogeneous traffic （real-time service and non-real-time service） to reduce the data conflict probability of users. Moreover, a multi-dimens...In this paper, we consider the optimal problem of channels sharing with het-erogeneous traffic （real-time service and non-real-time service） to reduce the data conflict probability of users. Moreover, a multi-dimensional Markov chain model is developed to analyze the performance of the proposed scheme. Meanwhile, performance metrics are derived. Numerical results show that the proposed scheme can effectively reduce the forced termination probability, blocking probability and spectrum utilization.展开更多
In this paper, we discuss the relationship between the blocking probabilityand the configuration of storage hierarchy in a Video on Demand ( VoD) server using the queueingmodel we propose. With this model, the optimal...In this paper, we discuss the relationship between the blocking probabilityand the configuration of storage hierarchy in a Video on Demand ( VoD) server using the queueingmodel we propose. With this model, the optimal configuration of the storage system can be obtained .展开更多
The structure of multistage link systems and the calculation of their blocking probability arediscussed in the paper. The characteristics of SPC digital switching network are specially outlined. Thenby defining the mi...The structure of multistage link systems and the calculation of their blocking probability arediscussed in the paper. The characteristics of SPC digital switching network are specially outlined. Thenby defining the minimum pothset used in network graph, a general algorithm is developed to calculate theblocking probability of a complex network. Compared with traditioanl methods for calculating the block-ing probability, the algorithm derived in this paper is more sirnple, more effective and more easily realizedon computer, and is well worthy of being used practically.展开更多
We investigate the impact of network topology on blocking probability in wavelength-routed networks using a dynamic traffic growth model. The dependence of blocking on different physical parameters is assessed.
Compared to the traditional wavelength division multiplexing （WDM） optical networks with rigid and coarse granularities, flexible spectrum optical networks have high spectrum efficiency, which can support the servic...Compared to the traditional wavelength division multiplexing （WDM） optical networks with rigid and coarse granularities, flexible spectrum optical networks have high spectrum efficiency, which can support the service with various bandwidth requirements, such as sub and super channel. Among all network performance parameters, blocking probability is an important parameter for the performance evaluation and network planning in circuit^based optical networks including flexible spectrum optical networks. We propose an analytical method of blocking probability computation for flexible spectrum optical networks in this letter through mathematical analysis and theoretical derivation. Two blocking probability models are built respectively based on whether considering spectrum consecutiveness or not. Numerical results validate our proposed blocking probability models under different link capacity and traffic loads.展开更多
基金Founded by the National Natural Science Foundation of China (No.60502005).
文摘Time-slotted optical burst switched network is a potential technique to support IP over Wavelength Division Multiplexing (WDM) by introduce Time Division Multiplexing (TDM) channel to Optical Burst Switching (OBS) technology. This paper presents a framework to evaluate blocking performance of time-slot-ted OBS networks with multi-fiber wavelength channels. The proposed model is efficient for not only single class traffic such as individual circuit switch traffics or best-effort traffics but also mixed multi-class traffics. The effectiveness of the proposed model is validated by simulation results. The study shows that blocking per-formance of multi-fiber TS-OBS network is acceptable for future Internet services.
文摘The analysis of WDM (Wavelength-Division Multiplexing) optical network is essential to have the routed wavelength blocking probability with the conversion of wavelength using techniques. In this paper, an enhanced analytical model is proposed to evaluate the blocking performances in topology network and to improve the performances of reduction of blocking probability. The variation of probability is based on the wavelength and load used in the network. The conversion is carried out with the support of optical backbone of the inherent flexibility of the network using the proposed IMCA in Sparse-Partial Wavelength Conversion (SPWC) architecture. It reduces the number of converters significantly with efficient process and provides placement scheme of wavelength converters in the network. The proposed model utilizes the network with the assignment and routing of wavelength using dynamic process of assignment algorithm. The proposed model provides dynamic and static routing process with the range limit to have a minimum conversion for the same probabilities of blocking. The proposed system analysis and the simulation results show the better performances in faster coverage, minimum number of conversions, blocking probability improvement for high load.
基金funded by Director Fund of the Inner Mongolia Autonomous Region Seismological Bureau(No.2023GG02,2023MS05)the Inner Mongolia Natural Science Foundation(No.2024MS04021)。
文摘The assessment of the completeness of earthquake catalogs is a prerequisite for studying the patterns of seismic activity.In traditional approaches,the minimum magnitude of completeness(MC)is employed to evaluate catalog completeness,with events below MC being discarded,leading to the underutilization of the data.Detection probability is a more detailed measure of the catalog's completeness than MC;its use results in better model compatibility with data in seismic activity modeling and allows for more comprehensive utilization of seismic observation data across temporal,spatial,and magnitude dimensions.Using the magnitude-rank method and Maximum Curvature(MAXC)methods,we analyzed temporal variations in earthquake catalog completeness,finding that MC stabilized after 2010,which closely coincides with improvements in monitoring capabilities and the densification of seismic networks.Employing the probability-based magnitude of completeness(PMC)and entire magnitude range(EMR)methods,grounded in distinct foundational assumptions and computational principles,we analyzed the 2010-2023 earthquake catalog for the northern margin of the Ordos Block,aiming to assess the detection probability of earthquakes and the completeness of the earthquake catalog.The PMC method yielded the detection probability distribution for 76 stations in the distance-magnitude space.A scoring metric was designed based on station detection capabilities for small earthquakes in the near field.From the detection probabilities of stations,we inferred detection probabilities of the network for diff erent magnitude ranges and mapped the spatial distribution of the probability-based completeness magnitude.In the EMR method,we employed a segmented model fitted to the observed data to determine the detection probability and completeness magnitude for every grid point in the study region.We discussed the sample dependency and low-magnitude failure phenomena of the PMC method,noting the potential overestimation of detection probabilities for lower magnitudes and the underestimation of MC in areas with weaker monitoring capabilities.The results obtained via the two methods support these hypotheses.The assessment results indicate better monitoring capabilities on the eastern side of the study area but worse on the northwest side.The spatial distribution of network monitoring capabilities is uneven,correlating with the distribution of stations and showing significant diff erences in detection capabilities among diff erent stations.The truncation eff ects of data and station selection aff ected the evaluation results at the edges of the study area.Overall,both methods yielded detailed descriptions of the earthquake catalog,but careful selection of calculation parameters or adjustments based on the strengths of diff erent methods is necessary to correct potential biases.
文摘Maximize the resource utilization efficiency and guarantee the quality of service(QoS)of users by selecting the network are the key issues for heterogeneous network operators,but the resources occupied by users in different networks cannot be compared directly.This paper proposes a network selection algorithm for heterogeneous network.Firstly,the concept of equivalent bandwidth is proposed,through which the actual resources occupied by users with certain QoS requirements in different networks can be compared directly.Then the concept of network applicability is defined to express the abilities of networks to support different services.The proposed network selection algorithm first evaluates whether the network has enough equivalent bandwidth required by the user and then prioritizes network with poor applicability to avoid the situation that there are still residual resources in entire network,but advanced services can not be admitted.The simulation results show that the proposed algorithm obtained better performance than the baselines in terms of reducing call blocking probability and improving network resource utilization efficiency.
基金supported in part by the National Natural Science Foundation of China(60972016,61231010)the Funds of Distinguished Young Scientists(2009CDA150)+1 种基金China-Finnish Cooperation Project(2010DFB10570)Specialized Research Fund for the Doctoral Program of Higher Education(20120142110015)
文摘In this paper, we consider the optimal problem of channels sharing with het-erogeneous traffic （real-time service and non-real-time service） to reduce the data conflict probability of users. Moreover, a multi-dimensional Markov chain model is developed to analyze the performance of the proposed scheme. Meanwhile, performance metrics are derived. Numerical results show that the proposed scheme can effectively reduce the forced termination probability, blocking probability and spectrum utilization.
文摘In this paper, we discuss the relationship between the blocking probabilityand the configuration of storage hierarchy in a Video on Demand ( VoD) server using the queueingmodel we propose. With this model, the optimal configuration of the storage system can be obtained .
文摘The structure of multistage link systems and the calculation of their blocking probability arediscussed in the paper. The characteristics of SPC digital switching network are specially outlined. Thenby defining the minimum pothset used in network graph, a general algorithm is developed to calculate theblocking probability of a complex network. Compared with traditioanl methods for calculating the block-ing probability, the algorithm derived in this paper is more sirnple, more effective and more easily realizedon computer, and is well worthy of being used practically.
文摘We investigate the impact of network topology on blocking probability in wavelength-routed networks using a dynamic traffic growth model. The dependence of blocking on different physical parameters is assessed.
基金supported by the National"863"Program of China(No.2012AA011301)the National"973"Program of China(No.2010CB328204)+3 种基金the National Natural Science Foundation of China(Nos.61271189 and 61201154)the Research Fund for the Doctoral Program of Higher Education of China(No.20120005120019)the Beijing Youth Elite Project for Universities,the Fundamental Research Funds for the Central Universities(No.2013RC1201)the Fund of State Key Laboratory of Information Photonics and Optical Communications(BUPT)
文摘Compared to the traditional wavelength division multiplexing （WDM） optical networks with rigid and coarse granularities, flexible spectrum optical networks have high spectrum efficiency, which can support the service with various bandwidth requirements, such as sub and super channel. Among all network performance parameters, blocking probability is an important parameter for the performance evaluation and network planning in circuit^based optical networks including flexible spectrum optical networks. We propose an analytical method of blocking probability computation for flexible spectrum optical networks in this letter through mathematical analysis and theoretical derivation. Two blocking probability models are built respectively based on whether considering spectrum consecutiveness or not. Numerical results validate our proposed blocking probability models under different link capacity and traffic loads.
