Method for packet scheduling of multi-hop network and node device

A packet scheduling and multi-hop network technology, applied in the field of communication, can solve the problems that the packet loss rate of the system cannot be guaranteed, and the packet scheduling method cannot meet the requirements of multi-hop network fairness and network resource utilization, so as to reduce the dropped rate. Effects of probability, avoiding waste, and ensuring fairness

Inactive Publication Date: 2010-02-10
CHINA MOBILE COMM GRP CO LTD
View PDF0 Cites 10 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0013] The purpose of the present invention is to propose a multi-hop network packet scheduling method and node device for the defect that the packet scheduling method in the prior art cannot guarantee the requirement of the system packet loss rate, so as to reduce the waiting time of data packets with more remaining hops , to reduce the probability of the packet being dropped
[0014] Another object of the present invention is to propose a multi-hop network packet scheduling method based on packet delay requirements for the defect that the packet scheduling method in the prior art cannot meet the requirements of multi-hop network for fairness and network resource utilization. Node device to avoid the difference in end-to-end delay and jitter of packets with different hops, ensure the fairness of user services, and improve the utilization of network resources

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
  • Method for packet scheduling of multi-hop network and node device
  • Method for packet scheduling of multi-hop network and node device
  • Method for packet scheduling of multi-hop network and node device

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0038] image 3 It is a flow chart of the multi-hop network packet scheduling method in Embodiment 1 of the present invention, such as image 3 As shown, this embodiment includes:

[0039] Step S301: Obtain the remaining delay and subsequent path status of each data packet;

[0040] Step S303: Determine the priority of each data packet according to the remaining delay and subsequent path conditions;

[0041] Step S305: Perform wireless resource allocation according to the priority of each data packet.

[0042] The method proposed in this embodiment takes into account subsequent path conditions and remaining time delays of data packets when performing packet scheduling. The subsequent path condition may include: the subsequent hop count of the data packet and / or the node load of the subsequent path, and the like. The method proposed in this embodiment can effectively guarantee the fairness of the delay in the data packets with different follow-up path hops and / or follow-up ...

Embodiment 2

[0044] Figure 4 It is a flow chart of the multi-hop network packet scheduling method in Embodiment 2 of the present invention, such as Figure 4 As shown, this embodiment includes:

[0045] Step S401: Obtain the remaining delay, previous path status and subsequent path status of each data packet;

[0046] Step S403: Determine the priority of each data packet according to the remaining delay, previous path conditions and subsequent path conditions;

[0047] Step S405: Perform wireless resource allocation according to the priority of each data packet.

[0048] After the data packets are scheduled in step S405 in this process, return to step S401 to start the next round of packet scheduling.

[0049] On the basis of the first embodiment, the method proposed in this embodiment further considers the status of the previous path of the data packet when performing packet scheduling. Previous path conditions may include: number of hops the packet has completed, data flow rate, and...

Embodiment 3

[0051] Figure 5 It is a flow chart of the multi-hop network packet scheduling method according to Embodiment 3 of the present invention. This example is for image 3 and Figure 4 The embodiment is further refined, adding processing operations when two or more data packets have the same priority. Such as Figure 5 As shown, this embodiment includes:

[0052] Step S601: Obtain the remaining delay, previous path status and subsequent path status of each data packet;

[0053] Step S603: Determine the priority of each data packet according to the remaining time delay, previous path conditions and subsequent path conditions;

[0054] Step S605: judging whether multiple data packets have the same priority, if not, proceed to step S617, otherwise proceed to step S607;

[0055] Step S607: For data packets with the same priority, determine the priority again according to the previous path condition;

[0056] Step S609: judging whether multiple data packets have the same priorit...

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 discloses a method for packet scheduling of a multi-hop network and a node device, wherein the method comprises the following steps of: acquiring residual time delay and follow-up routeconditions of all data packets; according to the residual time delay and following route conditions, determining the priority of the data packets; and according to the priority, allocating wireless resources to the data packets. The method has the advantages of effectively ensuring the packet scheduling of the high-capacity wireless multi-hop network meets the requirements of the data service on time delay, lowering the probability of discarding of the data packet with more residual hop counts, ensuring the fairness of the packet data services undergoing different hop counts, and avoiding waste of network resources.

Description

technical field [0001] The invention relates to packet scheduling technology in the communication field, in particular to a multi-hop network packet scheduling method and a node device. Background technique [0002] The wireless Mesh network (wireless mesh network) is different from the cellular network that passes through one hop to the destination node. It is essentially a multi-hop network, that is, a network in which data packets go through multiple hops from the source node to the destination node. The data flow carried by each node (Access Point, AP for short) is mainly divided into two types: the data flow experienced by a local user through one hop, and the data flow from other nodes through multiple hops. figure 1 is a wireless Mesh network topology diagram in the prior art, such as figure 1 As shown, the node AP1 not only needs to carry the data flow to the local terminal, but also carries the data flow from the main AP of the node to the node AP5 (the route of th...

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/56H04L12/28H04W72/12
Inventor 许文俊时洁田宝玉牛凯李茗谢芳
Owner CHINA MOBILE COMM GRP CO LTD
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