Wireless equipment and packet scheduling method thereof, and transmission method of wireless system

Abstract

The invention discloses wireless equipment and a packet scheduling method thereof, and a transmission method of a wireless system. The packet scheduling method of the wireless equipment comprises the following steps that: 1, N data packets which carry delay bounds and destinations wait to be served by a server in a buffer; 2, the server calculates the number M of data packets which can be served by the sever in the next time period; and 3, when N is less than or equal to M and more than 0, the server serves all the data packets in the buffer; and when M is less than N and more than 0, the server selects to serve the first M data packets with the maximum probability of exceeding the delay bounds. The packet scheduling method is suitable for a multi-hop network and a single-hop network; higher end-to-end data packet delay performance can be achieved, and fairness can be better ensured; and a dependency relationship does not exist among the wireless equipment, the server judges whether and how to serve the data packets in the buffer in an independent distribution mode, independent distribution is high in extensibility compared with central distribution, and the packet scheduling method is also suitable for a non-central mesh network, is low in complexity and is easy to implement.

Description

technical field [0001] The invention belongs to the technical field of communication, relates to a wireless device and a packet scheduling method thereof, and also relates to a transmission method of a wireless system. Background technique [0002] The research on packet scheduling in communication network develops gradually with the development of communication system. Although the scheduling problem in the queuing system began in the 1950s, people began to pay attention to the application of data packet scheduling in this type of system until the packet switching method appeared in the communication network. [0003] figure 1 A typical queuing system is given. In this system, data packets are sent from users and enter the queuing system at a certain input rate, and at the same time, the server also serves these data packets at a certain service rate and finally outputs these data packets. In order to cope with the situation that the short-term service rate cannot keep up...

AI Technical Summary

Problems solved by technology

But there are two problems in these two solutions: 1) Lack of scalability: the way of allocating a buffer to each active user will cause a bottleneck in performance when facing a large number of active users

2) Lack of support for the diversity of data services: In the early 1990s, the emergence of Integrated Services Digital Network (ISDN) and the rapid development of the Internet made people gradually realize that different data services have different requirements for service quality, such as voice Business and multimedia services have high requirements on the delay and jitter of data packets, while mail services require error-free transmission of data packets, but do not directly require delay and jitter, and the fair queuing method cannot distinguish these differences. data business

The way to solve problem 1 is to use aggregation (Aggregation) and policer (policer), that is, the data streams of different users are stored in one or more general buffers, and the policer is used to restrict user behavior

[0009] In solving the problem of distinguishing different services by introducing scheduling, the EDF algorithm in the wired multi-hop network cannot be directly applied to the wireless network, because compared with the wired network, the service time of the data packet in the wireless network is difficult to determine

The channel capacity of the wireless channel changes relatively quickly over time and is difficult to predict accurately, so the time for the server to serve the data packet (determined by the channel quality and the length of the data packet) is also difficult to determine

Since the server cannot calculate the exact service time of the data packet, the scheduling mechanism with the closest deadline priority must be modified accordingly, that is, the service time of the data packet is not considered. It is still not the optimal scheduling mechanism in the case of

Therefore, the current packet scheduling algorithm in the wireless multi-hop network is only a scheduling for fairness and capacity, but in 3G and subsequent wireless networks, different services have different service quality requirements, and fairness is only data One aspect of packet scheduling, so research on scheduling methods that support QoS in multi-hop wireless networks is still very immature

Images