Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Backbone network traffic scheduling method for eliminating link congestion

A backbone network and traffic scheduling technology, applied in the field of network communication, can solve the problems of not providing QoS guarantee, incapable of fine-grained control, and insufficient utilization of network bandwidth resources, etc., to achieve high connectivity, strong processing capacity, and large information Effect

Inactive Publication Date: 2016-10-26
UNIV OF ELECTRONICS SCI & TECH OF CHINA
View PDF6 Cites 14 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0007] 3. Best Effort: It does not provide any QoS guarantee and is mainly used for services that are not sensitive to delay, jitter and packet loss
In this way, even if other routes have idle bandwidth resources, the traffic of congested routes will not be distributed to idle routes, resulting in insufficient utilization of network bandwidth resources.
[0012] 2. No fine control

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
  • Backbone network traffic scheduling method for eliminating link congestion
  • Backbone network traffic scheduling method for eliminating link congestion
  • Backbone network traffic scheduling method for eliminating link congestion

Examples

Experimental program
Comparison scheme
Effect test

Embodiment

[0049] figure 1 It is a backbone network architecture diagram for eliminating link congestion in the present invention.

[0050] In this example, if figure 1 As shown, in any backbone network, letters represent network nodes, and forked links between network nodes represent congested links. The network segments corresponding to each network node are shown in Table 1;

[0051] Table 1 is the network segment corresponding to the network node;

[0052] network node

network segment

A

10.0.0.0 / 8

B

20.0.0.0 / 8

C

30.0.0.0 / 8

D

40.0.0.0 / 8

E

50.0.0.0 / 8

F

50.0.0.0 / 8

G

70.0.0.0 / 8

H

80.0.0.0 / 8

I

90.0.0.0 / 8

[0053] Table 1

[0054] Combine below figure 1 , a backbone network traffic scheduling method for eliminating link congestion of the present invention is described in detail, specifically comprising the following steps:

[0055] S1. According to the congested link information fed back...

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 present invention discloses a backbone network traffic scheduling method for eliminating link congestion. A congestion part of an original route is transferred to an alternative path of the congestion part, thereby bypassing a congestion link. Specifically, for a certain congestion link, due to overlarge, some traffics on the congestion link fails to find a proper candidate path, an algorithm temporarily skips the traffic and processes next traffic; and when the algorithm traverses all traffics on the congestion link and migrates all traffics that can be migrated, the algorithm may split all residual convergence flows on the link if the link is still in a congestion state, a large convergence flow is split into several small convergence flows, at most a maximum quantity of small convergence flows, so that a probability that the traffic finds the candidate path is increased, and the congestion link is adjusted.

Description

technical field [0001] The invention belongs to the technical field of network communication, and more specifically relates to a backbone network flow scheduling method system for eliminating link congestion. Background technique [0002] With the development of computer network line types and network products and technologies, the technology for flow control on the backbone network is mainly DifferServ. [0003] The DifferServ method is a differentiated service method, which has connectionless characteristics and is mainly realized through buffer management and priority scheduling mechanisms, without QoS negotiation and reserved bandwidth control. Because the development of IP network is still based on no connection, the differentiated service mode is suitable for it and is more suitable for application in large-scale IP networks. [0004] In the DiffServ method, the service flow is divided into different differentiated service classes, and the differentiated service class...

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
IPC IPC(8): H04L12/801H04L12/803H04L12/815H04L47/22
CPCH04L47/10H04L47/12H04L47/122H04L47/22
Inventor 章雨鹏郑少平虞红芳谭凌锵
Owner UNIV OF ELECTRONICS SCI & TECH OF CHINA
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products