Resource Allocation Using SPA Based on Different Cost Functions in Elastic Optical Networks

DOI: 10.4236/jcc.2019.710002   PDF   HTML   XML   144 Downloads   366 Views  


Routing, modulation and spectrum allocation in elastic optical networks is a problem aiming at increasing the capacity of the network. Many algorithms such as shortest path algorithm can be used as the routing section of this problem. The efficiency of these algorithms is partly based on how the cost of each link is defined. In this study, we considered several basic metrics in cost of network links and compared their effects on the network capacity. In particular, the static costs and the dynamic costs were evaluated and compared. For dynamic scenarios, compared to static scenarios, at least one additional factor, the usage of the links, was added. We further considered a new factor that is based on probability of accommodating the signal at a given time in any given link. The results show that, among them, the shortest path algorithm provides the least blocking probability when the cost is a combination of link length and the abovementioned possibility/usage of the link.

Share and Cite:

Tarhani, M. , Sarkar, S. , Eghbal, M. and Shadaram, M. (2019) Resource Allocation Using SPA Based on Different Cost Functions in Elastic Optical Networks. Journal of Computer and Communications, 7, 14-20. doi: 10.4236/jcc.2019.710002.

1. Introduction

Ever increasing need for higher traffic resulting from the emerging applications has motivated new research to increase the capacity of data networks [1] [2]. Elastic Optical Networks has been shown to be a good alternative for its counterpart Wavelength Division Multiplexing (WDM) because of not only higher capacity but also its flexibility and suitability for variable datarate traffics, one of the characteristics of the new data networks [3]. Orthogonal frequency multiplexing and intelligent client node, adaptive transmission and flexible grids are the characteristics of the Elastic optical Networks [4]. This new networking method has its own constraints as well. In particular, wavelength continuity constraint requires that no frequency conversion is allowed over the path connecting a given pair of source and destinations. Further, wavelength contiguity constraint requires that all frequency slots dedicated for signal transferring the data between a sender and a receiver must be adjacent [3]. These are the reasons that all the previously worked algorithms for the wavelength division multiplexing need to be reinvestigated and adjusted to be efficient in EONs [4]. Routing, modulation and spectrum allocation (RMSA) is the main problem in EON aiming at making the resource allocation very efficient toward higher capacity and less resource utilization [5]. To determine the path between a source and a destination there can be two general approaches [5] [6] [7]. First, a path (or a group of paths) is determined in advance of the network operation and this will be the only path between the pair whenever a new demand arrives at network requiring transferring the data between them. Contrary to this static approach, in the other group of routing algorithms, the algorithm dynamically searches and finds a route based on the current state of the network and hence different routes may be found and used in different times and in different states of the network. For both approaches, one of the simple and efficient algorithms that are commonly used (e.g., [8] [9] [10] ) is shortest path algorithm (SPT). This algorithm receives the graph of the network with weighted edges (the weights are the costs that will be defined on each link) and finds a route that has the least total cost. Therefore the route and hence the efficiency of SPT depend partly on what factors have been considered to define the cost of the links.

In this paper we consider some of the basic factors in both static and dynamic scenarios and compare their effects on the capacity of the networks. Last but not the least, we consider three basic functions (linear, quadratic and square root) to represent three general ways of merging the factors involved in defined the cost and evaluate their effect on the performance of the network.

The rest of the paper is organized as follows. Section 2 provides the network model considered in this work. Section 3 describes the costs that are supposed to be evaluated. The results of the simulations are provided in Sections 4 and finally Section 5 concludes the paper.

2. Network Model

We assume that bidirectional fiber links connect the nodes of the network. Full range optical spectrum in each link is 180 continuous frequency slices in which the central wavelength spacing is 12.5 GHZ. Demands can arrive to the network at any time and the source, destination and its required bitrate are random and unknown prior to arrival of the demand. The requested datarate varies from 1 to 50 GB/s, from demand to demand but is fixed for any given demand during the serving time. The modulation techniques that we consider in this paper include Binary Phase Shift keying (BPSK), quadrature phase shift keying (QPSK), 8-quadrature amplitude modulation 8 QAM, and 16 QAM. The maximum datarates per frequency slice they can support and the maximum supported distance under which each modulation techniques can deliver signal with acceptable SNR are given [11] in Table 1.

