WO2008025194A1 - Procédé et dispositif de contrôle de flux de données - Google Patents

Procédé et dispositif de contrôle de flux de données Download PDF

Info

Publication number
WO2008025194A1
WO2008025194A1 PCT/CN2007/000830 CN2007000830W WO2008025194A1 WO 2008025194 A1 WO2008025194 A1 WO 2008025194A1 CN 2007000830 W CN2007000830 W CN 2007000830W WO 2008025194 A1 WO2008025194 A1 WO 2008025194A1
Authority
WO
WIPO (PCT)
Prior art keywords
queue
data packet
packet
data
information
Prior art date
Application number
PCT/CN2007/000830
Other languages
English (en)
Chinese (zh)
Inventor
Weimin Qiu
Original Assignee
Huawei Technologies Co., Ltd.
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 Huawei Technologies Co., Ltd. filed Critical Huawei Technologies Co., Ltd.
Publication of WO2008025194A1 publication Critical patent/WO2008025194A1/fr

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L69/00—Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
    • H04L69/28—Timers or timing mechanisms used in protocols
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • 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
    • 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/56—Queue scheduling implementing delay-aware scheduling
    • H04L47/562—Attaching a time tag to queues

Definitions

  • the invention relates to a network data transmission technology, in particular to a data flow control method and device. Background technique
  • the traffic classification technology and the priority scheduling technology are generally used to control the traffic of the IP data packet (indicated by the flow control).
  • the traffic classification technology usually divides the data flow into a Premium Service (PS) according to the type of service > Assured Service (AS) and Best Effort (BE).
  • PS implements delay-sensitive services, and its goal is to minimize the waiting time of packets in the queue of the network node, and to have characteristics such as jitter, low packet loss rate, and bandwidth guarantee, such as: IP telephony; AS implements bandwidth-sensitive services, and allocates them.
  • QOS quality of service
  • FTP File Transfer Protocol
  • IP packets have the following characteristics: Variable length, it is difficult to calculate accurate traffic; It is bursty, there is no fixed traffic, and it is difficult to predict.
  • Transmission Control Protocol Transmission Control Protocol
  • a large number of data packets are retransmitted, which leads to network congestion
  • the invention provides a data flow control method and device to improve flow control accuracy and reduce network congestion.
  • a data flow control method provided by the embodiment of the present invention includes determining whether a difference between a current time and a transmission time of a previous data packet in a current queue is greater than a preset average time interval, where the queue is used to store the same destination address. The packet, if yes, sends the first packet in the queue and then processes the next queue; otherwise, the next queue is processed directly.
  • the data flow control device includes: a queue storage module, configured to store a queue of data packets with the same destination address; and a scheduling and forwarding module and a comparison module, where the scheduling and forwarding module is used for The queues stored in the queue storage module are polled, and the comparison module is called to calculate the difference between the current time and the sending time of the last data packet in the current queue; when the difference is greater than a preset average time interval, the sending is performed. The first packet in the queue, then polls the next queue; otherwise, polls the next queue directly.
  • the embodiment of the present invention strictly controls the sending of data packets according to preset time conditions, thereby realizing accurate control of the bandwidth of the terminal user and ensuring the accuracy of the flow control; It avoids the loss of real-time data packets and is re-transmitted to cause data packets to be sent, which avoids the access layer users competing for bandwidth and improving the operation quality.
  • FIG. 1 is a flowchart of Embodiment 1 of a data flow control method according to the present invention.
  • FIG. 2 is a schematic structural diagram of Embodiment 1 of a data flow control apparatus according to the present invention.
  • FIG. 3 is a flowchart of Embodiment 2 of a data flow control method according to the present invention.
  • FIG. 5 is a flowchart of Embodiment 3 of the flow control method according to the present invention.
  • FIG. 6 is a schematic structural diagram of Embodiment 3 of a data flow control apparatus according to the present invention.
  • the queues of the data packets sent to the user are sequentially processed, and if the current queue satisfies the average time interval condition, the first data packet in the queue is sent to the user, and then the next queue is processed; If the current queue does not meet the average time interval condition, the next queue is processed directly without sending a packet to the user.
  • Step 101 Determine whether a difference between a current time and a transmission time of a previous data packet in a current queue is greater than a pre-acquired average time interval. If yes, go to step 102; otherwise, go to step 103.
  • the queue is used to store the data packet with the same destination address.
  • the destination address can be the destination port number, the destination IP address, the destination MAC address, or any combination thereof.
  • the average time interval can be set according to actual needs. For example, a fixed average time interval is preset, or it can be set according to the user's subscription traffic corresponding to the destination address.
  • Step 102 Send the first data packet in the queue. Then, go to step 104.
  • step 103 it is determined whether there are other queues. If yes, go to step 104; otherwise, go back to step 101.
  • Step 104 Poll the next queue and go to step 101. Therefore, the data packet transmission is strictly controlled, the accuracy of the bandwidth control of the terminal user is realized, the accuracy of the flow control is ensured, and the burst traffic is avoided, the impact of the burst traffic on the core network is reduced, and the core is reduced. Network investment.
  • FIG. 2 is a schematic structural diagram of Embodiment 1 of the data flow control apparatus of the present invention which can be used to implement the method of FIG.
  • the data flow control device includes: a scheduling forwarding module 1, a comparison module 2, and a queue storage module 3, wherein the queue storage module 3 is configured to store a queue of data packets with the same destination address; The queue storing the data packet is polled, and the comparison module 2 is called to calculate the difference between the current time and the transmission time of the previous data packet in the current queue. When the difference is greater than the preset average time interval, the first packet in the queue is sent, and then the next queue is polled; otherwise, the next queue is polled directly.
  • FIG. 3 is a flowchart of Embodiment 2 of a data flow control method according to the present invention.
  • an average packet length of data packets in each queue is dynamically calculated, thereby determining an average time interval of data packets leaving each queue. Specifically include:
  • Step 301 Calculate an average packet length of the data packet in the queue.
  • the number of samples of the data packet preset by the user may be obtained from the description information of the queue, the data packet of the sample number is debounced, and then the packet length of the debounced data packet is averaged, thereby obtaining The average packet length of the packet.
  • Step 302 Determine, according to the average packet length of the data packet and the subscription traffic information of the user that is the same as the destination address of the data packet, the average time interval for sending the adjacent data packet by the queue.
  • the subscription traffic information of the user whose address is the same as the destination address of the data packet is obtained.
  • the average packet length and the subscription traffic may be negotiated to obtain the queue transmission phase. The average time interval between adjacent packets.
  • Step 303 Determine whether the difference between the current time and the sending time of the last data packet in the current queue is greater than the calculated average time interval. If yes, go to step 304; otherwise, go to step 305.
  • Step 304 sending the first data packet in the queue. Then, step 306 is performed.
  • step 305 it is determined whether there are other queues. If yes, go to step 306; otherwise, go back to step 302.
  • FIG 4 is a block diagram showing the structure of the second embodiment of the data flow control device of the present invention which can be used to implement the method of Figure 3, in the embodiment shown in Figure 2! ⁇ , a computing processing module 4 connected to the dispatching and forwarding module 1 is added, which is used for calculating the average packet length of the data packet in the queue, and obtaining the subscription traffic information of the user whose address is the same as the destination address of the data packet. And calculating the average time interval for sending adjacent data packets in the queue by evaluating the average packet length and the subscription traffic.
  • the number of samples corresponding to a destination address, the debounce parameters eight and B, and the parameters N, A, and B can be set in advance, and can be modified at any time. For example: You can choose the default value of A and B as 1 or 2.
  • the sample number is stored in the user information corresponding to the destination address, and the destination address may be a destination port number, a destination IP address, a destination MAC address, or any combination thereof.
  • a queue for each packet for storing the same destination address is established in advance based on the destination address.
  • the data flow control method provided by the present invention can be used to flow control the transmission of the data packet.
  • FIG. 5 is a flowchart of Embodiment 3 of the data flow control method of the present invention, which includes the following steps:
  • Step 501 Receive a data packet, and detect parameter information of the data packet, including a destination address and a packet length information of the data packet, for example, a destination IP address is 10.10.10.101, and a packet length information is 64K.
  • Step 502 The data packet is stored in a queue with a destination IP address of 10.10.10.101. Meanwhile, the description information is established according to the parameter information of the data packet, where the description information includes a packet length of the data packet and a next data packet. Describe the address of the information, and store the description information of the data packet at the destination IP address of 10.10.10.101. At the same time, obtain the user information with the IP address of 10.10.10.101, and establish the destination IP address according to the description information and the user information.
  • the description information of the queue of 10.10.10.101 includes the subscription traffic of the user, the number of samples N, the average packet length of the data packet of the sample number N, and the longest packet length of the data packet of the sample number N, The shortest packet length of the packet of the sample number N, the transmission time of the previous packet, and the address information of the first packet in the queue.
  • Table 1 shows an example of the content of the description information of the data packet of a certain destination address.
  • Table 2 below shows an example of the content of the description information of the queue of a certain destination address.
  • Step 505 Determine whether the difference between the current time and the Tprev in the description information of the queue is greater than the calculated current T_int of the queue. If yes, go to step 506; otherwise, go to step 507.
  • Step 506 Send the first data packet in the queue to its destination address. Then, step 508 is performed.
  • step 507 it is determined whether there are other queues. If yes, go to step 509; otherwise, go back to step 504.
  • the scheduling and forwarding module 1 is configured to poll the queue of the stored data packet by the average time interval calculated by the calculation processing module 4, and when the difference between the current time and the sending time of the last data packet in the current queue is greater than the average time interval, The first packet in the queue is sent, then the next queue is polled, otherwise, the next queue is polled directly.
  • the data information storage module 8, the queue storage module 3, and / Or the user information storage module 6 can be integrally provided.
  • the data information storage module 8, the queue storage module 3, and/or the user information storage module 6 may also be integrally provided with the monitoring management module 7; the monitoring management module may also be integrally provided with the data receiving module 5.
  • the transmission of the data packet can be strictly controlled to ensure the accuracy and QOS of the flow control
  • the access layer users are prevented from competing for bandwidth and improving the operation quality

