Method and device for IKE (internet key exchange) coordinated congestion control
A congestion control and key exchange protocol technology, applied in the field of network security, can solve the problems that EXCH cannot effectively and accurately control congestion, and the number cannot truly reflect the busyness of the system, so as to achieve the effect of congestion control
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0034] The processing flow of the congestion control method of IKE negotiation in Embodiment 1 of the present invention, such as figure 1 shown, including the following steps:
[0035] Step S102, after receiving the first message from the opposite end, obtain the operation time of the other end from the first message, wherein, the operation time is to parse the received second message and construct a response to the second message The time consumed by the first message of , or the time consumed to construct the first message;
[0036] For example, during the IKE negotiation process, when the initiating end or the responding end sends (including actively sending and replying) a message (called the third message) to the opposite end, it will carry its calculation time in the third message. The text is sent to the opposite end, wherein, when the third message is the first message sent by the initiator, the calculation time is the time consumed to construct the third message, and...
Embodiment 2
[0046] In the first embodiment, the introduction of a delay reply mechanism can effectively prevent the system from entering a congested state, but this mechanism uses the peer end to control the congestion problem of the local end through the delay reply message, and it cannot control the ongoing negotiation in the system (ie The total number of concurrent EXCH) in the system is a passive defense mechanism.
[0047] In the second embodiment of the present invention, by calculating the busy index of the local end, the local end can identify whether it has entered the busy state. If the status is busy, you can stop initiating or accepting new IKE negotiations, that is, whether the new IKE negotiations triggered by the local end or the peer end will be rejected. This mechanism is an active defense mechanism implemented at the local end, and its essence is to control the total number of EXCH in the control system.
[0048] Such as figure 2 As shown, the processing flow of the ...
Embodiment 3
[0059] EXCH (one EXCH corresponds to one IKE negotiation) exists to negotiate IKE SA (generated in the first phase of negotiation) or IPSec SA (generated in the second phase of negotiation). Normally, the local system Create EXCH and start message interaction with the peer. After all message interactions are completed, the corresponding SA will be generated. At this time, EXCH has completed its mission and will be deleted by the system. This period of time is the survival time of EXCH, which is recorded as EXCH_DURATION.
[0060] Therefore, the EXCH_DURATION of each EXCH in the system (that is, the ongoing IKE negotiation in the system) should be controlled within a reasonable time (called the survival time threshold), and the survival time threshold should meet the following requirements:
[0061] (1) The time should be long enough to have enough time to complete a complete IKE negotiation. If it is too short, EXCH will be released before the negotiation is completed, and the...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More - R&D
- Intellectual Property
- Life Sciences
- Materials
- Tech Scout
- Unparalleled Data Quality
- Higher Quality Content
- 60% Fewer Hallucinations
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2025 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com
