Method and device for scheduling slot resources

Patent metadata

Field	Value
Publication number	US-9591641-B2
Application number	US-201314435435-A
Country	US
Kind code	B2
Filing date	Oct 30, 2013
Priority date	Nov 14, 2012
Publication date	Mar 7, 2017
Grant date	Mar 7, 2017

Abstract

This application relates to network management technologies, and disclosed are a method and device for scheduling slot resources. The method is: upon reception of each new data packet delivered by a high level, a first node maintaining corresponding sending remaining time according to a delay requirement of the new data packet; performing slot resource determination on each extracted data packet, starting from the new data packet, in ascending order of the sending remaining time; when it is determined that the number of data packets to be sent in the sending remaining time corresponding to any data packet is greater than the number of slots currently used by the first node, applying for new slot resources. Therefore, when learning that the slot resources cannot meet the delay requirement of the data packet to be sent, the first node can apply for new slot resources in time, so as to solve the slot resource scheduling problem under the time division resource allocation mechanism based on FI interaction, meet the low-delay requirement on message exchange in telematics, and ensure timely message transmission, thereby effectively ensuring the performance of the telematics.

First claim

The invention claimed is:

1. A method for scheduling slot resources, comprising:
storing, by a first node, upon reception of each new data packet transmitted by a higher layer, the new data packet and maintaining a remaining transmission time of the new data packet according to a transmission delay corresponding to the new data packet; and
making, by the first node, a judgement on slot resource sequentially for each stored data packet with the remaining transmission time more than or equal to the remaining transmission time of the new data packet in an ascending order of the remaining transmission time starting with the new data packet, requesting a new slot resource when it is determined that the number of data packets to be transmitted is more than the number of slots currently used by the first node in the remaining transmission time corresponding to any data packet;
wherein requesting a new slot resource upon determining that the number of data packets to be transmitted is more than the number of slots currently used by the first node in the remaining transmission time corresponding to the any data packet, in a process of making, by the first node, a judgement on slot resource for any data packet, comprises:
judging, by the first node, from locally maintained slot state information, whether there are idle slots in the system before the remaining transmission time corresponding to the data packet, for which a judgement on slot resource is made, expires; and
If so, then selecting one of the idle slots as a newly requested slot;
otherwise, discarding the data packet for which the judgement on slot resource is made, and stopping making a judgement on slot resource for a subsequent data packet; or
reserving the data packet for which the judgement on slot resource is made, terminating a slot requesting process for the data packet for which the judgement on slot resource is made, and continuing making a judgement on slot resource for a subsequent data packet; or
selecting a low-priority data packet, with the remaining transmission time less than that of the data packet for which the judgement on slot resource is made and a priority lower than that of the data packet for which the judgement on slot resource is made, from the stored data packets, and deleting the selected low-priority data packet from a buffer; or
when a delay margin corresponding to the data packet for which the judgement on slot resource is made is set and the delay margin is not 0, updating the remaining transmission time corresponding to the data packet, for which the judgement on slot resource is made, with the length of time indicated by the delay margin, and selecting an idle slot in an updated remaining transmission time as a newly requested slot, wherein if there is still no idle slot in the updated remaining time, the data packet, for which the judgement on slot resource is made, is discarded, and no judgement on slot resource is made for a subsequent data packet; or the data packet, for which the judgement on slot resource is made, is reserved, the slot requesting process for the data packet, for which the judgement on slot resource is made, is terminated, and a judgement on slot resource is further made for a subsequent data packet; or a low-priority data packet, with the remaining transmission time less than that of the data packet for which the judgement on slot resource is made and a priority lower than that of the data packet for which the judgement on slot resource is made, is selected from the stored data packets, and the selected low-priority data packet is deleted from a buffer.

2. The method according to claim 1 , wherein maintaining, by the first node, the remaining transmission time of the new data packet according to the transmission delay corresponding to the new data packet comprises:
determining, by the first node, the preset transmission delay corresponding to the new data packet upon reception of the new data packet; and
setting, by the first node, a timer associated with the new data packet, for maintaining the remaining transmission time, according to the transmission delay, wherein the remaining transmission time characterizes the length of time starting from current time to the latest transmission time corresponding to the transmission delay of the new data packet.

3. The method according to claim 2 , wherein each time an accessible slot arrives, the first node selects and transmits a data packet currently with a shortest remaining transmission time, wherein if any data packet is not transmitted successfully when the corresponding remaining transmission time becomes zero, then the first node discards the data packet.

4. The method according to claim 2 , wherein when any accessible slot arrives, if it is determined that there is currently no data packet to be transmitted, then the first node invalidates the accessible slot, wherein if the accessible slot is a requested slot, then the first node deletes the requested slot from a locally maintained list of requested slots, and if the accessible slot is an occupied slot, then the first node deletes the occupied slot from a locally maintained list of occupied slots.

5. The method according to claim 1 , wherein making, by the first node, a judgement on slot resource sequentially for each stored data packet with the remaining transmission time more than or equal to the remaining transmission time of the new data packet in an ascending order of the remaining transmission time starting with the new data packet comprises:
sorting, by the first node, the stored data packets in an ascending order or a descending order according to the remaining transmission times corresponding thereto, and then making a judgement on slot resource sequentially for each data packet with the remaining transmission time more than or equal to the remaining transmission time of the new data packet in an ascending order of the remaining transmission time, starting with the new data packet, among the respective sorted data packets; or
comparing, by the first node, the remaining transmission time of each stored data packet with the remaining transmission time of the new data packet starting with the new data packet, then picking the data packets with the remaining transmission times more than or equal to the remaining transmission time of the new data packet from the respective stored data packets according to comparison results, and next make a judgement on slot resource sequentially for each picked data packet in an ascending order of the remaining transmission time.

6. The method according to claim 5 , wherein each time an accessible slot arrives, the first node selects and transmits a data packet currently with a shortest remaining transmission time, wherein if any data packet is not transmitted successfully when the corresponding remaining transmission time becomes zero, then the first node discards the data packet.

7. The method according to claim 5 , wherein when any accessible slot arrives, if it is determined that there is currently no data packet to be transmitted, then the first node invalidates the accessible slot, wherein if the accessible slot is a requested slot, then the first node deletes the requested slot from a locally maintained list of requested slots, and if the accessible slot is an occupied slot, then the first node deletes the occupied slot from a locally maintained list of occupied slots.

8. The method according to claim 1 , wherein after the newly requested slot is selected from the idle slots, the first node adds the newly requested slot to a list of requested slots, and updates the slot state information corresponding to the newly requested slot.

9. The method according to claim 1 , wherein each time an a

Assignees

• China Academy Telecommunications Technology

Inventors

• Zhao Yi
• Feng Yuan
• Zhao Li
• Fang Jiayi
• Li Feng

Classifications

• H04W72/569

  of the traffic information · CPC title

• H04W72/20

  Control channels or signalling for resource management · CPC title

• H04L47/28

  in relation to timing considerations · CPC title

• H04W72/0406

  Electricity · mapped topic

• H04W72/0446 Primary

  Resources in time domain, e.g. slots or frames · CPC title