Landscapes

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

Abstract

L'invention concerne un procédé de contrôle de flux de données, qui consiste : à déterminer si la différence entre le temps actuel et le temps auquel le dernier paquet de données de la file d'attente actuelle a été transmis est supérieure à un intervalle de temps moyen prédéterminé; si tel est le cas, à transmettre le premier paquet de données de la file d'attente et à traiter la file d'attente suivante; si tel n'est pas le cas, à traiter directement la file d'attente suivante, laquelle stocke les paquets de données possédant la même adresse de destination. L'invention a également trait à un dispositif de contrôle de flux de données, qui comprend un module de stockage de files d'attente, un module d'ordonnancement et de transmission et un module de comparaison.
PCT/CN2007/000830 2006-08-25 2007-03-15 Procédé et dispositif de contrôle de flux de données WO2008025194A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CNB2006101118487A CN100459586C (zh) 2006-08-25 2006-08-25 数据流量控制装置与流量控制方法
CN200610111848.7 2006-08-25

Publications (1)

Publication Number Publication Date
WO2008025194A1 true WO2008025194A1 (fr) 2008-03-06

Family

ID=37779028

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2007/000830 WO2008025194A1 (fr) 2006-08-25 2007-03-15 Procédé et dispositif de contrôle de flux de données

Country Status (2)

