CN100417120C - Method for realizing error-free message unit flow management - Google Patents
Method for realizing error-free message unit flow management Download PDFInfo
- Publication number
- CN100417120C CN100417120C CNB011322381A CN01132238A CN100417120C CN 100417120 C CN100417120 C CN 100417120C CN B011322381 A CNB011322381 A CN B011322381A CN 01132238 A CN01132238 A CN 01132238A CN 100417120 C CN100417120 C CN 100417120C
- Authority
- CN
- China
- Prior art keywords
- tat
- cell
- thr
- time
- consistent
- 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.)
- Expired - Fee Related
Links
- 238000000034 method Methods 0.000 title claims abstract description 53
- 230000007547 defect Effects 0.000 claims description 15
- 230000006870 function Effects 0.000 claims description 5
- 238000012545 processing Methods 0.000 abstract description 3
- 238000002372 labelling Methods 0.000 abstract 1
- 230000007306 turnover Effects 0.000 abstract 1
- 239000011159 matrix material Substances 0.000 description 8
- 238000010586 diagram Methods 0.000 description 4
- 230000005540 biological transmission Effects 0.000 description 2
- 239000003550 marker Substances 0.000 description 2
- 238000010561 standard procedure Methods 0.000 description 2
- 240000002853 Nelumbo nucifera Species 0.000 description 1
- 235000006508 Nelumbo nucifera Nutrition 0.000 description 1
- 235000006510 Nelumbo pentapetala Nutrition 0.000 description 1
- FHUKASKVKWSLCY-UHFFFAOYSA-N bixlozone Chemical compound O=C1C(C)(C)CON1CC1=CC=C(Cl)C=C1Cl FHUKASKVKWSLCY-UHFFFAOYSA-N 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 238000001514 detection method Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000012806 monitoring device Methods 0.000 description 1
- 238000000638 solvent extraction Methods 0.000 description 1
Images
Abstract
The present invention provides a method for realizing the flow control of error-free cells. When cells arrive, the present invention comprises the following steps: latching the observed value v(ta) of the actual arrival time of the cells; reading the relevant information of the flow control of the virtual paths of the cells from a memory; selecting the next action according to judge whether the cell mark of long-time interval is set or not; if not setting, carrying out the next step; or else, switching to the cell processing step; judging the consistency of the cells, and processing the judged cells to enable the consistent cells to transparently pass, and discarding or labeling the inconsistent cells according to requirements to reduce the priority level of the inconsistent cells. By using the method, the present invention can avoid the generation of an error without needing to track the turnover state of TAT or ta, considerably saves resources, and greatly improves the accuracy of the flow control of the cells.
Description
Technical field
The present invention relates to a kind of method of in atm network, carrying out flow control.Particularly relate to the flow at User Network Interface place monitor user ' cell, whether the decision cell has observed the method that connects the flow protocol of consulting when setting up.
Background technology
In atm network, can be because the internal error of node or the uncertain fluctuation of customer flow, and cause the congested of network, make the efficiency of transmission of network and the service quality QOS that connected sharply descends.Flow management is to optimize the atm network efficiency of transmission, guarantees the important method and the means of network QOS.Peak Cell Rate (PCR), cell delay variation tolerance (CDVT), maintainable cell rate (SCR), the burst tolerance flow parameters such as (BT) consulted when it is set up according to connection, practical communication flow to the user is monitored, cell to the flow protocol that do not meet negotiation, network can be according to the definition of consistency connection, take suitable processing, with the cell flow surge of avoiding the user to abuse or terminal equipment failure causes, the network congestion that causes.
Described the generic cell speed method (GCRA) of two kinds of equivalences in the ITU-T suggestion I.371, virtual scheduling method and continuous state leak bucket method, and they all use two parameters, increment size I and limiting value L.
The virtual scheduling method is the theoretical time of advent (TAT) and the actual time of arrival (ta) of cell relatively, if the actual time of arrival ta of cell lags behind TAT-L, then this cell is consistent, and the theoretical time of advent of calculating next cell according to TAT, ta and parameter I; Otherwise it is inconsistent that this cell just is considered to, and be not updated the theoretical time of advent.
Leak the leakage bucket that bucket method can be regarded as a limited capacity continuously, this leaks bucket with the continuous outwards seepage of bodge of time per unit, and its capacity increases I when a consistency cell arrives simultaneously.When cell arrived, if leak appearance lotus in the bucket less than L, then this cell was consistent, otherwise is exactly inconsistent.
In the actual hardware system, owing to can only use the counter of finite length to represent above-mentioned numerical value, directly use above-mentioned generic cell speed method, can produce because the conforming mistaken verdict of cell that counter rollover causes.For solving the erroneous judgement problem, must improve traditional generic cell speed method.The highest order of the ta of the more previous cell of US Pat.No.5668797 employing and the ta of current cell, and the method for 1 second updating mark has partly solved this problem.When the highest order of previous cell ta is 1, and the highest order of current cell ta is 0, perhaps when updating mark set in 1 second, just thinks that current cell is consistent cell.But this method may be consistent cell with inconsistent cell erroneous judgement when ta overturns.US Pat.No.6108303 improves this, it follows the tracks of the upset situation of TAT and ta simultaneously, can avoid the erroneous judgement that when TAT and ta upset, causes, but in the cell arrival interval when very long, the judgement of ta upset is inaccurate, the conforming erroneous judgement of cell still may take place this moment, but also needs to increase the expense of following the tracks of TAT and ta upset.
Summary of the invention
The technical problem to be solved in the present invention is exactly in order to overcome in the flow management system of reality, realize the counter rollover of generic cell speed method existence, the shortcoming that there is error in the judgement of cell consistency, a kind of method that realizes the cell flow management of zero defect has been proposed, to solve the problem that the erroneous judgement of cell consistency is determined.
The method of realization zero defect cell flow management of the present invention is characterized in that, when a cell arrives, carries out the following step:
The first step latchs the observed value v (ta) of the actual time of arrival of cell, and wherein v () observes function:
In second step, the flow management relevant information of reading virtual path under this cell from memory comprises increment size I, limiting value L, the observed value v (TAT) of the theoretical time of advent and long-time cell sign at interval;
In the 3rd step,, select next step action according to the whether set of long-time interval cell sign; If long-time cell sign does not at interval have set, carry out the situation in the 4th step and select; Otherwise, thinking that this cell is consistent cell, the renewal theory v time of advent (TAT)=v (ta+I) forwarded for the 9th step to;
In the 4th step, judge:
If (TAT+THR-min (I, L))＞v (TAT), and v (TAT-L-I)＜v (TAT) select situation A to v, forward for the 5th step to;
If (TAT+THR-min (I, L))＜v (TAT), and v (TAT-L-I)＜v (TAT) select situation B to v, forward for the 6th step to;
If (TAT+THR-min (I, L))＞v (TAT), v (TAT-L-I)＞v (TAT), and v (TAT)＜v (TAT-L) select situation C to v, forward for the 7th step to;
If (TAT+THR-min (I, L))＞v (TAT), v (TAT-L-I)＞v (TAT), and v (TAT) 〉=v (TAT-L) select situation D to v, forward for the 8th step to;
Wherein THR is known in advance constant, satisfies THR 〉=L+I, and the expression scope R of counter should satisfy (THR+L+I)-min (I, L)＜R;
The 5th step, situation A:
If v (TAT)≤v (ta), then cell is consistent, upgrades v (TAT)=v (ta+I); Otherwise relatively whether v (TAT-L) if cell be inconsistent cell, does not upgrade v (TAT) greater than v (ta); If not, cell is consistent cell, upgrades v (TAT)=v (TAT+I); Forwarded for the 9th step then to;
The 6th step, case B:
If v (ta)≤v (TAT-L-I) or v (TAT)≤v (ta), then cell is consistent cell, upgrades v (TAT)=v (ta+I).Otherwise relatively whether v (TAT-L) is greater than v (ta), if cell is inconsistent cell, do not upgrade v (TAT): if not, cell is consistent cell, upgrades v (TAT)=v (TAT+I); Forwarded for the 9th step then to;
The 7th step, situation C:
If v (TAT)≤v (ta), and v (ta)＜v (TAT+THR-min (I, L)), then cell is consistent cell, upgrades v (TAT)=v (ta+I).Otherwise (TAT+THR-min (I, L)) if cell is inconsistent cell, does not upgrade v (TAT) to judge whether to satisfy v (ta)＜v (TAT-L) and v (ta) 〉=v; If not, cell is consistent cell, upgrades v (TAT)=v (TAT+I); Forwarded for the 9th step then to;
The 8th step, situation D:
If v (TAT)≤v (ta), and v (ta)＜v (TAT+THR-min (I, L)), then cell is consistent cell, upgrades v (TAT)=v (ta+I).Otherwise, judge whether to satisfy v (ta)＜v (TAT) and v (ta) v (TAT-L), if cell is consistent cell, upgrade v (TAT)=v (TAT+I); If not, cell is inconsistent cell, does not upgrade v (TAT);
In the 9th step, cell is handled;
Judge according to the cell consistency that obtains, cell is handled accordingly; Make consistent cell transparently pass through, inconsistent cell then can be abandoned or label as required, reduce its priority.
Adopt the method for the invention, compared with prior art, can avoid the generation of mistake, and also not need TAT and ta rollover states are followed the tracks of.Save resource to a great extent, improved the accuracy of cell flow management greatly.
Description of drawings
Fig. 1 is the general flow chart of the method for the present invention's cell flow management of realizing zero defect.
Fig. 2 is the principle analysis figure of cell consistency erroneous judgement.
Fig. 3 is the relative time graph of a relation that the situation A of boundary crossover does not take place.
Fig. 4 is the cell consistency decision method of situation A.
Fig. 5 is a case B, greater than certain position of TAT boundary crossover has taken place, and is mapped to the relative time graph of a relation of the low side of watch window by replay.
Fig. 6 is the cell consistency decision method of case B.
Fig. 7 is situation C, has crossed over the border less than certain position of TAT, has been mapped to the high-end of watch window by replay, and TAT-L is positioned at the relative time graph of a relation when remapping part.
Fig. 8 is the cell consistency decision method of situation C.
Fig. 9 is situation D, has crossed over the border less than certain position of TAT, has been mapped to the high-end of watch window by replay, the relative time graph of a relation when TAT-L is not remapped.
Figure 10 is the cell consistency decision method of situation D.
Figure 11 is the flow chart of situation system of selection.
Embodiment
Be described in further detail below in conjunction with the enforcement of accompanying drawing technical scheme:
The present invention utilizes the intrinsic constraints of generic cell speed method, the relation constraint of binding isotherm time of advent, actual time of arrival, increment size, limits value and long-time cell arrival interval thresholding, concern by the position of TAT and ta relatively and the cell consistency judgement of finishing zero defect to have realized high-performance cell flow management.
The general flow chart of the method for the cell flow management of realization zero defect of the present invention at first according to the whether set of long-time cell sign at interval, is selected next step action as shown in Figure 1.If long-time cell flag set at interval thinks that then this cell is consistent cell; Otherwise, situation is selected, adopt different decision methods that the consistency of cell is judged respectively according to the situation of selecting again.Before describing the present invention in detail, at first introduce principle of the present invention and core concept.
As mentioned above, represent at the counter that uses finite length under the situation of the theory TAT time of advent and actual time of arrival ta, because counter can overturn, possibly can't obtain the correct time relation of the theory TAT time of advent and actual time of arrival ta, thus the mistake that causes the cell consistency to be judged.The erroneous judgement that this counter rollover causes, overlapping on the up duration axle between cut section clearly are explained as follows, and the hypothesis theoretical time of advent of TAT and actual time of arrival ta use the counter of equal length here.The length of counter determined theoretical time of advent of TAT and the expression scope of actual time of arrival ta, in fact has been equivalent to define the watch window of the finite length on the time shaft, and it is divided into time shaft between the cut section of many equal in length.Had only when theoretical time of advent, TAT and actual time of arrival ta dropped between same cut section, we are only accurately by the time relationship of the observed theory of the watch window TAT time of advent and actual time of arrival ta, at this moment carry out the cell consistency detection according to the generic cell speed method of standard code, be only reliably.
But, the situation that the theory TAT time of advent and actual time of arrival ta drop between same cut section is not always to set up, the theory TAT time of advent also might drop between different cut sections with actual time of arrival ta, but superimposed togetherly between these different cut sections export by watch window, make people can't distinguish theoretical time of advent TAT and actual time of arrival ta belong between which cut section just theoretical time of advent of the TAT and the pseudo-time relationship of actual time of arrival ta that obtains.Therefore, generic cell speed method that can not the use standard obtains the cell consistency judgement of zero defect.
Obviously, want to guarantee theoretical time of advent TAT and actual time of arrival ta to drop on be unpractical at the same time between cut section, theoretical time of advent, TAT and actual time of arrival ta always might be cut apart section boundaries the leap time.In fact, people just need obtain theoretical time of advent TAT and actual time of arrival ta between the relative time relation is just enough accurately, this condition than a little less than theoretical time of advent, TAT and actual time of arrival ta dropped at the same time between cut section many.
Can consider like this, the TAT time of advent is a time reference with theory, the time set that actual time of arrival ta may occur constitutes an interval S, this interval can only be observed by watch window equally, if no matter actual time of arrival ta appears at interval any position, can both make right judgement to the cell consistency, and the renewal theory TAT time of advent, just can guarantee the flow management of zero defect.
At first analyze the constraints of the time that generic cell speed method may occur actual time of arrival ta.To first cell, generic cell speed method is set to: make the theory TAT time of advent equal actual time of arrival ta, therefore, the always consistent cell of this cell.When follow-up cell arrived, generic cell speed method reached time ta and the theory TAT time of advent according to the actual of cell, and absolute rating L judges the consistency of cell.If ta＜TAT-L, this cell is inconsistent, and be not updated the theoretical time of advent; Otherwise this cell is consistent cell, is updated to TAT+I the theoretical time of advent of next cell.If the theoretical time of advent of current cell and actual time of arrival are respectively TAT and ta, the theoretical time of advent and the actual time of arrival of last cell are respectively TAT ' and ta '.If last cell is consistent cell, have
TAT’-ta’≤L
So
TAT＝max(TAT’，ta’)+I
≤max(TAT’，ta’+L)+I
＝ta’+L+I
＜ta+L+I
If last cell is inconsistent cell, then consider preceding first the consistent cell of this cell, its theoretical time of advent and actual time of arrival are respectively TAT " and ta ".Owing to theory is not upgraded the time of advent when inconsistent cell arrives, so have
TAT＝TAT’
＝max(TAT”，ta”)+I
≤max(TAT”，ta”+L)+I
＝ta”+L+I
＜ta’+L+I
＜ta+L+I
Therefore, all cells all satisfy,
TAT-ta’≤L+I
With
TAT-ta＜L+I
That is to say that the leading theory of the actual time of arrival ta TAT time of advent is not more than L+I.
In addition, be easy to obtain, when last cell is consistent cell,
TAT＝max(TAT’，ta’)+I≤ta’+I
When perhaps, last cell is inconsistent cell
TAT＝TAT’＞ta’+L
So, all cells are also satisfied,
TAT≥min(ta’+I，ta’+L)＝ta’+min(I，L)
Actual time of arrival ta ' the leading theoretical time of advent of the TAT that is to say last cell at least min (I, L).
But actual time of arrival ta lags behind the theory TAT time of advent then without any restriction.So the length of S is unlimited, its same observed window is cut apart and is overlapping, thereby will produce the pseudo-time relationship of the theory TAT time of advent and actual time of arrival ta inevitably.Can be by long-time cell arrival interval monitoring device, this device can be when adjacent cell time of advent surpasses a certain thresholding THR at interval set one marker.If adjacent cell is spaced apart D the time of advent, promptly when D 〉=THR, make marker set.If THR 〉=L+I can guarantee that then when this flag set, current cell is consistent cell, and ta＞TAT, theoretical time of advent of the TAT_update of next cell is updated to ta+I.Because have according to flag condition
Ta-ta '=D 〉=THR 〉=L+I, and all cells are all satisfied TAT-ta '≤L+I, have
TAT-ta≤TAT-(ta’+L+I)＝(TAT-ta’)-(L+I)≤0
TAT_update＝max(TAT，ta)+I＝ta+I
If, in the time of can also indicating not set in long-time cell arrival interval, correctly judge consistency and renewal theory time of advent of cell, just can finish zero defect ground flow management.Owing to there has been long-time cell arrival interval to indicate the restriction of not set, the S set that actual time of arrival ta may the time of advent become a finite length the interval (TAT-L-I, TAT+THR-min (I, L)) because
Ta-ta '=D＜THR, so
TAT-ta＞TAT-(ta’+THR)＝(TAT-ta’)-THR≥min(I，L)-THR
So, can obtain
TAT-(L+I)＜ta＜TAT+THR-min(I，L)
Open interval S may be cut apart section boundaries and remaps because of the leap time, causes interval aliasing, sees Fig. 2.When actual time of arrival ta is in the aliasing interval, can not judge the time relationship between the theory TAT time of advent and the actual time of arrival ta.
For avoiding aliasing that requirement takes place
(TAT+THR-min (I, L))-(TAT-L-I)=THR+L+I-min (and I, L)＜R wherein, R is the length between the time cut section, just the length of watch window.
Guaranteeing under the above-mentioned condition, just can divide four kinds of following situations to judge the consistency of cell and the theoretical time of advent of calculating next cell.
Fig. 3 does not cross over time partitioning boundary (situation A) for S.
Obviously, this moment TAT and ta the relative time relation and the relative time relationship consistency that obtains by watch window, can be according to the virtual scheduling method of standard, make the whether consistent judgement of cell: if ta drops on gray area, cell is inconsistent cell, if ta drops on white portion, cell is consistent cell.And can correctly upgrade TAT.Because all variablees are all observed by watch window, to observe function and be designated as v (.), all computings all are the modulo operations of relative watch window.
The block diagram of the virtual scheduling method of situation A as shown in Figure 4.
When describing said method, for for simplicity, each variable all not to be added sometimes and observe function v (.), and only the result of computing has been added the observation function, the effect of doing like this is identical.
Boundary crossover has taken place for the S interval greater than certain position of TAT in Fig. 5, is mapped to the situation of the low side of watch window by replay, remaps part with a some matrix representation (case B).
From Fig. 5 as seen, ta drops on the dot matrix part, shows ta originally greater than TAT, and this cell should be consistent cell.But observed ta is but less than TAT-L, therefore uses the virtual scheduling method of standard then can judge by accident and is inconsistent cell.Need make amendment to former method, use amended method to adjudicate, gray area is inconsistent cell, and white portion is consistent cell, and dot matrix partly belongs to white portion, for consistent cell areas, does not judge by accident.
Fig. 6 is the block diagram of the decision method of case B.
It should be noted that compare here be:
TAT-L＞ta？
Rather than
TAT＞ta+L？
This is remapped because ta+L may cross over watch window, can not guarantee the correctness of calculating.TAT-L then can not.Above-mentioned difference explanation must guarantee not produce in the calculating process and overflow, and comparison operator just can obtain correct result.
Fig. 7 has crossed over the border for the S interval less than certain position of TAT, has been mapped to the high-end of watch window by replay, and TAT-L is positioned at and remaps part (situation C).
In this case, if ta drops on the dot matrix part, show ta＜TAT originally, this cell may be consistent cell, also may be inconsistent cell.But the relative time relation that draws from watch window is v (ta)＞v (TAT), if the virtual scheduling method of the standard of use, all cells all can be judged as consistent cell, and wherein the grey dot matrix partly is the erroneous judgement zone.Therefore also need standard method is made amendment, use amended method, the grey dot matrix is judged as inconsistent cell, and white portion is judged as consistent cell (comprising white dot matrix zone), coincide with actual conditions.The decision method block diagram that obtains situation C as shown in Figure 8.
Fig. 9 has crossed over the border for the S interval less than certain position of TAT, has been mapped to the high-end situation of watch window by replay, and TAT-L is not remapped (situation D).
In this case, if ta drops on the dot matrix zone, show that originally this cell is inconsistent cell.But but be v (ta)＞v (TAT) from the relative time relation that watch window obtains this moment, if the virtual scheduling method of the standard of use, cell is mistaken for consistent cell.Therefore need improve standard method, use the back method of improvement, gray area is judged as inconsistent cell, and white portion is judged as consistent cell, coincide with actual conditions.At the decision method block diagram of situation D as shown in figure 10.
As for situation system of selection how to distinguish above-mentioned four kinds of situations, its flow chart as shown in figure 11.Be described below:
Calculate v (TAT-L-I) and v (TAT+THR-min (I, L)), the relation of comparison itself and v (TAT)
If, v (TAT-L-I)＜v (TAT)＜v (TAT+THR-min (I, L))
Then belong to situation A, do not have boundary crossover.
If, v (TAT-L-I)＜v (TAT), v (TAT+THR-min (I, L))＜v (TAT)
Then belong to case B, the interval high-end boundary crossover that taken place.
If, v (TAT＜TAT+THR-min (I, L)), v (TAT)＜v (TAT-L-I)
Then belong to situation C or D, boundary crossover has taken place in interval low side.
In order to distinguish situation C or D, also need to calculate v (TAT-L), relatively the relation of it and v (TAT)
If, v (TAT)＜v (TAT-L)
Then belong to situation C, TAT-L is remapped.
If, v (TAT)＞v (TAT-L)
Then belong to situation D, TAT-L is not remapped.
Claims (6)
1. a method that realizes zero defect cell flow management is characterized in that, when a cell arrives, carries out the following step:
The first step latchs the observed value v (ta) of the actual time of arrival of cell, and wherein v () observes function:
In second step, the flow management relevant information of reading virtual path under this cell from memory comprises increment size I, limiting value L, the observed value v (TAT) of the theoretical time of advent and long-time cell sign at interval;
In the 3rd step,, select next step action according to the whether set of long-time interval cell sign; If long-time cell sign does not at interval have set, carry out next step; Otherwise, forwarded for the 5th step to;
In the 4th step, the cell consistency is judged;
The 5th step made consistent cell transparently pass through, and inconsistent cell then can be abandoned or label as required, reduced its priority.
2. a kind of method that realizes zero defect cell flow management as claimed in claim 1, it is characterized in that, when satisfying v (TAT+THR-min (I, L))＞v (TAT), and during v (TAT-L-I)＜v (TAT), described the cell consistency is judged as: if v (TAT)≤v (ta), then cell is consistent, upgrades v (TAT)=v (ta+I); Otherwise relatively whether v (TAT-L) if cell be inconsistent cell, does not upgrade v (TAT) greater than v (ta); If not, cell is consistent cell, upgrades v (TAT)=v (TAT+I).
3. a kind of method that realizes zero defect cell flow management as claimed in claim 1, it is characterized in that, when satisfying v (TAT+THR-min (I, L))＜v (TAT), and during v (TAT-L-I)＜v (TAT), described the cell consistency is judged as: if v (ta)≤v (TAT-L-I) or v (TAT)≤v (ta), then cell is consistent cell, upgrades v (TAT)=v (ta+I); Otherwise relatively whether v (TAT-L) if cell be inconsistent cell, does not upgrade v (TAT) greater than v (ta); If not, cell is consistent cell, upgrades v (TAT)=v (TAT+I).
4. a kind of method that realizes zero defect cell flow management as claimed in claim 1, it is characterized in that, when satisfying v (TAT+THR-min (I, L))＞v (TAT), v (TAT-L-I)＞v (TAT), and during v (TAT)＜v (TAT-L), described the cell consistency is judged as: if v (TAT)≤v (ta), and v (ta)＜v (TAT+THR-min (I, L)), then cell is consistent cell, upgrades v (TAT)=v (ta+I); Otherwise (TAT+THR-min (I, L)) if cell is inconsistent cell, does not upgrade v (TAT) to judge whether to satisfy v (ta)＜v (TAT-L) and v (ta) 〉=v; If not, cell is consistent cell, upgrades v (TAT)=v (TAT+I).
5. a kind of method that realizes zero defect cell flow management as claimed in claim 1, it is characterized in that, when satisfying v (TAT+THR-min (I, L))＞v (TAT), v (TAT-L-I)＞v (TAT), and during v (TAT) 〉=v (TAT-L), described the cell consistency is judged as: if v (TAT)≤v (ta), and v (ta)＜v (TAT+THR-min (I, L)), then cell is consistent cell, upgrades v (TAT)=v (ta+I); Otherwise, judge whether to satisfy v (ta)＜v (TAT) and v (ta) 〉=v (TAT-L), if cell is consistent cell, upgrade v (TAT)=v (TAT+I); If not, cell is inconsistent cell, does not upgrade v (TAT).
6. as the arbitrary described a kind of method that realizes zero defect cell flow management of claim 1-5, it is characterized in that described THR is known in advance constant, satisfies THR 〉=L+1, and the expression scope R of counter should satisfy (THR+L+I)-min (I, L)＜R.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB011322381A CN100417120C (en) | 2001-11-14 | 2001-11-14 | Method for realizing error-free message unit flow management |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB011322381A CN100417120C (en) | 2001-11-14 | 2001-11-14 | Method for realizing error-free message unit flow management |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1419362A CN1419362A (en) | 2003-05-21 |
| CN100417120C true CN100417120C (en) | 2008-09-03 |
Family
ID=4671276
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB011322381A Expired - Fee Related CN100417120C (en) | 2001-11-14 | 2001-11-14 | Method for realizing error-free message unit flow management |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN100417120C (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN100358314C (en) * | 2003-10-28 | 2007-12-26 | 华为技术有限公司 | Method and device for realizing virtual channel flow control at asynchronous transfer mode |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5668797A (en) * | 1995-12-06 | 1997-09-16 | Pmc-Sierra, Inc. | Traffic controller for cell-based transmission |
| US6108303A (en) * | 1995-12-06 | 2000-08-22 | Pmc-Sierra Ltd. | Method and apparatus for traffic control in a cell-based network |
-
2001
- 2001-11-14 CN CNB011322381A patent/CN100417120C/en not_active Expired - Fee Related
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5668797A (en) * | 1995-12-06 | 1997-09-16 | Pmc-Sierra, Inc. | Traffic controller for cell-based transmission |
| US6108303A (en) * | 1995-12-06 | 2000-08-22 | Pmc-Sierra Ltd. | Method and apparatus for traffic control in a cell-based network |
Also Published As
| Publication number | Publication date |
|---|---|
| CN1419362A (en) | 2003-05-21 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105791560A (en) | Data network access control method and user terminal | |
| CN110247816A (en) | Index monitoring method and device | |
| CN102663895A (en) | Container truck jamming prompting system and realizing method thereof for container terminals | |
| CN108834090A (en) | A kind of assistance information transmission method and device | |
| CN108920339A (en) | A kind of system exception report method and device | |
| CN100417120C (en) | Method for realizing error-free message unit flow management | |
| CN102045213B (en) | Fault positioning method and device | |
| CN105117290A (en) | Information processing method and system and electronic equipment | |
| CN113065044A (en) | Driving state checking method, device, equipment and storage medium | |
| CN113065043A (en) | Driving route checking method, device, equipment and storage medium | |
| CN103532725B (en) | Charging method, network switching device, on-line charging system and charging system | |
| JP2737735B2 (en) | Polishing control device | |
| KR100243699B1 (en) | Telecommunication management network | |
| US6907007B2 (en) | Method of injecting/extracting control cells in an asynchronous transfer mode (ATM) network | |
| US6674723B1 (en) | Apparatus and method of monitoring a queue state in an asynchronous transfer mode switch | |
| US6151302A (en) | Cell flow rate control method for asynchronous transfer mode switch | |
| US6492996B1 (en) | Method of and display system for monitoring a signalling network | |
| KR100277233B1 (en) | Common line signal network design device and implementation method | |
| CN116599914A (en) | Wide area measurement and control protection method, device, equipment and readable storage medium | |
| JP2005184483A (en) | Vp line storage change system | |
| JP2937560B2 (en) | Control signal information collection processing method for switching system | |
| KR100306162B1 (en) | Method for processing message using ooad in exchangesystem | |
| JP3241969B2 (en) | Method and apparatus for equivalently converting communication network reliability | |
| Qi et al. | The structural property of network bottlenecks in maxmin fair flow control | |
| CN117354783A (en) | Card opening method, system and equipment based on TSM platform |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| ASS | Succession or assignment of patent right |
Owner name: SHENZHENG CITY ZTE CO., LTD. Free format text: FORMER OWNER: SHENZHENG CITY ZTE CO., LTD. SHANGHAI SECOND INSTITUTE Effective date: 20030722 |
|
| C41 | Transfer of patent application or patent right or utility model | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20030722 Applicant after: Zhongxing Communication Co., Ltd., Shenzhen City Applicant before: Shanghai Inst. of No.2, Zhongxing Communication Co., Ltd., Shenzhen City |
|
| 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: HAIMEN TECHNOLOGY DEVELOPMENT CORP. Free format text: FORMER OWNER: ZTE CORPORATION Effective date: 20130723 |
|
| C41 | Transfer of patent application or patent right or utility model | ||
| COR | Change of bibliographic data |
Free format text: CORRECT: ADDRESS; FROM: 518057 SHENZHEN, GUANGDONG PROVINCE TO: 226144 NANTONG, JIANGSU PROVINCE |
|
| TR01 | Transfer of patent right |
Effective date of registration: 20130723 Address after: 226144, No. 600, Beijing Road, Haimen, Jiangsu, Nantong province (room 0212 of administrative center) Patentee after: Haimen science and Technology Development General Corporation Address before: 518057 Nanshan District high tech Industrial Park, Guangdong, South Road, science and technology, ZTE building, legal department Patentee before: ZTE Corporation |
|
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20080903 Termination date: 20161114 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |