CN106878172B - Dynamic Adjustment Method of Router Trust Classification in Trusted Routing System - Google Patents
Dynamic Adjustment Method of Router Trust Classification in Trusted Routing System Download PDFInfo
- Publication number
- CN106878172B CN106878172B CN201710016518.8A CN201710016518A CN106878172B CN 106878172 B CN106878172 B CN 106878172B CN 201710016518 A CN201710016518 A CN 201710016518A CN 106878172 B CN106878172 B CN 106878172B
- Authority
- CN
- China
- Prior art keywords
- router
- weight
- trusted
- routing
- credit
- 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/30—Routing of multiclass traffic
-
- 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
-
- 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/20—Hop count for routing purposes, e.g. TTL
-
- 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/32—Flooding
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/29—Flow control; Congestion control using a combination of thresholds
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L63/00—Network architectures or network communication protocols for network security
- H04L63/14—Network architectures or network communication protocols for network security for detecting or protecting against malicious traffic
- H04L63/1441—Countermeasures against malicious traffic
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Computer Security & Cryptography (AREA)
- Computer Hardware Design (AREA)
- Computing Systems (AREA)
- General Engineering & Computer Science (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
本发明公开了一种可信路由系统中路由器可信分级动态调整方法,包括:根据全网路由的路由表计算每个路由器的可信权值;在路由转发过程中,如果某一路由器受到流量限制或遭受攻击时,降低自身可信权值并通知前一跳路由;每间隔预设时间阈值,根据预设路径更新权值方法更新受到流量限制或遭受攻击的路由器的路径权值,并更新全网路由的路由表;根据更新后的全网路由的路由表重新计算每个路由器的可信权值。本发明具有如下优点:让用户数据能够按照一个可预期的相对可信路由线路进行传输,强化了路由系统的可信程度,进一步改善了路由交换的效率和质量,保障了用户的体验效果。
The invention discloses a method for dynamic adjustment of router credibility classification in a trusted routing system, which includes: calculating the trusted weight value of each router according to the routing table of the entire network routing; When restricted or under attack, reduce its own trusted weight and notify the previous hop route; every preset time threshold, update the path weight of the router that is restricted by flow or under attack according to the preset path update weight method, and update The routing table of the entire network routing; recalculate the trusted weight of each router according to the updated routing table of the entire network routing. The present invention has the following advantages: user data can be transmitted according to a relatively predictable and reliable routing line, the reliability of the routing system is strengthened, the efficiency and quality of routing exchange are further improved, and user experience is ensured.
Description
技术领域technical field
本发明涉及路由技术领域,具体设计一种可信路由系统中路由器可信分级动态调整方法。The invention relates to the technical field of routing, and specifically designs a method for dynamically adjusting trusted levels of routers in a trusted routing system.
背景技术Background technique
分等级的可信路由寻址体系具体包括路由器和核心网络的服务可信程度分级,其目标是在使用软硬件后门与漏洞不可控网络设备的前提下,在保障网络基本服务性能的基础上,确保分组沿最优服务可控性路由转发。The hierarchical trusted routing addressing system specifically includes the service trustworthiness classification of routers and core networks. Ensure that packets are forwarded along optimal service controllable routes.
路由交换系统是当下数据传输的核心区域。随着接入终端数目的快速增长,其对数据交换的效率和质量的要求不断提升,同时,人们对互联网可信程度的要求也越来越高。为此,可信路由系统的概念应运而生。The routing and switching system is the core area of current data transmission. With the rapid growth of the number of access terminals, the requirements for the efficiency and quality of data exchange are constantly increasing, and at the same time, people's requirements for the credibility of the Internet are also getting higher and higher. For this reason, the concept of trusted routing system came into being.
所谓可信路由系统,就是指路由的行为和结果是可以预期的。当下路由系统的路由选择主要是基于IGP和BGP协议,通过权值和算法对路由路径进行计算,进而确定路由选择。但现有的可惜路由系统中,整个路由选择过程呈现扁平化,即每个路由器在核心交换区域的地位是平等的,没有根据服务质量和转发能力进行可信分级,无法确保人们的数据沿着预期的可信路由线路进行路由。The so-called trusted routing system means that the routing behavior and results are predictable. The routing selection of the current routing system is mainly based on the IGP and BGP protocols, and the routing path is calculated through weights and algorithms to determine the routing selection. However, in the existing routing system, the entire routing selection process is flat, that is, the status of each router in the core switching area is equal, there is no trustworthy classification based on service quality and forwarding capability, and it is impossible to ensure that people's data is routed along the route. The expected trusted routing circuit for routing.
发明内容Contents of the invention
本发明旨在至少解决上述技术问题之一。The present invention aims to solve at least one of the above-mentioned technical problems.
为此,本发明的一个目的在于提出一种可信路由系统中路由器可信分级动态调整方法,解决路由交换体系中的可信分级问题。For this reason, an object of the present invention is to propose a method for dynamically adjusting trust ratings of routers in a trusted routing system to solve the problem of trust ratings in routing switching systems.
为了实现上述目的,本发明的实施例公开了一种可信路由系统中路由器可信分级动态调整方法,包括以下步骤:S1:根据全网路由的路由表计算每个路由器的可信权值;S2:在路由转发过程中,如果某一路由器受到流量限制或遭受攻击时,降低自身可信权值并通知前一跳路由;S3:每间隔预设时间阈值,根据预设路径更新权值方法更新所述受到流量限制或遭受攻击的路由器的路径权值,并更新所述全网路由的路由表;S4:返回步骤S1,根据更新后的所述全网路由的路由表重新计算每个路由器的可信权值。In order to achieve the above object, the embodiment of the present invention discloses a method for dynamically adjusting the trustworthiness level of routers in a trusted routing system, which includes the following steps: S1: calculating the trustworthy weight of each router according to the routing table of the entire network; S2: During the route forwarding process, if a router is restricted by traffic or attacked, reduce its own trusted weight and notify the previous hop route; S3: Preset the time threshold at each interval, and update the weight according to the preset path method Updating the path weight of the router subject to traffic restriction or attack, and updating the routing table of the entire network routing; S4: Return to step S1, and recalculate each router according to the updated routing table of the entire network routing credible weight.
根据本发明实施例的可信路由系统中路由器可信分级动态调整方法,在核心路由工作过程中对路由器进行动态地评价,使用户数据能够按照人们的预期沿着相对可信的路由线路传输,解决了路由交换体系中的可信分级问题,让用户数据能够按照一个可预期的相对可信路由线路进行传输,该技术强化了路由系统的可信程度,进一步改善了路由交换的效率和质量,保障了用户的体验效果。According to the method for dynamically adjusting the trustworthiness level of routers in the trusted routing system of the embodiment of the present invention, the routers are dynamically evaluated during the core routing work process, so that user data can be transmitted along relatively trusted routing lines according to people's expectations, It solves the problem of trusted classification in the routing switching system, allowing user data to be transmitted according to a predictable and relatively trusted routing line. This technology strengthens the credibility of the routing system and further improves the efficiency and quality of routing switching. Guaranteed the user experience effect.
另外,根据本发明上述实施例的可信路由系统中路由器可信分级动态调整方法,还可以具有如下附加的技术特征:In addition, according to the above-mentioned embodiment of the present invention, the method for dynamically adjusting the trusted rating of routers in the trusted routing system may also have the following additional technical features:
进一步地,步骤S1进一步包括:S101:初始状态时,设定每个路由的初始信用度均为预设初始信用度,根据每个路由器的初始预设信用度建立所述全网路由的信用权值表;S102:根据全网路由的路由表计算多个路由器之间的转发权值;S103:根据每个路由器的各端口所占权重得到转移矩阵,根据所述转移矩阵对每个路由器的信用权值进行迭代,直至满足预设迭代终止条件时停止迭代,得到每个路由器的第一信用权值。Further, step S1 further includes: S101: In the initial state, set the initial credit of each route to be the preset initial credit, and establish the credit weight table of the entire network route according to the initial preset credit of each router; S102: Calculate the forwarding weight between multiple routers according to the routing table of the whole network routing; S103: Obtain the transfer matrix according to the weight occupied by each port of each router, and carry out the credit weight of each router according to the transfer matrix Iterate until the preset iteration termination condition is satisfied, and stop the iteration to obtain the first credit weight of each router.
进一步地,任意两个路由器之间的转发权值为所述两个路由器之间的路由表条目数占所述全网路由的路由表条目的比例。Further, the forwarding weight between any two routers is the ratio of the number of routing table entries between the two routers to the routing table entries of the entire network route.
进一步地,所述预设迭代终止条件为迭代结果与迭代前对应分量之差的绝对值小于预定阈值。Further, the preset iteration termination condition is that the absolute value of the difference between the iteration result and the corresponding component before the iteration is smaller than a predetermined threshold.
进一步地,步骤S2进一步包括:当第一路由器受到流量限制或遭受攻击时,丢失来自第二路由器发送的数据时,根据所述第一路由器的第一信用权值、所述第二路由器的第一信用权值和所述第一路由器向所述第二路由器之间的转发权值降低所述第一路由器的第一信用权值为第二信用权值。Further, step S2 further includes: when the first router is subject to traffic restriction or is under attack and loses data sent from the second router, according to the first credit weight value of the first router and the first credit weight of the second router, A credit weight and a forwarding weight from the first router to the second router reduce the first credit weight of the first router to a second credit weight.
本发明的附加方面和优点将在下面的描述中部分给出,部分将从下面的描述中变得明显,或通过本发明的实践了解到。Additional aspects and advantages of the invention will be set forth in the description which follows, and in part will be obvious from the description, or may be learned by practice of the invention.
附图说明Description of drawings
本发明的上述和/或附加的方面和优点从结合下面附图对实施例的描述中将变得明显和容易理解,其中:The above and/or additional aspects and advantages of the present invention will become apparent and comprehensible from the description of the embodiments in conjunction with the following drawings, wherein:
图1是本发明实施例的可信路由系统中路由器可信分级动态调整方法的流程图;Fig. 1 is a flow chart of a method for dynamically adjusting router trust ratings in a trusted routing system according to an embodiment of the present invention;
图2是本发明一个实施例的模型工作示意图;Fig. 2 is the schematic diagram of model work of an embodiment of the present invention;
图3是本发明一个实施例的无异常情况的模型工作示意图;Fig. 3 is a schematic diagram of model work without abnormal situation in one embodiment of the present invention;
图4是本发明一个实施例的出现异常情况的模型工作示意图。Fig. 4 is a schematic diagram of model work of an abnormal situation in an embodiment of the present invention.
具体实施方式Detailed ways
下面详细描述本发明的实施例,所述实施例的示例在附图中示出。下面通过参考附图描述的实施例是示例性的,仅用于解释本发明,而不能理解为对本发明的限制。Embodiments of the invention are described in detail below, examples of which are illustrated in the accompanying drawings. The embodiments described below by referring to the figures are exemplary only for explaining the present invention and should not be construed as limiting the present invention.
在本发明的描述中,需要理解的是,术语“第一”、“第二”仅用于描述目的,而不能理解为指示或暗示相对重要性。In the description of the present invention, it should be understood that the terms "first" and "second" are used for description purposes only, and should not be understood as indicating or implying relative importance.
参照下面的描述和附图,将清楚本发明的实施例的这些和其他方面。在这些描述和附图中,具体公开了本发明的实施例中的一些特定实施方式,来表示实施本发明的实施例的原理的一些方式,但是应当理解,本发明的实施例的范围不受此限制。相反,本发明的实施例包括落入所附加权利要求书的精神和内涵范围内的所有变化、修改和等同物。These and other aspects of embodiments of the invention will become apparent with reference to the following description and drawings. In these descriptions and drawings, some specific implementations of the embodiments of the present invention are specifically disclosed to represent some ways of implementing the principles of the embodiments of the present invention, but it should be understood that the scope of the embodiments of the present invention is not limited by this limit. On the contrary, the embodiments of the present invention include all changes, modifications and equivalents coming within the spirit and scope of the appended claims.
以下结合附图描述本发明。The present invention is described below in conjunction with accompanying drawing.
图1是本发明实施例的可信路由系统中路由器可信分级动态调整方法的流程图。如图1所示,一种可信路由系统中路由器可信分级动态调整方法,包括以下步骤:FIG. 1 is a flow chart of a method for dynamically adjusting trustworthiness levels of routers in a trusted routing system according to an embodiment of the present invention. As shown in Fig. 1, a method for dynamically adjusting trust ratings of routers in a trusted routing system includes the following steps:
S1:根据全网路由的路由表计算每个路由器的可信权值。S1: Calculate the trusted weight of each router according to the routing table of the entire network.
具体地,全网路由设备均保存有一张网路由设备的信用权值表:Specifically, the entire network routing device stores a credit weight table of the network routing device:
其中,Cr为信用权值表,Cri分量即为每个路由器的可信权值。Among them, Cr is the credit weight table, and the Cr i component is the credible weight of each router.
S101:1.1:初始状态时,设置每个路由初始信用度均为1,即:S101: 1.1: In the initial state, set the initial credit of each route to 1, namely:
S102:根据全网路由的路由表计算多个路由器之间的转发权值,具体为:S102: Calculate the forwarding weight between multiple routers according to the routing table of the entire network routing, specifically:
其中,Σrj为路由器i与路由器j直接相连的端口的路由表条目数,r为路由表总条目数,pij为路由器i中与路由器j相连的端口之间的转发权值,即路由器i与路由器j相连的端口之间路由表条目数占全网路由的路由表条目的比例(若路由器i与路由器j未直接相连,pij为0)。Among them, Σr j is the number of routing table entries of the ports directly connected to router i and router j, r is the total number of routing table entries, p ij is the forwarding weight between the ports connected to router j in router i, that is, router i The ratio of the number of routing table entries between ports connected to router j to the routing table entries of the entire network (if router i is not directly connected to router j, p ij is 0).
S103:根据每个路由器的各端口所占权重得到转移矩阵S103: Obtain the transfer matrix according to the weights occupied by each port of each router
通过不断迭代Cri+1=Cri*MT,即Cr1=Cr0*MT,Cr2=Cr1*MT,……,Crn=Crn-1*MT,并设置迭代终止条件为:Σ|Cri+1,j-Cri,j|nj=1<=δ,即相邻两个状态下的对应分量之差的绝对值求和小于某一常数δ,δ可根据不同的精确需求设定。最终计算出Cr′:By continuously iterating Cr i +1=Cr i *M T , that is, Cr 1 =Cr 0 *M T , Cr 2 =Cr 1 *M T ,..., Cr n =Cr n -1*M T , and set the iteration The termination condition is: Σ|Cri+1, j-Cri, j|nj=1<=δ, that is, the sum of the absolute values of the differences between the corresponding components in two adjacent states is less than a certain constant δ, and δ can be adjusted according to different precise demand setting. Finally calculate Cr':
Cr′≈MT*Cr′。Cr'≈M T *Cr'.
S2:在路由转发过程中,如果某一路由器受到流量限制或遭受攻击时,降低自身可信权值并通知前一跳路由。其中,当第一路由器受到流量限制或遭受攻击时,丢失来自第二路由器发送的数据时,根据第一路由器的第一信用权值、第二路由器的第一信用权值和第一路由器向第二路由器之间的转发权值降低第一路由器的第一信用权值为第二信用权值。S2: During the route forwarding process, if a router is restricted by traffic or attacked, it will reduce its own trustworthiness and notify the previous hop route. Wherein, when the first router is subject to traffic restriction or is under attack and loses the data sent from the second router, according to the first credit weight of the first router, the first credit weight of the second router and the first router's contribution to the second router, The forwarding weight between the two routers reduces the first credit weight of the first router to the second credit weight.
具体地,在路由转发过程中,若路由器j受到流量限制或遭受攻击,将从路由器i发送过来的数据包进行了丢包处理,则通知前一跳路由,并降低自身可信权值为:Specifically, in the route forwarding process, if router j is subject to traffic restrictions or attacks, and discards the data packets sent from router i, it will notify the previous hop route and reduce its own trusted weight to:
Cr′j=Crj-Cri*pij Cr′ j =Cr j -Cr i *p ij
Cr′j为调整后的路由器j的信用权值,当Cr′j<0时,将Cr′j置为0。Cr′j、Cri的当前路由器的信用权值。Cr' j is the adjusted credit weight of router j, when Cr' j <0, set Cr' j to 0. Cr′ j , the credit weight of the current router of Cr i .
S3:每间隔预设时间阈值,根据预设路径更新权值方法更新受到流量限制或遭受攻击的路由器的路径权值,并更新全网路由的路由表。S3: every preset time threshold, update the path weight of the router subject to traffic restriction or attack according to the preset path update weight method, and update the routing table of the whole network route.
具体地,每间隔预设时间阈值(Δt时间),根据新的可信权值,以Metric′ij=MetricijCrj/更新路径权值,并更新路由表。其中Metricij为原路由计算中从路由器Ri到路由器Rj的路径权值,Crj为计算出的目的路由器Rj的信用权值。Specifically, at intervals of a preset time threshold (Δt time), according to the new credible weight, the path weight is updated by Metric′ ij =Metric ij Cr j /, and the routing table is updated. Metric ij is the path weight from router Ri to router Rj in the original route calculation, and Cr j is the calculated credit weight of destination router Rj.
S4:返回步骤S1,根据更新后的全网路由的路由表重新计算每个路由器的可信权值。S4: Return to step S1, and recalculate the trusted weight of each router according to the updated routing table of the entire network.
具体地,利用步骤S1的方法(此时初始信用权值矩阵为Cr′)计算可信权值矩阵Cr”,后转至步骤S2继续进行。Specifically, use the method of step S1 (in this case, the initial credit weight matrix is Cr') to calculate the credible weight matrix Cr", and then go to step S2 to continue.
为使本领域人员进一步理解本发明,将通过以下实施例进行进一步的说明。In order to enable those skilled in the art to further understand the present invention, the following examples will be used for further illustration.
如图2所示,假设系统中有四个路由器,每个路由器的路由转发表、路径Metric如图,可以得到状态转移矩阵M为:As shown in Figure 2, assuming that there are four routers in the system, the routing forwarding table and path metric of each router are shown in the figure, and the state transition matrix M can be obtained as:
通过一次迭代可知:It can be known by one iteration:
继续上述迭代至Cr矩阵基本不变,即Crn≈Crn-1即可求出当前信用权值矩阵Continue the above iterations until the Cr matrix is basically unchanged, that is, Cr n ≈ Cr n-1 to find the current credit weight matrix
情况一:假设转发过程中没有丢包行为,经过Δt,则重新计算Metric′,然后根据新的路径权值计算路由表。得到调整后的权值及转发表如图3所示。Case 1: Assuming that there is no packet loss during the forwarding process, after Δt, Metric' is recalculated, and then the routing table is calculated according to the new path weight. The adjusted weight and forwarding table are shown in Figure 3.
情况二:假设转发过程中,由于某种原因,路由器R4未成功转发来自R3的数据包,则Cr4′=Cr4-Cr3*p34=0.89-1.33/2=0.225,此时Situation 2: Assume that during the forwarding process, for some reason, router R4 fails to forward the data packet from R3, then Cr4'=Cr4-Cr3*p34=0.89-1.33/2=0.225, at this time
得到调整后的转发表和权值如图4所示。The adjusted forwarding table and weights are shown in Figure 4.
本发明实施例的可信路由系统中路由器可信分级动态调整方法,在核心路由工作过程中对路由器进行动态地评价,使用户数据能够按照人们的预期沿着相对可信的路由线路传输,解决了路由交换体系中的可信分级问题,让用户数据能够按照一个可预期的相对可信路由线路进行传输,该技术强化了路由系统的可信程度,进一步改善了路由交换的效率和质量,保障了用户的体验效果。In the trusted routing system of the embodiment of the present invention, the method for dynamically adjusting the trusted classification of routers dynamically evaluates the routers during the core routing process, so that user data can be transmitted along relatively trusted routing lines according to people's expectations, solving the problem of It solves the problem of trusted classification in the routing and switching system, allowing user data to be transmitted according to a predictable and relatively trusted routing line. This technology strengthens the credibility of the routing system, further improves the efficiency and quality of routing and switching, and ensures the user experience effect.
另外,本发明实施例的可信路由系统中路由器可信分级动态调整方法的其它构成以及作用对于本领域的技术人员而言都是已知的,为了减少冗余,不做赘述。In addition, other components and functions of the method for dynamically adjusting router trust ratings in the trusted routing system according to the embodiment of the present invention are known to those skilled in the art, and will not be repeated in order to reduce redundancy.
在本说明书的描述中,参考术语“一个实施例”、“一些实施例”、“示例”、“具体示例”、或“一些示例”等的描述意指结合该实施例或示例描述的具体特征、结构、材料或者特点包含于本发明的至少一个实施例或示例中。在本说明书中,对上述术语的示意性表述不一定指的是相同的实施例或示例。而且,描述的具体特征、结构、材料或者特点可以在任何的一个或多个实施例或示例中以合适的方式结合。In the description of this specification, descriptions referring to the terms "one embodiment", "some embodiments", "example", "specific examples", or "some examples" mean that specific features described in connection with the embodiment or example , structure, material or characteristic is included in at least one embodiment or example of the present invention. In this specification, schematic representations of the above terms do not necessarily refer to the same embodiment or example. Furthermore, the specific features, structures, materials or characteristics described may be combined in any suitable manner in any one or more embodiments or examples.
尽管已经示出和描述了本发明的实施例,本领域的普通技术人员可以理解:在不脱离本发明的原理和宗旨的情况下可以对这些实施例进行多种变化、修改、替换和变型,本发明的范围由权利要求及其等同限定。Although the embodiments of the present invention have been shown and described, those skilled in the art can understand that various changes, modifications, substitutions and modifications can be made to these embodiments without departing from the principle and spirit of the present invention. The scope of the invention is defined by the claims and their equivalents.
Claims (4)
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201710016518.8A CN106878172B (en) | 2017-01-10 | 2017-01-10 | Dynamic Adjustment Method of Router Trust Classification in Trusted Routing System |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201710016518.8A CN106878172B (en) | 2017-01-10 | 2017-01-10 | Dynamic Adjustment Method of Router Trust Classification in Trusted Routing System |
Publications (2)
Publication Number | Publication Date |
---|---|
CN106878172A CN106878172A (en) | 2017-06-20 |
CN106878172B true CN106878172B (en) | 2019-08-09 |
Family
ID=59157316
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN201710016518.8A Active CN106878172B (en) | 2017-01-10 | 2017-01-10 | Dynamic Adjustment Method of Router Trust Classification in Trusted Routing System |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN106878172B (en) |
Families Citing this family (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN117097662A (en) * | 2022-05-18 | 2023-11-21 | 华为技术有限公司 | Routing method, network equipment and system |
CN115442275B (en) * | 2022-07-27 | 2024-02-27 | 北京邮电大学 | Hybrid telemetry method and system based on hierarchical trusted streams |
Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN101095321A (en) * | 2004-12-31 | 2007-12-26 | 英国电讯有限公司 | Method of operating a network |
CN101808031A (en) * | 2010-03-02 | 2010-08-18 | 北京邮电大学 | Trusted improvement method of router |
US8706583B1 (en) * | 2012-10-24 | 2014-04-22 | Causam Energy, Inc. | System, method, and apparatus for settlement for participation in an electric power grid |
CN105721301A (en) * | 2016-02-25 | 2016-06-29 | 清华大学 | Routing computation method supporting credibility classification |
Family Cites Families (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20150312215A1 (en) * | 2014-01-28 | 2015-10-29 | Lov Kher | Generating optimal pathways in software-defined networking (sdn) |
-
2017
- 2017-01-10 CN CN201710016518.8A patent/CN106878172B/en active Active
Patent Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN101095321A (en) * | 2004-12-31 | 2007-12-26 | 英国电讯有限公司 | Method of operating a network |
CN101808031A (en) * | 2010-03-02 | 2010-08-18 | 北京邮电大学 | Trusted improvement method of router |
US8706583B1 (en) * | 2012-10-24 | 2014-04-22 | Causam Energy, Inc. | System, method, and apparatus for settlement for participation in an electric power grid |
CN105721301A (en) * | 2016-02-25 | 2016-06-29 | 清华大学 | Routing computation method supporting credibility classification |
Non-Patent Citations (1)
Title |
---|
基于主观逻辑的无线传感器网络可信路由算法研究;张留敏;《中国优秀硕士学位论文全文数据库 信息科技辑》;20190915;全文 * |
Also Published As
Publication number | Publication date |
---|---|
CN106878172A (en) | 2017-06-20 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US11411853B2 (en) | Link-state advertisement LSA sending method, apparatus, and system | |
US7558214B2 (en) | Mechanism to improve concurrency in execution of routing computation and routing information dissemination | |
EP2911348B1 (en) | Control device discovery in networks having separate control and forwarding devices | |
US9807035B1 (en) | Using available bandwidths of an IP fabric to intelligently distribute data | |
US8094555B2 (en) | Dynamic weighted-fair load-balancing | |
Vetriselvan et al. | Survey on the RIP, OSPF, EIGRP routing protocols | |
US8825898B2 (en) | Technique for optimized routing of data streams on an IP backbone in a computer network | |
US10785145B2 (en) | System and method of flow aware resilient ECMP | |
CN106713182B (en) | A method and device for processing flow table | |
US20180026878A1 (en) | Scalable deadlock-free deterministic minimal-path routing for dragonfly networks | |
US20070011351A1 (en) | Method and system for gateway selection in inter-region communication on IP networks | |
CN101436995B (en) | A Method of Fast IP Address Blocking Based on BGP Virtual Next Hop | |
US10462040B2 (en) | Non-minimum cost forwarding for packet-switched networks | |
CN108123878B (en) | A routing method, device and data forwarding device | |
Shvedov et al. | Application of the Backman Model for the Distribution of Traffic Flows in Networks with Segment Routing | |
US7733798B2 (en) | Evaluation of network data aggregation | |
WO2017088762A1 (en) | Method and device for realizing load sharing | |
Lei et al. | Multipath routing in SDN-based data center networks | |
US20240179095A1 (en) | Method and apparatus for determining hash algorithm information for load balancing, and storage medium | |
CN106878172B (en) | Dynamic Adjustment Method of Router Trust Classification in Trusted Routing System | |
CN109286563B (en) | A data transmission control method and device | |
CN108075981B (en) | A transmission method of link state data packet and routing node | |
CN104378306B (en) | The route issuing method and autonomous system of a kind of IP network | |
Alvarez-Horcajo et al. | Improving multipath routing of TCP flows by network exploration | |
Faghani et al. | Shortcut switching strategy in metro Ethernet networks |
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 |