Dominant factor method based network sharing bandwidth dynamic allocation method

A leading factor, dynamic allocation technology, applied in data exchange networks, radio transmission systems, digital transmission systems, etc., can solve problems such as low update rate, not an ideal research direction, unreasonable, etc., to achieve the effect of timely allocation

Inactive Publication Date: 2007-10-31
袁嘉 +1
View PDF0 Cites 5 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0003] Operability issues: The configuration method is complicated and highly professional, requiring guidance from the technical support personnel of the network equipment manufacturer, and the user's self-configuration is error-prone
[0004] Rationality problem: users usually know the importance of each connection data flow, but they can only simply use the fixed bandwidth allocation method to allocate the corresponding bandwidth for each connection. This allocation method is relatively random and has unreasonable factors
[0006] Timeliness problem: After the user completes the bandwidth

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
  • Dominant factor method based network sharing bandwidth dynamic allocation method
  • Dominant factor method based network sharing bandwidth dynamic allocation method
  • Dominant factor method based network sharing bandwidth dynamic allocation method

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0021] Fig. 2 is a schematic flowchart of the method of the present invention. In a network with shared bandwidth links, the total shared bandwidth of a link is Bw max . At a certain moment, the link has N priorities from Pri 0 to Pri N-1 (Pri i =Pri i+1 or Pri i =Pri i+1 -1, 0≤i≤N-2) data flow, the smaller the priority value, the higher the priority, so Pri 0 =0 The priority is the highest, and there is no priority jump. From Priority Pri 0 to Pri N-1 , the number of data streams with the same priority is expressed as e 0 、e 1 、e 2 ...... e k (0≤k≤N-1), where k indicates that there are k different priority levels in N data streams, and e m (0≤m≤k) has the following relationship with N:

[0022] Σ m = 0 k e m = N (where 0≤k≤N-1)

[0023] In step 201, when the dominant factor method is enabled, the system ...

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 network sharing bandwidth dynamic distributing method based on the dominant gene method, using the method in the invention, in the every circuit that the network nodes distributes the network sharing bandwidth dynamically, the system can make decision according to the user's requirement, the PRI of data flow and the flux and distribute the sharing bandwidth, and uses the network source rationally, that includes following processing: step 1, according to the user's requirement, the PRI of data flow and the flux, it produces a decision-making value which can effect the distribution for the bandwidth of data for the data flow with highest PRI before the distributing the bandwidth; step 2, according to the decision-making value, the system will decide the distributing strategy, and distributes the bandwidth for the data flow; step 3, using the sparing bandwidth in the system, it distributes the sharing bandwidth for the data flow with lower PRI based on the dominant gene method.

Description

technical field [0001] The invention relates to a processing method for implementing dynamic allocation of shared bandwidth in a network with shared links, and has strong practical value in the field of network communication. Background technique [0002] As shown in Figure 1, in an actual network, there are not always enough resources for different data streams to have completely independent traffic paths, so it is inevitable that there will be multiple data streams passing through the same path and sharing a link with limited bandwidth. road. When configuring shared link bandwidth, you usually encounter the following problems. [0003] Operability issues: The configuration method is complex and highly professional, requiring guidance from the technical support personnel of the network equipment manufacturer, and users are prone to errors in self-configuration. [0004] Rationality problem: Users usually know the importance of each connection data flow, but they can o...

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): H04B7/212H04L12/56H04L12/24H04L47/76
Inventor 袁嘉
Owner 袁嘉
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

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap