CN101888328A - Trust management system based trusted reconstructing method of IP routing protocol - Google Patents
Trust management system based trusted reconstructing method of IP routing protocol Download PDFInfo
- Publication number
- CN101888328A CN101888328A CN2010101156998A CN201010115699A CN101888328A CN 101888328 A CN101888328 A CN 101888328A CN 2010101156998 A CN2010101156998 A CN 2010101156998A CN 201010115699 A CN201010115699 A CN 201010115699A CN 101888328 A CN101888328 A CN 101888328A
- Authority
- CN
- China
- Prior art keywords
- router
- trust
- trust value
- management system
- value
- 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
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a trust management system based trusted reconstructing method of an IP routing protocol, which comprises the following steps of: 1. before each router is added into a network, registering to the trust management system, and sending corresponding trust certificates to the routers by the trust management system; 2. transferring the trust certificates among the routers through hello information, wherein an adjacency relation is not established for the router without the trust certificate, all the routers in the network are ensured to have the trust certificates per se, and each router is used for establishing a database, storing a comprehensive trust value and computing the parameter required by a subjective trust value, the subjective trust value and the MAC (Media Access Control) addresses of all other neighbor routers; 3. inputting the comprehensive trust value and the subjective trust value into a model, computing the total trust value of the router for the neighbor routers, and modifying the metric field of a link-state announcement Router_LSA packet as the total trust value; 4. synchronously connecting a state database, modifying a Dijkstra algorithm when establishing a shortest path tree, computing the trust value between the nonadjacent routers through recommendation trust, finally establishing the trusted shortest path tree, and forming a trusted routing list; and 5. periodically reporting the subjective trust value of the neighbor routers to the trust management system by each router, simultaneously obtaining the parameter required for computing the subjective trust value, updating the trust certificate of each router at fixed time, and eliminating the router with the overdue trust certificate out of the network to maintain the topological structure of the whole network.
Description
Technical field
The present invention relates to communication technical field, be specifically related to a kind of trusted improvement method of the IP routing protocol based on trust management system.
Background technology
The safeguard protection that is extensive use of information of the Internet has proposed huge challenge.Routing Protocol is used for distributing the information about network topology between router, router searches out best route according to topology information, realizes the forwarding to various packets in the network.The correctness of routing iinformation is having a strong impact on the efficient of message transmissions in the network, even can influence message and make it to arrive the destination, when serious even can make whole network at a standstill.The Routing Protocol of safety is one of key factor that guarantees network security, and therefore the safety for Routing Protocol is transformed into one of focus for current research.
Ospf protocol is a kind of typical link-state routing protocol, is used for transmitting route messages between the router in an autonomous system and issuing routing iinformation.The link-state information of using between the router of ospf protocol exchange message each other and preserving whole network is in LSD, thereby depict whole topology of networks according to LSD, calculate each router himself being the shortest path tree of root node, thereby form routing table.Because ospf protocol has outstanding network scalability and converges fast, extensively used at present, but on behalf of ospf protocol, this have the ability of the malicious attack resisted.The true(-)running of ospf protocol places one's entire reliance upon for the trust of neighbor router and information thereof, but this trust is blindly, router can be propagated accidental or premeditated wrong routing iinformation inevitably, and Routing Protocol itself exists easy security breaches under fire.
Summary of the invention
Technical problem to be solved by this invention provides a kind of trusted improvement method of the IP routing protocol based on trust management system, this method is on the ospf protocol basis, the course of work to whole agreement is carried out suitable transformation, do not influencing the original autgmentability of ospf protocol and converging fast on the basis of performance, interpolation is the trust evaluation strategy between the router of evaluation mechanism with the trust value, according to the credible shortest path tree of this policy calculation, generate credible routing table.Distance value in the credible routing table has merged the trust value between the router.
The technical problem that the present invention proposes is to solve like this: a kind of trusted improvement method of the IP routing protocol based on trust management system is provided, and its implementation procedure may further comprise the steps:
1) router solicitation login network access: need before the router Access Network to apply for the registration of, obtain the trusted certificate of oneself to trust management system (TrustManagementSystem).
2) router sends Hello message and finds out neighbours: each router need obtain all neighbours' trusted certificate, and therefrom obtain neighbours' comprehensive trust value, the carrier of trusted certificate is a hello message bag, each router is provided with a timer, be used for regularly sending a hello message (comprising the trusted certificate that obtains from trust management system TMS in the message), thereby keep backfence syntople to neighbours.
3) calculate total trust value to neighbor router: each router obtains five parameters (forward rate of link flow, packet loss, time-delay, bag, the confidence level of bag), calculate subjective trust value to neighbor router, calculate total trust value with comprehensive trust value again, total trust value is used for participating in the calculating of routing table.
4) calculate credible routing table: the core of Routing Protocol is to calculate routing table, 3) in calculated total trust value to neighbor router, then total trust value is inserted in the metric field of 16bit of Router_LSA, each router generates the Router_LSA of self, synchronous then connection status database, calculate credible shortest path tree, generate credible routing table.
5) trust value regularly upgrades: router regularly reports TMS with the subjective trust value of each neighbor router of storing in this router, is carried out the belief updating of each router by TMS.
Description of drawings
Fig. 1 is the overall system architecture figure between trust management system TMS and the router;
Fig. 2 is the router solicitation login network access and obtains the trusted certificate schematic diagram;
Fig. 3 is that trust value regularly upgrades schematic diagram;
Fig. 4 sends Hello message to keep the adjacency state schematic diagram between the router;
Fig. 5 is the database storage schematic diagram of router;
Fig. 6 is total trust value computational process schematic diagram;
Fig. 7 is the business process map of the credible routing table remodeling method of entire I P network routing protocol.
Embodiment
Below in conjunction with description of drawings and embodiment, the present invention is described in further detail.
Under fire security breaches easily at the OSPF Routing Protocol exists the present invention proposes a kind of corresponding improvement project: a kind of credible routing table remodeling method of the IP network Routing Protocol based on trust value.Fig. 1 is at the core mechanism that uses trust value and trusted certificate between the router and between router and the trust management system in this programme.Fig. 7 is the operation flow that this core mechanism is embodied in the whole agreement course of work.
The present invention is applicable to the IP network environment on the general meaning, and the credible shortest path tree that is proposed in the invention and the foundation of credible routing table will effectively be avoided the propagation of wrong routing iinformation, realizes the trusted improvement of Routing Protocol.
1, some definition of implementation procedure needs
[definition 1]: trusted certificate
By the objective evaluation of trust management system (TMS) to router, to objectively responding of the trusting degree of this router, comprise this router trust value, trust trust information such as the term of validity, application type.The concrete behavior and the time of trusted certificate and router are closely related, are dynamic changes, and life cycle is very short.Trusted certificate binds together Router Distinguisher and trust information, and (TMS) examines and sign and issue by trust management system.
[definition 2]: the valid expiration date of trusted certificate
The trusted certificate of each router all has the valid expiration date of oneself, regularly obtains the trusted certificate of neighbor router, if receive that neighbours' trusted certificate is expired, and does not receive new trusted certificate again, and router then can be removed neighbours' syntople therewith.
[definition 3]: comprehensive trust value
A trust value of each router that is drawn by certain Model Calculation by trust management system (TMS) itself mainly comprises the IDS data, vulnerability scanning data, fire compartment wall data etc.According to tactful requirement, regularly start each router in the safety means scanning field, obtain these data.Each router obtains the comprehensive trust value of oneself when obtaining trusted certificate, this value is used for allowing neighbours calculate total trust value to oneself, thereby calculates credible shortest path tree and credible routing table.
[definition 4]: subjective trust value
The trust value to neighbor router that router draws by certain Model Calculation, the parameter that calculating the subjective trust value needs has the forward rate of link flow, packet loss, time-delay, bag and the confidence level of bag.According to tactful requirement, router is regularly revised five parameters of calculating subjective trust value to keep the reliability and the real-time of information.
[definition 5]: total trust value
Router will combine the trust value that calculates to the subjective trust value of neighbor router and neighbours' self comprehensive trust value by certain model, and total trust value is used for participating in the calculating of credible routing table.
Step 1 router solicitation login network access, as shown in Figure 2:
1) needs to apply for the registration of before the router Access Network to trust management system TMS;
2) router obtains the initial trust value need carry out initialization operation when trust management system is applied for the registration of by reporting basic configuration information;
3) trust management system TMS sends confirmation to the router of the networking of applying for the registration of, and issues the trusted certificate of this router.
Step 2 trust value regularly upgrades, as shown in Figure 3:
1) each router all can be in real time produces the subjective trust value to neighbor router, and the subjective trust value is the part that trust management system TMS is used for calculating the comprehensive trust value of each router;
2) timer of each router startup is regularly to the subjective trust value of trust management system TMS report to neighbor router;
3) trust management system TMS goes out comprehensive trust value by certain Model Calculation;
4) trust management system TMS sends to each router to new trusted certificate, router is established trust after the certificate, by hello message trusted certificate is issued neighbours, thereby cause regenerating Router_LSA, again synchronous connection status database, recomputate credible shortest path tree, regenerate credible routing table, thereby realized the renewal of trust value.
Step 3 router sends Hello message and finds out neighbours, as shown in Figure 4:
1) after router is received the trusted certificate that trust management system TMS issues, trusted certificate is included in the Hello message bag sends to neighbours by device;
2) receive the Hello message bag that neighbor router sends over, check wherein trusted certificate and valid expiration date thereof, trusted certificate exists and still effectively just can keep neighborhood, the assurance route is carried out smoothly, if do not have trusted certificate or trusted certificate to lose efficacy in the Hello bag, then cancellation and these neighbours' syntople;
3) router obtains the comprehensive trust value of neighbor router from trusted certificate, is saved in the stored data base;
4) if the comprehensive trust value in the trusted certificate changes, then regenerate Router_LSA, synchronous again connection status database recomputates credible routing table.
The database storage of step 4 router, as shown in Figure 5:
1) each router has oneself stored data base in the Routing Protocol, in Routing Protocol the original contents of database, also need to set up comprehensive trust value table, calculate neighbor router needed five parameters of subjective trust value (link flow, packet loss, delay time, send to neighbours bag forward rate and receive confidence level from neighbours' bag).
2) the Mac address with router self and all neighbor routers also all is saved in the database, thereby the judgment data bag from which neighbor router sends over.
Step 5 is calculated the total trust value to neighbor router, as shown in Figure 6:
1) trust value calculates between neighbor router
T(i→j，t)＝α
1iLinkstateT(i→j，t)+α
2iDirT(i→j，t)
Wherein (i → j t) is regarded as the link trust value of t moment router i to router j to LinkstateT; (i → j, t) expression t moment router i is to the direct trust value of router j for DirT.
2) the link trust value calculates
LinkstateT(i→j，t)＝Compute_Trust(Throughput_Link，LossRatio_Link，Latency)
Wherein Compute_Trust () function is trust value computing function (can come as the case may be to determine), and the parameter inside this moment is respectively link flow, packet loss and the time-delay on the communication link.
3) the router direct trust value is calculated
DirT(i→j，t)＝Compute_Trust(Throughput_Rj，LossRatio_Rj，Latency_Rj)
Wherein Compute_Trust () function is trust value computing function (can come as the case may be to determine), and this moment, the parameter of the inside was respectively router R
jLink flow, packet loss, time-delay.
Step 6 is calculated credible routing table, whole flow process as shown in Figure 7:
1) each router generates the Router_LSA of self;
Total trust value to neighbor router that 2) will calculate is inserted in the metric field of 16bit of Router_LSA;
3) Router_LSA that will add total trust value joins in the DD bag, carries out database exchange, connection status database synchronously with neighbor router;
4) when setting up shortest path tree, revise dijkstra's algorithm, calculate trust value by recommendation trust between the non-adjacent router, set up credible shortest path tree at last.Calculate the change that may relate to route table items in the credible shortest path tree process, route table items upgrades in time;
5) generate credible routing table along with the continual renovation of route table items is final.
Claims (8)
1. trusted improvement method based on the IP routing protocol of trust management system.It is characterized in that on the ospf protocol basis, the course of work to whole agreement is carried out suitable trusted improvement, do not influencing the original autgmentability of ospf protocol and converging fast on the basis of performance, interpolation is the trust evaluation strategy between the router of evaluation mechanism with the trust value, according to the credible shortest path tree of this policy calculation, generate credible routing table.Distance value in the credible routing table has merged the trust value between the router.
2. as right 1 described trusted improvement to the OSPF Routing Protocol course of work, its implementation procedure may further comprise the steps:
1) router solicitation login network access: need before the router Access Network to network, obtain the trusted certificate of oneself to trust management system (Trust Management System) application for registration.
2) router sends Hello message and finds out neighbours: each router need obtain all neighbours' trusted certificate, and therefrom obtain neighbours' comprehensive trust value, the carrier of trusted certificate is a hello message bag, each router is provided with a timer, be used in the valid expiration date of trusted certificate, regularly sending a hello message (comprising the trusted certificate that obtains from trust management system TMS in the message), thereby keep backfence syntople to neighbours.
3) calculate total trust value to neighbor router: each router obtains five parameters (forward rate of link flow, packet loss, time-delay, bag, the confidence level of bag), calculate subjective trust value to neighbor router, calculate total trust value with comprehensive trust value again, total trust value is used for participating in the calculating of routing table.
4) calculate credible routing table: the core of Routing Protocol is to calculate routing table, 3) in calculated total trust value to neighbor router, then total trust value is inserted in the metric field of 16bit of Router_LSA, each router generates the Router_LSA of self, synchronous then connection status database, calculate credible shortest path tree, generate credible routing table.
5) trust value regularly upgrades: router regularly reports TMS with the subjective trust value of each neighbor router of storing in this router, is carried out the belief updating of each router by TMS.
3. being characterized as valid expiration date of right 2 described trusted certificates, trusted certificate, comprehensive trust value, total trust value:
Trusted certificate: be the objective evaluation of trust management system (TMS), to objectively responding of the trusting degree of this router to router.Comprise this router trust value, trust trust information such as the term of validity, application type.The concrete behavior and the time of trusted certificate and router are closely related, are dynamic changes, and life cycle is very short.Trusted certificate binds together Router Distinguisher and trust information, and (TMS) examines and sign and issue by trust management system.
The valid expiration date of trusted certificate: the trusted certificate of each router all has the valid expiration date of oneself, and router will regularly obtain the trusted certificate of neighbor router, in case neighbours' trusted certificate is expired, then removes the syntople of neighbor router therewith.
Comprehensive trust value: a trust value of each router that is drawn by certain Model Calculation by trust management system (TMS) itself mainly comprises the IDS data, vulnerability scanning data, fire compartment wall data etc.According to tactful requirement, regularly start each router in the safety means scanning field, obtain these data.Comprehensive trust value is by the trusted certificate transmission, router obtains comprehensive trust value by communicating by letter with TMS, and use hello message to pass to neighbours by trusted certificate, neighbor router uses the total trust value of comprehensive trust value calculating to this router, thereby calculates credible shortest path tree and credible routing table.
The subjective trust value: the trust value to neighbor router that router draws by certain Model Calculation, the parameter that calculating the subjective trust value needs has the forward rate of link flow, packet loss, time-delay, bag and the confidence level of bag.According to tactful requirement, router is regularly revised five parameters of calculating subjective trust value to keep the reliability and the real-time of information.
Link flow: the packet that flows through in the unit interval in the router.
Packet loss: each router all has a counter, and statistical unit sends to certain neighbour's bag P in the time
AThe bag P that receives with certain neighbour
R, packet loss
Time-delay: each packet all stabs if having time, is used for calculating the required time of neighbor router that arrives.
The forward rate of bag: the ratio of all bags that router is transmitted in the unit interval sends from the packet of neighbor router and this neighbor router that receives.
The confidence level of bag: a strategy is set, and the bag that receives in the unit interval from certain neighbor router surpasses certain boundary, then thinks to attack, and with the trust value of adjusting this neighbor router, reduces the confidence level of the packet of this neighbor router transmission.
Total trust value: router will combine the trust value that calculates to the subjective trust value of neighbor router and neighbours' self comprehensive trust value by certain model, and total trust value is used for participating in the calculating of credible routing table.
4. being characterized as right 2 described router solicitation login network access:
1) needs to apply for the registration of before the router Access Network to trust management system TMS;
2) router obtains the initial trust value need carry out initialization operation when trust management system is applied for the registration of by reporting basic configuration information;
3) trust management system TMS sends confirmation to the router of the networking of applying for the registration of, and issues the trusted certificate of this router.
5. send Hello message as router as described in the right 2 and find out being characterized as of neighbours:
1) after router is received the trusted certificate that trust management system TMS issues, trusted certificate is included in the Hello message bag, sends Hello message to neighbor router;
2) receive the Hello message bag that neighbor router sends over, check wherein trusted certificate and valid expiration date thereof, trusted certificate exists and still effectively just can keep neighborhood, the assurance route is carried out smoothly, if do not have trusted certificate or trusted certificate to lose efficacy in the Hello bag, then cancellation and these neighbours' syntople;
3) router obtains the comprehensive trust value of neighbor router from trusted certificate, is saved in the stored data base;
4) if the comprehensive trust value in the trusted certificate changes, then regenerate Router_LSA, synchronous again connection status database recomputates credible routing table.
6. as being characterized as of calculating as described in the right 2 to total trust value of neighbor router:
1) trust value calculates between neighbor router
T(i→j，t)＝α
1iLinkstateT(i→j，t)+α
2iDirT(i→j，t)
Wherein (i → j t) is regarded as the link trust value of t moment router i to router j to LinkstateT; (i → j, t) expression t moment router i is to the direct trust value of router j for DirT.
2) the link trust value calculates
LinkstateT(i→j，t)＝Compute_Trust(Throughput_Link，LossRatio_Link，Latency)
Wherein Compute_Trust () function is trust value computing function (can come as the case may be to determine), and the parameter inside this moment is respectively link flow, packet loss and the time-delay on the communication link.
3) the router direct trust value is calculated
DirT(i→j，t)＝Compute_Trust(Throughput_Rj，LossRatio_Rj，Latency_Rj)
Wherein Compute_Trust () function is trust value computing function (can come as the case may be to determine), and this moment, the parameter of the inside was respectively link flow, packet loss, the time-delay of router Rj.
7. being characterized as the credible routing table of calculating as described in the right 2:
1) each router generates the Router_LSA of self;
Total trust value to neighbor router that 2) will calculate is inserted in the metric field of 16bit of Router_LSA;
3) Router_LSA that will add total trust value joins in the DD bag, carries out database exchange, connection status database synchronously with neighbor router;
4) when setting up shortest path tree, revise dijkstra's algorithm, calculate trust value by recommendation trust between the non-adjacent router, set up credible shortest path tree at last.Calculate the change that may relate to route table items in the credible shortest path tree process, route table items upgrades in time;
5) generate credible routing table along with the continual renovation of route table items is final.
8. as being characterized as that right 2 described trust values regularly upgrade:
1) each router all can be in real time produces the subjective trust value to neighbor router, and the subjective trust value is the part that trust management system TMS is used for calculating the comprehensive trust value of each router;
2) timer of each router startup is regularly to the subjective trust value of trust management system TMS report to neighbor router;
3) trust management system TMS goes out comprehensive trust value by certain Model Calculation;
Trust management system TMS sends to each router to new trusted certificate, router is established trust after the certificate, by hello message trusted certificate is issued neighbours, thereby cause regenerating Router_LSA, again synchronous connection status database, recomputate credible shortest path tree, regenerate credible routing table, thereby realized the renewal of trust value.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2010101156998A CN101888328B (en) | 2010-03-02 | 2010-03-02 | Trust management system based trusted reconstructing method of OSPF routing protocol |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2010101156998A CN101888328B (en) | 2010-03-02 | 2010-03-02 | Trust management system based trusted reconstructing method of OSPF routing protocol |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101888328A true CN101888328A (en) | 2010-11-17 |
| CN101888328B CN101888328B (en) | 2013-07-24 |
Family
ID=43074061
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2010101156998A Expired - Fee Related CN101888328B (en) | 2010-03-02 | 2010-03-02 | Trust management system based trusted reconstructing method of OSPF routing protocol |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101888328B (en) |
Cited By (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102035831A (en) * | 2010-11-26 | 2011-04-27 | 北京邮电大学 | Double bounce restoration-based BGP (Border Gateway Protocol) normalizing method |
| CN102075424A (en) * | 2011-01-11 | 2011-05-25 | 华中科技大学 | Feedback updating mechanism-based trust routing method |
| CN102368728A (en) * | 2011-09-20 | 2012-03-07 | 中国人民解放军国防科学技术大学 | Automatic configuration method of routing protocol, routing device and authorization server |
| CN104660607A (en) * | 2015-03-06 | 2015-05-27 | 深圳欧德蒙科技有限公司 | Implementation method of two-dimension routing protocol and device using protocol |
| CN105049354A (en) * | 2015-08-14 | 2015-11-11 | 电子科技大学 | Trustful routing method based on OSPF |
| CN105162701A (en) * | 2015-07-29 | 2015-12-16 | 杭州电子科技大学 | Network level energy-saving method for improving routing algorithm in OSPF protocol |
| CN105282097A (en) * | 2014-06-20 | 2016-01-27 | 北京瑞星信息技术有限公司 | Method and device for route safety management |
| CN105721301A (en) * | 2016-02-25 | 2016-06-29 | 清华大学 | Routing computation method supporting credibility classification |
| CN105979507A (en) * | 2016-05-06 | 2016-09-28 | 兰州交通大学 | Calculating method of trust value of wireless sensor network |
| CN108282337A (en) * | 2017-12-04 | 2018-07-13 | 中国电子科技集团公司第三十研究所 | A kind of Routing Protocol reinforcement means based on trusted cryptography's card |
| CN110024347A (en) * | 2016-08-11 | 2019-07-16 | 比格斯维琪网络公司 | Safety building network structure |
| CN110839244A (en) * | 2019-10-21 | 2020-02-25 | 华侨大学 | Credible data collection method based on node trust value virtual force |
| EP3610384A4 (en) * | 2017-04-13 | 2020-11-25 | Nokia Technologies Oy | Apparatus, method and computer program product for trust management |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113329204B (en) * | 2021-08-03 | 2021-10-01 | 北京电信易通信息技术股份有限公司 | Data security transmission method and system based on terminal trust management |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101014013A (en) * | 2007-02-09 | 2007-08-08 | 上海大学 | Reliability-based secure routing method of wireless sensor network |
| CN101478773A (en) * | 2009-01-16 | 2009-07-08 | 北京科技大学 | MANET routing protocol synthetic evaluation method based on credibility |
| US7984294B1 (en) * | 2005-04-14 | 2011-07-19 | Avaya Inc. | Method and apparatus for trust based routing in data networks |
-
2010
- 2010-03-02 CN CN2010101156998A patent/CN101888328B/en not_active Expired - Fee Related
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7984294B1 (en) * | 2005-04-14 | 2011-07-19 | Avaya Inc. | Method and apparatus for trust based routing in data networks |
| CN101014013A (en) * | 2007-02-09 | 2007-08-08 | 上海大学 | Reliability-based secure routing method of wireless sensor network |
| CN101478773A (en) * | 2009-01-16 | 2009-07-08 | 北京科技大学 | MANET routing protocol synthetic evaluation method based on credibility |
Non-Patent Citations (1)
| Title |
|---|
| 王洪超，郭华明，张宏科: "可信路由机理及关键技术", 《中兴通讯技术》, vol. 15, no. 6, 31 December 2009 (2009-12-31), pages 13 - 17 * |
Cited By (23)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102035831B (en) * | 2010-11-26 | 2013-07-24 | 北京邮电大学 | Double bounce restoration-based BGP (Border Gateway Protocol) modification method |
| CN102035831A (en) * | 2010-11-26 | 2011-04-27 | 北京邮电大学 | Double bounce restoration-based BGP (Border Gateway Protocol) normalizing method |
| CN102075424A (en) * | 2011-01-11 | 2011-05-25 | 华中科技大学 | Feedback updating mechanism-based trust routing method |
| CN102075424B (en) * | 2011-01-11 | 2012-11-21 | 华中科技大学 | Feedback updating mechanism-based trust routing method |
| CN102368728A (en) * | 2011-09-20 | 2012-03-07 | 中国人民解放军国防科学技术大学 | Automatic configuration method of routing protocol, routing device and authorization server |
| CN102368728B (en) * | 2011-09-20 | 2014-06-11 | 中国人民解放军国防科学技术大学 | Automatic configuration method of routing protocol, routing device and authorization server |
| CN105282097A (en) * | 2014-06-20 | 2016-01-27 | 北京瑞星信息技术有限公司 | Method and device for route safety management |
| CN104660607A (en) * | 2015-03-06 | 2015-05-27 | 深圳欧德蒙科技有限公司 | Implementation method of two-dimension routing protocol and device using protocol |
| CN104660607B (en) * | 2015-03-06 | 2018-04-27 | 深圳欧德蒙科技有限公司 | A kind of implementation method of two dimension Routing Protocol and the device using the agreement |
| CN105162701B (en) * | 2015-07-29 | 2018-04-17 | 杭州电子科技大学 | A kind of network level power-economizing method of improved routing algorithm in the ospf protocol |
| CN105162701A (en) * | 2015-07-29 | 2015-12-16 | 杭州电子科技大学 | Network level energy-saving method for improving routing algorithm in OSPF protocol |
| CN105049354A (en) * | 2015-08-14 | 2015-11-11 | 电子科技大学 | Trustful routing method based on OSPF |
| CN105721301A (en) * | 2016-02-25 | 2016-06-29 | 清华大学 | Routing computation method supporting credibility classification |
| CN105721301B (en) * | 2016-02-25 | 2018-08-03 | 清华大学 | Support the route computing method of confidence level classification |
| CN105979507A (en) * | 2016-05-06 | 2016-09-28 | 兰州交通大学 | Calculating method of trust value of wireless sensor network |
| CN105979507B (en) * | 2016-05-06 | 2019-04-09 | 兰州交通大学 | A kind of trust value computing method of wireless sensor network |
| CN110024347A (en) * | 2016-08-11 | 2019-07-16 | 比格斯维琪网络公司 | Safety building network structure |
| EP3610384A4 (en) * | 2017-04-13 | 2020-11-25 | Nokia Technologies Oy | Apparatus, method and computer program product for trust management |
| US11012313B2 (en) | 2017-04-13 | 2021-05-18 | Nokia Technologies Oy | Apparatus, method and computer program product for trust management |
| CN108282337A (en) * | 2017-12-04 | 2018-07-13 | 中国电子科技集团公司第三十研究所 | A kind of Routing Protocol reinforcement means based on trusted cryptography's card |
| CN108282337B (en) * | 2017-12-04 | 2021-04-13 | 中国电子科技集团公司第三十研究所 | Routing protocol reinforcing method based on trusted password card |
| CN110839244A (en) * | 2019-10-21 | 2020-02-25 | 华侨大学 | Credible data collection method based on node trust value virtual force |
| CN110839244B (en) * | 2019-10-21 | 2022-11-01 | 华侨大学 | Credible data collection method based on node trust value virtual force |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101888328B (en) | 2013-07-24 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101888328B (en) | Trust management system based trusted reconstructing method of OSPF routing protocol | |
| EP2597830B1 (en) | Method, router bridge, and system for trill network protection | |
| Vetriselvan et al. | Survey on the RIP, OSPF, EIGRP routing protocols | |
| Rakheja et al. | Performance analysis of RIP, OSPF, IGRP and EIGRP routing protocols in a network | |
| CN106063203B (en) | Software defined network (SDN) particular topology INFORMATION DISCOVERY | |
| US6823395B1 (en) | Arrangement and method relating to routing in a network | |
| CN106603417B (en) | A kind of route processing method, equipment and system | |
| US20160134591A1 (en) | VPN Implementation Processing Method and Device for Edge Device | |
| US7200120B1 (en) | Packet-switched network topology tracking method and system | |
| US10924394B2 (en) | Computing label-switched data communication paths | |
| CN101808030A (en) | Logical network construction method based on virtual routers | |
| US9398553B2 (en) | Technique for improving LDP-IGP synchronization | |
| JP7528289B2 (en) | System and method for handling IGP flooding topology inconsistencies - Patents.com | |
| CN104539461A (en) | Device and method for inhibitory protocol port oscillation reporting | |
| Halim et al. | Agent-based trusted on-demand routing protocol for mobile ad hoc networks | |
| CN105637806A (en) | Method and apparatus for determining network topology, and centralized network state information storage device | |
| WO2013086653A1 (en) | Method, device and system for publishing inter-domain link information | |
| EP3531630B1 (en) | Link state packet transmission method, and routing node | |
| CN102571605B (en) | Method and device for preventing traffic from interrupting | |
| CN115460129B (en) | Quantum key distribution routing method based on OSPF protocol | |
| WO2012079421A1 (en) | Method for processing inter-domain link state information and path computation element | |
| US11496388B2 (en) | Resource reservation and maintenance for preferred path routes in a network | |
| Yau et al. | Comparative performance evaluation of RIP with OSPF routing protocol | |
| Khayou et al. | A hybrid distance vector link state algorithm: distributed sequence number | |
| Yeremenko et al. | Flow-aware approach of evaluating probability of compromise in combined structure network |
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 | ||
| C17 | Cessation of patent right | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20130724 Termination date: 20140302 |