Blocking in wavelength-routed all-optical WDM network with or without wavelength conversion

The blocking probability in wavelength-routed all-optical networks is a very important measure of performance of the network. This blocking probability can be affected by many factors such as network topology, traffic load, number of links, algorithms employed and whether wavelength conversion is available or not. In this paper we have proposed a mathematical model to reduce the blocking probability of the WDM optical network for both wavelength convertible networks as well as for wavelength non-convertible networks. The model is can be used to evaluate the blocking performance of any network topology also it can be useful to improve its performance of the given network topology.     

Performance analysis of traffic groomed optical network

In this paper we carry out the performance analysis of traffic groomed multilayer optical networks. It is seen that the number of wavelength channels required decreases as the wavelength grooming factor increases. We have evaluated blocking probability for different load and grooming factor. The performance of the network has been evaluated for different conditions; first for fixed number of links with grooming factor set to 3 and subsequently with increase in grooming factor up to 18 in steps. The load on each link is selected as 2, 5, 9, 12, 15 and 20 Erlangs and the blocking probability as function of number of optical channels has been evaluated. In this work the effect of number of wavelength channels, traffic load and grooming factor on network blocking probability has been studied. The investigation reveals that the blocking probability decreases with increase in wavelength channels. Similarly we found that the blocking probability increases with increase in traffic load which is quite evident. Further it is shown that when the grooming factor is increased to significant value (16), the number of wavelengths requirement (8) becomes relatively stable.     

Blocking probability analysis model for flexible spectrum optical networks

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.     

Blocking probability calculation in wavelength-routed all-optical networks

In this paper we have proposed a mathematical model to reduce the blocking probability of the WDM optical network. The mathematical model proposed has a closed-form expression and does not require simulated statistics, it has low implementation complexity and the computation is quite efficient. This model suggests us to choose the best path and appropriate number of free wavelengths in the network. We can go for the compromise between the path length and number of free wavelength. The model is also used to evaluate the blocking performance of NSFNet topology and hence used to improve its performance.     

Blocking in wavelength-routed all-optical WDM networks

In this paper, we have developed a low complexity mathematical model which is used for the calculation of blocking probability of network and this model does not require any simulation statistics. The implementation of the model proposed has less complexity and the computation used in this model is quite efficient. This paper suggests an optimum path as a solution to routing problem and the appropriate number of wavelengths have also been suggested which should be free in a network to have the least blocking probability. This model can be implemented on different network topologies. Further, the model is also used to evaluate the blocking performance of NSFNet topology and hence used to improve its performance on the basis of blocking probability.     

Generic-II routing and wavelength assignment algorithm for a wavelength-routed WDM network

In this paper, we have developed a Generic routing and wavelength assignment algorithm (Generic RWA-II) which is used for the calculation of blocking probability of network. A simple mathematical model has also been proposed for the optimization and minimization of blocking probability. The implementation of the proposed model and algorithm has less complexity and the computation used in this model is quite efficient. This paper suggests an optimum path and assigns wavelength to that path, as a solution to routing and wavelength assignment problem to have least blocking probability. This model can be implemented on different network topologies. Further, the model is also used to evaluate the blocking performance of a 6-node simple network topology and hence used to improve its performance on the basis of blocking probability.     

Generic routing and wavelength assignment algorithm for a wavelength-routed WDM network

In this paper, we have developed a simple mathematical model which is used for the calculation of blocking probability of network. A generic routing and wavelength assignment algorithm has also been proposed for the optimization and minimization of blocking probability. The implementation of the proposed model has less complexity and the computation used in this model is quite efficient. This paper suggests an optimum path and assigns wavelength to that path, as a solution to routing and wavelength assignment problem to have least blocking probability. This model can be implemented on different network topologies. Further, the model is also used to evaluate the blocking performance of a 6-node simple network topology and hence used to improve its performance on the basis of blocking probability.     

Blocking probability analysis of survivable routing in WDM optical networks with/without sparse-wavelength conversion

In this paper, a new algorithm for wavelength assignment has been proposed and its performance is evaluated in terms of blocking probability and fairness. It has been shown that the proposed algorithm offers the least blocking probability. The blocking performance of wavelength division multiplexing (WDM) network has been analyzed for the network having 10 nodes and for varying loads. As the load per link (in Erlangs) increases, the blocking probability increases. The result shows that the performance of first-fit algorithm is better than random algorithm whereas the proposed algorithm offers the least blocking.     

