Machine Learning-Assisted Least Loaded Routing to Improve Performance of Circuit-Switched Networks

04/03/2018
by   Gangxiang Shen, et al.
0

The Least Loaded (LL) routing algorithm has been in recent decades the routing method of choice in circuit switched networks and therefore it provides a benchmark against which new methods can be compared. This paper improves the performance of the LL algorithm by additionally incorporating a machine learning approach, using a conceptually simple supervised naïve Bayes (NB) classifier. Based on a sequence of historical network snapshots, this predicts the potential future circuit blocking probability between each node pair. These snapshots are taken for each service request arriving to the network and record the number of busy capacity units on each link at that instant. The candidate route for serving a current service request is based on both the link loads and the potential future blocking probability of the entire network in case this route is indeed used. The performance of this proposed approach is studied via simulations and compared with both the conventional LL algorithm and the Shortest Path (SP) based approach. Results indicate that the proposed supervised naïve Bayes classifier-assisted LL routing algorithm significantly reduces blocking probability of service connection requests and outperforms both the conventional LL and SP routing algorithms. To enable the learning process based on a large number of network snapshots, we also develop a parallel computing framework to implement parallel learning and performance evaluation. Also, a network control system supporting naïve Bayes classifier-assisted LL routing algorithm is addressed.

READ FULL TEXT
research
09/10/2019

Resource allocation using SPA based on different cost functions in elastic optical networks

Routing, modulation and spectrum allocation in elastic optical networks ...
research
07/11/2013

Soft Computing Framework for Routing in Wireless Mesh Networks: An Integrated Cost Function Approach

Dynamic behaviour of a WMN imposes stringent constraints on the routing ...
research
05/17/2022

Opportunistic Routing in Quantum Networks

Unlike classical routing algorithms, quantum routing algorithms make use...
research
08/27/2012

Distributed Pharaoh System for Network Routing

In this paper it is introduced a biobjective ant algorithm for construct...
research
08/25/2023

A Comparative Study on Routing Selection Algorithms for Dynamic Planning of EONs over C+L Bands

The performance of three routing selection algorithms is compared in ter...
research
06/24/2020

Circuit Routing Using Monte Carlo Tree Search and Deep Neural Networks

Circuit routing is a fundamental problem in designing electronic systems...
research
07/08/2019

Mitigating Censorship with Multi-Circuit Tor and Linear Network Coding

Anonymity networks are providing practical mechanisms to protect its use...

Please sign up or login with your details

Forgot password? Click here to reset