Country Link
CN (1) CN100459586C (fr)
WO (1) WO2008025194A1 (fr)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP3461085A4 (fr) * 2016-06-28 2019-05-08 Huawei Technologies Co., Ltd. Procédé et dispositif de gestion de file d'attente
CN112783123A (zh) * 2020-12-30 2021-05-11 北京理工大学 一种工作流调度执行单元控制方法和控制器

Families Citing this family (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101465792B (zh) * 2007-12-18 2011-05-25 北京北方微电子基地设备工艺研究中心有限责任公司 一种数据调度方法及装置
CN101827033B (zh) * 2010-04-30 2013-06-19 北京搜狗科技发展有限公司 一种网络流量控制方法、装置及局域网系统
CN103856435A (zh) * 2012-11-28 2014-06-11 中兴通讯股份有限公司 一种地址解析协议缓存及其缓存方法
CN105721332A (zh) * 2014-12-03 2016-06-29 深圳市中兴微电子技术有限公司 一种基于改进的wred的拥塞控制方法和装置
CN107707928B (zh) * 2017-10-30 2021-03-23 广州市千钧网络科技有限公司 一种数据流延迟的控制方法、装置及接收设备
CN109379287B (zh) * 2018-12-25 2022-03-11 广东浪潮大数据研究有限公司 一种数据包的输入缓冲方法及输入缓冲部件
CN113395302B (zh) * 2020-03-11 2022-04-26 杭州中天微系统有限公司 异步数据分发器、相关装置和方法

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20020097679A1 (en) * 2001-01-25 2002-07-25 Berenbaum Alan D. Automatic quality of service assignment in ethernet switches
CN1567828A (zh) * 2003-06-18 2005-01-19 中兴通讯股份有限公司 一种网络处理器对数据流量进行限速的方法
US20050232276A1 (en) * 2004-04-15 2005-10-20 Frank Glaser Method for processing a sequence of data packets in a receiver apparatus, as well as a receiver apparatus

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7237007B2 (en) * 2001-12-05 2007-06-26 Qualcomm Incorporated Method and system for flow control between a base station controller and a base transceiver station

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20020097679A1 (en) * 2001-01-25 2002-07-25 Berenbaum Alan D. Automatic quality of service assignment in ethernet switches
CN1567828A (zh) * 2003-06-18 2005-01-19 中兴通讯股份有限公司 一种网络处理器对数据流量进行限速的方法
US20050232276A1 (en) * 2004-04-15 2005-10-20 Frank Glaser Method for processing a sequence of data packets in a receiver apparatus, as well as a receiver apparatus

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP3461085A4 (fr) * 2016-06-28 2019-05-08 Huawei Technologies Co., Ltd. Procédé et dispositif de gestion de file d'attente
US10951551B2 (en) 2016-06-28 2021-03-16 Huawei Technologies Co., Ltd. Queue management method and apparatus
CN112783123A (zh) * 2020-12-30 2021-05-11 北京理工大学 一种工作流调度执行单元控制方法和控制器

Also Published As

Publication number Publication date
CN100459586C (zh) 2009-02-04
CN1921450A (zh) 2007-02-28

Similar Documents

Publication Publication Date Title
WO2008025194A1 (fr) Procédé et dispositif de contrôle de flux de données
US10432556B1 (en) Enhanced audio video bridging (AVB) methods and apparatus
US6633540B1 (en) Real-time traffic shaper with keep-alive property for best-effort traffic
CN108418767B (zh) 数据传输方法、设备及计算机存储介质
JP4105341B2 (ja) フラグメントサイズ変更方法及びルータ装置
US7633869B1 (en) Automatic network traffic characterization
WO2020042624A1 (fr) Procédé et appareil de commande de débit de transmission, dispositif d'envoi et dispositif de réception
US20040156380A1 (en) Multi-level expedited forwarding per hop behavior
WO2006002597A1 (fr) Procede permettant l'acquisition periodique de la qos d'un flux de donnees multimedia
EP1240740A1 (fr) Commutateur de reseau possedant une programmation de paquets
JP2009055327A (ja) ネットワークシステム
CN113726671B (zh) 一种网络拥塞控制方法及相关产品
JP2001168920A (ja) 可変長パケットの輸送用ネットワークのパケットの流れをトラフィック契約に一致させる方法
JP2001285296A (ja) 中継装置
WO2008062621A1 (fr) Système de communication à transmission en continu
KR101585208B1 (ko) 라우팅 및 게이트웨이 통합 ＶｏＩＰ 시스템에서 광대역포트로부터 수신되는 ＶｏＩＰ 미디어 패킷의 ＱｏＳ 제어시스템 및 방법
CN113783785A (zh) Ecn水线值的配置方法、装置及网络设备
Grigorescu et al. Evaluation of the impact of packet drops due to AQM over capacity limited paths
CN114979011B (zh) 一种应用于园区网络的拥塞控制方法
US8483210B2 (en) Method and apparatus for voice traffic management in a data network
WO2022068617A1 (fr) Procédé et dispositif de mise en forme de trafic
Irawan et al. Performance evaluation of queue algorithms for video-on-demand application
JP2004241835A (ja) 品質保証型データストリームを転送するための受付判定方法、閉域ｉｐ網、そのプログラム
Cisco Implementing a Wide Area Network
JP2002247067A (ja) 帯域制御装置

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: 07720411

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

NENP Non-entry into the national phase

Ref country code: RU

122 Ep: pct application non-entry in european phase

Ref document number: 07720411

Country of ref document: EP

Kind code of ref document: A1