CN110336745A - A kind of method and device for realizing service path fast convergence by batched operation - Google Patents
A kind of method and device for realizing service path fast convergence by batched operation Download PDFInfo
- Publication number
- CN110336745A CN110336745A CN201910803413.6A CN201910803413A CN110336745A CN 110336745 A CN110336745 A CN 110336745A CN 201910803413 A CN201910803413 A CN 201910803413A CN 110336745 A CN110336745 A CN 110336745A
- Authority
- CN
- China
- Prior art keywords
- lsp
- forwarding table
- memory space
- business
- forwarding
- 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
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/22—Alternate routing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/28—Routing or path finding of packets in data switching networks using route fault recovery
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/54—Organization of routing tables
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a kind of methods for realizing service path fast convergence by batched operation, comprising the following steps: when detecting that link breaks down, creates LSP；Newly-built LSP is issued to forward processing unit, forms the first memory space at the forward processing unit；The index of old LSP index, the business being carried on old LSP index and newly-built LSP is switched into the corresponding position of the first forwarding table to generate the second forwarding table；The forward processing unit carries out batch data processing to the second forwarding table to obtain third forwarding table；Third forwarding table and old LSP solution are bound, and bound again with newly-built LSP.The present invention also provides a kind of electronic equipment and computer readable storage medium.Method of the invention is by the design method of batched operation, so that accelerating under the scene of any fast detection mechanism of no configuration and protection mechanism by business convergence to the spare path LSP in IPRAN system.
Description
Technical field
The present invention relates to a kind of fields of communication technology, more particularly to one kind to realize that service path is quick by batched operation
Convergent method and device.
Background technique
Currently, a kind of MPLS VPN technologies using IPization of IPRAN(realize that data are transmitted) in network, LSP(label is handed over
Path is changed, is the path that message passes through in an mpls network) formation in path generallys use the mode of protocol negotiation.In order to protect
The business carried on the path LSP, it usually needs configuration Protection path LSP, Protection path LSP is generally termed spare LSP, and is protected
The LSP of shield is generally termed primary LSP, and when primary lsp failure, then business datum is switched to spare LSP, in order to accelerate business
Switch, usually also need to configure BFD(it be one for detect two forwarding put between failure network protocols) to failure into
Row quickly detection, therefore time=primary lsp failure detection time+main LSP of business convergence to spare LSP are switched to spare LSP
Time business may be implemented and restrained within 50ms usually under the action of the two, but under certain application scenarios,
May there is no config failure testing mechanism and LSP protection mechanism, such as the path LSP generated by LDP agreement, both not configure
BFD testing mechanism detects the state of main LSP, also without configuring a kind of protection mechanism of LDP LSP of LDP FRR(), when the path LSP
It, then will be first by routing convergence to the new path LSP, then by the heavy with the new path LSP of one rule of business when breaking down
New binding, if number of services is larger, business convergence speed is excessively slow, leads to a large amount of packet losses of business.
Summary of the invention
For overcome the deficiencies in the prior art, it is realized one of the objects of the present invention is to provide a kind of by batched operation
The method of service path fast convergence can accelerate business convergence to the spare path LSP.
The second object of the present invention is to provide a kind of electronic equipment, can accelerate business convergence to the spare path LSP.
The third object of the present invention is to provide a kind of computer readable storage medium, can accelerate business convergence to standby
With the path LSP.
An object of the present invention adopts the following technical scheme that realization:
A method of service path fast convergence is realized by batched operation, comprising the following steps:
Detecting step: when detecting that link breaks down, LSP is created；
It issues step: issuing newly-built LSP to forward processing unit, form the first memory space at the forward processing unit,
And the first forwarding table is formed in first memory space, first forwarding table includes a plurality of forwarding-table item, and every turns
Forwarding list item corresponds to a business；
Switch step: search old LSP index and the business being carried on old LSP index, and by old LSP index, be carried on it is old
The index of business index and newly-built LSP on LSP switches to the corresponding position of the first forwarding table to generate the second forwarding table；
Scale processing steps: the second forwarding table is issued to forward processing unit, the forward processing unit is to the second forwarding table
Batch data processing is carried out to obtain third forwarding table；The batch data processing step specifically includes setting steps, modification step
Rapid and data return step:
Setting steps: the second memory space of setting reads forwarding-table item in the second forwarding table in batches from the first memory space
To the second memory space；
Amendment step: the second forwarding table is obtained at the second memory space, the second memory space is then stored according to business
Position uses newly-built LSP forwarding-table item to go to modify corresponding business to generate third forwarding table；
Data return step: third forwarding table is back in the first memory space；
Bind step again: third forwarding table and old LSP solution being bound, and bound again with newly-built LSP, and according to binding again after
Newly-built LSP carry out business forwarding.
Further, in the detecting step: what the newly-built LSP was recalculated according to protocol processing unit
LSP path is constructed.
Further, further include deleting step after binding step again: issuing old LSP and delete information to forward process list
Member, so that forward processing unit deletes old LSP forwarding table.
Further, the size of first memory space is N*M, and N is the entry number of business, and M is shared by a business
Space size.
Further, in issuing step, the first forwarding table in first memory space is forwarded for service guidance,
It is destroyed when its device powers down.
Further, after amendment step: after the completion of forwarding table data modification, the second memory space is returned in control
It receives.
Further, in the first memory space or the second memory space, index value obtained is continuous numerical value
Or discontinuous numerical value, first memory space are identical as the second storage size.
The second object of the present invention adopts the following technical scheme that realization:
A kind of electronic equipment including memory, processor and stores the calculating that can be run on a memory and on a processor
Machine program, the processor realize that one kind described in any one of one of the object of the invention is logical when executing the computer program
Cross the method that batched operation realizes service path fast convergence.
The third object of the present invention adopts the following technical scheme that realization:
A kind of computer readable storage medium is stored thereon with computer program, when the computer program is executed by processor
Realizing a kind of realization service path fast convergence by batched operation as described in any one of one of the object of the invention
Method.
Compared with prior art, the beneficial effects of the present invention are:
The method of realization service path fast convergence of the invention is by the design method of batched operation, so that in IPRAN system
It unites under the scene of any fast detection mechanism of no configuration and protection mechanism, accelerates to subtract business convergence to the spare path LSP
The a large amount of packet losses of business are lacked.
Detailed description of the invention
Fig. 1 is the flow chart of the method that service path fast convergence is realized by batched operation in embodiment one；
Fig. 2 is the flow chart of the implementation of the method that service path fast convergence is realized by batched operation in embodiment one；
Fig. 3 is the schematic diagram that the batched operation in embodiment one is realized.
Specific embodiment
In the following, being described further in conjunction with attached drawing and specific embodiment to the present invention, it should be noted that not
Under the premise of conflicting, new implementation can be formed between various embodiments described below or between each technical characteristic in any combination
Example.
Embodiment one
Current scheme under certain application scenarios, may not have config failure testing mechanism and LSP protection mechanism, such as by
The state of main LSP is both detected in the path LSP that LDP agreement generates without configuration BFD testing mechanism, also without configuration LDP FRR
(a kind of protection mechanism of LDP LSP), when LSP path fails, then will first by routing convergence to the new path LSP,
Then binding again with the new path LSP by one rule of business, if number of services is larger, business convergence speed is excessively slow,
Lead to a large amount of packet losses of business.In view of above-mentioned reason, the present invention provides one kind in any fast detection mechanism of no configuration and
Under the scene of protection mechanism, accelerate business convergence to the method in the spare path LSP, specific embodiment is as follows:
As depicted in figs. 1 and 2, a kind of side that service path fast convergence is realized by batched operation is present embodiments provided
Method, comprising the following steps:
Step S1: when detecting that link breaks down, LSP is created；The newly-built LSP is recalculated according to protocol processing unit
The obtained path LSP is constructed；When link failure, protocol processing unit recalculates the path LSP, and notices at control
Manage unit: the old path LSP is deleted in the newly-built path LSP, controls the related letter that processing unit is used to manage LSP in the present embodiment
Breath, and do some corresponding logical process.Comprising there are three modules in this embodiment: at protocol processing unit, control
Reason unit and forward processing unit, three processing units are respectively used to handle different contents.
Step S2: newly-built LSP is issued to forward processing unit, it is empty to form the first storage at the forward processing unit
Between, and the first forwarding table is formed in first memory space, first forwarding table includes a plurality of forwarding-table item, and every
Forwarding-table item corresponds to a business；The size of first memory space is N*M, and N is the entry number of business, and M is a business
Shared space size.The first forwarding table in first memory space is forwarded for service guidance, is sold in device powers down
It ruins.Control unit inquires self-administered LSP relevant information, at this point, first issuing the new path LSP to forward processing unit, shape
The forwarding table operated in batch, forward processing unit are used to form forwarding-table item, and message is instructed to forward.Assuming that equipment branch
The entry number for holding business (customer service+LSP) is N, and a forwarding-table item committed memory size is M, then needs depositing in equipment
The memory space that one section of space size is N*M is opened up on reservoir, is used to store forwarding-table item, the data of this memory space are used to
Service guidance forwarding, when device powers down, can just destroy.One business occupies a forwarding-table item, and one business occupancy of every configuration is deposited
The size for storing up space is M, and to this memory allocation one index, so as to access next time, when deleting certain business, root
This memory space is found according to the index of distribution, by forwarding-table item data dump, and recycles index.
Step S3: search old LSP index and the business being carried on old LSP index, and by old LSP index, be carried on
The index of business index and newly-built LSP on old LSP switches to the corresponding position of the first forwarding table to generate the second forwarding table；
Control unit searches the index of old LSP and the business being carried on old LSP index, then these is indexed+are created the rope of LSP
Draw+switch to the corresponding marker of newly-built LSP and is issued to forward processing unit.
Step S4: being issued to forward processing unit for the second forwarding table, the forward processing unit to the second forwarding table into
The processing of row batch data is to obtain third forwarding table；The step S4 specifically includes following sub-step:
Setting steps: the second memory space of setting reads forwarding-table item in the second forwarding table in batches from the first memory space
To the second memory space；What the second memory space here referred to is temporary memory space, is mainly used to be faced in it
When data storage and modify；
Amendment step: the second forwarding table is obtained at the second memory space, the second memory space is then stored according to business
Position uses newly-built LSP forwarding-table item to go to modify corresponding business to generate third forwarding table；After amendment step: working as forwarding
After the completion of table data modification, the second memory space is recycled in control.
Data return step: third forwarding table is back in the first memory space.In the first memory space or second
In memory space, index value obtained is continuous numerical value or discontinuous numerical value.
Specific batched operation realization principle figure as shown in Figure 3, what Buffer referred in figure is memory space,
Realization principle is as follows: the business, including LSP itself carried on a LSP, may be continuous in the obtained index value of memory space
It is also likely to be discontinuous；Assuming that creation LSP obtain index be index_1, the number of services for needing to switch be 1K(N-1 >
1K), and index_1 and 1K business index obtained are discontinuous, find maximum in index_1 and 1K business index
Value and minimum value, are respectively labeled as index_max and index_min；The interim storage that one section of space size is N*M is opened up again
Space, by index range be [index_min, index_max] forwarding-table item from memory space described in the 1st article batch
It reads to temporary memory space.Then index_1-index_min is newly-built LSP in the position of temporary memory space, similarly, 1K
It is 1K business in the corresponding position of temporary memory space that the corresponding index of business, which subtracts index_min then,；In temporary space
Newly-built LSP forwarding table information is obtained at index_1-index_min, and the position of temporary space is then stored according to 1K business
It sets, removes 1K business forwarding-table item information of modification with newly-built LSP forwarding-table item；After the completion of modification, temporary memory space is stored
Forwarding-table item, again in memory space described in the 1st article of the write-in of batch, the writing range of this memory space is [index_
Min, index_max], temporary memory space can be destroyed at this time, be recovered in the system.
It specifically that is to say, read in batches from Buffer_1, one section of index range [index_min, index_max]
Continuous forwarding-table item is illustrated followed by specific data, it is assumed that index_min=3, index_max=10, then then needing
8 list items are read in total into Buffer_2.If the table item index of Buffer_1 where LSP is 4, the business for needing to modify
The table item index of Buffer_1 is respectively 3,7,9,10 where list item, then is respectively in the corresponding index of interim Buffer_2: standby
), lsp(1 the data such as business (0,4,6,7).After the completion of modification, Buffer_1 is write back in batches, and index range is [index_
min,index_max]。
Step S5: third forwarding table and old LSP solution being bound, and bound again with newly-built LSP, and according to binding again after
Newly-built LSP carry out business forwarding.Control unit carries out software records processing, and business and old LSP solution are bound, built with new LSP
Vertical binding relationship, to realize the fast convergence of service path.
Step S6: it issues old LSP and deletes information to forward processing unit, turn so that forward processing unit deletes old LSP
It delivers.When those skilled in the art encounter the above problem, the way generallyd use is that corresponding detection machine is directly arranged
System, because of testing mechanism relative maturity, so it is opposite that directly setting testing mechanism operates to those skilled in the art
Easily, the batched operation and mentioned in the present embodiment is not easy to expect to those skilled in the art.
The method of realization service path fast convergence of the invention by the design method of batched operation so that
IPRAN system accelerates under the scene of any fast detection mechanism of no configuration and protection mechanism by business convergence to spare LSP
Path reduces a large amount of packet losses of business.
Embodiment two
Embodiment two discloses a kind of electronic equipment, which includes processor, memory and program, wherein processor
One or more can be used with memory, program is stored in memory, and is configured to be executed by processor, processing
When device executes the program, a kind of method that service path fast convergence is realized by batched operation of embodiment one is realized.It should
Electronic equipment can be a series of electronic equipment of mobile phone, computer, tablet computer etc..
Embodiment three
Embodiment three discloses a kind of computer readable storage medium, and the storage medium is for storing program, and the program quilt
When processor executes, a kind of method that service path fast convergence is realized by batched operation of embodiment one is realized.
Certainly, a kind of storage medium comprising computer executable instructions, computer provided by the embodiment of the present invention
The method operation that executable instruction is not limited to the described above, can also be performed in method provided by any embodiment of the invention
Relevant operation.
By the description above with respect to embodiment, it is apparent to those skilled in the art that, the present invention
It can be realized by software and required common hardware, naturally it is also possible to which by hardware realization, but in many cases, the former is more
Good embodiment.Based on this understanding, technical solution of the present invention substantially in other words contributes to the prior art
Part can be embodied in the form of software products, which can store in computer readable storage medium
In, floppy disk, read-only memory (Read-Only Memory, ROM), random access memory (Random such as computer
Access Memory, RAM), flash memory (FLASH), hard disk or CD etc., including some instructions use so that an electronic equipment
(can be personal computer, server or the network equipment etc.) executes method described in each embodiment of the present invention.
It is worth noting that, in the above-mentioned embodiment based on content update notice device, included each unit and mould
Block is only divided according to the functional logic, but is not limited to the above division, and is as long as corresponding functions can be realized
It can；In addition, the specific name of each functional unit is also only for convenience of distinguishing each other, the protection model being not intended to restrict the invention
It encloses.
The above embodiment is only the preferred embodiment of the present invention, and the scope of protection of the present invention is not limited thereto,
The variation and replacement for any unsubstantiality that those skilled in the art is done on the basis of the present invention belong to institute of the present invention
Claimed range.
Claims (9)
1. a kind of method for realizing service path fast convergence by batched operation, which comprises the following steps:
Detecting step: when detecting that link breaks down, LSP is created；
It issues step: issuing newly-built LSP to forward processing unit, form the first memory space at the forward processing unit,
And the first forwarding table is formed in first memory space, first forwarding table includes a plurality of forwarding-table item, and every turns
Forwarding list item corresponds to a business；
Switch step: search old LSP index and the business being carried on old LSP index, and by old LSP index, be carried on it is old
The index of business index and newly-built LSP on LSP switches to the corresponding position of the first forwarding table to generate the second forwarding table；
Scale processing steps: the second forwarding table is issued to forward processing unit, the forward processing unit is to the second forwarding table
Batch data processing is carried out to obtain third forwarding table；The batch data processing step specifically includes setting steps, modification step
Rapid and data return step:
Setting steps: the second memory space of setting reads forwarding-table item in the second forwarding table in batches from the first memory space
To the second memory space；
Amendment step: the second forwarding table is obtained at the second memory space, the second memory space is then stored according to business
Position uses newly-built LSP forwarding-table item to go to modify corresponding business to generate third forwarding table；
Data return step: third forwarding table is back in the first memory space；
Bind step again: third forwarding table and old LSP solution being bound, and bound again with newly-built LSP, and according to binding again after
Newly-built LSP carry out business forwarding.
2. a kind of method for realizing service path fast convergence by batched operation as described in claim 1, feature exist
In in the detecting step: the newly-built LSP carries out structure according to the path LSP that protocol processing unit recalculates
It builds.
3. a kind of method for realizing service path fast convergence by batched operation as described in claim 1, feature exist
In further including deleting step after binding step again: issuing old LSP and delete information to forward processing unit, so that forwarding
Processing unit deletes old LSP forwarding table.
4. a kind of method for realizing service path fast convergence by batched operation as described in claim 1, feature exist
In the size of first memory space is N*M, and N is the entry number of business, and M is space size shared by a business.
5. a kind of method for realizing service path fast convergence by batched operation as described in claim 1, feature exist
In in issuing step, the first forwarding table in first memory space is forwarded for service guidance, in device powers down
It destroys.
6. a kind of method for realizing service path fast convergence by batched operation as described in claim 1, feature exist
In after amendment step: after the completion of forwarding table data modification, the second memory space is recycled in control.
7. a kind of method for realizing service path fast convergence by batched operation as described in claim 1, feature exist
In index value obtained is continuous numerical value or discontinuous number in the first memory space perhaps the second memory space
Value, first memory space are identical as the second storage size.
8. a kind of electronic equipment including memory, processor and stores the meter that can be run on a memory and on a processor
Calculation machine program, which is characterized in that the processor realizes any one of claim 1-7 institute when executing the computer program
A kind of method that service path fast convergence is realized by batched operation stated.
9. a kind of computer readable storage medium, is stored thereon with computer program, it is characterised in that: the computer program quilt
Realize that one kind as described in claim 1-7 any one realizes that service path is quick by batched operation when processor executes
Convergent method.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910803413.6A CN110336745B (en) | 2019-08-28 | 2019-08-28 | Method and device for realizing rapid convergence of service paths through batch operation |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910803413.6A CN110336745B (en) | 2019-08-28 | 2019-08-28 | Method and device for realizing rapid convergence of service paths through batch operation |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110336745A true CN110336745A (en) | 2019-10-15 |
| CN110336745B CN110336745B (en) | 2019-12-20 |
Family
ID=68150217
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910803413.6A Active CN110336745B (en) | 2019-08-28 | 2019-08-28 | Method and device for realizing rapid convergence of service paths through batch operation |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110336745B (en) |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1805411A (en) * | 2006-01-23 | 2006-07-19 | 杭州华为三康技术有限公司 | Method for processing label binding |
| US7283529B2 (en) * | 2003-03-07 | 2007-10-16 | International Business Machines Corporation | Method and system for supporting a dedicated label switched path for a virtual private network over a label switched communication network |
| CN101237409A (en) * | 2008-02-27 | 2008-08-06 | 华为技术有限公司 | Method and device for realizing quick re-routing in MPLS VPN |
| CN101552729A (en) * | 2009-05-20 | 2009-10-07 | 杭州华三通信技术有限公司 | Method for preventing label switch path oscillating and interim label switching router |
| CN102377677A (en) * | 2011-11-21 | 2012-03-14 | 盛科网络（苏州）有限公司 | Method and system for quickly switching protection paths in multi-protocol label switching (MPLS) network |
| CN103368843A (en) * | 2012-03-27 | 2013-10-23 | 丛林网络公司 | An OAM label switched path for fast reroute of protected label switched paths |
| CN108055163A (en) * | 2018-01-06 | 2018-05-18 | 北京特立信电子技术股份有限公司 | A kind of dual-homed equipment and its protection switching method |
| US10341228B1 (en) * | 2017-03-29 | 2019-07-02 | Juniper Networks, Inc. | RSVP make-before-break label reuse |
-
2019
- 2019-08-28 CN CN201910803413.6A patent/CN110336745B/en active Active
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7283529B2 (en) * | 2003-03-07 | 2007-10-16 | International Business Machines Corporation | Method and system for supporting a dedicated label switched path for a virtual private network over a label switched communication network |
| CN1805411A (en) * | 2006-01-23 | 2006-07-19 | 杭州华为三康技术有限公司 | Method for processing label binding |
| CN101237409A (en) * | 2008-02-27 | 2008-08-06 | 华为技术有限公司 | Method and device for realizing quick re-routing in MPLS VPN |
| CN101552729A (en) * | 2009-05-20 | 2009-10-07 | 杭州华三通信技术有限公司 | Method for preventing label switch path oscillating and interim label switching router |
| CN102377677A (en) * | 2011-11-21 | 2012-03-14 | 盛科网络（苏州）有限公司 | Method and system for quickly switching protection paths in multi-protocol label switching (MPLS) network |
| CN103368843A (en) * | 2012-03-27 | 2013-10-23 | 丛林网络公司 | An OAM label switched path for fast reroute of protected label switched paths |
| US10341228B1 (en) * | 2017-03-29 | 2019-07-02 | Juniper Networks, Inc. | RSVP make-before-break label reuse |
| CN108055163A (en) * | 2018-01-06 | 2018-05-18 | 北京特立信电子技术股份有限公司 | A kind of dual-homed equipment and its protection switching method |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110336745B (en) | 2019-12-20 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103905311B (en) | Flow table matching method and device and switch | |
| US10938966B2 (en) | Efficient packet classification for dynamic containers | |
| CN105224692A (en) | Support the system and method for the SDN multilevel flow table parallel search of polycaryon processor | |
| CN107104824B (en) | Network topology determination method and device | |
| CN105589744B (en) | A kind of virtual machine migration method and device | |
| KR20090006034A (en) | Method and system for an atomically updated, central cache memory | |
| CN105379206A (en) | In-network message processing method, in-network message forwarding equipment and in-network message processing system | |
| CN106445730A (en) | Method for improving performance of virtual machine, and terminal | |
| CN110109868A (en) | Method, apparatus and computer program product for index file | |
| CN110704438B (en) | Method and device for generating bloom filter in blockchain | |
| CN108259346A (en) | A kind of equivalent route item establishing method and device | |
| JP3034873B2 (en) | Information processing device | |
| CN105930178A (en) | Configurable parameter dynamic loading method and system | |
| CN107273187A (en) | Reading position acquisition methods and device, computer installation, readable storage medium storing program for executing | |
| CN109218458A (en) | Wiring method, equipment and the computer readable storage medium of MAC Address | |
| CN110336745A (en) | A kind of method and device for realizing service path fast convergence by batched operation | |
| CN104461779B (en) | A kind of storage method of distributed data, apparatus and system | |
| US10693731B2 (en) | Flow entry management method and device | |
| US9652310B1 (en) | Method and apparatus for using consistent-hashing to ensure proper sequencing of message processing in a scale-out environment | |
| CN104702508A (en) | Method and system for dynamically updating table items | |
| CN105117169B (en) | A kind of method and device of the disk space management of optimization | |
| CN107070797A (en) | A kind of method and system of message forwarding | |
| CN116150152A (en) | Method and device for determining wind control characteristic blood-vessel relation | |
| CN112532594B (en) | Method and device for creating aggregation group and forwarding message | |
| CN108366024A (en) | Message forwarding method and device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |