Unlock instant, AI-driven research and patent intelligence for your innovation.

Dynamic sharing device of physical queue based on the stream queue

A technology of dynamic sharing and physical queues, applied in the field of computer networks, can solve problems such as lack of scalability, high-speed broadband network, consumption, multi-processing time, etc.

Inactive Publication Date: 2009-07-29
TSINGHUA UNIV
View PDF6 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

Through network measurement and other means, it is found that in high-speed broadband networks (such as 2.5Gbps, 10Gbps bandwidth networks), more than one million different active service flows can coexist at the same time, so it is necessary to maintain millions of physical Queue, which would make the management unit take up too many resources and consume too much processing time, making it difficult to implement
Therefore, although per-flow queuing buffer management can provide QoS guarantees, the traditional concept is considered not scalable enough to be implemented in high-speed broadband 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
  • Dynamic sharing device of physical queue based on the stream queue
  • Dynamic sharing device of physical queue based on the stream queue
  • Dynamic sharing device of physical queue based on the stream queue

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0089] The write module is responsible for the writing of the arriving packet. First, request the dynamic sharing module for the corresponding physical queue that is currently in the offload, and then according to the result returned by the dynamic sharing module, obtain the end-of-line write address of the physical queue from the RAM management module, and write the data packet into the address corresponding to the RAM.

[0090] To facilitate management, the RAM management module usually divides the data packet storage space into storage blocks of fixed size. However, data packets of variable length are transmitted on the network, so the packets need to be cut into fixed-size units called Data Units (DUs). These DUs are reassembled into original variable lengths before leaving the forwarding device. Data grouping. The size of the storage block into which the RAM is divided is the same as that of the DU, so one DU occupies exactly one storage block.

[0091] In the data packet mem...

Embodiment 2

[0108] The writing module works in the same way as the first embodiment.

[0109] The RAM management module works in the same way as in the first embodiment.

[0110] The scheduling module works in the same way as in Embodiment 1.

[0111] The dynamic shared list also follows Picture 9 The hash method of the method is divided into different sub-tables, and each sub-table is organized in a binary search tree manner to reduce the time overhead on the sub-tables. Each node on the binary search tree also contains the active stream number and the corresponding physical queue number. An example of a binary search tree is as follows Picture 11 As shown, for the convenience of presentation, only the numerical value of the corresponding stream number is given on each node. The characteristic of a binary search tree is that the value of the left subtree is less than the value of the root node, and the value of the right subtree is greater than the value of the root node.

[0112] If you w...

Embodiment 3

[0116] The writing module works in the same way as the first embodiment.

[0117] The RAM management module works in the same way as in the first embodiment.

[0118] The scheduling module works in the same way as in Embodiment 1.

[0119] The dynamic shared list also follows Picture 9 The hash method of the method is divided into different sub-tables, but each sub-table is organized in a balanced binary search tree. The difference between it and the binary search tree is that the depth difference between the left and right subtrees of each node does not exceed 1. The search process of the balanced binary search tree is the same as the search process of the binary search tree in Embodiment 2. When inserting an entry into the balanced binary search tree, the search process of the binary search tree in Embodiment 2 is the same, and then the generated binary search tree is adjusted so that the depth difference between the left and right subtrees does not exceed 1. When a balanced bi...

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 belongs to the technical field of business flow management in a computer network, and is characterized in that it contains: the device contains: a physical storage device RAM, and a writing module integrated on the FPGA / ASIC, a scheduling module, a RAM management module, and a dynamic sharing list , a dynamic sharing module; wherein, the physical storage device RAM is used to cache data packets and the next pointer of each data block; the data packets are written into the address corresponding to the RAM; the scheduling module is active according to the scheduled scheduling mode Scheduling in the flow of state; RAM management module manages the data structure of data packets stored in RAM according to the set method; dynamic sharing list maintains the mapping relationship between active flow and physical queue; dynamic sharing provides a fast search mechanism , the insertion mechanism, and the deletion mechanism. The device reduces the required physical queue and realizes queuing according to flow.

Description

Technical field [0001] The present invention is a physical queue dynamic sharing device that realizes per-flow queueing of service flows at wire speed. It can be applied to high-speed broadband network forwarding equipment to realize quality of service (QoS) guarantee and belongs to computer networks. field. Background technique [0002] By adopting a per-flow queuing method for buffer management in computer network forwarding equipment such as routers and switches, the Quality of Service (QoS) between different service flows can be strictly guaranteed. In the traditional sense, different flows need to be physically isolated for management according to the queuing of each flow, which means that a separate physical queue must be maintained for each flow. Through network measurement and other means, it is found that high-speed broadband networks (such as 2.5Gbps, 10Gbps bandwidth networks) can coexist more than one million different active business streams at the same time, which r...

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 Patents(China)
IPC IPC(8): H04L12/56H04L12/26H04L47/41
Inventor 胡成臣刘斌唐毅
Owner TSINGHUA UNIV