WO2012171460A1 - Procédé et dispositif de transmission de paquets - Google Patents

Procédé et dispositif de transmission de paquets Download PDF

Info

Publication number
WO2012171460A1
WO2012171460A1 PCT/CN2012/076860 CN2012076860W WO2012171460A1 WO 2012171460 A1 WO2012171460 A1 WO 2012171460A1 CN 2012076860 W CN2012076860 W CN 2012076860W WO 2012171460 A1 WO2012171460 A1 WO 2012171460A1
Authority
WO
WIPO (PCT)
Prior art keywords
queue
packet
transmission
time slice
sent
Prior art date
Application number
PCT/CN2012/076860
Other languages
English (en)
Chinese (zh)
Inventor
陈晓
唐建娟
Original Assignee
中兴通讯股份有限公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 中兴通讯股份有限公司 filed Critical 中兴通讯股份有限公司
Publication of WO2012171460A1 publication Critical patent/WO2012171460A1/fr

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L49/00—Packet switching elements
    • H04L49/30—Peripheral units, e.g. input or output ports
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/50—Queue scheduling
    • H04L47/52—Queue scheduling by attributing bandwidth to queues
    • H04L47/522—Dynamic queue service slot or variable bandwidth allocation
    • H04L47/524—Queue skipping
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/50—Queue scheduling
    • H04L47/62—Queue scheduling characterised by scheduling criteria
    • H04L47/625—Queue scheduling characterised by scheduling criteria for service slots or service orders
    • H04L47/6255—Queue scheduling characterised by scheduling criteria for service slots or service orders queue load conditions, e.g. longest queue first
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/50—Queue scheduling
    • H04L47/62—Queue scheduling characterised by scheduling criteria
    • H04L47/6215—Individual queue per QOS, rate or priority
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/50—Queue scheduling
    • H04L47/62—Queue scheduling characterised by scheduling criteria
    • H04L47/625—Queue scheduling characterised by scheduling criteria for service slots or service orders
    • H04L47/6275—Queue scheduling characterised by scheduling criteria for service slots or service orders based on priority

