Method for exchange system for inputting end of two-stage queuing structure

Abstract

NXM queuing system in switching system contains N input ends and M destination ends. There are switching unit, flow controller and system central dispatcher. Characters are: (1) queuing data packets in two stages is carried out in storage buffer area at input end; at first stage, based on priorities, data packets reached to each input end in system are sorted to L classes, L is a positive integer larger than 1 given in advance; (2) based on each class, queuing is carried out according to destination; (3) through simple and effective dispatch algorithm, data packets in queues in first stage are sent to queues in second stage according to priorities of destination ends; (4) under control of quick dispatch of central dispatcher, data packets through switching unit reach to destination end of the system. The invention supports quality of service, lowers difficulties of bottleneck of central dispatch. The method is applicable to high-speed router in large scale and other switchboard.

Description

technical field [0001] The invention relates to a method for controlling data packets flowing through a network communication system, in particular to a method for a two-stage queuing structure at an input end in a switching system. Background technique [0002] At present, the information network is developing at an extremely rapid pace. The data and information flow on the Internet is increasing at a rate of 30% per month. The amount of information transmitted on the information network is already astronomical. The development of the next generation network The overall trend must be the rapid growth of bandwidth and continuous improvement of speed, and the switching capacity of the central node of the core router will inevitably increase at a rate of tens to hundreds of times; on the other hand, the level of human use in information networks is constantly deepening , users' requirements for service quality are also increasing rapidly. In recent years, service quality assu...

AI Technical Summary

Problems solved by technology

The advantage of the first method is that queuing is relatively simple, but because there are often too many queues, the time complexity of the central scheduling algorithm is relatively high due to the use of weighted matching; while the second method is just the opposite, only M queues are scheduled, and the central The scheduling algorithm is relatively easy to implement, but since the weight of data packets must be dynamically calculated in each time period, and the one with the largest weight must be placed at the head of the queue, that is, the queue must be dynamically inserted in each time period, and the time complexity of queuing is relatively high. difficult to realize

Therefore, these methods have problems such as high complexity and difficult implementation.

Images