CN105262691B - A kind of quick method and apparatus for removing the invalid LSA of OSPF - Google Patents
A kind of quick method and apparatus for removing the invalid LSA of OSPF Download PDFInfo
- Publication number
- CN105262691B CN105262691B CN201510730736.9A CN201510730736A CN105262691B CN 105262691 B CN105262691 B CN 105262691B CN 201510730736 A CN201510730736 A CN 201510730736A CN 105262691 B CN105262691 B CN 105262691B
- Authority
- CN
- China
- Prior art keywords
- link state
- invalid
- lsa
- state advertisement
- advertisement
- 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.)
- Active
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/02—Topology update or discovery
- H04L45/021—Ensuring consistency of routing table updates, e.g. by using epoch numbers
Abstract
The present invention provides a kind of quick method and apparatus for removing the invalid LSA of OSPF, and methods described includes step：LSD is traveled through, whether each Link State Advertisement of preliminary judgement be invalid；After judging that the Link State Advertisement is invalid for the first time, second is carried out to the Link State Advertisement and is judged, to confirm whether it is Link State Advertisement；If confirm that the Link State Advertisement is broadcasted for invalid link state after second judges, the Link State Advertisement is deleted；It is without any processing if confirm that the Link State Advertisement is effective after first judgement or second judge.The quick method for removing the invalid LSA of OSPF provided by the invention, removes invalid LSA, reduces memory usage, improve router-level topology speed.Further, it is also possible to it is compatible with existing realization, as long as there is the equipment for supporting above-mentioned realization each ospf area.
Description
Technical field
The present invention relates to communication technical field, more particularly to a kind of quick method and apparatus for removing the invalid LSA of OSPF.
Background technology
In OSPF (ospf) network, router is merely able to make in advance LSA (links caused by oneself
State is broadcasted) aging, and LSA caused by aging other equipment is unable to, specific action is that the ageing time of the LSA is set into 3600
Then second floods away again.The mechanism causes (such as equipment removes from network, router id changes) in some cases,
Equipment have no chance before premature aging caused by LSA (invalid LSA), LSA can only be waited to reach 3600 seconds overtime ageing times, most
Whole LSA deletes from LSDB (LSD).So, invalid LSA is resided in LSDB for a long time, committed memory money
Source and influence router-level topology speed.
The content of the invention
In view of the above problems, the application describes a kind of quick method for removing the invalid LSA of OSPF, and methods described includes step
Suddenly：
LSD is traveled through, whether each Link State Advertisement of preliminary judgement be invalid；
After judging that the Link State Advertisement is invalid for the first time, second is carried out to the Link State Advertisement and is judged, with
Confirm whether it is the broadcast of invalid link state；
If confirm that the Link State Advertisement is broadcasted for the invalid link state after second judges, described in deletion
Link State Advertisement.
It is without any processing if confirm that the Link State Advertisement is effective after first judgement or second judge.
Preferably, during whether each Link State Advertisement of preliminary judgement invalid, for a kind of link
Whether state broadcast or two class Link State Advertisements, inspection a kind of Link State Advertisement or the two classes Link State Advertisement
On SPF trees, if determining that it is effective；Otherwise, it is determined that its is invalid.
Preferably, for three class Link State Advertisements or four class Link State Advertisements, judge that it whether there is zone boundary
The path of router and whether corresponding route can be calculated, if the three classes Link State Advertisement or the four classes link
There is the path of the Area Border Router and can calculate the route in state broadcast, then judge the three classes link shape
State is broadcasted or the four classes Link State Advertisement is effective；It is otherwise, it is determined that invalid.
Preferably, for five class Link State Advertisements or seven class Link State Advertisements, judge that it whether there is autonomous system
Border router and whether corresponding route can be calculated, if the five classes Link State Advertisement or the seven classes link shape
There is the path of the Autonomous System Boundary Router, AS Boundary Router and can calculate the route in state broadcast, then judge the five classes link
State is broadcasted or the seven classes Link State Advertisement is effective；It is otherwise, it is determined that invalid.
Preferably, the Link State Advertisement is carried out second during judging, by the Link State Advertisement
Sequence number increase by 1 is simultaneously sent, if not receiving the renewal of the Link State Advertisement within a certain period of time, described in judgement
Link State Advertisement is invalid；Otherwise, it is determined that the Link State Advertisement is effective.
Preferably, in second this judgement during judge that the Link State Advertisement is invalid after, by the Link State
The ageing time of broadcast is arranged to 3600 seconds and flooded away.
Present invention also offers a kind of quick equipment for removing the invalid LSA of OSPF, the equipment includes：
Whether first determination module is invalid to each Link State Advertisement of preliminary judgement；
Secondary determination module, it is connected with the first determination module, to be carried out second to the Link State Advertisement
Judge to confirm whether it is the broadcast of invalid link state；
Removing module, it is connected with the secondary determination module, to delete the invalid link state broadcast.
Preferably, the first determination module includes：
First identifying unit, to check a kind of Link State Advertisement or two class Link State Advertisements whether on SPF trees；
Second identifying unit, to judge that three class Link State Advertisements or four class Link State Advertisements whether there is regional edge
The path of boundary's router and whether can calculate corresponding route；
3rd identifying unit, to judge five class Link State Advertisements or seven class Link State Advertisements with the presence or absence of autonomous system
Unite border router path and whether can calculate corresponding route.
Preferably, the secondary determination module includes：
Sequence number adding unit, sentence respectively with first identifying unit, second identifying unit and the described 3rd
Order member is connected, the sequence number of the Link State Advertisement is increased into 1 and sent；
Invalid determining unit, be connected with the sequence number adding unit, to judge the Link State Advertisement whether institute
State the broadcast of invalid link state.
Preferably, the removing module includes：
Time setting unit, it is connected with the invalid determining unit, to the aging for broadcasting the invalid link state
Time is arranged to 3600 seconds；
Unit is flooded, is connected with the time setting unit, invalid link state broadcast flooding to be gone out
Above-mentioned technical proposal has the following advantages that or beneficial effect：The quick invalid LSA of removing OSPF that the present embodiment provides
Method, remove invalid LSA, reduce memory usage, improve router-level topology speed.Further, it is also possible to it is compatible with existing realization,
As long as there is the equipment for supporting above-mentioned realization each ospf area.
Brief description of the drawings
With reference to appended accompanying drawing, more fully to describe embodiments of the invention.However, appended accompanying drawing be merely to illustrate and
Illustrate, and be not meant to limit the scope of the invention.
Fig. 1 is a kind of flow chart one of the quick method for removing the invalid LSA of OSPF of the present invention；
Fig. 2 is a kind of flowchart 2 of the quick method for removing the invalid LSA of OSPF of the present invention；
Fig. 3 is a kind of structural representation one of the quick equipment for removing the invalid LSA of OSPF of the present invention；
Fig. 4 is a kind of structural representation two of the quick equipment for removing the invalid LSA of OSPF of the present invention.
Embodiment
Enter below in conjunction with the accompanying drawings with the specific embodiment quick method and apparatus for removing the invalid LSA of OSPF a kind of to the present invention
Row describes in detail.
Embodiment one
As shown in figure 1, (Open Shortest Path First, open type shortest path are excellent by a kind of quick removing OSPF
First) the method for invalid LSA (Link-State Advertisement, Link State Advertisement), including step：
Travel through LSDB (Link State DataBase, LSD), tentatively judge each LSA whether be
Invalid LSA；
If it find that the LSA is invalid LSA, the invalid LSA is further confirmed；
If judging after judging twice, the LSA is invalid, deletes the LSA；
Otherwise, do not process.
If it find that the LSA is effective LSA, do not process.
Specifically, each LSA in LSD is traveled through, and judges whether this LSA is invalid for the first time.If
It is invalid to judge for the first time, it is necessary to is judged again；Otherwise, it is without any processing.After judging again, if the LSA is still
To be invalid, the LSA is deleted, it is otherwise, without any processing.
During each LSA in LSD is judged whether it is invalid for the first time, according to chain
The species of line state broadcast, carries out judging that the process of processing is also different.Specifically, the process includes following several situations：
(1) for a kind of LSA or two class LSA, check the LSA whether on SPF trees；
If the LSA is on SPF trees, it is believed that it is effective LSA；
If the LSA not on SPF trees, judges the LSA for invalid LSA.
(2) for three class LSA or four class LSA, ABR (Area Border Router, the area of the LSA are judged whether
Domain border router) path and whether can calculate corresponding route；
If in the presence of, it is judged for effective LSA,
If being not present, invalid LSA is determined that it is.
(3) for five class LSA and seven class LSA, judge whether that ASBR (the autonomous system boundary routes of the LSA can be calculated
Device, Autonomous System Boundary Router) path and whether can calculate corresponding route；
If can, judge it for effective LSA；
Otherwise, then judge it for invalid LSA.
Specifically, Link State Advertisement can be divided into six kinds：A kind of LSA, two class LSA, three class LSA, four class LSA, five
Class LSA and seven class LSA.For a kind of LSA and two class LSA, by checking it whether in SPF trees (Shortest-Path
Tree on), that is, judge whether a kind of LSA or two class LSA meet SPF algorithms.If it is satisfied, then assert that it is effective LSA, otherwise
For invalid LSA；For three class LSA and four class LSA, the path of the LSA Area Border Routers is judged whether, if there is
Then judge whether that corresponding route can be calculated, be then invalid LSA otherwise if it can, then assert that it is effective LSA；For
Five class LSA and seven class LSA, judge whether that the path of the Autonomous System Boundary Router, AS Boundary Router of the LSA can be calculated, and whether can
Corresponding route is enough calculated, is otherwise invalid LSA if it can, then assert that it is effective LSA.
Carried out in the Link State Advertisement in LSD whether after the first judgement for being invalid LSA,
Also need to judge the invalid LSA judged for the first time again, it has been determined that whether it is on earth invalid LSA.It is as shown in Fig. 2 right
The process that the invalid LSA is further confirmed includes step：
If a LSA is identified as invalid LSA during preliminary judgement, the sequence number of the LSA is added 1, and send
Go out, if not receiving the renewal of the LSA within a certain period of time, it is invalid LSA to confirm the LSA.
Specifically, an OSPF rule is make use of in said process：LSA caused by oneself is received, and than local
LSA renewal, then the sequence number for receiving LSA is added 1, then flood away again.Therefore, using the rule, one kind can be formed
Detection mechanism, if a LSA is locally judged as invalid LSA, its sequence number is added 1, and sent, if in a timing
The interior renewal for not receiving the LSA, then it is invalid LSA to confirm the LSA.
After it is invalid LSA that decision process, which confirms the LSA, twice, set this LSA ageing time for 3600 seconds simultaneously
Flood away, you can remove the invalid LSA in network.
In the present embodiment, different invalid LSA determination methods are provided for all kinds of LSA, and utilizes and originates route
Device, which receives oneself caused LSA, can update the mechanism of the LSA, realize the method that invalid LSA confirms.
For in the prior art, invalid LSA is resided in LSDB for a long time, committed memory resource and influences route meter
Speed is calculated, the method for the quick invalid LSA of removing OSPF that the present embodiment provides, removes invalid LSA, memory usage is reduced, carries
High router-level topology speed.Further, it is also possible to it is compatible with existing realization, as long as each ospf area has one to support above-mentioned realization
Equipment.
Embodiment two
A kind of quick method for removing the invalid LSA of OSPF proposed for above-described embodiment, the present embodiment propose one kind
The quick equipment for removing the invalid LSA of OSPF.
As shown in figure 3, a kind of quick equipment for removing the invalid LSA of OSPF, including：
Whether first determination module is invalid to each Link State Advertisement of preliminary judgement；
Secondary determination module, it is connected with the first determination module, judges to carry out second to Link State Advertisement
To confirm whether it is the broadcast of invalid link state；
Removing module, it is connected with the secondary determination module, to delete the invalid link state broadcast.
Specifically, when traveling through LSD, first each Link State of determination module preliminary judgement is wide
Whether invalid, if invalid, secondary determination module carries out second and judged to confirm whether it is the broadcast of invalid link state if broadcasting.
After confirming as broadcasting for invalid link state, the invalid link state broadcast is deleted.
As shown in figure 4, the first determination module includes：
First identifying unit, to check a kind of Link State Advertisement or two class Link State Advertisements whether on SPF trees；
Second identifying unit, to judge that three class Link State Advertisements or four class Link State Advertisements whether there is regional edge
The path of boundary's router and whether can calculate corresponding route；
3rd identifying unit, to judge five class Link State Advertisements or seven class Link State Advertisements with the presence or absence of autonomous system
Unite border router path and whether can calculate corresponding route.
The secondary determination module includes：
Sequence number adding unit, sentence respectively with first identifying unit, second identifying unit and the described 3rd
Order member is connected, the sequence number of the Link State Advertisement is increased into 1 and sent；
Invalid determining unit, it is connected with the sequence number adding unit, to judge that the Link State Advertisement is invalid
Link State Advertisement.
The removing module includes：
Time setting unit, it is connected with the invalid determining unit, to the aging for broadcasting the invalid link state
Time is arranged to 3600 seconds；
Unit is flooded, is connected with the time setting unit, invalid link state broadcast flooding to be gone out.
Specifically, when traveling through LSD, the process judged for the first time is for different Link State Advertisements
The decision means that species uses are also different.A kind of Link State Advertisement or two class Link State Advertisements are judged with the first identifying unit
Whether it is on SPF trees；Three class Link State Advertisements or four class Link State Advertisements are judged whether with the second identifying unit
The path of Area Border Router and whether can calculate corresponding route；Five class Link State Advertisements or seven class link shapes
State broadcast judges whether Autonomous System Boundary Router, AS Boundary Router with the 3rd identifying unit and whether can calculate corresponding road
By.After if the first identifying unit or the second identifying unit or the 3rd identifying unit judge that the Link State Advertisement is invalid for the first time,
The sequence number of the Link State Advertisement is increased by 1 and sent by the sequence number adding unit in secondary determination module.If
The renewal of the Link State Advertisement is not received in certain time, invalid determining unit judges that the Link State Advertisement is invalid
Link State Advertisement.Then, the ageing time that the invalid link state is broadcasted is arranged to 3600 seconds by time setting unit,
And the flooding that the invalid link state is broadcasted is gone out by flooding unit, so as to delete the invalid link state broadcast.
For a person skilled in the art, after reading described above, various changes and modifications undoubtedly will be evident.
Therefore, appended claims should regard whole variations and modifications of the true intention and scope that cover the present invention as.Weighing
Any and all scope and content of equal value, are all considered as still belonging to the intent and scope of the invention in the range of sharp claim.
Claims (6)
- A kind of 1. quick method for removing the invalid LSA of OSPF, it is characterised in that methods described includes step：LSD is traveled through, whether each Link State Advertisement of preliminary judgement be invalid；After judging that the Link State Advertisement is invalid for the first time, second is carried out to the Link State Advertisement and is judged, to confirm Whether it is the broadcast of invalid link state；If confirming that the Link State Advertisement is broadcasted for the invalid link state after second judges, the invalid chain is deleted Line state is broadcasted；It is without any processing if confirm that the Link State Advertisement is effective after first judgement or second judge；Preliminary During judging whether each Link State Advertisement be invalid, for a kind of Link State Advertisement or two class Link States Broadcast, a kind of Link State Advertisement or the two classes Link State Advertisement is checked whether on SPF trees, if judging it To be effective；Otherwise, it is determined that it is broadcasted for the invalid link state；Second of mistake judged is carried out to the Link State Advertisement Cheng Zhong, the sequence number of the Link State Advertisement is increased by 1 and sent, if not receiving the link within a certain period of time The renewal of state broadcast, then judge that the Link State Advertisement is invalid；Otherwise, it is determined that the Link State Advertisement is effective.
- 2. the quick method for removing the invalid LSA of OSPF according to claim 1, it is characterised in that for three class link shapes Whether state is broadcasted or four class Link State Advertisements, judge it with the presence or absence of the path of Area Border Router and can calculate Corresponding route, if the path of the Area Border Router be present and can calculate the route, judges three class Link State Advertisement or the four classes Link State Advertisement are effective；Otherwise, it is determined that broadcasted for invalid link state.
- 3. the quick method for removing the invalid LSA of OSPF according to claim 1, it is characterised in that for five class link shapes State is broadcasted or seven class Link State Advertisements, judges it with the presence or absence of Autonomous System Boundary Router, AS Boundary Router and whether can calculate phase The route answered, if the path of the Autonomous System Boundary Router, AS Boundary Router be present and the route can be calculated, judge described five Class Link State Advertisement or the seven classes Link State Advertisement are effective；Otherwise, it is determined that broadcasted for invalid link state.
- 4. the quick method for removing the invalid LSA of OSPF according to claim 1, it is characterised in that in second this judgement During judge that the Link State Advertisement is invalid after, by the ageing time of the Link State Advertisement be arranged to 3600 seconds and flood Glow.
- 5. a kind of quick equipment for removing the invalid LSA of OSPF, it is characterised in that the equipment includes：Whether first determination module is invalid to each Link State Advertisement of preliminary judgement；Secondary determination module, it is connected with the first determination module, judges to carry out second to the Link State Advertisement To confirm whether it is the broadcast of invalid link state；Removing module, it is connected with the secondary determination module, to delete the invalid link state broadcast；The first determination module includes：First identifying unit, to check a kind of Link State Advertisement or two class Link State Advertisements whether on SPF trees；Second identifying unit, to judge that three class Link State Advertisements or four class Link State Advertisements whether there is zone boundary road By device path and whether can calculate corresponding route；3rd identifying unit, to judge that five class Link State Advertisements or seven class Link State Advertisements whether there is autonomous system side The path of boundary's router and whether can calculate corresponding route；The secondary determination module includes：Sequence number adding unit, judge respectively with first identifying unit, second identifying unit and the described 3rd single Member is connected, the sequence number of the Link State Advertisement is increased into 1 and sent；Invalid determining unit, it is connected with the sequence number adding unit, to judge the whether described nothing of the Link State Advertisement Imitate Link State Advertisement.
- 6. the quick equipment for removing the invalid LSA of OSPF according to claim 5, it is characterised in that the removing module bag Include：Time setting unit, it is connected with the invalid determining unit, to the ageing time for broadcasting the invalid link state It is arranged to 3600 seconds；Unit is flooded, is connected with the time setting unit, invalid link state broadcast flooding to be gone out.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510730736.9A CN105262691B (en) | 2015-10-30 | 2015-10-30 | A kind of quick method and apparatus for removing the invalid LSA of OSPF |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510730736.9A CN105262691B (en) | 2015-10-30 | 2015-10-30 | A kind of quick method and apparatus for removing the invalid LSA of OSPF |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105262691A CN105262691A (en) | 2016-01-20 |
| CN105262691B true CN105262691B (en) | 2018-04-06 |
Family
ID=55102199
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510730736.9A Active CN105262691B (en) | 2015-10-30 | 2015-10-30 | A kind of quick method and apparatus for removing the invalid LSA of OSPF |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105262691B (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109525491A (en) * | 2018-10-26 | 2019-03-26 | 北京网太科技发展有限公司 | Information processing method and device, the storage medium of open type shortest path priority protocol |
| CN110535861B (en) * | 2019-08-30 | 2022-01-25 | 杭州迪普信息技术有限公司 | Method and device for counting SYN packet number in SYN attack behavior identification |
| CN112383419B (en) * | 2020-11-03 | 2022-08-05 | 晏平 | OSPF network problem warning method, device, computer equipment and storage medium |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1787469A (en) * | 2005-11-25 | 2006-06-14 | 北京邮电大学 | Method of topological convergent for layered yout light network |
| CN101043462A (en) * | 2007-04-20 | 2007-09-26 | 华为技术有限公司 | Method for processing link condition announcement and router |
| CN101547125A (en) * | 2008-03-25 | 2009-09-30 | 中国科学院计算技术研究所 | System and method for abnormal network positioning of autonomous system |
| CN101695053A (en) * | 2009-09-30 | 2010-04-14 | 清华大学 | IP fast rerouting method for improving inter-domain routing OSPF algorithm |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7327695B2 (en) * | 2003-12-19 | 2008-02-05 | Telefonaktiebolaget Lm Ericsson (Publ) | Centralized link-scope configuration of an internet protocol (IP) network |
-
2015
- 2015-10-30 CN CN201510730736.9A patent/CN105262691B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1787469A (en) * | 2005-11-25 | 2006-06-14 | 北京邮电大学 | Method of topological convergent for layered yout light network |
| CN101043462A (en) * | 2007-04-20 | 2007-09-26 | 华为技术有限公司 | Method for processing link condition announcement and router |
| CN101547125A (en) * | 2008-03-25 | 2009-09-30 | 中国科学院计算技术研究所 | System and method for abnormal network positioning of autonomous system |
| CN101695053A (en) * | 2009-09-30 | 2010-04-14 | 清华大学 | IP fast rerouting method for improving inter-domain routing OSPF algorithm |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105262691A (en) | 2016-01-20 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105262691B (en) | A kind of quick method and apparatus for removing the invalid LSA of OSPF | |
| Ostermaier et al. | Enhancing the security of local dangerwarnings in vanets-a simulative analysis of voting schemes | |
| Salehi et al. | Detection of sinkhole attack in wireless sensor networks | |
| US20170111377A1 (en) | NETWORK CAPABLE OF DETECTING DoS ATTACKS AND METHOD OF CONTROLLING THE SAME, GATEWAY AND MANAGING SERVER INCLUDED IN THE NETWORK | |
| WO2006083872A3 (en) | System and methods for network path detection | |
| CN105827456B (en) | A kind of embedding distribution formula network-building method and its system | |
| ATE339830T1 (en) | PATH DETERMINATION IN A DATA NETWORK | |
| CN104217129A (en) | Passenger flow estimation method for urban rail road network | |
| ATE511726T1 (en) | SYSTEM AND METHOD FOR IDENTIFYING NETWORK PATH PERFORMANCE | |
| ECSP077211A (en) | METHOD AND APPLIANCE TO CANCEL PILOT INTERFERENCE IN A WIRELESS COMMUNICATION SYSTEM | |
| DE602005014514D1 (en) | COMMUNICATION NODES AND METHODS FOR ROUTING TRAFFIC IN A COMMUNICATION NETWORK BY MEANS OF CUTTING AND SENSITIVITY PARAMETERS FOR METRICS | |
| ATE420514T1 (en) | DEVICE AND METHOD FOR COLLECTING INFORMATION FOR ROUTING IN A NETWORK BASED ON A MESH-SHAPED TOPOLOGY | |
| ATE515127T1 (en) | FORWARDING NETWORK TRAFFIC REGARDING DIFFERENTIATED, LIMITED TRANSIT NETWORK NODES | |
| CN103297340B (en) | Routing convergence method and device in multi-protocol label switching (MPLS) and border gateway protocol (BGP) networking | |
| CN102769845B (en) | Wormhole detecting method based on specific triple-jump channel path in wireless sensor network | |
| CA2957701A1 (en) | Multimodal land transportation network supervision infrastructure | |
| Kerrache et al. | Hierarchical adaptive trust establishment solution for vehicular networks | |
| Amudhavel et al. | An robust recursive ant colony optimization strategy in VANET for accident avoidance (RACO-VANET) | |
| CN106157603B (en) | A method of weighing public traffic network traffic flow spatial distribution inequality extent | |
| CN105337863B (en) | A kind of label distribution method and device | |
| Anjum et al. | SDN based V2X networks for disaster management: A systematic literature review | |
| RU2017133755A (en) | METHOD AND DEVICE FOR THE PROCESSING OF THE SWITCH ROUTING CONFLICT | |
| CN106230798B (en) | A kind of flow lead method and device | |
| CN105281974B (en) | Router on off operating mode detection method and system in IPV6 network environment under OSPFv3 agreement | |
| CN101217471B (en) | Method and device for optimizing route |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| TR01 | Transfer of patent right | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20201201 Address after: Room 10242, No. 260, Jiangshu Road, Xixing street, Binjiang District, Hangzhou City, Zhejiang Province Patentee after: Hangzhou Jiji Intellectual Property Operation Co., Ltd Address before: 201616 Shanghai city Songjiang District Sixian Road No. 3666 Patentee before: Phicomm (Shanghai) Co.,Ltd. |
|
| TR01 | Transfer of patent right | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20201217 Address after: 8319 Yanshan Road, Bengbu City, Anhui Province Patentee after: Bengbu Lichao Information Technology Co.,Ltd. Address before: Room 10242, No. 260, Jiangshu Road, Xixing street, Binjiang District, Hangzhou City, Zhejiang Province Patentee before: Hangzhou Jiji Intellectual Property Operation Co., Ltd |
|
| TR01 | Transfer of patent right | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20210309 Address after: 313000 room 1019, Xintiandi commercial office, Yishan street, Wuxing District, Huzhou, Zhejiang, China Patentee after: Huzhou YingLie Intellectual Property Operation Co.,Ltd. Address before: 8319 Yanshan Road, Bengbu City, Anhui Province Patentee before: Bengbu Lichao Information Technology Co.,Ltd. |