Network is assumed to be transparent. In other words, optical bypass is carried out in all intermediary nodes. For each path the algorithm employs a modulation format that can provide the maximum possible spectral efficiency as long as its length does not exceed the maximum distance supported by the corresponding modulation technique. The number of required frequency slices, for instance, for a

demand with 40 GB/s is 3, ( 40 25 + 1 > 2 ), if the modulation techniques QPSK is used (one slice is allocated for guard band).

3. Examined Costs

1) Link Length: This is a static cost because the length of the link does not change with network operation and the cost will remain the same regardless of the traffic in the network. The selected path by this cost will have the shortest length (total fiber lengths) and therefore most efficient modulation technique can be applied which means least possible number of frequency slices will be required for the signal over the path. However, there will not be a guarantee if the considered path will have enough available continuous frequency slices because the link cost does not consider the utilization of the link.

2) Unity: This is another static cost in which cost of all links are equal to one. If the modulation level employed ever the path by this cost is the same as the one with Link Length as the cost and the path are not the same then the resource utilization in this path is less because the number of links involved are less. However, similar to the previous one, this cost does not incorporate any information about the current usage of the links.

3) Distance/unity and usage of the link: This cost is dynamic in that the cost of the link can change from demand to demand because the usage of the link can be different in different times. This cost tries to merge both efficiency in spectral usage and also the uniformity of the resource utilization.

4) Distance/link and the probability of accommodating a signal in a link: The second part of this cost tries to not only create uniformity of resource utilization but also find a path that actually has the maximum chance to accommodate the signal for the given demand. For instance, suppose that a frequency slot that is available to use is surrounded by two frequency slots that are already in use by

Table 1. Reach (in km) and maximum datarates (Gb/s).

previous demands. For a demand that requires a minimum of three slots this slot should not be considered as available because of the wavelength contiguity constraint. The probability in this cost is simply the fraction of the total frequency slots in the link that not only are available but also can be used for a particular demand.

5) Cost Functions: The functions that merge the above mentioned metrics can also affect the performance of the networks. For the factors in Section 3 we define cost C as follows:

C = L + α u 2 (1)

where L is the normalized length of the link, u s the usage or the number of used slices over total number of slices in the link and α is a tanning coefficient. This quadratic term adds to the cost of the link especially when the link is about to be fully occupied the other two costs have linear and square root term to include the usage u as follows:

C = L + α u (2)

C = L + α u (3)

As we mentioned we will evaluate the effects of these three functions separately. When comparing the effect of the metrics we use L , 1, L + α u , and p + α u (the possibility defined in Section 4) respectively to consider the effects of metrics in Section 1-4.

4. Simulation Results

In this section we evaluate the Shortest Path Algorithm for described cost functions in terms of blocking probability and per served demand transceiver usage. A smaller blocking probability of a technique means that the network can serve a higher number of requests compared to a technique with higher blocking probability which means the former technique has higher capacity. This is while the transceiver use measure shows how much on average the resources are used for stablishing a path between a pair of receiver and sender. For example for two techniques with the same blocking probabilities it may be reasonable to select one that has smaller transceiver usage. In the experiments, the distribution of the demands is randomly produced by a Poison distribution with λ = 10 and the duration of the demands follows an exponential distribution with variable μ to represent different traffic loads. The experiments are under two different networks namely US Backbone network, and NSFnet network shown in Figure 1. The results have been produced by using simulation using MATLAB. For each load in each cost we ran the network for 10,000 demands to provide enough accuracy.

Figure 2(a) and Figure 3(a) show the blocking probability of the shortest path Algorithm using the metrics, length link (LL), unity (U), link length and link usage (LLU), and link length and probability of accommodating (LLP) as defined in Section 3. As it can be seen, the dynamic metrics (LLU and LLP) have less blocking probability compared to static ones (LL and U). As an example in Figure 2, the algorithm can support loads with 30 and 42 Erlangs to have

Figure 1. Topologies, (top) NSFNet network, (bottom) US Backbone network.

Figure 2. Performance (a) and resource utilization (b) of SPT using different cost metrics.

Figure 3. Performance (a) and resource utilization (b) of SPT using different cost metrics.

