CN1622532A - A dynamic equilibrium distributing method for port data flow - Google Patents
A dynamic equilibrium distributing method for port data flow Download PDFInfo
- Publication number
- CN1622532A CN1622532A CNA2003101166646A CN200310116664A CN1622532A CN 1622532 A CN1622532 A CN 1622532A CN A2003101166646 A CNA2003101166646 A CN A2003101166646A CN 200310116664 A CN200310116664 A CN 200310116664A CN 1622532 A CN1622532 A CN 1622532A
- Authority
- CN
- China
- Prior art keywords
- port
- data flow
- initialization
- congested
- label
- 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.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 19
- 238000013507 mapping Methods 0.000 claims description 7
- 230000001105 regulatory effect Effects 0.000 abstract 1
- 238000012545 processing Methods 0.000 description 3
- 238000004891 communication Methods 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 230000003068 static effect Effects 0.000 description 1
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The dynamic balanced port data flow distributing method for distributing the data flow from one first port to several second ports includes: receiving the data package of data flow from the first port; judging whether the data flow has been initialized based on the label of the data flow and distributing one destination port for un-initialized flow while recording the corresponding relation; for initialized flow, judging whether to have jamming in the corresponding second port, and re-transmitting the data package from the corresponding second port if no jamming; in case of jamming, regulating the data flow to the next no-jamming second port for data package re-transmission, and recording the corresponding relation between the data flow label to the second port.
Description
Technical field
The present invention relates to the communication technology, relate in particular to the balanced distribution method of a kind of port data flow dynamics.
Background technology
Giving the interface of several low rates with the distribution of flows of a two-forty interface, is the problem that the data communication the inside runs into through regular meeting.As, from 2.5G port to four a 622M port,, all be typical example from 10G port to four a 2.5G port and from 40G port to four a 10G port.In order to guarantee that four ports can both handle with heap(ed) capacity, this just need need guarantee its harmony when giving four ports with flow distribution.
Prior art, after the data flow initialization, the packet of this stream should be transmitted from fixed port, no longer adjusts, though this method is simple, but because data flow all has sudden, distribute so can not carry out absolute static equilibrium, when surpassing port flow, a part of flow can't be adjusted to other ports when the stream sudden increase of generation, promptly can not realize the dynamic equalization flow, the packet loss phenomenon will take place in this moment.
Summary of the invention
The object of the present invention is to provide the balanced distribution method of a kind of port data flow dynamics, can not dynamic equalization have the problem of packet loss when increasing in that data traffic is sudden to solve in the prior art because of a plurality of port data flows.
For addressing the above problem, the invention provides following technical proposals:
The balanced distribution method of a kind of port data flow dynamics is used for giving a plurality of second ports with the distribution of flows of one first port; It is characterized in that the method comprising the steps of:
The packet of A, a data flow of reception first port;
B, judge the whether initialization of this data flow according to the label of data flow, if then carry out step D, otherwise, carry out step C;
C, be one second port of described distribution of flows as destination interface, transmit packet and write down the corresponding relation of this data flow label and this second port, the commentaries on classics steps A from this second port;
D, that whether second port of judging described data flow correspondence takes place is congested, if do not take place congestedly, then transmits packet from second port of this data flow correspondence, changes steps A; Otherwise, this data flow is adjusted to the next second congested port that do not take place, the corresponding relation that the second congested port is transmitted packet and record data stream label and this second port does not take place from this, change steps A.
According to said method:
With the initialization flag of data flow, the label of data flow, the destination slogan corresponding with this data flow, and the corresponding relation between the congestion flag of this destination slogan is stored in the mapping table.
Among the step C, the value of the initialization token that a value is circulated between the number of described second port is as the destination slogan of described data flow, and after this data flow of initialization, the value of initialization token is added 1, guarantee when initialization data flows balanced assignment of port numbers, wherein the initial value of this initialization token is identical with smallest end slogan in a plurality of second ports.
Among the step D,, do not adjust second port of described data flow correspondence when the second all ports all occurs when congested.
The present invention can increase substantially the flow percent of pass, reduces the influence because of congested convection current as far as possible, thereby has reduced the packet loss phenomenon that causes when bursts of traffic effectively.
Description of drawings
Fig. 1 is the illustraton of model of first end and a plurality of second ports;
Fig. 2 is a flow chart of the present invention.
Embodiment
Consult shown in Figure 1, the first port-for-port A, this port A is the port of a two-forty, delivers to four second ports (being not limited to four) from the flow process of port A after balanced the distribution and goes parallel processing, these four second ports are respectively port B, C, D, E, are the port of low rate.
Because the sudden and unpredictability of flow happens suddenly so ought originally be assigned to the flow of B port, its speed has surpassed 1/4 o'clock of flow of A port, at this moment packet loss will take place.The present invention automatically transfers to port C with the partial discharge that has more under this emergency case, D or E get on and handle, and to avoid taking place the phenomenon of packet loss to greatest extent, reaches best performance.That is to say, which port is data flow specifically remove is to carry out dynamic adjustments according to the flow situation of four ports in back, what flow was many will go its dynamic assignment to the little port of flow, to keep four flow equalizations between the port, guarantee the ability of the processing of its best.
In order to make the flow dynamics equilibrium, following sign is set:
The initialization token, balanced assignment of port numbers during the original allocation data flow.The value of initialization token is encircled between the number of second port and is followed, and initial value is identical with smallest end slogan in the port.With the currency of this initialization token destination slogan (port numbers of one second port) as this data flow, the value with the initialization token adds 1 then when data flow of initialization.In Fig. 1, the number of second port is 4, and the smallest end slogan is 0, and then the value of initialization token circulates between 0～3, if promptly currency is 3, the value that then adds after 1 is 0.
Initialization flag is used to represent whether some stream has distributed port numbers.
Congestion flag (or claiming dynamically to adjust sign) if the flow of one second port reaches certain thresholding, represents that the flow of this port has reached almost full, and this moment, this flag bit will be changed to 1.
For initialized data flow, the corresponding relation between the congestion flag of label (abbreviation stream number), initialization flag, destination slogan and this port of data flow is stored in the mapping table, as shown in the table.
| Initialization flag | Stream number | The destination slogan | Congestion flag |
| ????0 | ????1 | ????0 | ????1 |
| ????1 | ????2 | ????1 | ????0 |
| ????1 | ????3 | ????2 | ????0 |
| ????1 | ????4 | ????3 | ????0 |
| ????0 | ????N |
If it is congested to be that the destination interface of a flow distribution does not take place, then after this stream just mail to this destination interface always.
During original allocation, stream distribute destination interface in order, distributed port B after, will go to distribute port C, so analogize.Distribute port in order, in the process of distributing, transmit the initialization token.Simultaneously when a flow distribution behind port, this stream and its corresponding port etc. and initialization flag are written in the middle of the mapping table.
When non-original allocation, if a port generation is congested, this moment, congestion flag will be put, then can give next destination interface with the flow distribution that belongs to his part, if it is congested that next destination interface also takes place, then can distribute to again next destination interface, by that analogy.If four destination interfaces all need dynamic adjustment, then destination interface is not changed, and this moment, the packet loss phenomenon will take place.
Consult shown in Figure 2, as follows to the processing procedure of data flow:
Step 10: beginning is clearly zero with the initialization flag of all stream at first, and the token of initialization simultaneously also is clearly zero.
Step 20: receive the packet of a stream, and according to the number of failing to be sold at auction query mappings table.
Step 30: whether judgment data initialization, if there is not initialization, then carry out step 40, otherwise carry out step 50.
Step 40: the value that the destination slogan of stream is changed to the initialization token, be about to the destination interface of the port numbers port identical as this stream with the value of initialization token, transmit packet and each corresponding relation is write mapping table from this port, the value with the initialization token adds 1 simultaneously, changes step 20.
Step 50: it is congested whether the corresponding destination interface of judgment data stream takes place, if then carry out step 70, otherwise carry out step 60;
Step 60: packet is transmitted from the data flow corresponding port, promptly do not adjusted destination interface, and change step 20.
Step 70: the destination interface of data flow is adjusted into next not congested port, transmits packet and each corresponding relation is write the mapping table commentaries on classics step 20 from this not congested port.
If it is congested that all ports all take place, then do not adjust.
Describe though the present invention's second port is four ports, the number of this second port can increase or reduce as required, and its method is same as described above.
Claims (5)
1, the balanced distribution method of a kind of port data flow dynamics is used for giving a plurality of second ports with the distribution of flows of one first port; It is characterized in that the method comprising the steps of:
The packet of A, a data flow of reception first port;
B, judge the whether initialization of this data flow according to the label of data flow, if then carry out step D, otherwise, carry out step C;
C, be one second port of described distribution of flows as destination interface, transmit packet and write down the corresponding relation of this data flow label and this second port, the commentaries on classics steps A from this second port;
D, that whether second port of judging described data flow correspondence takes place is congested, if do not take place congestedly, then transmits packet from second port of this data flow correspondence, changes steps A; Otherwise, this data flow is adjusted to the next second congested port that do not take place, the corresponding relation that the second congested port is transmitted packet and record data stream label and this second port does not take place from this, change steps A.
2, the method for claim 1 is characterized in that, with the initialization flag of data flow, and the label of data flow, the destination slogan corresponding with this data flow, and the corresponding relation between the congestion flag of this destination slogan is stored in the mapping table.
3, the method for claim 1, it is characterized in that, among the step C, the value of the initialization token that a value is circulated between the number of described second port is as the destination slogan of described data flow, and after this data flow of initialization, the value of initialization token is added 1, guarantee when initialization data flows balanced assignment of port numbers, wherein the initial value of this initialization token is identical with smallest end slogan in a plurality of second ports.
4, as the arbitrary described method of claim 1 to 3, it is characterized in that, among the step D,, do not adjust second port of described data flow correspondence when the second all ports all occurs when congested.
5, method as claimed in claim 4 is characterized in that, the speed of described first port is higher than second port.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2003101166646A CN100479420C (en) | 2003-11-25 | 2003-11-25 | A dynamic equilibrium distributing method for port data flow |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2003101166646A CN100479420C (en) | 2003-11-25 | 2003-11-25 | A dynamic equilibrium distributing method for port data flow |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1622532A true CN1622532A (en) | 2005-06-01 |
| CN100479420C CN100479420C (en) | 2009-04-15 |
Family
ID=34760721
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB2003101166646A Expired - Lifetime CN100479420C (en) | 2003-11-25 | 2003-11-25 | A dynamic equilibrium distributing method for port data flow |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN100479420C (en) |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2009132559A1 (en) * | 2008-04-29 | 2009-11-05 | 华为技术有限公司 | A method, an apparatus and a system for equalizing flow capacity |
| CN102263697A (en) * | 2011-08-03 | 2011-11-30 | 杭州华三通信技术有限公司 | Method and device for sharing aggregated link traffic |
| CN107005484A (en) * | 2014-12-27 | 2017-08-01 | 英特尔公司 | For carrying out the technology that medium size is adaptively route in high performance network structure |
| JP2017224979A (en) * | 2016-06-15 | 2017-12-21 | 株式会社デンソー | Relay device |
| CN109831388A (en) * | 2017-11-23 | 2019-05-31 | 中国电信股份有限公司 | Method and apparatus for optimizing flow load balance |
| CN114374651A (en) * | 2021-12-31 | 2022-04-19 | 海光信息技术股份有限公司 | Transport flow control method, network on chip, electronic device, and storage medium |
-
2003
- 2003-11-25 CN CNB2003101166646A patent/CN100479420C/en not_active Expired - Lifetime
Cited By (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2009132559A1 (en) * | 2008-04-29 | 2009-11-05 | 华为技术有限公司 | A method, an apparatus and a system for equalizing flow capacity |
| US8611226B2 (en) | 2008-04-29 | 2013-12-17 | Huawei Technologies Co., Ltd. | Method, apparatus and system for equalizing flows |
| CN102263697A (en) * | 2011-08-03 | 2011-11-30 | 杭州华三通信技术有限公司 | Method and device for sharing aggregated link traffic |
| WO2013017017A1 (en) * | 2011-08-03 | 2013-02-07 | Hangzhou H3C Technologies Co., Ltd | Load balancing in link aggregation |
| CN102263697B (en) * | 2011-08-03 | 2014-12-10 | 杭州华三通信技术有限公司 | Method and device for sharing aggregated link traffic |
| CN107005484A (en) * | 2014-12-27 | 2017-08-01 | 英特尔公司 | For carrying out the technology that medium size is adaptively route in high performance network structure |
| JP2017224979A (en) * | 2016-06-15 | 2017-12-21 | 株式会社デンソー | Relay device |
| CN109831388A (en) * | 2017-11-23 | 2019-05-31 | 中国电信股份有限公司 | Method and apparatus for optimizing flow load balance |
| CN114374651A (en) * | 2021-12-31 | 2022-04-19 | 海光信息技术股份有限公司 | Transport flow control method, network on chip, electronic device, and storage medium |
| CN114374651B (en) * | 2021-12-31 | 2023-01-20 | 海光信息技术股份有限公司 | Transport flow control method, network on chip, electronic device, and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN100479420C (en) | 2009-04-15 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| EP1005739B1 (en) | Shared memory management in a switched network element | |
| US5818844A (en) | Address generation and data path arbitration to and from SRAM to accommodate multiple transmitted packets | |
| US7944931B2 (en) | Balanced bandwidth utilization | |
| US7136355B2 (en) | Transmission components for processing VLAN tag and priority packets supported by using single chip's buffer structure | |
| US7203889B2 (en) | Error correction for memory | |
| US8478932B2 (en) | Power efficient memory management for embedded systems | |
| EP1045558B1 (en) | Very wide memory TDM switching system | |
| US7512684B2 (en) | Flow based packet processing | |
| US7904677B2 (en) | Memory control device | |
| KR20040002922A (en) | Efficient processing of multicast transmissions | |
| EP3166269B1 (en) | Queue management method and apparatus | |
| CN1643872A (en) | Caching streaming data | |
| EP0903029A1 (en) | Data structure to support multiple transmit packets for high performance | |
| US7506081B2 (en) | System and method of maintaining high bandwidth requirement of a data pipe from low bandwidth memories | |
| TWI476601B (en) | System and method for improving multicast performance in banked shared memory architectures | |
| US7330481B2 (en) | Highly channelized port polling in a telecommunications switch | |
| CN1622532A (en) | A dynamic equilibrium distributing method for port data flow | |
| US5940404A (en) | Method and apparatus for enhanced scatter mode allowing user data to be page aligned | |
| CN1199421C (en) | Network transmitter with data frame priority management for data transmission | |
| CN1574784A (en) | Transceiving network controller and method for controlling buffer memory allocation and data flow | |
| US7379467B1 (en) | Scheduling store-forwarding of back-to-back multi-channel packet fragments | |
| US8572349B2 (en) | Processor with programmable configuration of logical-to-physical address translation on a per-client basis | |
| US20140164553A1 (en) | Host ethernet adapter frame forwarding | |
| CN101789840B (en) | Pan-T crossing device and pan-T crossing method | |
| CN1669279A (en) | Improving Memory Access Efficiency for Packet Applications |
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 | ||
| CX01 | Expiry of patent term |
Granted publication date: 20090415 |
|
| CX01 | Expiry of patent term |