CN103873364A - Inter-domain multi-path rooting implementation method - Google Patents
Inter-domain multi-path rooting implementation method Download PDFInfo
- Publication number
- CN103873364A CN103873364A CN201210535012.5A CN201210535012A CN103873364A CN 103873364 A CN103873364 A CN 103873364A CN 201210535012 A CN201210535012 A CN 201210535012A CN 103873364 A CN103873364 A CN 103873364A
- Authority
- CN
- China
- Prior art keywords
- path
- node
- route
- routing
- main controlled
- 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
Abstract
The invention discloses an implementation method of inter-domain multi-path rooting which is user-customized and can be compatible with present routing protocol and infrastructure. The method comprises the following steps: user routing customized parameters are inputted to a master node according to user customized routing performance requirements, wherein the user routing customized parameters contain a user-customized target network; the master node selects AS nodes from a routing list to form a locally topological collection of AS nodes; the master node requests each AS node in the collection of AS nodes to construct section items and the section items are returned to the master node; based on the constructed local topology, the master node calculates feasible paths which satisfy user customization; and the master node installs the paths which meet user requirements for users, and the users use the successfully-installed feasible paths to realize inter-domain multi-path rooting. According to the invention, users' flexible routing and customized routing need service are realized.
Description
Technical field
The present invention relates to internet routing protocol and algorithmic technique field, relate in particular to the implementation method of multipath route between the territory of a kind of user oriented customization.
Background technology
Along with internet, applications rapid growth, new the continuing to bring out of applying such as isomerous environment, ubiquitous networking, mobile access and magnanimity Streaming Media, people are increasing to the demand for services of diversified and personalized the Internet high usage route.Because traditional inter-domain routing protocol (BGP) exists poor reliability, do not support the problems such as multipath route, be faced with more and more serious technological challenge taking bgp protocol (single-path routing agreement) as the Internet of core technology.Between territory, multipath route can meet user's routing flexibility effectively, improves reliability, stability and the fail safe of network, is the important method that realizes the Internet high usage route.Between territory, multipath route is subject to academia and pays close attention to widely and study in recent years, has produced multi-path routing technology between many territories.
Between domain of study, multipath route mainly contains two kinds of thinkings at present: the novel inter-domain routing protocol design of the enhancing design based on BGP and support multipath route.First kind research mainly comprises multipath route (MIRO) between territory, reliable BGP (RBGP), the work such as perception diversity multipath route (DBGP and BBGP), their main target is to solve some specific application problems, for example guarantee that network is reliable and secure, support traffic engineering etc., but the design of existing enhancing BGP multipath still have some essential shortcomings and deficiencies of bgp protocol.The representativeness work of Equations of The Second Kind research has inter-domain routing protocol of future generation (HLP), novel the Internet routing architecture (NIRA), they have abandoned existing routing protocol and infrastructure thereof completely, designed the novel routing architecture of supporting multipath route, its deficiency be dispose more difficult.
Meanwhile, there are two kinds of different excitation models by community in interconnection path: Internet service and flow exchange pricing model (STEM) and alliance's route excitation model (CRIM).STEM is current AS(autonomous system) between service and flow exchange pricing model, this service model does not encourage the route service of neighboring AS; And CRIM is a kind of novel route confederations excitation model, it has excitation to each AS that route service is provided.For using different excitation model, AS provides the enthusiasm of route service also can be different, under STEM service model, AS is open compatible its tactful routing iinformation only, and under CRIM excitation model, AS is ready the routing iinformation in open path, and ensure route quality.Therefore, the present invention considers the method for designing of multipath route between these the two kinds territories under excitation model, not only goes for traditional AS service model at present, and diversified route service is to a certain degree provided; And can be used for AS route confederations excitation model, and powerful diversified route service is provided, can ensure user's route quality simultaneously.Therefore, can also become technical problem urgently to be resolved hurrily by compatible two kinds of different multipath route implementation methods that encourage models.
Summary of the invention
(1) technical problem that will solve
The technical problem to be solved in the present invention is: how to avoid the deficiency of multi-path routing method between above-mentioned two kinds of territories, the implementation method of multipath route between the territory of a kind of compatible existing routing protocol and infrastructure is provided,
(2) technical scheme
For addressing the above problem, the invention provides a kind of user oriented customization, the implementation method of multipath route between the territory of compatible existing routing protocol and infrastructure, said method comprising the steps of:
S1: according to the routing performance requirement of customization, to main controlled node input user route customized parameter, described user's route customized parameter comprises the object network of customization;
S2: main controlled node is selected the AS node set of AS node composition local topology from routing table;
S3: the each AS joint structure section item described in main controlled node request in AS node set is also back to main controlled node by described section item;
S4: the local topology of main controlled node based on building, calculates the feasible path that meets customization;
S5: main controlled node is that user selects and the described feasible path that meets customization is installed, and user utilizes the feasible path of described successful installation, realizes multipath route between territory.
Preferably, described user's route customized parameter also comprises normal route number, backup path number, routing cost cost information, route interval computing time, route customization time limit, excitation model and path performance constrained parameters, and described path performance constrained parameters comprise delay, delay jitter, bandwidth and Loss Rate parameter.
Preferably, described step S2 is further comprising the steps:
S21: main controlled node, according to described user's route customized parameter, obtains the path that arrives object network, and determines Path selection scope according to the preferential principle of high-quality from its bgp routing table, finally determines a node candidate collection;
S22: the AS node set of further selecting AS node composition local topology on the basis of described node candidate collection.
Preferably, described step S22, in the time further selecting the AS node set of AS node composition local topology, selects according to the degree of described AS node or AS node path availability.
Preferably, described step S3 is further comprising the steps:
S31: main controlled node sends structure section item request message to the each AS node in described AS node set;
S32: each AS node is according to its bgp routing table, and the feasible path that it is arrived to object network is encoded and formed section item, and described section item is back to main controlled node.
Preferably, described step S32 is further comprising the steps:
S321: each AS node, according to its bgp routing table of object network inquiry, obtains the feasible path that arrives object network, then determines according to section visibility and self routing policy the PL path that can serve as section item information in feasible path;
S322: for each PL path of each AS node, this AS node, according to PL path type, generates dissimilar section item.
Preferably, described step S32 is further comprising the steps:
S323: each AS node, according to its bgp routing table of object network inquiry, obtains the feasible path that arrives object network;
S324: each AS node, according to section visibility and self routing policy, is determined the feasible path that can serve as section item information, generates corresponding section item.
Preferably, described step S5 is further comprising the steps:
S51: main controlled node directly on selected path the multipath routing table of each AS node install and meet the feasible path of customization;
S52: user, by the feasible path of described successful installation, realizes multipath route.
Preferably, described step S5 is further comprising the steps:
S53: judge the whether compatible main controlled node strategy in one of them path in the described feasible path that meets customization, if so, execution step S54, if not, execution step S55;
S54: for the path of compatible main controlled node strategy, directly described path is encased in to the multipath routing table of main controlled node and stamps specific routing label, skips steps S55;
S55: for the path of incompatible main controlled node strategy, the AS node installation routing table on described path or tunnel table through consultation;
S56: repeating step S53-S55, until install the feasible path that meets customization, after the success of main controlled node installation path, user, by described feasible path, realizes multipath route.
Preferably, described step S55 is further comprising the steps:
S551: main controlled node is set up tunnel record;
S552: check one by one on described path each node whether with the section of its management as main path, if not main path, main controlled node is held consultation and sets up IP tunnel with this node, until the node of all incompatible strategies has all been set up IP tunnel on described path, whole piece path is made up of cascade IP tunnel, forms an operable path.
Preferably, described step S552 is further comprising the steps:
S5521: check on path one of them AS node whether with the section of its management as main path; If so, skips steps S5522 and S5523, if not, continue execution step S5522;
S5522: main controlled node sends and sets up tunneled requests to described AS node, request content comprises the tunnel record of main controlled node;
S5523: described AS node distributes a tunnel ID, the routing information that self is controlled adds in tunnel record, and in himself tunnel table, described tunnel record is installed, and then tunnel record being returned to main controlled node, main controlled node is replaced old tunnel with the tunnel record returning and is recorded and preserve;
S5524: repeating step S5521-S5523, until the node of all incompatible strategies has all been set up IP tunnel on this path, whole piece path is made up of cascade IP tunnel, form an operable path.
(3) beneficial effect
The present invention is on the basis of existing BGP route system, for meeting user's variation and personalized route need, the method of carrying out route calculating by building local topology, a kind of multipath routing solution of high efficient and reliable is provided, not only realize user flexibility routing and personalized route need service, and improved core competitiveness and the economic well-being of workers and staff of Internet Service Provider (ISP).
Meanwhile, the present invention considers the method for designing of multipath route between two kinds of territories under different excitation models, not only goes for traditional AS service model at present, and diversified route service is to a certain degree provided; And can be used for AS route confederations excitation model, and powerful diversified route service is provided, can ensure user's route quality simultaneously.
Brief description of the drawings
Fig. 1 is the flow chart of multipath route implementation method between territory of the present invention;
Fig. 2 is the flow chart of the step S2 of multipath route implementation method between territory of the present invention;
Fig. 3 is the flow chart of the step S3 of multipath route implementation method between territory of the present invention;
Fig. 4 is the flow chart of the step S32 of multipath route implementation method in the time that excitation model is STEM between territory of the present invention;
The flow chart of the step S32 of multipath route implementation method in the time that excitation model is CRIM between Fig. 5 territory of the present invention;
Fig. 6 is the flow chart of the step S5 of multipath route implementation method in the time that excitation model is CRIM between territory of the present invention;
Fig. 7 is the flow chart of the step S5 of multipath route implementation method in the time that excitation model is STEM between territory of the present invention;
Fig. 8 is the flow chart of the step S55 of multipath route implementation method between territory of the present invention;
Fig. 9 is the flow chart of the step S552 of multipath route implementation method between territory of the present invention;
Figure 10 is multipath application scenarios schematic diagram between territory of the present invention;
Figure 11 is that between territory of the present invention, multipath route is calculated abstract model;
Figure 12 is the section item structure flow chart of multipath between territory of the present invention;
Figure 13 is multipath joint structure section item schematic diagram between territory of the present invention;
Figure 14 is that between territory of the present invention, multipath IP tunnel is set up schematic diagram;
Figure 15 is the Path diversity schematic diagram of UMIR under different excitation model of the present invention;
Figure 16 is that section visibility R of the present invention is on the multifarious schematic diagram that affects in path;
Figure 17 is that topological node of the present invention is counted N to the multifarious schematic diagram that affects in path;
Figure 18 is the path number distribution schematic diagram no longer than main path of the present invention;
Figure 19 is the relatively schematic diagram of communication overhead of section visibility R of the present invention;
Figure 20 is that topological node of the present invention is counted the affect schematic diagram of N on computing cost.
Embodiment
Below in conjunction with drawings and Examples, that the present invention is described in detail is as follows:
Between the territory of the user oriented customization that the present invention proposes, the implementation method of multipath route, adopts a kind of heuritic approach to build the method for local topology, and embodiment is described with reference to the accompanying drawings as follows:
The present invention has used a kind of novel section item, and described section item refers to that the link between AS node is routing iinformation, based on this basic route member designs of section item the implementation method of multipath routing protocols between a kind of territory.Because autgmentability and routing flexibility are two major issues that multipath routing protocols must solve, therefore based on this 2 point, when multipath route implementation method between design territory of the present invention (being called for short " UMIR Routing Protocol "), from improving autgmentability and the routing flexibility of agreement, the design philosophy of determining UMIR Routing Protocol is: according to user's route requests, main controlled node is collected the local topology of certain scale, then carries out route calculating.Local topology forms and comprises node selection and node section construction process.By selecting the larger node of node degree value, the potentiality of Path diversity are improved., consider physical attribute M, policy attribute T and the cost information C in section when in joint structure the section.By controlling the available section number of section visibility R(representation node of node) and topological node count N(and represent the scale of local topology) can regulate performance and the expense of UMIR Routing Protocol.Route computational process can be used multiple routing algorithm (such as tactful route, minimum cost route etc.), the ability of calculating to improve route.
As shown in Figure 1, between territory of the present invention the idiographic flow of the implementation method of multipath route as shown in the following step S1-S5:
S1: according to the routing performance requirement of customization, to main controlled node input user route customized parameter, described user's route customized parameter comprises the object network of customization.Described main controlled node refers to has disposed the ISP node that UMIR Routing Protocol, reception user route customize and be responsible for to initiate path computing task.
In step S1, described user's route customized parameter also can comprise normal route number, backup path number, routing cost cost information, route interval computing time, route customization time limit, excitation model and path performance constrained parameters, and described path performance constrained parameters comprise delay, delay jitter, bandwidth and Loss Rate parameter.Concrete operations are as follows:
A. the object network d that inputs customization, comprises No. AS, object network prefix, or the parameter such as destination server IP address;
B. input normal number of routes and the route stand-by number of customization;
C. input routing cost cost information;
D. input the time interval that route is calculated, and the time limit of route customization;
E. input excitation model used, for example STEM or CRIM;
F. input the various constrained parameters of route, comprise and postpone D, delay jitter J, the performance index such as bandwidth B and Loss Rate LR.
The demand of describing the customization of user's route below in conjunction with Figure 10 and Figure 11, as shown in figure 10, Figure 10 is the application scenarios of the multipath route service of a customization, for example ALICE and BOB need access name to be called certain network D1 in the AS of D.ALICE wishes to use and postpones the shortest path, and BOB needs the path of utilized bandwidth maximum, therefore they to need its ISP(be main controlled node Z) customize the path service of this particular characteristic.For the ease of description below, we by abstract the each AS in Figure 10 be a network node, obtain route shown in Figure 11 and calculate abstract model, be i.e. AS figure.
S2: main controlled node is selected the AS node set of AS node composition local topology from routing table.
Particularly, as shown in Figure 2, step S2 can comprise following two steps:
S21: main controlled node is according to described user's route customized parameter, from its bgp routing table, obtain the path that arrives object network, and according to the preferential principle of high-quality, determine Path selection scope according to the order of main path, path candidate and logical path, finally determine a node candidate collection.
Particularly, because the type of available path comprises three basic forms of it: main path, path candidate and other logical paths, for main path, because the routing policy of its compatible main controlled node is preferentially defined as Path selection object; For path candidate, because it does not meet the routing policy of main controlled node but they meet the routing policy of other AS nodes and are defined as Path selection object by suboptimum; For other logical paths, if when first two path A S node is also discontented with requiring of sufficient protocol construction local topology, can further considers and use this logical path, therefore the selecteed priority of this logical path is minimum.Finally from these three kinds of paths, can obtain node candidate collection.
S22: on the basis of described node candidate collection, according to node selection strategy and node degree size, select the AS node set of AS node composition local topology from node candidate collection.
Step S22 is in the time selecting the AS node set of AS node composition local topology, and the selection principle of AS node mainly contains two: the degree of AS node or AS node path availability.The degree of described AS node represents the AS number with this node direct neighbor, and it has reflected the overall quality of service of node; And AS node path availability represents the available path number of object network in AS node, it is to weigh the service quality that arrives object network.Main controlled node, according to user's demand and the selection strategy of self, can use two kinds of different node selection strategies: the 1st kind of strategy-Ruo agreement need to maximize its Path diversity, selects required node according to node degree; The 2nd kind of strategy-Ruo agreement need to maximize the compatible number of path of its strategy, selects required node according to the path availability of node.
Explain below in conjunction with Figure 13 the process that node is selected, as shown in figure 13, according to the routing table RIB of main controlled node Z, first this node determines set of node { B, the D} on main path; Set of node { A, D} on path candidate; { C} finally obtains set of node to be selected { A, B, C} to immediate neighbor node collection.Suppose that it is 2 that local topology interstitial content N requires, and node selection strategy uses the 1st kind of strategy to maximize its Path diversity.Can calculate each AS node degree: Degree(A based on routing table RIB)=3, Degree(B)=3, Degree(C)=2; Then select two nodes of node degree maximum to form local topology node set { A, B}.
S3: the each AS joint structure section item described in main controlled node request in AS node set is also back to main controlled node by described section item.
Particularly, as shown in Figure 3, described step S3 comprises the following steps:
S31: the AS node set definite according to step S2, main controlled node sends structure section item request message to the each AS node in described AS node set.
S32: each AS node is according to its bgp routing table, and the feasible path that it is arrived to object network is encoded and formed section item, and described section item is back to main controlled node.
The difference of the excitation model using according to UMIR agreement, the algorithm difference of each AS joint structure section item:
Particularly, as shown in Figure 4, if use STEM excitation model, described step S32 comprises the following steps:
S321: each AS node is according to its bgp routing table of object network inquiry, obtain the feasible path that arrives object network, then determine according to section visibility and self routing policy the PL path that can serve as section item information in feasible path, to offer main controlled node for constructing local topology;
S322: for each PL path of each AS node, as shown in Figure 12 and Figure 13, this AS node is according to PL path type, i.e. main path or path candidate, generates respectively dissimilar section item, wherein, main path generates the road section information of type=1, and whole section item form is [section mark, object network, metric vector, road segment classification (type=1)]; And path candidate generates the road section information of type=2, whole section item form is [section mark, object network, metric vector, road segment classification (type=2)].
If use CRIM excitation model, as shown in Figure 5, described step S32 comprises the following steps:
S323: each AS node, according to its bgp routing table of object network inquiry, obtains the feasible path that arrives object network, and described feasible path comprises main path and path candidate.
S324: as shown in Figure 12 and Figure 13, each AS node, according to section visibility and self routing policy, is determined the feasible path that can serve as section item information, generates corresponding section item.Whole section item form is [section mark, object network, metric vector, road segment classification (type=0)], it should be noted that with STEM excitation model in different, the road segment classification of the section item that it generates is all type=0.
S4: the local topology of main controlled node based on building, calculates the feasible path that meets customization.
Particularly, main controlled node obtains after the local topology that calculates certain object network, can call such as shortest path first of routing algorithm, maximum bandwidth algorithm or tactful routing algorithm etc., and according to the requirement of user's routing performance, calculate the feasible path that meets user personality.Routing algorithm of the present invention can adopt any one of routing algorithm of prior art, and the present invention does not limit at this, still, as preferred technical scheme, can adopt following routing algorithm:
Algorithm 1:Bfs-path-search(BPS) path computation algorithm
Bfs-path-search（G，s,t,n）
# input: local topology figure (G) adopts adjacency list storage, and (s, t) is source, destination node pair
# output: calculate n edge disjoint path
Above-mentioned algorithm 1 program has provided taking local topology as inputting and calculate the rudimentary algorithm of route.This algorithm has very strong autgmentability, can support more powerful path computation function, for example the shortest (delay) routing algorithm through suitable expansion, maximum (bandwidth) routing algorithm, multiple constraint path optimization routing algorithm, or tactful routing algorithm etc., to meet different route computation requirements.
S5: main controlled node is that user selects and the described feasible path that meets customization is installed, and user utilizes the feasible path of described successful installation, realizes multipath route between territory.
Particularly, for the feasible path that meets customization, its multipath routing table is selected and installed to main controlled node according to the routing policy of oneself for user.According to the difference of excitation model used, the method for taking is not identical yet.
Under CRIM excitation model, be all ready to provide route service due to all AS nodes, therefore directly install in the multipath routing table of each AS node, in such cases, as shown in Figure 6, step S5 comprises the following steps:
S51: main controlled node directly on selected path the multipath routing table of each AS node install and meet the feasible path of customization;
S52: user, by the feasible path of described successful installation, realizes multipath route.
Under STEM excitation model, for the path of compatible main controlled node strategy, also can directly dispatch use, but for the path of the routing policy of incompatible AS node, like needing through consultation, on path, AS node is ready to provide path service, in the case, as shown in Figure 7, step S5 comprises the following steps:
S53: judge the whether compatible main controlled node strategy in one of them path in the described feasible path that meets customization, if so, execution step S54, if not, execution step S55;
S54: for the path of compatible main controlled node strategy, directly described path is encased in to the multipath routing table of main controlled node and stamps specific routing label, skips steps S55;
S55: for the path of incompatible main controlled node strategy, the AS node installation routing table on described path or tunnel table through consultation;
S56: repeating step S53-S55, until install the feasible path that meets customization, after the success of main controlled node installation path, user, by described feasible path, realizes multipath route.
For step S55, as shown in figure 14, Figure 14 has provided one and has set up the instantiation that Z-B-E-D path is feasible path.A given paths, the AS node on path label in order, all AS nodes are designated as AS={n1 ..., nk}, correspondingly the section of its management is designated as PL={p1 ..., pk}, main controlled node is held consultation with node k successively, as shown in Figure 8, carries out following steps:
S551: main controlled node is set up empty tunnel record (d, tid=null, path_old=null), and wherein d represents object network;
S552: check one by one on described path each node whether with the section of its management as main path, if not main path, main controlled node is held consultation and sets up IP tunnel with this node, until the node of all incompatible strategies has all been set up IP tunnel on described path, whole piece path is made up of cascade IP tunnel, forms an operable path.
As shown in Figure 9, the idiographic flow of S552 is as follows:
S5521: check on path one of them AS node k whether with the section pk of its management as main path, if so, skips steps S5522 and S5523, continue to check next node k-1, if not, continues execution step S5522;
S5522: main controlled node sends and sets up tunneled requests to described AS node, request content comprises the tunnel record (d, tid, path_old) of main controlled node;
S5523: described AS node distributes a tunnel ID, the routing information that self is controlled adds in tunnel record, the upper old ID of trace route path path_old of path splicing by AS node control forms new route mark path_new, and described tunnel record (tid is installed in himself tunnel table, path_new), then tunnel record is returned to main controlled node, main controlled node is replaced old tunnel with the tunnel record returning and is recorded and preserve;
S5524: repeating step S5521-S5523, until the node of all incompatible strategies has all been set up IP tunnel on this path, whole piece path is made up of cascade IP tunnel, form an operable path.
Between above-mentioned territory of the present invention, the implementation method of multipath route has following main feature: the route that (1) user directly drives is calculated and system of selection; (2) centralized control and route are calculated; (3) routing iinformation on-demand propagation; (4) will in strategy and topology information implantation routing iinformation, propagate; (5) feature of junction link state algorithm and path vector algorithm.The present invention, according to the route of customization and performance requirement thereof, builds local topology by the routing iinformation of collecting certain scale AS node, then carries out based on this route calculating, realizes the method for multipath route between territory.The present invention can meet user's variation and personalized route need, has solved the problem in the past existing in multi-path routing method between territory.
Introduce the experiment effect of multipath route implementation method between the territory that the present invention proposes below.
The Perfected process of assessment Internet Routing Protocol is by true performance and the expense of measuring agreement of disposing in Internet.But due to the restriction of various objective factors, it is almost unpractical disposing test on business-like Internet, be therefore that the Internet topological environmental being similar to is simulated Routing Protocol operation than better suited method.In order to evaluate the implementation method of multipath route between territory of the present invention, we have developed a UMIR simulator and have simulated UMIR Routing Protocol.This simulator has been simulated basic operating mechanism and the key characteristic of UMIR Routing Protocol, for example cooperative node selection strategy, section request and construction method, structure local topology, strategy configuration etc.Experiment topology is used real the Internet topology, this topology is the bgp routing table based in routing table cooperating analysis and shared website (www.routeviews.org), utilizes GAO reasoning algorithm to derive Internet topology (this topology has marked the commercial relations of AS node).Then we have chosen 10000 random points at random to carrying out AS path characteristics and diversity experimental analysis thereof.Owing to will using RIB routing table in experiment, still first obtain a RIB routing table example, and the disclosed Origin AS of selecting paths is as destination node, and the preferential stochastical sampling method of destination node usage ratio RFRS determines.The sample distribution of destination node is as shown in table 1 below, and wherein AF, AP, AR, RI and LA represent respectively 5 the regional internet numbers RIR of registration center (Regional Internet Number Registries) mechanisms that distribute autonomous system number (being ASN number).
The sample distribution table of table 1 object AS node
In order to evaluate UMIR Routing Protocol, we have investigated the content of protocol capabilities and expense two aspects.UMIR performance of route protocol mainly comprises Path diversity and path.UMIR routing protocol overhead comprises communication and computing cost.In simulated experiment, parameter setting comprises: (1) sets local topology size N; (2) determine node selection strategy S; (3) set section visibility R; (4) configuration AS excitation model.Then,, according to different experiments parameter, observe their actual influences to UMIR performance of route protocol and expense.We have done a large amount of simulated experiments, and its experimental result is as shown in the Figure 15 to Figure 20 in accompanying drawing: Figure 15 has provided Path diversity cumulative probability distribution CDF (the Cumulative Distribution Function) curve under different excitation model configurations; Figure 16 has provided section visibility R to the multifarious impact in path; Figure 17 has provided local topology size N to the multifarious impact in path; Figure 18 has provided the path profile no longer than main path; Figure 19 has provided the observation of communication overhead under different sections of highway visibility R; Figure 20 has provided topological node and has counted the impact of N on agreement computing cost.
Interpretation is as follows with evaluation:
Path diversity is one of key character of multipath routing protocols between territory, and it has shown the multifarious degree of enriching of agreement energy realizing route, is also the important symbol of user's routing flexibility.Figure 15 has provided the statistics of path number under different excitation models.Path number on two curves of different excitation models is exponential increase, and its variation tendency is basic identical.The number of path of STEM is on the low side, and the number of path of CRIM is higher.This is that the commercial relations between neighboring AS have limited the number of available path due in STEM model, there will be many invalid " the lowest point " paths; And under CRIM excitation model, because this restriction has been eliminated in excitation, thereby available path is increased greatly, further improve the Path diversity of UMIR agreement.As can be seen from Figure 15, for CRIM model, the right number of path of 80% node is greater than 7352; For STEM model, the right number of path of 80% node is greater than 2433 paths, and obviously UMIR Routing Protocol can be found a large amount of diversified paths under STEM model, and under CRIM excitation model, the Path diversity of UMIR Routing Protocol will be abundanter.
Figure 16 has provided the impact that changes the Path diversity on UMIR Routing Protocol along with section visibility R.With the increase of section visibility R, Path diversity presents the trend of exponential increasing.In theory, this is readily appreciated that, because supposition path is n, there is m selection in every section, and possible path will be m
nthe path number of magnitude.In the time of the visibility R=5 of section, CRIM number of path is 2235, and STEM number of path is 753.Along with R continues to increase, path number presents exponential increase trend.Another problem is that the increase of section visibility R will cause the increase of communication and computing cost.Therefore visibility R in section is the protocol parameter that must think over and conscientiously choose, and R=5 is proper parameter.
Figure 17 has provided in the time of the visibility R=5 of section, and topological node is counted N to the multifarious variable effect in path.Along with topological node is counted N increase, there is the trend increasing progressively fast in path number.But, affect comparison with section visibility R to path is multifarious, as can be seen from the figure topological node is counted N does not have section visibility R large on the multifarious impact in path.To the statistical result showed of bgp routing table, the local topology nodes N average out to 18 forming based on AS node on object network available path.From scheming, can find out, when topological node is counted N=17, approach maximum, and topological node when counting N and continuing to increase its path number increase not obvious.
In order to evaluate the ability in UMIR protocol discovery high-quality path.Figure 18 has provided the path profile no longer than main path.In figure, can find out: under traditional STEM model, UMIR agreement can be found a small amount of high-quality path, and approximately 11% node is to there being the path no longer than main path; And under CRIM excitation model, exceed more than 64% node to there being four above paths no longer than main path.In addition, approximately there is 8% node to there is the path that is shorter than main path.From path (being AS interstitial content), not a lot of although be shorter than the path of optimal path, the node identical with optimal path length, to but very abundant, has at most nearly hundred paths.Therefore, utilize these potential high-quality paths can improve the routing performance of user's application.
In order to evaluate the expense impact of UMIR Routing Protocol, we have added up UMIR Routing Protocol and have carried out communication and the computing cost of path computing.The influencing factor of UMIR routing protocol overhead mainly comprises two aspects, first local topology nodes N, and it two is section visibility R of node.Topological node number and section visibility have determined performance and the expense of Routing Protocol.Topology scale and section visibility are larger, and UMIR agreement can be found more multipath number, and protocol capabilities is better, and correspondingly communication and computing cost are larger.Therefore, the value of topological scale and section visibility must comprehensively be weighed between routing performance and expense.Figure 19 has provided the experimental result of communication overhead under different sections of highway visibility R.As we know from the figure, communication overhead changes little, and communication message number concentrates between 40 to 130.Section visibility R is linear relationship on the impact of communication overhead, and along with R value is larger, communication overhead is also larger.For section visibility R=3, the right communication message number of 5 and 7,20% nodes is less than respectively 43,68 and 88, and 80% node is to being greater than 43,68 and 88.Figure 20 has provided topological node and has counted the impact of N on UMIR agreement computing cost.Along with topological node is counted increasing progressively of N, computing cost is also exponential increasing.Be less than before 10 at N, the variation of computing cost is milder, and its reason may be to cause limit number to increase slowly because node degree is on the low side.In the time of N=10, section visibility R is 3,5,7 o'clock, is respectively 0.7s, 9.5s and 52s its computing time.Can find that section visibility R and topological node are counted N larger on the impact of computing cost, although the value of R and N is larger, the routing performance of UMIR Routing Protocol can be better, and its expense is also huge.Therefore, these protocol parameters choose the balance that need to consider between UMIR performance of route protocol and expense.
Analyze by simulated experiment, we draw the following conclusions: the first, UMIR Routing Protocol has larger path discovery ability, can meet the requirement of user's routing flexibility, realize the route service demand of user's variation, personalization; The second, UMIR Routing Protocol can be found high-quality path, utilizes these paths can improve routing performance (for example, the low delay) requirement of user's application; The 3rd, UMIR Routing Protocol has rational calculating and communication overhead.In sum, the present invention has reached expection object.
Above execution mode is only for illustrating the present invention; and be not limitation of the present invention; the those of ordinary skill in relevant technologies field; without departing from the spirit and scope of the present invention; can also make a variety of changes and modification; therefore all technical schemes that are equal to also belong to category of the present invention, and scope of patent protection of the present invention should be defined by the claims.
Claims (11)
1. an implementation method for multipath route between territory, is characterized in that, comprises the following steps:
S1: according to the routing performance requirement of customization, to main controlled node input user route customized parameter, described user's route customized parameter comprises the object network of customization;
S2: main controlled node is selected the AS node set of AS node composition local topology from routing table;
S3: the each AS joint structure section item described in main controlled node request in AS node set is also back to main controlled node by described section item;
S4: the local topology of main controlled node based on building, calculates the feasible path that meets customization; And
S5: main controlled node is that user selects and the described feasible path that meets customization is installed, and user utilizes the feasible path of described successful installation, realizes multipath route between territory.
2. the implementation method of multipath route between territory as claimed in claim 1, it is characterized in that, described user's route customized parameter also comprises normal route number, backup path number, routing cost cost information, route interval computing time, route customization time limit, excitation model and path performance constrained parameters, and described path performance constrained parameters comprise delay, delay jitter, bandwidth and Loss Rate parameter.
3. the implementation method of multipath route between territory as claimed in claim 1, is characterized in that, described step S2 is further comprising the steps:
S21: main controlled node, according to described user's route customized parameter, obtains the path that arrives object network, and determines Path selection scope according to the preferential principle of high-quality from its bgp routing table, finally determines a node candidate collection;
S22: the AS node set of further selecting AS node composition local topology on the basis of described node candidate collection.
4. the implementation method of multipath route between territory as claimed in claim 3, is characterized in that, described step S22, in the time further selecting the AS node set of AS node composition local topology, selects according to the degree of described AS node or AS node path availability.
5. the implementation method of multipath route between territory as claimed in claim 1, is characterized in that, described step S3 is further comprising the steps:
S31: main controlled node sends structure section item request message to the each AS node in described AS node set;
S32: each AS node is according to its bgp routing table, and the feasible path that it is arrived to object network is encoded and formed section item, and described section item is back to main controlled node.
6. the implementation method of multipath route between territory as claimed in claim 5, is characterized in that, described step S32 is further comprising the steps:
S321: each AS node, according to its bgp routing table of object network inquiry, obtains the feasible path that arrives object network, then determines according to section visibility and self routing policy the PL path that can serve as section item information in feasible path;
S322: for each PL path of each AS node, this AS node, according to PL path type, generates dissimilar section item.
7. the implementation method of multipath route between territory as claimed in claim 5, is characterized in that, described step S32 is further comprising the steps:
S323: each AS node, according to its bgp routing table of object network inquiry, obtains the feasible path that arrives object network;
S324: each AS node, according to section visibility and self routing policy, is determined the feasible path that can serve as section item information, generates corresponding section item.
8. the implementation method of multipath route between territory as claimed in claim 1, is characterized in that, described step S5 is further comprising the steps:
S51: main controlled node directly on selected path the multipath routing table of each AS node install and meet the feasible path of customization;
S52: user, by the feasible path of described successful installation, realizes multipath route.
9. the implementation method of multipath route between territory as claimed in claim 1, is characterized in that, described step S5 is further comprising the steps:
S53: judge the whether compatible main controlled node strategy in one of them path in the described feasible path that meets customization, if so, execution step S54, if not, execution step S55;
S54: for the path of compatible main controlled node strategy, directly described path is encased in to the multipath routing table of main controlled node and stamps specific routing label, skips steps S55;
S55: for the path of incompatible main controlled node strategy, the AS node installation routing table on described path or tunnel table through consultation;
S56: repeating step S53-S55, until install the feasible path that meets customization, after the success of main controlled node installation path, user, by described feasible path, realizes multipath route.
10. the implementation method of multipath route between territory as claimed in claim 9, is characterized in that, described step S55 is further comprising the steps:
S551: main controlled node is set up tunnel record;
S552: check one by one on described path each node whether with the section of its management as main path, if not main path, main controlled node is held consultation and sets up IP tunnel with this node, until the node of all incompatible strategies has all been set up IP tunnel on described path, whole piece path is made up of cascade IP tunnel, forms an operable path.
Between 11. territories as claimed in claim 10, the implementation method of multipath route, is characterized in that, described step S552 is further comprising the steps:
S5521: check on path one of them AS node whether with the section of its management as main path; If so, skips steps S5522 and S5523, if not, continue execution step S5522;
S5522: main controlled node sends and sets up tunneled requests to described AS node, request content comprises the tunnel record of main controlled node;
S5523: described AS node distributes a tunnel ID, the routing information that self is controlled adds in tunnel record, and in himself tunnel table, described tunnel record is installed, and then tunnel record being returned to main controlled node, main controlled node is replaced old tunnel with the tunnel record returning and is recorded and preserve;
S5524: repeating step S5521-S5523, until the node of all incompatible strategies has all been set up IP tunnel on this path, whole piece path is made up of cascade IP tunnel, form an operable path.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210535012.5A CN103873364B (en) | 2012-12-11 | 2012-12-11 | Inter-domain multi-path rooting implementation method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210535012.5A CN103873364B (en) | 2012-12-11 | 2012-12-11 | Inter-domain multi-path rooting implementation method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103873364A true CN103873364A (en) | 2014-06-18 |
| CN103873364B CN103873364B (en) | 2017-04-19 |
Family
ID=50911505
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201210535012.5A Active CN103873364B (en) | 2012-12-11 | 2012-12-11 | Inter-domain multi-path rooting implementation method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103873364B (en) |
Cited By (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106664249A (en) * | 2014-07-31 | 2017-05-10 | 微软技术许可有限责任公司 | Propagating routing awareness for autonomous networks |
| CN107078955A (en) * | 2014-11-05 | 2017-08-18 | 科锐安特股份有限公司 | network element for data transmission network |
| CN107454069A (en) * | 2017-07-21 | 2017-12-08 | 河南工程学院 | Inter-domain routing system mimicry means of defence based on AS Security Associations |
| CN109995650A (en) * | 2018-01-03 | 2019-07-09 | 中兴通讯股份有限公司 | Path calculation method and device under Multi-dimensional constraint based on SDN network |
| CN111064661A (en) * | 2019-12-26 | 2020-04-24 | 杭州初灵信息技术股份有限公司 | Routing protocol data transmission method with backup path in grouping equipment |
| CN111464449A (en) * | 2019-01-18 | 2020-07-28 | 广西民族大学 | Inter-domain flow localization exchange method |
| CN112104551A (en) * | 2016-03-03 | 2020-12-18 | 华为技术有限公司 | Border gateway protocol for communication between software defined network controllers |
| CN112688813A (en) * | 2020-12-24 | 2021-04-20 | 中国人民解放军战略支援部队信息工程大学 | Routing node importance ordering method and system based on routing characteristics |
| CN113794724A (en) * | 2021-09-15 | 2021-12-14 | 中国科学院计算机网络信息中心 | Encoding and decoding method and system for route origin authorization compression |
| CN114363235A (en) * | 2020-09-30 | 2022-04-15 | 瞻博网络公司 | Computing a list of segment identifiers for multipaths in a segment routing enabled network |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101667961B (en) * | 2009-09-30 | 2011-08-24 | 西安电子科技大学 | Policy-routing system based on grid service and dynamic policy-generating method |
-
2012
- 2012-12-11 CN CN201210535012.5A patent/CN103873364B/en active Active
Cited By (18)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106664249A (en) * | 2014-07-31 | 2017-05-10 | 微软技术许可有限责任公司 | Propagating routing awareness for autonomous networks |
| CN107078955A (en) * | 2014-11-05 | 2017-08-18 | 科锐安特股份有限公司 | network element for data transmission network |
| CN112104551A (en) * | 2016-03-03 | 2020-12-18 | 华为技术有限公司 | Border gateway protocol for communication between software defined network controllers |
| CN112104551B (en) * | 2016-03-03 | 2022-01-18 | 华为技术有限公司 | Border gateway protocol for communication between software defined network controllers |
| CN107454069A (en) * | 2017-07-21 | 2017-12-08 | 河南工程学院 | Inter-domain routing system mimicry means of defence based on AS Security Associations |
| CN107454069B (en) * | 2017-07-21 | 2020-04-21 | 河南工程学院 | Inter-domain routing system mimicry protection method based on AS security alliance |
| WO2019134483A1 (en) * | 2018-01-03 | 2019-07-11 | 中兴通讯股份有限公司 | Path calculation method and device under multi-dimensional constraints, processor and storage medium |
| CN109995650A (en) * | 2018-01-03 | 2019-07-09 | 中兴通讯股份有限公司 | Path calculation method and device under Multi-dimensional constraint based on SDN network |
| CN109995650B (en) * | 2018-01-03 | 2022-02-22 | 中兴通讯股份有限公司 | SDN network-based path calculation method and device under multidimensional constraint |
| CN111464449A (en) * | 2019-01-18 | 2020-07-28 | 广西民族大学 | Inter-domain flow localization exchange method |
| CN111464449B (en) * | 2019-01-18 | 2022-07-12 | 广西民族大学 | Inter-domain flow localization exchange method |
| CN111064661B (en) * | 2019-12-26 | 2020-10-16 | 杭州初灵信息技术股份有限公司 | Routing protocol data transmission method with backup path in grouping equipment |
| CN111064661A (en) * | 2019-12-26 | 2020-04-24 | 杭州初灵信息技术股份有限公司 | Routing protocol data transmission method with backup path in grouping equipment |
| CN114363235A (en) * | 2020-09-30 | 2022-04-15 | 瞻博网络公司 | Computing a list of segment identifiers for multipaths in a segment routing enabled network |
| CN114363235B (en) * | 2020-09-30 | 2023-08-18 | 瞻博网络公司 | Computing a multi-path list of segment identifiers in a segment-routing enabled network |
| CN112688813A (en) * | 2020-12-24 | 2021-04-20 | 中国人民解放军战略支援部队信息工程大学 | Routing node importance ordering method and system based on routing characteristics |
| CN113794724A (en) * | 2021-09-15 | 2021-12-14 | 中国科学院计算机网络信息中心 | Encoding and decoding method and system for route origin authorization compression |
| CN113794724B (en) * | 2021-09-15 | 2022-05-24 | 中国科学院计算机网络信息中心 | Encoding and decoding method and system for route origin authorization compression |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103873364B (en) | 2017-04-19 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103873364A (en) | Inter-domain multi-path rooting implementation method | |
| CN104702522B (en) | Computer implemented method, device, the controller of software defined network routing data | |
| Gomes et al. | Edge caching with mobility prediction in virtualized LTE mobile networks | |
| Guo et al. | Improving the performance of load balancing in software-defined networks through load variance-based synchronization | |
| CN101321134B (en) | Service quality routing selection method under dynamic network condition | |
| Kim et al. | Ant colony based self-adaptive energy saving routing for energy efficient Internet | |
| CN105074735B (en) | Accelerate to learn by sharing information between multiple Learning machines | |
| CN108809857A (en) | A method of the traffic monitoring based on SDN and service quality securing strategy | |
| CN102318288B (en) | Method, equipment and system of node sorting and selection | |
| CN105024853A (en) | SDN resource matching and service path discovering method based on rumor spreading mechanism | |
| CN101483610B (en) | Route updating method for link state routing protocol | |
| CN103001892B (en) | Based on network resource allocation method and the system of cloud computing | |
| Lo et al. | Traffic‐aware routing protocol with cooperative coverage‐oriented information collection method for VANET | |
| CN102594679B (en) | For determining the method and apparatus of the operation information of network node in Video Applications | |
| Nguyen et al. | Efficient virtual network embedding with node ranking and intelligent link mapping | |
| CN103188150A (en) | Path determination method and path determination device | |
| Sadegh et al. | A two-phase virtual machine placement policy for data-intensive applications in cloud | |
| Huang et al. | Routing with multiple quality-of-services constraints: an approximation perspective | |
| Jazaeri et al. | Toward caching techniques in edge computing over SDN-IoT architecture: A review of challenges, solutions, and open issues | |
| CN105207905A (en) | Route selection method and device | |
| Chen et al. | Optimal transport on supply-demand networks | |
| Papadimitriou et al. | Lagrangian relaxation for the time-dependent combined network design and routing problem | |
| CN101753457B (en) | Method and system for predicating available bandwidth of end-to-end route between nodes at Internet end | |
| Busch et al. | Quality of routing congestion games in wireless sensor networks | |
| Khan et al. | Grank-an information-centric autonomous and distributed ranking of popular smart vehicles |
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 |