CN102088414B - Method for managing passive queue by virtue of combining random drop and drop front - Google Patents
Method for managing passive queue by virtue of combining random drop and drop front Download PDFInfo
- Publication number
- CN102088414B CN102088414B CN2011100528201A CN201110052820A CN102088414B CN 102088414 B CN102088414 B CN 102088414B CN 2011100528201 A CN2011100528201 A CN 2011100528201A CN 201110052820 A CN201110052820 A CN 201110052820A CN 102088414 B CN102088414 B CN 102088414B
- Authority
- CN
- China
- Prior art keywords
- packet
- bottleneck node
- formation
- queue
- abandon
- Prior art date
- Legal status (The legal status 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 status listed.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 18
- 230000015572 biosynthetic process Effects 0.000 claims description 20
- 230000005540 biological transmission Effects 0.000 abstract description 8
- 238000007726 management method Methods 0.000 description 22
- 230000002950 deficient Effects 0.000 description 2
- 239000000654 additive Substances 0.000 description 1
- 230000000996 additive effect Effects 0.000 description 1
- 230000003139 buffering effect Effects 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 230000003247 decreasing effect Effects 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000002688 persistence Effects 0.000 description 1
- 238000011084 recovery Methods 0.000 description 1
- 230000035945 sensitivity Effects 0.000 description 1
Images
Abstract
The invention discloses a method for managing passive queue by virtue of combining random drop and drop front. The method comprises: when the Internet is jammed and a bottleneck node queue is full, a data packet is discarded from the front of the bottleneck node queue first; and then another data packet in the queue is randomly discarded, thus the fairness can be effectively improved, the global synchronization and deadlock can be eliminated, and the network transmission performance can be improved with small computation.
Description
Technical field
The present invention relates to data communication field, relate in particular at random and abandon the method for the passive queue management of head combination.
Background technology
TCP is provided with different parameters and realizes the congested control of different TCP through " starting slowly ", " Congestion Avoidance ", " retransmitting fast ", " fast quick-recovery " 4 algorithms; Be exactly to increase long-pending formula with formula to reduce (AIMD; Additive increase multiplicative decrease), TCP adjusts transmission speed according to congestion window.The most frequently used queue management strategy is " abandoning tail " (Drop Tail) in the bottleneck node, and promptly the packet loss along with overflowing of buffering area is a kind of passive queue management mechanism.The defective of " abandoning tail " comprises the global synchronization of data flow, deadlock and continue that bursty traffic that team completely causes is strangled etc.Though active queue management can solve " global synchronization " problem effectively, exists parameter that sensitivity is set, response relatively lags behind in the defective of real network situation its algorithm more complicated.In actual use, complicated algorithm is brought very big expense to the network equipment, and the decreased performance of intermediate node has increased the weight of network congestion on the contrary, so present various Active Queue Management Algorithm is not used on network in a large number.
Summary of the invention
The object of the invention is exactly a method that adopts at random and abandon the passive queue management of head combination, and network takes place congested, during the bottleneck node queue full; Earlier abandon a packet from bottleneck node formation head; And then in formation packet of random drop, can effectively improve fairness, eliminate global synchronization and deadlock; Improve network transmission performance, and the algorithm computation amount is little.Owing to be ability packet discard when the bottleneck node queue full, so be a kind of method of passive type queue management.
To achieve these goals, the technical scheme of the present invention's employing is:
When the bottleneck node queue full, earlier abandon a packet, and then calculate one 1 and subtract 1 random number to current queue length from bottleneck node formation head, abandon the packet that is positioned at this random number again.Adopt at random with abandon head combine a packet loss mainly to be because: during (1) bottleneck node queue full; Explain congested more serious; Therefore it is not enough only abandoning 1 packet; If abandon 2 packets simultaneously, just can let more transmitting terminal detect network congestion and reduce transmission speed as soon as possible, alleviate congestion condition; (2) abandon a mode than other data packet discarding mode, can notify the transmitting terminal network congested as soon as possible; When (3) adopting at random packet loss simultaneously; If the packet number that TCP is linked in the formation is n, the formation maximum length is a Q packet, and then to link by the probability of packet loss be n/Q to this TCP; Be connected to better punishment effect to occupying the more TCP chain of formation, improve fairness.Bottleneck node concrete operations step is following:
Q representes the maximum length of bottleneck node formation, and q representes current bottleneck node queue length.
(1) judges whether that new packet will get into the bottleneck node formation: if not, then still in (1) step; If, then to (2) step;
(2) judge whether q >=Q-1: if, then to (3) step; If not, then to (6) step;
(3) abandon the top packet of formation;
(4) call random function and calculate the random number between [1, q-2];
(5) abandon the packet that is positioned at the random number position that step (4) calculates;
(6) new data packets gets into the bottleneck node formation, and then to (1) step.
The inventive method can be avoided global synchronization and deadlock, improves the fairness of Network Transmission, improves utilization rate of network resource.This method is simple, is adapted at using on the existing Internet.
Description of drawings
Fig. 1 is the flow chart of the inventive method;
Fig. 2 is the network topology that the inventive method is tested;
Fig. 3 is the inventive method and other queue management comparison result.
Embodiment
Below in conjunction with accompanying drawing the present invention is done further explain.
Q representes the maximum length of bottleneck node formation among the present invention, and q representes current bottleneck node queue length.
(1) judges whether that new packet will get into the bottleneck node formation: if not, then still in (1) step; If, then to (2) step;
(2) judge whether q >=Q-1: if, then to (3) step; If not, then to (6) step;
(3) abandon the top packet of formation;
(4) call random function and calculate the random number between [1, q-2];
(5) abandon the packet that is positioned at the random number position that step (4) calculates;
(6) new data packets gets into the bottleneck node formation, and then to (1) step.
Fig. 2 is the test network environment of the inventive method, and R0 is a bottleneck node, bottleneck link between node R 0 and node R 1, link capacity 12Mbps, the time-delay 15ms, adopt different queue managements respectively, cache size is 30packets; Node Si is persistence ftp business source, and the link capacity between they and the node R 0 is 20Mbps, and time-delay 15ms sends data to destination node Di; Link capacity between node Di and the node R 1 is 20Mbps, time-delay 15ms; Packet is 1040Byte (comprising 40Byte packet header).The window of receiving terminal Di is provided with enough big, makes TCP send and controlled by congestion window Cwnd.
Fig. 3 be the inventive method Fig. 1 embodiment with abandon the passive queue management of tail, RED active queue management, separately abandon the moving queue management of epicranium, the passive queue management method of packet loss is compared under Fig. 2 network environment at random separately; The number that sending node S is set is respectively 2,4,6,8,10; The number of receiving node D is identical with sending node, and bottleneck link R0 is to effective bag number of R1 transmission in the statistics 80s.The efficient of the inventive method will be higher than abandons the passive queue management of tail, RED active queue management, abandons the moving queue management of epicranium, the passive queue management of packet loss at random separately separately.Particularly when 2 sending nodes, method secured transmission of payload data bag ratio of the present invention abandon the passive queue management of tail, RED active queue management, separately abandon the moving queue management of epicranium, the passive queue management of packet loss exceeds 8%, 15.4%, 4.8%, 6.3% respectively at random separately.The inventive method can effectively improve the efficiency of transmission of network.
Present embodiment is not to be construed as limiting the invention, and those skilled in the art also belong to protection scope of the present invention through reading the equivalents of making behind the present embodiment.
Claims (1)
- One kind at random with a method of abandoning the passive queue management that head combines; Take place congested at network; During the bottleneck node queue full, earlier abandon a packet from bottleneck node formation head, and then in formation packet of random drop; It is characterized in that, following for bottleneck node concrete operations step:Q representes the maximum length of bottleneck node formation, and q representes current bottleneck node queue length;(1) judges whether that new packet will get into the bottleneck node formation: if not, then still in (1) step; If, then to (2) step;(2) judge whether q >=Q-1: if, then to (3) step; If not, then to (6) step;(3) abandon the top packet of formation;(4) call random function and calculate the random number between [1, q-2];(5) abandon the packet that is positioned at the random number position that step (4) calculates;(6) new data packets gets into the bottleneck node formation, and then to (1) step.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2011100528201A CN102088414B (en) | 2011-03-07 | 2011-03-07 | Method for managing passive queue by virtue of combining random drop and drop front |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2011100528201A CN102088414B (en) | 2011-03-07 | 2011-03-07 | Method for managing passive queue by virtue of combining random drop and drop front |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102088414A CN102088414A (en) | 2011-06-08 |
| CN102088414B true CN102088414B (en) | 2012-07-18 |
Family
ID=44100033
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2011100528201A Active CN102088414B (en) | 2011-03-07 | 2011-03-07 | Method for managing passive queue by virtue of combining random drop and drop front |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102088414B (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106385376B (en) * | 2016-08-31 | 2019-06-07 | 孙广路 | A kind of method for controlling network congestion based on Continuum Model |
| CN107197392B (en) * | 2017-05-24 | 2019-05-28 | 中广热点云科技有限公司 | Packet discarding method and packet loss device in barrage video stream transmission procedure |
| CN107295364B (en) * | 2017-05-24 | 2019-05-24 | 中广热点云科技有限公司 | For the real-time streaming transport control method of barrage video, control device |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101459584A (en) * | 2007-12-14 | 2009-06-17 | 中国科学院声学研究所 | Terminal processing method for P2P stream media data request |
| CN101969432A (en) * | 2010-09-27 | 2011-02-09 | 江苏科技大学 | Random backoff based control method of TCP (Transmission Control Protocol) congestion window |
-
2011
- 2011-03-07 CN CN2011100528201A patent/CN102088414B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101459584A (en) * | 2007-12-14 | 2009-06-17 | 中国科学院声学研究所 | Terminal processing method for P2P stream media data request |
| CN101969432A (en) * | 2010-09-27 | 2011-02-09 | 江苏科技大学 | Random backoff based control method of TCP (Transmission Control Protocol) congestion window |
Non-Patent Citations (1)
| Title |
|---|
| 李雪等.TCP丢包检测技术分析.《中国新通信》.2007,(第17期),52-54. * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102088414A (en) | 2011-06-08 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Monks et al. | Limitations of TCP-ELFN for ad hoc networks | |
| Hayes et al. | Revisiting TCP congestion control using delay gradients | |
| Zhai et al. | Rate-based transport control for mobile ad hoc networks | |
| CN105024940A (en) | Link adaptation-based heterogeneous network TCP congestion control method | |
| KR20140049581A (en) | A method for avoiding network congestion and an apparatus thereof | |
| Francis et al. | Techniques for enhancing TCP performance in wireless networks | |
| Thilagavathe et al. | Cross layer based congestion control technique for reliable and energy aware routing in MANET | |
| Poojary et al. | Analytical model for congestion control and throughput with TCP CUBIC connections | |
| CN102088414B (en) | Method for managing passive queue by virtue of combining random drop and drop front | |
| CN101969432A (en) | Random backoff based control method of TCP (Transmission Control Protocol) congestion window | |
| CN102123094B (en) | Passive queue management method capable of realizing random packet loss twice | |
| Himeedah et al. | Tcp congestion analysis of wired and wireless links using ns3 | |
| CN102082735B (en) | Method for managing passive queue by abandoning head for N times | |
| Hao et al. | Study on internet congestion control algorithm | |
| Zhang et al. | TCP-FITDC: An adaptive approach to TCP incast avoidance for data center applications | |
| Asmaa et al. | EC-elastic an explicit congestion control mechanism for named data networking | |
| Zhang et al. | Dynamics comparison of TCP Veno and Reno | |
| Pradeep et al. | Comparison of drop rates in different TCP variants against various routing protocols | |
| Shihada et al. | BAIMD: a responsive rate control for TCP over optical burst switched (OBS) networks | |
| Chen et al. | Adaptive congestion control of internet of things based on improved red algorithm | |
| Chen et al. | TCP with variance control for multihop ieee 802.11 wireless networks | |
| Oda et al. | Compound TCP+ for fairness improvement among Compound TCP connections in a wireless LAN | |
| Nemoto et al. | An adaptive TCP congestion control having RTT-fairness and inter-protocol friendliness | |
| Oo et al. | How good delayed acknowledgement effects rate-based pacing tcp over multi-hop wireless network | |
| Kliazovich et al. | Cross-layer congestion control in multi-hop wireless local area networks |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| ASS | Succession or assignment of patent right |
Owner name: CHANGSHU NANJING NORMAL UNIVERSITY DEVELOPMENT INS Free format text: FORMER OWNER: JIANGSU UNIVERSITY OF SCIENCE AND TECHNOLOGY Effective date: 20121109 |
|
| C41 | Transfer of patent application or patent right or utility model | ||
| COR | Change of bibliographic data |
Free format text: CORRECT: ADDRESS; FROM: 212003 ZHENJIANG, JIANGSU PROVINCE TO: 215500 SUZHOU, JIANGSU PROVINCE |
|
| TR01 | Transfer of patent right |
Effective date of registration: 20121109 Address after: 215500 Changshou City South East Economic Development Zone, Jiangsu, Jin Road, No. 8 Patentee after: Changshu Nanjing Normal University Development Research Academy Institute Co., Ltd. Address before: 212003 Zhenjiang City, Jiangsu province dream Creek Road, No. 2 Patentee before: Jiangsu University of Science and Technology |
|
| TR01 | Transfer of patent right | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20171013 Address after: 215500 Qingnian Road, Suzhou, Jiangsu Province, Changshou City Town, Sha Chang town, Chang Kun Industrial Park, No. 88 Patentee after: Jiangsu Zhongli Electronic Information Technology Co., Ltd. Address before: 215500 Changshou City South East Economic Development Zone, Jiangsu, Jin Road, No. 8 Patentee before: Changshu Nanjing Normal University Development Research Academy Institute Co., Ltd. |
|
| TR01 | Transfer of patent right |
Effective date of registration: 20180115 Address after: 215500 Qingnian Road, Suzhou, Jiangsu Province, Changshou City Town, Sha Chang town, Chang Kun Industrial Park, No. 88 Co-patentee after: Jiangsu Zhongli group Limited by Share Ltd Patentee after: Jiangsu Zhongli Electronic Information Technology Co., Ltd. Address before: 215500 Qingnian Road, Suzhou, Jiangsu Province, Changshou City Town, Sha Chang town, Chang Kun Industrial Park, No. 88 Patentee before: Jiangsu Zhongli Electronic Information Technology Co., Ltd. |
|
| TR01 | Transfer of patent right |