Routing and wavelength assignment in wavelength-routed all-optical WDM networks

In this paper, low-complexity mathematical model has been developed which is used for the calculation of the blocking probability of network and this model does not require any simulation statistics. The implementation of the model proposed has less complexity and the computation used in this model is quite efficient. The routing algorithm has also been proposed in this paper depending upon the proposed model, which is very efficient in calculation and minimization of the blocking probability. This algorithm suggests an optimum path as a solution to routing problem. The wavelength assignment technique has also been suggested in this paper to minimize the blocking probability. The proposed model and algorithms can be implemented on different network topologies. Furthermore, the model, routing algorithm and wavelength assignment technique is also used to evaluate the blocking performance of NSFNet and EUPAN Network topology and hence used to improve its performance on the basis of the blocking probability.     

Performance optimization of GMPLS networks with finite number of sources

The performance of GMPLS network depends upon the various parameters such as number of channels, number of sources, traffic intensity etc. In this paper we have proposed a call blocking model for mode of operation to determine the type of applications suitable for GMPLS networks. Further we have suggested a switch model for GMPLS network and developed a mathematical model for GMPLS network for call blocking probability and call holding probability. In proposed model blocking probability of the network is reduced and then the call blocking performance of the model is compared with the call holding performance.     

Performance analysis of topologies for optical wavelength convertible networks

An architecture of wavelength converters shared per-node wavelength cross-connects is proposed to function the optical node in simulation. And first-fit wavelength allocation algorithm and Dijkstra shortest path routing algorithm are used. It is shown that star topology performs the best on blocking probability, average hop count and average packet delay, but it is unfavorable on link utilization. Furthermore, wavelength conversion is not ideal for the star topology. However, the ring topology network is the cost-optimal one if the appropriate wavelength conversion capability in network is to be considered.     

有业务量疏导能力的WDM网格网阻塞性能分析

提出一个新分析模型来计算有业务量疏导能力的波分复用(WDM)网格网的呼叫阻塞概率,WDM网络中的业务量疏导定义为复用、解复用和交换低速率业务量到高容量光路的行为.该模型首先把原始网络分解为单个子系统,然后再对这些子系统进行独立分析,最后对这些子系统的结果进行适当组合得到整个网络的解.同时,模型考虑了链路负载和链路阻塞事件之间的相关性.仿真结果表明该模型给出的结果较准确.     

The Trade-Offs between Optimality and Feasibility in Online Routing with Dedicated Path Protection in Elastic Optical Networks

The article discusses an online problem of routing and spectrum allocation with dedicated path protection in elastic optical networks. We propose three novel algorithms to solve this problem. The first of them is the minimum-cost–maximum-flow heuristic algorithm, which calculates the solution assuming that the spectrum units on the working and dedicated backup path are the same. Such an assumption, on the one hand, increases the bandwidth blocking probability; however, on the other hand, it enables a simple, cheap and fast way to connect customers to the network during the implementation phase of elastic optical networks. The next two algorithms, which determine the exact solutions, are based on the branch and bound method. The first calculates the working and dedicated backup paths with the minimum total occupied bandwidth, called the total cost, while the second calculates the paths with the minimum total length. These algorithms enable the performance evaluation of the proposed heuristic algorithm and provide the answer as to what should be optimized, the total cost or the total length of paths, in order to minimize the bandwidth blocking probability. Extensive simulation research has shown that the proposed heuristic algorithm can be used in elastic optical networks, but with a small network load. Moreover, it is shown that the optimization of the total cost of paths provides a slightly lower blocking probability than the optimization of the total length of paths.     

基于OPNET的星地光网络性能测试仿真平台研究

为了测试星地光网络的性能,设计了一种基于OPNET的星地光网络性能测试仿真平台。介绍了平台的总体技术架构,探讨了星间链路建立的条件。采用最大接入仰角与最长服务时间加权的方式,完成星地链路的卫星接入服务;按照切换呼叫优先的策略完成业务传输中的卫星切换服务,确保星地链路不间断的通信能力。根据最小链路代价和首次命中原则,实现星地光网络的路由与波长的动态分配。最后,利用平台的OPNET软件测试了三种星座下的星地光网络性能,测试结果表明：在LEO、MEO和GEO星座下,星地光网络的网络阻塞率分别为10%、40%和54%,平均网络时延分别为0.1s、0.07s和0.054s。测试结果对星地光网络的工程应用具有一定的指导意义。     

