Fluid track dispatching method

A round-robin scheduling and trajectory technology, applied in the field of data communication, can solve the problems of inability to apply large-capacity network nodes, large amount of calculation, waste of bandwidth, etc.

Inactive Publication Date: 2004-02-04
SHANGHAI JIAO TONG UNIV
View PDF1 Cites 7 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0004] The purpose of the present invention is to provide a novel weighted fair queue scheduling method for the deficiencies in the prior art, which is called the fluid trajectory polling scheduling method. This method calculates the scheduling trajectory b

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

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0058] The following examples are provided in conjunction with the contents of the present invention, and the method of the present invention is further understood:

[0059] packet number

1

2

3

4

5

6

7

8

9

arrival queue

1

2

3

2

2

1

2

4

2

Packet length / Byte

70

40

50

50

60

60

50

80

50

Arrival time / us

0

100

100

500

600

700

700

1000

1100

[0060] Step 1, generate an array of fluid trajectories. The total reserved bandwidth is 80+160+120+40=400kbps, so the length of the fluid trajectory array is 400kbps / 40kbps=10 items.

[0061] 1) Initialize the array Tstart=[0,0,0,0], Tend=[5,2.5,3.33,10], start to calculate the 0th item of the track array, i.e. j=0;

[0062] 2) The Tstart values ​​of the four queues are not greater than 0, and the one co...

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 is a method for alternatively dispatching flow trace in the data communication. The invention calculates the trace array according to the predetermined band-width of various business using a way for generating flow trace array; then selects an array, which needs to dispatch, according to current business state and the calcualted trace array in a topological dispatching structure of two stages during each dispatching period; and finally sends the data packet of the array through a red word counter module or directly. The invention can use the band-width of network nodes in 100% and ensure that the band-width used actually by each array reaches the predetermined band-width for the business, as well as can distribute in proportion the idle band-widths according to the predetermined band-width of each business with the time-delay property able to reach the theoretical best level of the accessible dispatching method, being simple to operate and easy to extend.

Description

technical field [0001] The invention relates to a scheduling method, in particular to a fluid trajectory polling scheduling method suitable for realizing router service quality, and belongs to the field of data communication. Background technique [0002] The data communication network has developed from the traditional "best effort" data transmission stage to the stage that needs to provide a certain quality of service (QoS, Quality of Service) for business. Such changes require routers to guarantee QoS parameters for data services, and these parameters include delay, delay jitter, loss rate, and throughput. The weighted fair queue scheduling method is currently one of the main means to ensure bandwidth allocation and QoS indicators of each service flow in routers and other data communication network nodes. General Processor Sharing (GPS, General Processor Sharing) is an ideal scheduling method that cannot be realized. It assumes that (a) packets are infinitely divisible;...

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/24H04L12/42H04Q3/64
Inventor 张芥凡
Owner SHANGHAI JIAO TONG 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