Figure 4. Performance of SPT using (1)-(3).

blocking probabilities of no more than one percent using metric U and LLP respectively which means that using the same algorithm (SPA) with LLP metric increases the capacity by nearly 40 percent compared to the case where U is used as the metric. Also, for static metrics, depending on the network, one of the metric is better than the other. Another observation is that the number of used transceivers per served demands (Figure 2(b) and Figure 3(b)) in dynamic metrics is higher compared to static metrics which also implies that the route that is selected by them is not the one with the least resource requirements. In other word, when the link cost is only length of the link the path between sender and the receiver will be the minimum, compared to those of other metrics. Therefore the most efficient and applicable modulation format (according to Table 1) may be different than that of other techniques, hence, requires less transceivers (and less frequency slots per link) in the source and the destination. In fact, the reason that they have better total performance is that they use the resources more uniformly across the network and, hence, there is a smaller probability of lacking enough adjacent frequency slots over a path for any particular demand.

Figure 4 shows the blocking probability of the US backbone network under the cost defined by (1), (2), and (3) respectively. As we expected, the linear function has slightly less blocking probability the (3) has the slightly higher blocking probability.

5. Conclusion

In this paper we examined the effect of different cost metrics on the blocking probability of two networks using the shortest path algorithm (SPT). The simulations results show that the dynamic metrics that take into account the resource utilization of the links can result in less total blocking probability although for any particular demand their selected path may not be one with the least resource requirements.

Conflicts of Interest

The authors declare no conflicts of interest regarding the publication of this paper.


[1] Simmons, J.M. (2014) Optical Network Design and Planning. 2nd Edition, Springer, New York.
[2] Shieh, W., Yi, X. and Tang, Y. (2007) Transmission Experiment of Multi-Gigabit Coherent Optical OFDM Systems over 1000 km SSMF Fiber. Electronics Letters, 43, 183-184.
[3] Jinno, M., Takara, H., Kozicji, B., Tsukishima, Y., Sone, Y. and Matsuoka, S. (2009) Spectrum-Efficient and Scalable Elastic Optical Path Network: Architecture, Benefits, and Enabling Technologies. IEEE Communications Magazine, 47, 66-73.
[4] Gerestel, O., Jinno, M., Lord, A. and Yoo, S.J.B. (2012) Elastic Optical Networking: A New Dawn for the Optical Layer? IEEE Communications Magazine, 50, s12-s20.
[5] Valesco, L., Vela, A.P., Morales, F. and Ruiz, M. (2017) Designing, Operating and Reoptimization Elastic Optical Networks. Journal of Lightwave Technology, 35, 513-526.
[6] Lopez, V. and Velasco, L. (2016) Elastic Optical Networks, Architectures, Technologies and Control. Springer, Berlin.
[7] Byranvand, H. and Salehi, J.A. (2013) A Quality-of-Transmission Aware Dynamic Routing and Spectrum Assignment Scheme for Future Elastic Optical Networks. Journal of Lightwave Technology, 31, 3043-3054.
[8] Moharrami, M., Fallahpour, A., Beyranvand, H. and Salehi, J. (2017) Resource Allocation and Multicast Routing in Elastic Optical Networks. IEEE Transactions on Communications, 65, 2101-2113.
[9] Fan, Z., Li, Y., Shen, G. and Chan, C.C. (2017) Distance-Adaptive Spectrum Resource Allocation Using Subtree Scheme for All-Optical Multicasting in Elastic Optical Networks. Journal of Lightwave Technology, 35, 1460-1468.
[10] Yang, L., Gong, L., Zhou, F., Cousin, B., Molnar, M. and Zhu, Z. (2015) Leveraging Light Tree with Rateless Network Coding to Design Efficient All-Optical Multicast Schemes for Elastic Optical Networks. Journal of Lightwave Technology, 33, 3945-3955.
[11] Bocoi, A., Schuster, M., Rambach, F., Kiese, M., Bunge, C. and Spunnler, B. (2009) Reach-Dependent Capacity in Optical Networks Enabled by OFDM. Optical Fiber Communication Conference, San Diego, 22-26 March 2009, 1-3.

comments powered by Disqus

Copyright © 2020 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.