Definitions

  • the present invention relates to the field of data transmission technologies, and in particular, to a message transmission method and apparatus. Background technique
  • the system sets different priorities for the packet according to the importance of the packet.
  • the network system is congested, a large number of packets are aggregated to the outbound port of a network device. In this case, you need to ensure that packets with a higher priority are sent as expected.
  • each port on a network device generally has eight output queues, each of which has a fixed priority, represented by a number, in the order of 7, 6, 5, 4, 3, 2, 1, 0 queues.
  • the priority of each queue is pre-registered in the system. Among them, the queue 7 with the highest sequence number has the highest priority, the priority of the queue is sequentially decreased according to the sequence number of the queue, and the queue 0 has the lowest priority.
  • packets with a higher priority are placed in a queue with a higher priority.
  • packets in the higher priority queue are sent preferentially in the order of priority from highest to lowest.
  • the highest priority of course has the highest transmission right. That is, the packet in the queue 7 with the highest priority is sent first, and when the queue 7 with the highest priority is empty, the packet in the queue 6 with the lower priority is sent, and so on. Therefore, the packets of the critical service are placed in the queue of the higher priority, and the packets of the non-critical service are placed in the queue of the lower priority.
  • the system is idle. When no high-priority packets are sent, low-priority packets can be sent.
  • the most basic priority queue scheduling method is a combination of fixed priority and time slice.
  • the system selects the to-be-sent packet with the highest priority in the queue according to the priority of the queue to be sent.
  • the new arbitration is performed.
  • the packets of the queue can continue to be sent. Otherwise, the system selects the packets in the queue with higher priority.
  • the length of the packet to be sent in the queue is less than the maximum length supported by the system in a time slice, even if the packet in the queue has been sent, the system still needs to wait until the end of the time slice to reassign the next time slice.
  • packets sent in a queue with a higher priority are generally protocol packets. Since protocol packets are not sent continuously, and each protocol packet contains fewer bytes, the system allocates time slices. When a protocol message is sent, there may be only a small amount of time in which the message is sent, and most of the time is wasted. In an extreme case, when the transmission period of the protocol packet coincides with the time slice, each time slice can only send one protocol packet. At the same time, the packet in the low priority queue is often due to the time slice. It is occupied and cannot be sent.
  • the present invention provides a message transmission method and apparatus for solving the problem of system resource waste caused by unreasonable time slice allocation in the prior art.
  • the invention provides a message transmission method, and the method comprises the following steps:
  • each sending team value is sequentially determined according to the priority
  • the time slice is allocated to the sending queue to perform message transmission; if no, the time slice is idling.
  • the time slice is allocated to the sending queue, and the packet is transmitted as:
  • the time slice is allocated to the highest-priority transmission queue to perform packet transmission, and no The sending queue with the highest priority of the sending queue has a lower priority until the time slice is allocated to the sending queue for packet transmission.
  • the method further includes:
  • Determining that the highest priority transmission queue includes a message to be sent.
  • the determining time slice is idling to:
  • the current time slice is determined to be idle.
  • the method further includes:
  • the packet transmission length threshold is set according to the maximum rate of the port and the length of the time slice.
  • the packet transmission length threshold is not greater than any value of the product of the maximum rate of the port and the time length of the time slice.
  • the present invention provides a message transmission apparatus, the apparatus comprising:
  • a judging module configured according to priority according to priority of each sending queue in the port Packet length threshold
  • the transport idle module is configured to allocate a time slice to the sending queue to perform packet transmission when determining that the number of bytes of the to-be-sent packet included in the sending queue is greater than a set packet length threshold; otherwise, determining The time slice is idling.
  • the transmission idle module is specifically configured to find a sending queue with the highest priority in the current sending queue; determine the number of bytes to be sent in the sending queue with the highest priority; When the number of bytes included in the sent packet is greater than the preset packet length threshold, the time slice is allocated to the highest priority sending queue for packet transmission, and no search is performed.
  • the sending queue has a lower priority transmission queue until the time slice is allocated to the sending queue for message transmission.
  • the determining module is further configured to determine whether the sending queue with the highest priority includes a message to be sent.
  • the transmission idle module is specifically configured to determine that the time slice is idle when the number of bytes of the to-be-sent packet included in the transmission queue with the lowest priority in the transmission queue is smaller than a preset packet transmission length threshold.
  • the device further includes:
  • the setting module is configured to set a packet sending length threshold according to the maximum rate of the port and the time length of the time slice, where the packet sending length threshold is an arbitrary value that is not greater than a product of a maximum rate of the port and a time length of the time slice.
  • the present invention provides a packet transmission method and apparatus.
  • a packet transmission length threshold is set, and according to the priority of each transmission queue in the port, the to-be-sent report included in each transmission queue is sequentially determined according to the priority. Whether the number of bytes included in the file is greater than the set packet length threshold; determining whether to allocate the time slice to the sending queue for message transmission; When the number of bytes to be sent in the sent queue is less than the set packet length threshold, the time slice is determined to be idle.
  • the time slice is allocated to the transmission only when the number of bytes to be transmitted in the transmission queue is greater than the set packet length threshold. The queue performs message transmission, thereby improving the utilization of the time slice, thereby effectively reducing the waste of system resources.
  • FIG. 1 is a schematic diagram of a process of a message transmission method according to the present invention.
  • FIG. 2 is a schematic diagram of a detailed process of a message transmission method according to the present invention.
  • FIG. 3 is a schematic diagram of a detailed process of another packet transmission method according to the present invention
  • FIG. 4 is a schematic structural diagram of a message transmission apparatus according to the present invention. detailed description
  • the present invention provides a message transmission method and apparatus.
  • the present invention by setting a packet length threshold for each transmission queue, only in the transmission queue.
  • the time slice is allocated to the sending queue to perform packet transmission. Therefore, the time slice utilization is improved, thereby effectively reducing the number of bytes. A waste of system resources.
  • FIG. 1 is a schematic diagram of a process of a message transmission method according to the present invention.
  • the transmission method includes the following steps: S101: According to the priority of each sending queue in the port, determine, according to the priority, whether the number of bytes included in the sending packet included in each sending queue is greater than the set packet length threshold, and the result is yes. At step S102, otherwise, step S103 is performed.
  • the packet sending length threshold is set in advance, and may be any value, which is determined according to the maximum rate of the port and the length of the time slice.
  • the system sets a packet length threshold of the sending queue according to the maximum rate of the port and the length of the time slice, where the packet sending length threshold is not greater than any value of the product of the maximum rate of the port and the time length of the time slice; This is because the time length of each time slice is fixed.
  • the maximum rate of the port is determined by the configuration of the system. Therefore, the maximum number of bytes that the port can transmit during the time length of each time slice is the maximum number of ports. A fixed value determined by multiplying the rate by the length of time slice.
  • the system allocates a current time slice to the found sending queue, where the found sending queue is: The number of bytes of the to-be-sent packet to be sent is greater than the set packet sending length threshold. Queue, and the highest priority send queue.
  • the system idling the current time slice and starting the next time slice allocation process when the system does not find the transmission queue that contains the number of bytes of the packet to be sent is greater than the set packet length threshold.
  • the packet length threshold is set for each sending queue, and the time slice is allocated only when the number of bytes included in the to-be-sent packet included in the sending queue is greater than the set packet length threshold.
  • the sending queue performs message transmission, thereby improving the utilization of the time slice, thereby effectively reducing the waste of system resources.
  • the time slice can be idling, or, in order to ensure a higher priority transmission.
  • the sending of the packet in the queue the time slice can send the to-be-sent message included in the sending queue with the highest priority; or the sending queue with the largest number of bytes can be found in all the sending queues, and the sending queue is sent.
  • the message to be sent in the message; or a WTRU may be arbitrarily selected to send a message to be sent included in the sending queue.
  • the packet with the highest priority is preferentially transmitted, and according to the priority of each transmission queue in the port, according to the priority according to the transmission length threshold, including:
  • each transmission queue is sequentially searched according to the priority of the transmission queue from the highest to the bottom, and the number of bytes to be sent in the transmission queue is determined, and a certain transmission queue is found in order. If the number of bytes of the to-be-sent packet to be sent is greater than the set packet length threshold, the number of bytes of the to-be-sent packet included in all the transmission queues is greater than the configured packet.
  • the sending queue with the highest threshold and the highest priority is sent to the sending queue, and the to-be-sent packet included in the sending queue is sent.
  • FIG. 2 is a schematic diagram of a detailed process of a message transmission method according to the present invention.
  • the detailed process of the method includes the following steps:
  • S201 According to the priority of each sending queue in the port, find the sending queue with the highest priority in the current sending queue. Specifically, when the time slice mechanism of the system starts to operate and the time slice is allocated, the system searches for the highest priority sending queue in the current sending queue according to the priority of each sending queue in the port.
  • S202 Determine, according to the sending queue with the highest priority, the number of bytes that are to be sent in the current sending queue.
  • step S203 Determine whether the number of bytes included in the to-be-sent message in the sending queue is greater than a set message length threshold. If the determination result is yes, go to step S204; otherwise, go to step S205.
  • step S205 Determine whether the sending queue is the lowest priority sending queue of the port. When the determination result is yes, proceed to step S206; otherwise, proceed to step S207.
  • determining the time slice idling includes: When determining the lowest priority threshold in the current sending queue, the current time slice is idling.
  • step S207 In the transmission queue other than the transmission queue, the transmission queue with the highest priority is searched, and step S202 is performed.
  • the transmission queue that is greater than the set packet length threshold, for each transmission queue in the port is determined to be in the transmission queue.
  • the transmission queue that is greater than the set packet length threshold, for each transmission queue in the port is determined to be in the transmission queue.
  • the sending queue contains a message to be sent.
  • the sending queues may not contain the packets to be sent. If the sending queue does not contain the packets to be sent, the number of bytes included in the sending queue is zero, which is less than the set packet length threshold. Therefore, in the present invention, in order to improve the efficiency of packet transmission, before determining the number of bytes to be sent in each transmission queue, it is determined that the queue to be sent is If the packet to be sent is included in the sending queue, the number of bytes to be sent in the sending queue is determined. If the to-be-sent queue does not contain the to-be-sent packet, It is determined that the number of bytes included in the sending queue is less than the set packet length threshold, and the judgment of the next priority sending queue is directly performed.
  • FIG. 3 is a schematic diagram of a detailed process of another packet transmission method according to the present invention. The method includes the following steps:
  • S301 The time slice mechanism of the system starts to operate, and the current time slice is allocated.
  • S302 According to the priority of each sending queue in the port, find the sending queue with the highest priority in the current sending queue, and use the sending queue with the highest priority as the current sending queue.
  • step S303 Determine whether the current transmission queue includes a to-be-sent message. If the determination result is yes, go to step S304, otherwise, go to step S307.
  • S304 Determine, according to the current sending queue, the number of bytes included in the to-be-sent packet in the current sending queue.
  • step S305 Determine whether the number of bytes included in the to-be-sent packet in the current sending queue is greater than a set packet length threshold. If the determination result is yes, go to step S306; otherwise, go to step S307.
  • step S307 Determine whether the current sending queue is the lowest priority sending queue of the port. If the determination result is yes, proceed to step S308; otherwise, proceed to step S309.
  • S308 Determine that the time slice is idling, and immediately start the allocation of the next time slice.
  • Step S309 The sending queue with the highest priority is sent to the sending queue with the highest priority than the current sending queue, and the sending queue with the highest priority is used as the current sending queue. Step S303.
  • determining the priority is the most At the threshold, the current time slice allocation ends and the next time slice allocation begins.
  • the system in order to improve the time slice utilization rate and further ensure that packets with a high priority are preferentially transmitted, the system can uniformly set the packet transmission length threshold of each transmission queue in the port, or according to the port. For each priority transmission queue, set the packet transmission length threshold corresponding to the transmission queue of different priorities.
  • the system when a high-priority packet contains a small number of bytes, the system can uniformly set a packet transmission length threshold for the transmission queue in the port to ensure that packets with a low-priority traffic can be transmitted. For example, it is uniformly set to the maximum number of message bytes that a port can transmit. In this case, when the number of packets included in the sending queue with the highest priority is less than the set packet length threshold, the system does not reach the set packet length threshold. The current time slice is allocated to the transmission queue whose lower priority is included, and the number of bytes of the received message is greater than the set packet length threshold, and the message is transmitted.
  • the system sets the packet transmission length threshold according to the priority of the sending queue in the port. For example, setting a higher priority transmission.
  • the packet length of the queue is 60% of the maximum number of packets that can be transmitted on the port.
  • the maximum length of the packet sent by the queue with the lower priority is the maximum number of bytes that the port can transmit.
  • the time slice is allocated to the lower priority, and the number of bytes included is larger than the maximum number of bytes that the port can transmit.
  • the sending queue is used to transmit the packet. When the number of bytes of the to-be-sent packet accumulated in the queue with the higher priority is greater than 60% of the maximum number of bytes that the port can transmit, the time slice is allocated.
  • the high priority transmission queue performs message transmission.
  • FIG. 4 is a schematic structural diagram of a message sending apparatus according to the present invention.
  • the apparatus includes: a determining module 41, configured to: according to a priority of each sending queue in a port, according to a priority Message transmission length threshold;
  • the transmission idling module 42 is configured to allocate a time slice to the sending queue to perform message transmission when determining that the number of bytes of the to-be-sent message included in the sending queue is greater than a preset packet sending length threshold; , to determine the time slice idling.
  • the transmission idling module 42 is specifically configured to find a sending queue with the highest priority in the current sending queue. For the sending queue with the highest priority, determine the number of bytes to be sent in the sending queue with the highest priority. And determining whether the number of bytes included in the to-be-sent packet is greater than a preset packet length threshold; when determining that the number of bytes to be sent in the to-be-sent packet is greater than a preset packet length threshold, time slice allocation The packet with the highest priority is sent to the transmission queue. Otherwise, the transmission queue with the lower priority of the highest priority transmission queue is searched until the time slice is allocated to the transmission queue for packet transmission.
  • the determining module 41 is further configured to determine whether the highest priority sending queue includes a to-be-sent packet.
  • the transmission idle module 42 is specifically configured to determine that the time slice is idle when the number of bytes of the to-be-sent packet included in the transmission queue with the lowest priority in the transmission queue is smaller than a preset packet transmission length threshold.
  • the device also includes:
  • the setting module 43 is configured to set a message sending length threshold according to the maximum rate of the port and the time length of the time slice, where the message sending length threshold is not more than any value of the product of the port maximum rate and the time length of the time slice.
  • the present invention provides a packet transmission method and apparatus.
  • a packet length threshold is set in advance, and according to the priority of each transmission queue in the port, the transmission length threshold is sequentially determined according to the priority;
  • the slice is allocated to the sending queue for message transmission;
  • the time slice is determined to be idle.
  • the time slice is allocated to the transmission only when the number of bytes to be transmitted in the transmission queue is greater than the set packet length threshold.
  • the queue is used for message transmission. Therefore, the utilization of the time slice is improved, thereby effectively reducing the waste of system resources.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)
  • Telephonic Communication Services (AREA)