Routing and wavelength assignment in WDM networks with dynamic link weight assignment

We consider the routing and wavelength assignment problem on wavelength division multiplexing networks without wavelength conversion. When the physical network and required connections are given, routing and wavelength assignment (RWA) is the problem to select a suitable path and wavelength among the many possible choices for each connection such that no two paths using the same wavelength pass through the same link. In wavelength division multiplexing (WDM) optical networks, there is need to maximize the number of connections established and to minimize the blocking probability using limited resources. In this paper, we have proposed three dynamic link weight assignment strategies that change the link weight according to the traffic. The performance of the existing trend and the proposed strategies is shown in terms of blocking probability. The simulation results show that all the proposed strategies perform better than the existing trend.     

Performance enhancement of optical burst switched networks

Optical burst switching (OBS) is an optical switching paradigm which offers a good tradeoff between the traditional optical circuit switching (OCS) and optical packet switching (OPS) since it has the relatively easy implementation of the first and the efficient bandwidth utilization of the second. Hence, OBS is a promising technology for the next generation optical Internet. A buffer-less OBS network can be implemented using ordinary optical communication equipment without the need for either wavelength converters or optical memories. In an OBS network, burst-loss performance is a critical concern. In OBS, the data-burst transmission is delayed by an offset time (relative to its burst control packet (BCP), or header) and the burst follows its header without waiting for an acknowledgment for resource reservation. Thus, a burst may be lost at an intermediate node due to contention, which is generally resolved according to the local routing and bandwidth information. The routing table maintained in each OBS node is generally pre-computed and fixed to forward the data bursts. Such a static forwarding feature might have limited efficiency to resolve contentions. Moreover, a burst may be lost and the network may be congested when a network element (e.g., fiber link) fails. In this paper, an efficient integrated scheme based on dynamic routing and burst segmentation has been proposed to improve reliability of data transport and network load balancing in optical burst switched networks. Simulation results demonstrate that the proposed approach reduces effectively blocking probability and hence contention. Further, it provides end-to-end throughput performance also. Hence, it establishes an appropriate tradeoff between loss rate and end-to-end throughput.     

Optimal design of virtual topology reconfiguration in WDM optical networks

Virtual topology of WDM optical networks is often designed for some specific traffic matrix to get the best network performance. When traffic demand imposed on WDM optical networks changes, the network performance may degrade and even become unacceptable. So virtual topology need to be reconfigured. In previous works, virtual topology is reconfigured to achieve the best network performance, in which a large number of lightpaths need to be set up or torn down. In this paper, we try to get a tradeoff between the network performance and traffic disruption (or implementing cost). The problem of virtual topology reconfiguration for changing traffic patterns is formulated as an optimization problem and a mixed integer linear programming (MILP) algorithm is presented. Numerical results show that a large cost reduction of reconfiguration can be achieved at the expense of network performance.     

Blocking and delay performance for differential output-ports choosing probability scheme applied optical burst switching network

Differential output-ports choosing probability (DOCP) scheme is a novel traffic outputting model for core router in optical burst switching (OBS) network. In this paper, we provide an analytical model for studying the performance of traffic blocking and delay in DOCP-applied OBS network. We first evaluate blocking probabilities using DOCP and confirm it by simulation. Then, in optical buffer-equipped OBS core router, we consider the average delay time for buffered traffic and the average total traffic queueing length in core router. The knowledge of delay performance is useful for the optical buffer architecture configuration in differential traffic scenario. Several results indicate that, under the same load condition, the blocking probabilities and the delay time will change along with the changeable ports choosing probability and the ratio between different length bursts in the OBS system.     

三阶多粒度光交叉连接的优化设计研究

在采用密集波分复用技术的骨干网中,通过建立动态多粒度业务模型对由大粒度（光纤和波带）和小粒度（波长）组成的三阶多粒度光交叉连接所构成的节点的网络特性（阻塞概率和带宽阻塞比）进行了研究和仿真分析,并由此对三阶多粒度节点的结构参数和网络中的系统参数进行了优化设计.从仿真结果可以看出,所提出来的优化设计方案能够显著的减少节点结构的复杂度并改善阻塞性能,从而减小了网络中设备的规模和成本.     

Impact of Wavelength-Routed Network Physical Topology on Blocking Probability Using a Dynamic Traffic Growth Model

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.