Reduction of Blocking Probability in Generalized Multi-Protocol Label Switched Optical Networks

2019 ◽  
Vol 0 (0) ◽  
Author(s):  
Monika Dhawan ◽  
Simranjit Singh ◽  
Amit Wason

AbstractThe blocking probability is studied for improving the quality of service of the network. The call blocking model for mode of operation to determine the types of applications suitable for Generalized Multi-Protocol Label Switched (GMPLS) networks is proposed. The performance of optical network depends upon various parameters such as number of channels, number of sources, traffic intensity which directly affect the blocking probability of the network. A mathematical model of an optical network for blocking probability of cleared calls and holding calls is developed. In the proposed model, blocking probability of the network gets reduced with a large number of servers. The proposed models decrease the blocking probability of the network to a level of 10–40. In addition, the blocking performance for held calls is also analyzed to compare the amount of traffic intensity that can be handled and completed properly with that of the cleared calls probability. The blocking probability is less for cleared calls than that for held calls as more traffic intensity can be handled in case of cleared calls but the chances for call completion increases in case of held calls.

Current research interests have diverted towards the efficient priority-based routing and wavelength assignment strategy in order to enhance the quality of service in the distributed optical networks. The traditional RWA techniques such as Adaptive Routing (AR), Non priority based RWA schemes etc. are lacking of capability to reduce both the blocking probability and average end to end delay simultaneously during the transmission of networks. In this paper, an Adaptable Priority-based RWA (APRWA) schemes for optical network has been demonstrated and evaluated by utilizing the performance enhancing metric such as reduction in hop count while simultaneously handling distinguishable traffic volume. The simulation result shows considerable reduction both in the blocking probability (approx. 25%) as well as in average end to end delay near around (15 msec.) in comparison to conventional RWA techniques.


2021 ◽  
Author(s):  
Feng Wang ◽  
Qingcheng Zhu ◽  
Xiaolong Li ◽  
Jiaming Gu ◽  
Zhenhua Yan ◽  
...  

Mixed-grid optical networks are in a migration state where fixed-grid and flex-grid optical networks coexist. To carry point-to-multipoint (P2MP) services in mixed-grid optical networks, routing and resource allocation (RRA) problems need to be solved. Once the RRA fails, services will be blocked and then influence quality of service. The minimized spectrum for satisfying the bandwidth request of services is called as a frequency block (FB). For a service, the total number of available FBs embodies the spectrum availability on a link. Because the fixed-grid and flex-grid links have different channel spacing, spectrum availability on fixed-grid and flex-grid links needs different evaluation method. We propose a RRA algorithm in mixed-grid optical networks for P2MP services by being aware of spectrum availability. The spectrum availability is evaluated according to fixed-grid and flex-grid constraints. Our proposed algorithm achieves the lower blocking probability (BP) than that of benchmark RRA algorithms according to simulation results.


2021 ◽  
Author(s):  
Selvakumar S ◽  
S S Manivannan

Abstract The rapid growth of the technologies, high bandwidth applications and cloud data centers consume heavy internet service. So, the consumer of the internet expects a high capacity medium for communication. The Elastic Optical Network (EON) provides a flexible and reliable transmission service for the consumers. The spectrum fragmentation is a key challenge in EON. In simple terms, unaligned Frequency Slots (FSs) in the network are referred to as fragmented spectrum, while in defragmentation, the available FSs need to be rearranged to create room for the new connection requests. The problem in defragmentation occurs due to the lack of a continuous spectrum and it leads to depreciation in spectrum usage and simultaneously increasing the Blocking Probability (BP) which disrupts the majority of the existing connections in the network. Several techniques and approaches were suggested to reduce the possibility of disruption and reconfiguration in the network while defragmenting the frequency slots. This paper proposes a new algorithm to overcome the drawbacks and improvement in the quality of service of the network. The proposed algorithm holds the approach of proactive and reactive along with the meta-heuristic nature-inspired optimization technique called Jellyfish Search Optimization (JSO). The proposed combination, PR-DF-JFSO outperforms well in terms of spectrum utilization, network efficiency, and quality of service offered when compared to the state-of-the-art spectrum defragmentation algorithms according to the results of experiments done using standard quality metrics.


2019 ◽  
Vol 0 (0) ◽  
Author(s):  
Ashok Kumar ◽  
V. K. Banga ◽  
Amit Wason

AbstractPassive optical network (PON)-supported orthogonal frequency-division multiplexing is viewed as a capable answer designed for subsequent generation optical networks in terms of traffic coloring when integrated with monarch butterfly optimization (MBO). Traffic coloring optimization (TCO) or MBO algorithmic rule solves the matter of controlling the traffic, began by end-user transceivers with multiple parameters through rescheduling transmission capacity and bandwidth allocation strategy of the optical network, which are done by means of its operator functions. The TCO method with granularity adjustment components outcome signifies an improvement in quality of service as it reduces jitter and increases throughput in PON by 350 µs and 12.5 %, respectively. It even improves the blocking probability and fairness index.


2018 ◽  
Vol 0 (0) ◽  
Author(s):  
Sandeep Goel ◽  
Ranjit Kaur ◽  
Amit Wason

AbstractThe call blocking is the most vital factor in generalized multiprotocol label switching (GMPLS) Networks. Call blocking depends upon many factors such as traffic intensity, number of servers and number of links. Call blocking performance for GMPLS networks has been calculated in this paper by using a proposed mathematical model. The proposed model investigates the dependency of probability of call blocking upon the number of wavelengths and number of links. In the suggested model, the blocking performance of GMPLS network is improved.


2006 ◽  
Vol 14 (26) ◽  
pp. 12679 ◽  
Author(s):  
Chee Kheong Siew ◽  
Daojun Xue ◽  
Yang Qin ◽  
Jens Schmitt

Sign in / Sign up

Export Citation Format

Share Document