Method and system for selecting a minimum load router based on naive Bayes classifier

一种贝叶斯分类器、路由的技术,应用在传输系统、数字传输系统、仪器等方向,能够解决提高电路交换网络、没有机器学习技术等问题

Active Publication Date: 2018-05-25
SUZHOU UNIV
View PDF5 Cites 12 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

Although machine learning techniques have been widely used in various fields including communication networks, no machine learning techniques have been used to improve the performance of routing algorithms in circuit-switched networks.

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Method and system for selecting a minimum load router based on naive Bayes classifier
  • Method and system for selecting a minimum load router based on naive Bayes classifier
  • Method and system for selecting a minimum load router based on naive Bayes classifier

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0139] The minimum load route selection method based on the naive Bayesian classifier in this embodiment includes: determining the candidate route when establishing a service connection between the node pair sd, and putting it into the set R sd Middle; according to the usage status information of the current network link resources, when each candidate route is used for service connection between node pairs sd, calculate the load of each candidate route, and run the naive Bayesian classifier to predict the potential connection congestion of the entire network in the future rate; determine the optimal route between nodes to sd according to the routing formula, and the routing formula is:

[0140]

[0141] In the formula, is the best route among all candidate routes between node pair sd; is a candidate route The potential blocking rate of the entire network in the future when a service connection is established between the node pair sd; is the candidate route load. I...

Embodiment 2

[0182] This embodiment is based on the minimum load routing selection system of the naive Bayesian classifier, which can be used to run the method described in the above-mentioned embodiment 1. The system includes: a candidate routing set establishment unit and a potential blocking rate of the future network, routing load calculation unit.

[0183] The candidate route set establishment unit is used to determine all candidate routes for establishing service connections between node pairs sd, and put them into the set R sd middle;

[0184] The potential blocking rate and routing load calculation unit of the future network is used to run the naive Bayesian classifier to predict the future network traffic of each candidate route when a service connection is established between node pairs based on the current network link resource usage status information. The potential connection blocking rate and the load of each candidate route;

[0185] The best route determining unit is used...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The invention relates to a method and system for selecting a minimum load router based on a naive Bayes classifier. The performance of the method for selecting the minimum load router is improved, a network snapshot records historical network state information, and the naive Bayes classifier is used for predicting the potential network blocking rate of all candidate routers between each node pair.The network snapshot corresponds to each arrived service request and records the number of occupied network resource units on each link. If the current service request establishes a connection on a candidate router, then the naive Bayes classifier predicts the potential blocking rate for future service connection establishment and calculates the load for each candidate router at the same time. Finally, the router with the smallest load and the lowest potential blocking rate and without service connection establishment is selected from all the candidate routers between the node pairs to establish service connection to achieve the optimal balance between the load and the blocking rate.

Description

technical field [0001] The invention specifically relates to a minimum load routing selection method and system based on a naive Bayesian classifier. Background technique [0002] Routing algorithms in circuit switched networks is a mature subject. Routing algorithms can be divided into three categories: fixed shortest routing algorithms, fixed alternative routing algorithms and adaptive routing algorithms. [0003] Fixed shortest route algorithm: Find a fixed shortest route for a node pair in advance, and all services between node pairs will be established along this route. [0004] Algorithm for fixed alternative routing: select multiple fixed routes between node pairs, and then try to establish services in turn, that is, the first route is preferred to establish services, and if unsuccessful, try the second route until all routes are used. Try to build a business. [0005] Adaptive routing algorithm: According to the real-time link status in the network, the optimal ro...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
Patent Type & Authority Applications(China)
IPC IPC(8): H04L29/08H04L12/721H04L12/803H04L12/24H04L45/24
CPCH04L41/145H04L45/38H04L47/125H04L67/63H04L47/127H04L45/123H04L45/14H04L45/22G06F18/24155
Inventor 沈纲祥李龙飞张亚
Owner SUZHOU UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products