CN101043427A - Method for processing congestion - Google Patents
Method for processing congestion Download PDFInfo
- Publication number
- CN101043427A CN101043427A CNA2006100608807A CN200610060880A CN101043427A CN 101043427 A CN101043427 A CN 101043427A CN A2006100608807 A CNA2006100608807 A CN A2006100608807A CN 200610060880 A CN200610060880 A CN 200610060880A CN 101043427 A CN101043427 A CN 101043427A
- Authority
- CN
- China
- Prior art keywords
- message
- buffering area
- threshold values
- newly
- congested
- 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
Images
Abstract
The processing-congestion method in telecommunication network comprises: A. comparing the PRI of new-coming message to decide whether it lower than current congestion level, yes to step B, or else putting the new-coming message into a buffer; B. comparing the PRI of new-coming message to decide whether it lower than the lowest PRI in current buffer, not to step B, or else taking away the new-coming from the buffer; and C. abandoning the message with PRI lower than the new-coming one, and storing the new-coming message into the buffer. This invention can reduce the loss led by congestion to the lowest.
Description
Technical field
The present invention relates to the congestion management techniques field in the communications field, especially refer to a kind of method of congested processing.
Background technology
Signaling system is the key technology of modern communication networks, and telecommunication apparatus is the key that guarantees high capable telecommunications network to the reliable transmission of signaling message.Traffic needs such as voice, data, multimedia all increase, and big data on flows makes the congested key that is treated as the telecommunication apparatus reliability, and present widely used No.7 signaling system solves common congested processing.
The structure of traditional No.7 signaling protocol stack is as shown in Figure 1: this protocol stack is corresponding to OSI (OpenSystems Interconnection open system is interconnected) seven layer model.
MPT1 (Message Transfer Part Level 1, one deck message is transmitted) is corresponding to the physical layer in the OSI seven layer model; MPT2 (Message Transfer Part Level 2, two-layer message transmission) is corresponding to the data link layer in the OSI seven layer model; MPT3 (3, three layers of message transmission of Message Transfer PartLevel) is corresponding to the network layer in the OSI seven layer model; SCCp (SignallingConnection Control Part, SCCP) is corresponding to the transport layer in the OSI seven layer model; ISUP (Integerated Services Digital Network User Part, Integrated Service Digital Network(ISDN) User Part) and TUP (Telephone User Part, Telephone User Part) are corresponding to the session layer in the OSI seven layer model; TCAP (Transaction Capabilities AppllcationPart, Transaction Capabilities Application Part) is corresponding to the presentation layer in the OSI seven layer model; INAP (Intelligent Network Application Protocol, Intelligent Network Application Protocol), OMAP (Operation, Maintenance and Administration Part, Operation and Maintenance Application Part) and MAP (Mobile Application Part, MAP) corresponding to the application layer in the OSI seven layer model.
Wherein MPT1, MPT2 and MPT3 are referred to as MTP (Message Transfer Part, Message Transfer Part).
IETF (The Internet Engineering Task Force, the international project task groups) formulates based on IP (Internet Protocol, Internet protocol) SIGTRAN (SignallingTransport of technology, the signaling transmission) protocol family, the adapting protocol that mainly comprises No.7 signaling system MTP is to provide the transmittability of No.7 signaling on IP network.SIGTRAN bunch comprises following agreement: V5UA (V5.2-User Adaptation Layer, the user adaptation layer of V5.2), M2UA (MessageTransfer Part 2-User Adaptation Layer, MTP2-User Adaptation Layer), DUA (DPNSS1/DASS 2 User Adaptation, DPNSS 1/DASS 2 user adaptation layers), M3UA (MessageTransfer Part 3-User Adaptation Layer, MTP3-User Adaptation Layer), SUA (Signalling Connection Control Part User Adaptation Layer, signaling connection control part customer message adaptation layer), promptly in traditional NO.7 signaling network system, progressively substituted by SIGTRAN below the SCCP layer, the operation layer on upper strata remains unchanged; The SIGTRAN stack provides the upper-layer user that the service same with the transport layer of traditional NO.7 is provided.These signaling protocols all relate to congested processing capacity.
The existing congestion processing method of field of telecommunications is under congested situation, according to congestion level and message priority, gives up part message, as the MTP3 flow-control mechanism.When using how congested grade of processing mode,, corresponding congestion threshold of each rank of buffering area is set at present according to congestion level.When congested,, give up part message according to congestion level and message priority.Congested as shown in Figure 2 beginning signaling link congestion state is the state of n level.
Message when congested is given up principle and is generally: when new information arrives, compare according to the message priority of this message and the congestion level of selected signaling link, when the priority of this message during more than or equal to the congestion level value of signaling link, this message is added buffering area, otherwise this message is given up.Its concrete flow chart as shown in Figure 3.
Existing congested processing is just to begin packet loss congested the time, but abandons other bag of a little low priority, can not restrain congestion level at short notice and continue to raise, and causes abandoning the bag of more high priorities, has enlarged congested influence.
When the N level is congested, can be dropped when newly to message level is lower than the N level.But have the more message of low priority in the buffering area this moment.In this case, newly the message of to higher priority has been dropped, and the message of lower priority can be sent out away in the buffering area, and can not be dropped, and promptly the message of low priority is sent out away, and high-priority message is dropped.Be the demand that does not meet branch priority level business like this.
Summary of the invention
The method that the purpose of this invention is to provide a kind of congested processing, when message congestion occurring, the message that priority is low abandons, and keeps the high message of priority, thereby reduces congested influence.
The invention provides following technical scheme:
A kind of method of congested processing includes the new of priority when congested and handles to message, comprises step:
A, more describedly newly whether be lower than the current congestion level to message priority, if, enter step B, otherwise, newly put into buffering area with described to message;
B, more describedly newly whether be lower than the lowest priority of message in the current buffering area, if not, enter step C to message priority, otherwise, newly do not put into described buffering area to message with described;
C, the buffering area medium priority is lower than describedly newly abandons, and newly deposit described buffering area in to message with described to the message of message priority.
Among the step C buffering area medium priority is lower than described newly abandoning and specifically comprises step to the message of message priority:
With being kept at laggard buffering area in the minimum rank message of buffering area, abandon successively, till abandoning the message size summation and being equal to or greater than newly message, will newly put into buffering area to message.
Also comprise step before the steps A:
Be provided with buffering area multistage congested in first threshold values and second threshold values of each grade correspondence;
When newly arriving, obtain second threshold values of buffering area occupation rate this moment, current congestion level, current congestion level to message.
When described newly when the buffering area occupation rate when message arrives is not less than second threshold values of described current congestion level, execution in step A.
The described multistage congested level 1 congestion at least of being; Described first threshold values and second threshold values are to determine according to the buffering area occupation rate.
Describedly newly do not put into described buffering area and comprise: abandon the described message that newly arrives to message with described.
Second threshold values that obtains buffering area occupation rate this moment, current congestion level, current congestion level also comprises step afterwards:
Obtain described new first threshold values of current congestion level when arriving to message;
When new buffering area occupation rate when arriving to message is between first threshold values of congested level and second threshold values, calculates the described congestion probability that newly arrives message.
Described congestion probability obtains for using formula, and described formula is: go into the buffering area Mean Speed and deduct out the buffering area Mean Speed, then with subtracting each other the value that obtains divided by going out the buffering area Mean Speed.
Obtain described new when message arrives first threshold values of current congestion level comprise step afterwards:
More described congestion probability and congestion probability threshold values are if this congestion probability less than described congestion probability threshold values, is then sent into buffer stores to described newly arrived message; If this congestion probability is greater than congestion probability threshold values, execution in step A.
, handle congested method and also comprise when being lower than the lowest priority of message in the current buffering area when new: reduce informed source speed, improve and buffering rate to message priority.
Also comprise before the described steps A:
When the buffering area occupation rate less than described new when arriving during first threshold values of congested level to message, should newly send into buffer stores to message.
The present invention is put into congested processing before the congested generation, reduces the probability of congested generation, accomplishes not lose or loses message, the message of losing high priority especially less less; After congested generation, by abandoning the message of low priority in the buffering area, the loss that is caused when congested drops to minimum.
Description of drawings
No.7 signaling protocol structure in Fig. 1 prior art;
The signaling link congestion state is the congested level of n level partition structure figure in Fig. 2 prior art;
The flow process of congested processing in Fig. 3 prior art;
Fig. 4 the present invention is to new flow process to Message Processing;
The flow process that Fig. 5 the present invention handles message congestion;
The concrete buffer congestion threshold values of implementing is divided among Fig. 6 the present invention;
The once congested processing procedure of Fig. 7 embodiment of the invention;
Embodiment
In existing congested processing processing method, the message of low priority is sent out away in buffering area, and newly to high-priority message be dropped, enlarged congested influence.
The method that a kind of congested processing processing of realization in telecommunications network is provided of the present invention, core concept is: congested level is greater than new priority to message after congested the generation, abandon the message that buffering area is lower than described new low priority to message priority, the loss that is caused when congested drops to minimum.
Describe the present invention in detail below in conjunction with accompanying drawing, the comprising the steps: of the method for the invention
Newly arrive the message priority congested level corresponding with this moment;
When described new, judge whether the message of the lowest priority in the buffering area is newer for the message height than described, if abandon described new to message to the congested level of message priority less than this moment; Otherwise, abandon the message of low priority in the buffering area, newly put into buffer stores with described to message.
Its step is concrete as Fig. 4, and 5,6, shown in 7:
Step 5 01, that the N level is set is congested, and wherein N is the number more than or equal to 1, and be provided with the N level congested in pairing congested elimination threshold values at different levels and congested generation threshold values.
The corresponding congested elimination threshold values of congested level, congested generation threshold values are determined according to the buffering area occupation rate of setting.
When arriving, obtains new information buffer performance R, congested elimination threshold values, the congested generation threshold values of corresponding congested level when newly arriving message arrival.
If step 502 R puts into this message in the buffering area less than congested elimination threshold values; If R is greater than congested generation threshold values, take place congested this moment, carries out congested processing; If R between congested elimination threshold values and the congested generation threshold values, then congestedly forms, need to calculate and produce congested probability.The congestion probability that calculates with the congestion probability computational methods of setting, when congestion probability less than the probability threshold values, congested generation probability newly enters buffering area to message; Otherwise, carry out described congested processing.
The congestion probability computational methods of setting comprise:
With message " go into the buffering area Mean Speed " with " going out the buffering area Mean Speed " calculate congested generation probability:
Congested generation probability=(go into buffering area Mean Speed-go out buffering area Mean Speed)/go out buffering area Mean Speed.
Described congested processing comprises:
If A newly is greater than or equal to the congested level of this moment to message priority, store described newly to message, otherwise arrive B;
B, judge that the message of lowest priority in having stored in the buffering area is whether low to message priority than new, if, carry out C, otherwise, D carried out;
C, the message that the buffering area medium priority is low abandon up to abandoning the low priority message size and are equal to or greater than the new message that arrives, and storage is new for message;
D, abandon this new information or reduce informed source speed, improve and buffering rate.
For example: the congested N of being divided into level (N is not less than 1 integer), promptly wherein corresponding 1 arrive the congested of N level, when the n level is congested, wherein n is smaller or equal to N, for two threshold values in the buffering area, no congested and congested, buffer performance is set is higher than 80% for congested generation threshold values, be lower than 70% and be congested elimination threshold values, as shown in the figure.
When a new information arrives, judge the buffer performance R after this message adds buffering area earlier.If R is 50%, this moment, R was less than 70%, and message is put in the buffering area; If R is 90%, carry out congested processing greater than 80% this moment.If R is 75%, this moment, less than 80%, then thinking congested may form greater than 70%, need to calculate the probability of congested generation this moment: if go out the speed of buffering this moment is 1MB/s, the speed of advancing buffering is 2MB/s, and congestion probability is (2-1)/1=100%, need carry out congested processing; If go out buffering rate this moment is 1MB/s, advancing buffering rate is 1.5MB/s, and congestion probability is (1.5-1)/1=50%, then directly enters buffering area this moment.
When the n level was congested, congested treatment step was:
If A priority is greater than or equal to n, be put into the transmission buffering area, otherwise to B;
The minimum message of rank in B, the inspection buffering area, whether low to message level than new, if execution in step C is arranged, otherwise execution in step D;
C, the data of laggard buffering in the minimum rank message are abandoned successively, be equal to or greater than new to message up to abandoning the message size summation;
D, abandon this and newly improve and buffering rate to message or minimizing informed source speed.
Above do hypothesis multistage congested in, the congested generation threshold values of each rank, congested elimination threshold values, and " the probability threshold values " of each congestion level all can be provided with according to practical application.The congestion probability computational methods also are to select different algorithms.
The present invention is put into congested processing before the congested generation, reduces the probability of congested generation, accomplishes not lose or loses message, the message of losing high priority especially less less.After congested generation, by abandoning the message of low priority in the buffering area, also the loss that can be caused when congested drops to minimum.
The above; only for the preferable embodiment of the present invention, but protection scope of the present invention is not limited thereto, and anyly is familiar with those skilled in the art in the technical scope that the present invention discloses; the variation that can expect easily or replacement all should be encompassed within protection scope of the present invention.Therefore, protection scope of the present invention should be as the criterion with the protection range of claims.
Claims (11)
1, a kind of method of congested processing includes the new of priority when congested and handles to message, it is characterized in that, comprises step:
A, more describedly newly whether be lower than the current congestion level to message priority, if, enter step B, otherwise, newly put into buffering area with described to message;
B, more describedly newly whether be lower than the lowest priority of message in the current buffering area, if not, enter step C to message priority, otherwise, newly do not put into described buffering area to message with described;
C, the buffering area medium priority is lower than describedly newly abandons, and newly deposit described buffering area in to message with described to the message of message priority.
2, method according to claim 1 is characterized in that, among the step C buffering area medium priority is lower than described newly abandoning to the message of message priority and specifically comprises step:
With being kept at laggard buffering area in the minimum rank message of buffering area, abandon successively, till abandoning the message size summation and being equal to or greater than newly message, will newly put into buffering area to message.
3, method according to claim 1 is characterized in that, also comprises step before the steps A:
Be provided with buffering area multistage congested in first threshold values and second threshold values of each grade correspondence;
When newly arriving, obtain second threshold values of buffering area occupation rate this moment, current congestion level, current congestion level to message.
4, method according to claim 3 is characterized in that, when described newly when the buffering area occupation rate when message arrives is not less than second threshold values of described current congestion level, and execution in step A.
5, method according to claim 3 is characterized in that, the described multistage congested level 1 congestion at least of being; Described first threshold values and second threshold values are to determine according to the buffering area occupation rate.
6, method according to claim 1 is characterized in that, does not describedly newly put into described buffering area to message and comprises described: abandon the described message that newly arrives.
7, method according to claim 3 is characterized in that, second threshold values that obtains buffering area occupation rate this moment, current congestion level, current congestion level also comprises step afterwards:
Obtain described new first threshold values of current congestion level when arriving to message;
When new buffering area occupation rate when arriving to message is between first threshold values of congested level and second threshold values, calculates the described congestion probability that newly arrives message.
8, method according to claim 7 is characterized in that, described congestion probability obtains for using formula, and described formula is: go into the buffering area Mean Speed and deduct out the buffering area Mean Speed, then with subtracting each other the value that obtains divided by going out the buffering area Mean Speed.
9, method according to claim 7 is characterized in that, obtain described new when message arrives first threshold values of current congestion level comprise step afterwards:
More described congestion probability and congestion probability threshold values are if this congestion probability less than described congestion probability threshold values, is then sent into buffer stores to described newly arrived message; If this congestion probability is greater than congestion probability threshold values, execution in step A.
10, according to any described method in the claim 1 to 9, it is characterized in that, when being lower than the lowest priority of message in the current buffering area, handling congested method and also comprise: reduce informed source speed, improve and buffering rate to message priority when new.
11, according to any described method in the claim 1 to 9, it is characterized in that, also comprise before the described steps A:
When the buffering area occupation rate less than described new when arriving during first threshold values of congested level to message, should newly send into buffer stores to message.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN200610060880A CN101043427B (en) | 2006-05-24 | 2006-05-24 | Method for processing congestion |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN200610060880A CN101043427B (en) | 2006-05-24 | 2006-05-24 | Method for processing congestion |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101043427A true CN101043427A (en) | 2007-09-26 |
| CN101043427B CN101043427B (en) | 2010-05-12 |
Family
ID=38808644
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN200610060880A Expired - Fee Related CN101043427B (en) | 2006-05-24 | 2006-05-24 | Method for processing congestion |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101043427B (en) |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101146050B (en) * | 2007-11-06 | 2011-03-23 | 杭州华三通信技术有限公司 | Frame relaying packet transmission method and device |
| CN102415060A (en) * | 2009-03-31 | 2012-04-11 | 英国电讯有限公司 | Pre-congestion notification (PCN) as a base for admission control and floe termination |
| CN103036794A (en) * | 2011-10-10 | 2013-04-10 | 华为技术有限公司 | Learning method, device and system of message |
| CN103229466A (en) * | 2012-12-27 | 2013-07-31 | 华为技术有限公司 | Data packet transmission method and device |
| WO2014100973A1 (en) * | 2012-12-25 | 2014-07-03 | 华为技术有限公司 | Video processing method, device and system |
| WO2023241649A1 (en) * | 2022-06-17 | 2023-12-21 | Huawei Technologies Co., Ltd. | Method and apparatus for managing a packet received at a switch |
Family Cites Families (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1152313C (en) * | 2000-11-02 | 2004-06-02 | 北京算通数字技术研究中心有限公司 | Section-by-section congestion control method based on random early detection |
| US7961616B2 (en) * | 2001-06-07 | 2011-06-14 | Qualcomm Incorporated | Method and apparatus for congestion control in a wireless communication system |
| CN1245815C (en) * | 2002-03-13 | 2006-03-15 | 威盛电子股份有限公司 | Ethernet exchange controller and its congestion control method |
| CN1286283C (en) * | 2003-05-23 | 2006-11-22 | 大唐移动通信设备有限公司 | Congestion control and recovery processing method in mobile communication system |
-
2006
- 2006-05-24 CN CN200610060880A patent/CN101043427B/en not_active Expired - Fee Related
Cited By (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101146050B (en) * | 2007-11-06 | 2011-03-23 | 杭州华三通信技术有限公司 | Frame relaying packet transmission method and device |
| CN102415060A (en) * | 2009-03-31 | 2012-04-11 | 英国电讯有限公司 | Pre-congestion notification (PCN) as a base for admission control and floe termination |
| CN102415060B (en) * | 2009-03-31 | 2015-06-17 | 英国电讯有限公司 | Pre-congestion notification (PCN) as a base for admission control and floe termination |
| WO2013053266A1 (en) * | 2011-10-10 | 2013-04-18 | 华为技术有限公司 | Message learning method, device and system |
| EP2753029A1 (en) * | 2011-10-10 | 2014-07-09 | Huawei Technologies Co., Ltd. | Message learning method, device and system |
| EP2753029A4 (en) * | 2011-10-10 | 2015-01-07 | Huawei Tech Co Ltd | Message learning method, device and system |
| CN103036794A (en) * | 2011-10-10 | 2013-04-10 | 华为技术有限公司 | Learning method, device and system of message |
| WO2014100973A1 (en) * | 2012-12-25 | 2014-07-03 | 华为技术有限公司 | Video processing method, device and system |
| CN103229466A (en) * | 2012-12-27 | 2013-07-31 | 华为技术有限公司 | Data packet transmission method and device |
| WO2014101060A1 (en) * | 2012-12-27 | 2014-07-03 | 华为技术有限公司 | Data packet transmission method and device |
| CN103229466B (en) * | 2012-12-27 | 2016-03-09 | 华为技术有限公司 | A kind of method of data packet transmission and device |
| US9866482B2 (en) | 2012-12-27 | 2018-01-09 | Huawei Technologies Co., Ltd. | Packet transmission method and apparatus |
| WO2023241649A1 (en) * | 2022-06-17 | 2023-12-21 | Huawei Technologies Co., Ltd. | Method and apparatus for managing a packet received at a switch |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101043427B (en) | 2010-05-12 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN1073318C (en) | Movable communication | |
| CN101043427A (en) | Method for processing congestion | |
| CN1771707A (en) | Call admission control in VoIP systems | |
| CN1631008A (en) | Method and apparatus for scheduling message processing | |
| CN1300490A (en) | Apparatus and method for monitoring data flow at node on a network | |
| CN1162381A (en) | System and method of providing enhanced subscriber services in multi-node telecommunication network | |
| CN1541474A (en) | System and method of differentiated queuing in routing system | |
| CN1933431A (en) | Method for detecting QoS | |
| CN1163031A (en) | Overload prevention in a telecommunications network node | |
| US6628672B1 (en) | Signalling in a telecommunications network | |
| CN1314757A (en) | Method for processing jam state of user part of news transmission part | |
| CN1127273C (en) | Overload control method implemented in application layer of mobile switch center | |
| CN1152313C (en) | Section-by-section congestion control method based on random early detection | |
| CN1870521A (en) | Method for reducing service lossing of SS7 signalling and M3UA communicating | |
| CN1219388C (en) | Method for realizing signaling transit point in IP domain of user adaption layer in signaling network layer | |
| CN1842171A (en) | A method of call connection | |
| CN1897561A (en) | Method for protecting VOIP digital signal processing channel | |
| CN1266902C (en) | Call routing method in frame relay voice network | |
| CN1282330C (en) | Control gating method for realizing applied signalling to business in number 7 news distribution unit | |
| CN1622555A (en) | Port dynamic binding module for media gateway and dynamic binding method thereof | |
| CN1463112A (en) | Method for realizing traffic load sharing in user adaptation layer of signaling network layer | |
| CN100391270C (en) | Calling treatment method | |
| CN1463127A (en) | Method for realizing interworking between wideband and narrowband signaling networks | |
| CN1889610A (en) | Large-capacity distributing signalling processing equipment and method thereof | |
| CN1314238C (en) | Method for implementing self-adaptive inter-task communication in embedded system |
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 | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20100512 Termination date: 20170524 |