Abstract

La présente invention concerne un procédé et un dispositif de transmission de paquets. Ledit procédé consiste à : configurer un seuil de longueur de transmission de paquets, déterminer séquentiellement sur la base de la priorité de chaque file d'attente de transmission dans un port si un compte d'octets compris dans une transmission en attente de paquets, comprise dans chaque file d'attente de transmission, est supérieur au seuil de longueur de transmission de paquets configuré ; déterminer d'allouer ou non une tranche de temps à la file d'attente de transmission, effectuer la transmission de paquets ; lorsqu'il est déterminé que les comptes d'octets compris dans la transmission en attente de paquet dans toutes les files d'attente de transmission sont inférieurs au seuil de longueur de transmission de paquets configuré, déterminer que la tranche de temps est au repos. Dans la présente invention, parce que le seuil de longueur de transmission de paquets est configuré pour chaque file d'attente de transmission, uniquement lorsque le compte d'octets, compris dans la transmission en attente de paquets dans la file d'attente de transmission, est supérieur au seuil de longueur de transmission de paquets configuré, la tranche de temps est allouée à la file d'attente de transmission pour effectuer la transmission de paquets, ce qui améliore le taux d'utilisation de la tranche de temps et réduit ainsi efficacement le gaspillage de ressources du système.
PCT/CN2012/076860 2011-06-17 2012-06-13 Procédé et dispositif de transmission de paquets WO2012171460A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201110164406.X 2011-06-17
CN201110164406.XA CN102223306B (zh) 2011-06-17 2011-06-17 一种报文传输方法及装置

Publications (1)

Publication Number Publication Date
WO2012171460A1 true WO2012171460A1 (fr) 2012-12-20

Family

ID=44779738

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2012/076860 WO2012171460A1 (fr) 2011-06-17 2012-06-13 Procédé et dispositif de transmission de paquets

Country Status (2)

Country Link
CN (1) CN102223306B (fr)
WO (1) WO2012171460A1 (fr)

Families Citing this family (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102223306B (zh) * 2011-06-17 2018-10-16 南京中兴软件有限责任公司 一种报文传输方法及装置
CN102833168B (zh) * 2012-08-31 2015-12-02 北京东土科技股份有限公司 一种基于时间触发机制的数据传输方法及装置
CN102882809B (zh) * 2012-10-26 2015-07-15 杭州迪普科技有限公司 一种基于报文缓存的网络限速方法及装置
US9667561B2 (en) * 2013-04-26 2017-05-30 Mediatek Inc. Packet output controller and method for dequeuing multiple packets from one scheduled output queue and/or using over-scheduling to schedule output queues
CN104468629B (zh) * 2014-12-30 2018-10-09 北京奇虎科技有限公司 一种批量发送消息的方法和装置
CN106713172B (zh) * 2015-11-16 2019-06-18 华为数字技术（苏州）有限公司 一种调度报文的方法和装置
EP3905620A4 (fr) 2019-02-03 2022-01-12 Huawei Technologies Co., Ltd. Procédé de planification de message, planificateur, dispositif de réseau et système de réseau
CN110336758B (zh) * 2019-05-28 2022-10-28 厦门网宿有限公司 一种虚拟路由器中的数据分发方法及虚拟路由器
CN112585914B (zh) * 2020-11-27 2024-05-28 新华三技术有限公司 报文转发方法、装置以及电子设备
CN115209166A (zh) * 2021-04-12 2022-10-18 北京字节跳动网络技术有限公司 一种消息发送方法、装置、设备和存储介质

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1809050A (zh) * 2006-02-13 2006-07-26 杭州华为三康技术有限公司 一种发送报文的方法
CN102025638A (zh) * 2010-12-21 2011-04-20 福建星网锐捷网络有限公司 基于优先级的数据传输方法、装置及网络设备
CN102035748A (zh) * 2010-12-31 2011-04-27 深圳市深信服电子科技有限公司 一种基于应用的流量控制方法及流量控制器
CN102223306A (zh) * 2011-06-17 2011-10-19 中兴通讯股份有限公司 一种报文传输方法及装置

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR20000038096A (ko) * 1998-12-03 2000-07-05 정선종 데이터 전송용 위성 망에서 채널 할당방법
CN101547150B (zh) * 2009-04-30 2011-12-28 中兴通讯股份有限公司 数据通信输入端口调度的方法及装置

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1809050A (zh) * 2006-02-13 2006-07-26 杭州华为三康技术有限公司 一种发送报文的方法
CN102025638A (zh) * 2010-12-21 2011-04-20 福建星网锐捷网络有限公司 基于优先级的数据传输方法、装置及网络设备
CN102035748A (zh) * 2010-12-31 2011-04-27 深圳市深信服电子科技有限公司 一种基于应用的流量控制方法及流量控制器
CN102223306A (zh) * 2011-06-17 2011-10-19 中兴通讯股份有限公司 一种报文传输方法及装置

Also Published As

Publication number Publication date
CN102223306B (zh) 2018-10-16
CN102223306A (zh) 2011-10-19

Similar Documents

Publication Publication Date Title
WO2012171460A1 (fr) Procédé et dispositif de transmission de paquets
EP2702730B1 (fr) Circuits efficaces dans réseaux à commutation de paquets
CN104079501B (zh) 一种基于多优先级的队列调度方法
WO2012122849A1 (fr) Procédé et dispositif d'attribution de ressource de liaison montante
CN101557340B (zh) 一种数据网络中实现多级队列调度的方法及装置
JP5297317B2 (ja) 無線リソース割当装置および無線リソース割当方法
WO2018121522A1 (fr) Procédé de transmission de données, équipement utilisateur et dispositif d'accès radio
TW201338470A (zh) 用於在客戶端裝置上利用封包服務分類執行封包佇列的系統及方法
WO2014075555A1 (fr) Procédé et dispositif pour une programmation de ressources de tranche de temps
WO2014032348A1 (fr) Procédé et dispositif de transmission de données basés sur un mécanisme à déclenchement temporel
WO2018113436A1 (fr) Procédé et dispositif de gestion d'encombrement réseau
WO2008095397A1 (fr) Procédé de planification de trafic et appareil apparenté
CN106330742B (zh) 一种流量控制的方法及网络控制器
Karim et al. An efficient priority packet scheduling algorithm for wireless sensor network
CN101286949A (zh) 基于IEEE802.16d标准的无线Mesh网MAC层资源调度策略
CN101075963A (zh) 一种基于网络QoS的动态控制装置及其方法
WO2014117347A1 (fr) Procédé et appareil de planification de données
WO2014201934A1 (fr) Procédé et dispositif de planification de message
WO2015149460A1 (fr) Procédé, dispositif et système de commande de flux de canal de fibre optique sur ethernet
WO2016033938A1 (fr) Procédé et appareil de transmission de messages de commande et support de stockage informatique
WO2016082115A1 (fr) Procédé et dispositif d'ordonnancement de service
EP2477366A1 (fr) Procédé, appareil et système de transmission de données
CN1518296A (zh) 一种支持多业务的综合队列调度的实现方法
Dumazet Busy polling: Past, present, future
CN104427630B (zh) 一种分组调度方法及装置

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 12800970

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 12800970

Country of ref document: EP

Kind code of ref document: A1