Smoothly turning and grouping scheduling control method and arrangement

Abstract

The invention is a packet exchanging method and the device in omputer network. It consists of three parts of weight development sequence scanner, weight matrix supervisor and queue supervisor. The output value of the weight development sequence scanner is used to determine a defined row of weight matrix in weight matrix supervisor by the queue supervisor and to scan the row from top to bottom. When nonzero term of weight matrix in the weight matrix supervisor, the queue supervisor proceeds services for relative flow by utilizing contained packet selector. After the row in weight matrix being scanned, the quece supervisor fetches next value from weight development sequence in the weight development sequence scanner, then proceeds scanning for relative row in weight matrix supervisor, and so on, it will proceeds scanning from the top of sequence when the bottom of sequence of scanned by weight development sequence scanner.

Description

1. Technical field [0001] The present invention is a smoothed round robin (Smoothed Round Robin, SRR for short) group scheduling control method and control device. It belongs to the technical field of packet switching in computer networks. 2. Background technology [0002] With the rapid development of computer network technology, especially the Internet, a single network infrastructure will replace the current telephone network, private packet network, telegraph network, cable TV network and other networks and provide various The business has always been a hot issue concerned by academia and industry. Since the Internet is now the dominant network infrastructure, it is hoped that the integration of all networks will be realized by the Internet. But the current Internet based on IP (Internet Protocol) technology is not up to the task. This is mainly because the current Internet cannot provide quality of service guarantee. Compared with circuit switching technology, IP te...

AI Technical Summary

Problems solved by technology

Under this scheduler, the user's end-to-end delay characteristics can be well guaranteed, and this scheduler can treat all users fairly, but the biggest disadvantage of this scheduler lies in its time complexity increases linearly with the number of users

This scheduler becomes impractical when the number of users becomes large

The scheduling time complexity of other schedulers developed on the basis of the WFQ scheduler increases logarithmically at least as the number of users increases, and such schedulers become impractical at high speeds

Another round-robin-based scheduler such as DRR (Deficit Round Robin) scheduler, although the time complexity does not increase with the increase of the number of users, but they are not well isolated from different users, and each user can affect each other, so this kind of The delay characteristics of the scheduler are very poor and cannot be used for various types of real-time services and interactive services

Images