CN101610433A - A multi-constraint routing selection method supporting policy resolution - Google Patents
A multi-constraint routing selection method supporting policy resolution Download PDFInfo
- Publication number
- CN101610433A CN101610433A CNA2009100887584A CN200910088758A CN101610433A CN 101610433 A CN101610433 A CN 101610433A CN A2009100887584 A CNA2009100887584 A CN A2009100887584A CN 200910088758 A CN200910088758 A CN 200910088758A CN 101610433 A CN101610433 A CN 101610433A
- Authority
- CN
- China
- Prior art keywords
- path
- routing
- limiting factors
- computing unit
- requests
- 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.)
- Pending
Links
Images
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
本发明提供了一种支持策略解析的多约束条件路由选择方法。本发明对路径计算限制因素进行有效分类，针对各种限制因素采用相应解决方案，考虑多个并发、预约或预测请求的全局优化处理，通过算法外在机制控制，得到在不同情况和需求下的最佳路径选择。本发明的优势在于能够处理多层多域中多种约束条件下的路径计算，并能够灵活地控制各种限制因素是否参与路径计算，从而根据用户策略动态地调整路由算法，计算出各种要求下的最佳路径。
The invention provides a multi-constraint route selection method supporting strategy analysis. The present invention effectively classifies the path calculation limiting factors, adopts corresponding solutions for various limiting factors, considers the global optimization processing of multiple concurrent, reservation or forecast requests, and obtains the results under different situations and requirements through the control of the external mechanism of the algorithm. Optimal path selection. The advantage of the present invention is that it can handle path calculation under various constraint conditions in multi-layer and multi-domain, and can flexibly control whether various limiting factors participate in path calculation, thereby dynamically adjusting routing algorithms according to user policies, and calculating various requirements the best path below.
Description
Technical field
The present invention relates to ASON (ASON, Automatically Switched OpticalNetworks) technical field, be specifically related to distribution route computing system based on dual-route computing unit.
Background technology
The Route Selection problem is one of key problem of studying in the optical-fiber network.In traditional ASON routing architecture, Route Selection is finished according to the full mesh topology information of himself storing by each node respectively and is calculated and selection.Because route is calculated and is finished by each node is distributed, on the one hand because the asynchronous full mesh topology resource information that may cause each node to be preserved of information from flooding is inconsistent, thereby cause the routing section link overlapping, cause professional the obstruction; On the other hand, there is time delay, may in the process that signaling is propagated, just finds the situation of resource contention because signaling is propagated.
In addition, at inter-domain routing, 3 kinds of route patterns have been provided in the standard of the ITU-T of International Telecommunications Union in G.7715, i.e. level route, source routing and hop-by-hop route.In the level routing architecture of ASON network, each subnet is only known the topological structure of itself, does not but understand the topological relation of its upper strata or lower floor.Each level all has one to comprise path control deivce (RC in the subnet, Routing Controller), connect controller (CC, Connection Controller) and Link Resource Manager device (LRM, Link ResourceManager) host node, be responsible for the routing of subnet at the corresponding levels, interact according to the relation of hierarchical structure between every grade of host node and select route.And under the source routing pattern, connection procedure is to unite by CC in the node that distributes and RC segmentation to finish.Because a connection may be passed through a plurality of routed domain, under the source routing pattern, begin to connect a routed domain of every process from source node, its Ingress node will be responsible for the Route Selection in this routed domain, and the responsible Ingress node of judging the required next routed domain that enters of connection, routed domain is carried out routing so one by one, the routed domain up to the destination node place of final arrival.In the hop-by-hop route, the selection of route is that with the node unit hop-by-hop selects, and is similar with the pass-through mode of packet in the IP network.
Above-mentioned 3 kinds of route patterns are all because information screen or topological abstract and cause the poor information accuracy between the territory, discrete traffic engineering parameters such as bandwidth information are difficult to be gathered, so that the information of flooding causes traffic overload in a large number, and especially the path computing under the complicated constraints of multi-layer multi-domain is difficult to be solved.
Deficiency at traditional ASON routing architecture, propose based on scientific research and standardization body because of special Nat IEEE, employing is based on path-calculating element (PCE, Path ComputationElement) network configuration and routing technology, path computing and traffic engineering under the complexity constraint is independent from traditional control plane.PCE is a functional entity of being responsible for path computing in the network specially, based on known network topology structure and constraints, calculates optimal path according to the request of path computing client (PCC, Path ComputationClient).The cross-domain routing mechanism of multilayer is the Core Feature of large-scale optical network, adopts relatively independent PCE to be responsible for path computing specially, helps strengthening the extensibility of network size and routing mechanism, alleviates the impact of a large amount of computation requirements to the network equipment simultaneously.Since two thousand six, IETF has announced 13 standard recommendation successively, has provided the preliminary imagination of PCE basic framework and protocol extension.But many PCE relevant criterion are still waited to finish, and also have very big Standardization Research space.
Yet, no matter be the routing solution of traditional ASON, also be based on the routing solution of PCE, under the situation of considering traffic engineering, also can only consider the previous professional influence that the back sending service is caused, and can not consider the influence that the back sending service causes previous business, thereby do not reach the target of the whole network resource route.
Fig. 2 is the professional schematic diagram that blocks.As shown in Figure 2, have two professional S1 and S2 successively to arrive, respectively from the A point to the F point with from the D point to the E point.Can calculate two shortest paths of professional S1 according to current network topological sum wavelength resource information, one is A-B-C-E-F, and one is A-B-D-E-F.If S1 has selected path A-B-D-E-F, S2 will get clogged so.
In the dual-route computing unit system based on ASON hierarchical routing and PCE, traditional ASON routing module provides functions such as Topology Discovery, route control as individual computing unit (UCE, Unit Computation Element).Cluster computing unit (GCE, Group ComputationElement) based on the PCE technology is provided with provides the group who is exclusively used in complicated limited routing procedure calculation services.Their traffic engineering database (TED, Traffic Engineering Database) has different network visual fields.Routing unit selector (RES, Routing Element Selector) is responsible for above-mentioned route computing unit function is selected.The group calculates agency (GCA, Group Computation Agent) corresponding to the path computing client in the PCE structure.
Two kinds of route computing units can both be realized the routing function in the optical-fiber network; but in the routing process under the multi-layer multi-domain multi-constraint condition that can expand on a large scale; it is complicated that traditional control plane routing function seems; and can not realize the traffic engineering of multi-layer multi-domain effectively; protection recovers, the functions such as routing between resource optimization and territory under control and the multi-constraint condition.
Introducing GCE then can address the above problem.GCE has adopted the thought of concentrating among a small circle, distributing on a large scale, can realize the routing function under the various scenes effectively.Particularly can be solved preferably under the cooperation at a plurality of GCE in the routing problem under the multi-layer multi-domain multi-constraint condition.When the routing request comes, both the routing request can be passed to UCE by the connection controller in the Control Node and finish routing, also can pass to GCE and carry out path computing.Under the environment of multi-layer multi-domain, especially the path computing under extensive multi-constraint condition can be given one or more GCE and be finished.Cooperate with each other by UCE and GCE, finish calculating quick, accurate, end-to-end path jointly.
Yet in the distribution route computation structure based on GCE, when the destination node of routing request was not in the responsible scope of local GCE institute, local GCE needed to send the routing solicited message to peripheral GCE and floods, and arrives destination node place GCE up to request.And then calculate shortest path tree to origin node by destination node place GCE, finally the combined calculation by a plurality of GCE obtains the shortest path that destination node arrives source node.
At concrete routing algorithm, people have proposed shortest path, based on the shortest path and the K-shortest path scheduling algorithm of weight, and three kinds of routing algorithms are described below.
SPF (SPF, Shortest Path First): shortest path first is that given source node and destination node sought shortest path in given network diagram, and the link cost in this path is all lower than other any paths.Cost function often is exactly the summation of the weight on all limits on the passage.Generally speaking, the weight of passage be static and also with link on route quantity irrelevant.The route that shortest path first produced and other any route all have nothing to do, therefore, shortest path without any need for search-order or selective rule, result calculated is exactly last unique selection.
SPF (WSPF, Weight-based Shortest Path First) based on weight: the weight shortest path first is a kind of shortest path first, but link cost may dynamically be regulated according to the route quantity of having set up.Therefore, this algorithm need be carried out according to certain search-order, for example, chooses according to the search of maximum traffic flow or according to chance mechanism.
K bar SPF (KSPF, K Shortest Path First): this algorithm is all sought more than one optical channel for each to source node and destination node.The replaceable passage of K bar has increased the flexibility of Route Selection, yet it transforms routing issue for multirouting selection problem, by in K bar passage, selecting to obtain the required minimum cost interface channel of (minimum cost refers to total jumping figure or total link cost minimum), not only increase the amount of calculation of route search, also additionally increased the amount of calculation of Route Selection.
Constraint shortest path first (CSPF, Constraint-based Shortest Path First): be a kind of improved shortest-path first algorithm, it on the basis of LSD and TED, calculates the shortest path that satisfies constraints according to the particular requirement of business.
KCSPF: the combination that is KSPF and CSPF.
Yet, the routing solution of existing ASON and solution single domain that routing algorithm often can only be simple or the route computational problem between the territory, support not ideal enough for the end-to-end path computation under the multi-constraint condition of multi-layer multi-domain, can not control flexibly and manage at various limiting factors and subscriber policy, also not consider concurrent requested resource collision problem.
Summary of the invention
In extensive multi-layer multi-domain optical network, multiple constraints becomes the key constraints of Route Selection.For the calculating of the end-to-end flux Engineering label switching path of multi-layer multi-domain, the path computing limiting factor mainly is divided into two kinds, can cutting and can not cutting.
But described cutting limiting factor be meant can simple filtration limiting factor, such as bandwidth, protection demand and various artificial restriction strategies etc.;
Describedly can not the cutting limiting factor be divided into additive property and nonadditivity limiting factor again;
Described additive property limiting factor comprises decay, chromatic dispersion, time delay etc.;
Described nonadditivity limiting factor comprises the exchange capacity of consistent wavelength, node and port number etc.;
Multiple limiting factor causes the complexity of Route Selection in the multi-layer multi-domain optical network to become big, ageing reduction.
At above-mentioned situation, a kind of distribution route computing system based on dual-route computing unit of considering the PRI conflict perception at GCE is proposed, this system not only can consider the influence that previous business causes the back sending service, and can consider the influence that the back sending service causes previous business, thereby avoid the generation of above-mentioned professional congestion situations.It is as follows to the invention provides scheme:
Scheme is effectively classified to the path computing limiting factor, and to adopt corresponding solution route at various limiting factors be core content, by the mode of the external mechanism of control algolithm, obtains the optimal selection path under different situations and different demands.Described method comprises:
Come from two entity: TED and Policy Table based on the limiting factor in the distribution route computation structure of dual-route computing unit.
Described TED comprises the various parameters relevant with link and network topology, such as the exchange capacity of bandwidth, resource operating position, node and the physical parameter of link etc.;
Described Policy Table, loaded storage own or the various strategies assigned of PCC and webmaster, be provided with etc. as protection, resource optimization and priority a certain link or node;
Algorithm itself will come from two path computing limiting factors in the database and be divided three classes: but that can not add, that can add and cutting.
Preferably, in the described method, the limiting factor controller is controlled certain limiting factor dynamically, defines whether it effective.
When the routing request arrives, request queue is handled.For the situation of a plurality of concurrent, reservations or predictions request, carry out global optimization by the corresponding business strategy, promptly ask in the formation of living in to each before and after request consider as a whole, and the demand of other request is converted into constraints to this request;
Preferably, in dual-route computing unit system,, can solve a large amount of concurrent path requests effectively and will cause serious resource conflict problem especially based on the route computing unit of GCE;
Described concurrent path request will cause serious resource conflict problem, exist in the distributed routing architecture based on traditional control plane, and a large amount of concurrent path requests will cause serious resource conflict problem, even can cause network lock-up and the whole network paralysis;
Preferably, described GCE (when C/S, Client/Server) framework, GCE receive the request that a plurality of GCA send simultaneously, according to regular hour and priority rule queuing, handles for the routing request in the formation successively based on client/server;
Preferably, described GCE has it to be responsible for the interior overall visual field in zone, can carry out TED timely and upgrade, thereby avoid the resource conflict problem that a large amount of concurrent request caused effectively.
From the above as can be seen, the distribution route computing system advantage based on dual-route computing unit that the present invention proposes is to handle the path computing under the multiple constraints in the multi-layer multi-domain, and can control the path computing that various limiting factors participate in flexibly, simultaneously can adjust routing algorithm dynamically, thereby calculate the optimal path under the various requirement according to subscriber policy.In addition, can either carry out priority queueing to a plurality of requests that arrive simultaneously, can consider the request before and after this request again, accomplish global optimization's processing based on the treatment mechanism of multiple concurrent, reservation or prediction.The present invention has established theoretical foundation for the application of extensive ASON.
Description of drawings
Fig. 1 is the route solution schematic diagram that the present invention is based under the multi-constraint condition;
Fig. 2 is the professional schematic diagram that blocks;
Fig. 3 is the concurrent request queue model of a present invention schematic diagram;
Fig. 4 considers the conflict perception route selection method schematic diagram of priority for the present invention.
Embodiment
The present invention introduces multi-constraint condition in the routing solution, scheme is with effective classification of path computing limiting factor, and to adopt corresponding solution at various limiting factors be core, consider simultaneously a plurality of concurrent/global optimization of reservation/predictions request handles, by the external mechanism control of algorithm, obtain the optimal path selection under different situations and demand.
In extensive multi-layer multi-domain optical network, multiple constraints becomes the key constraints of Route Selection.For the calculating of the end-to-end flux Engineering label switching path of multi-layer multi-domain, the path computing limiting factor mainly is divided into two kinds, can cutting and can not cutting.
But described cutting limiting factor be meant can simple filtration limiting factor, such as bandwidth, protection demand and various artificial restriction strategies etc.;
Describedly can not the cutting limiting factor be divided into additive property and nonadditivity limiting factor again;
Described additive property limiting factor comprises decay, chromatic dispersion, time delay etc.;
Described nonadditivity limiting factor comprises the exchange capacity of consistent wavelength, node and port number etc.;
Multiple limiting factor causes the complexity of Route Selection in the multi-layer multi-domain optical network to become big, ageing reduction.
Introduce at first that present embodiment provides based on the routing solution under the multi-constraint condition.
In the present embodiment, described scheme is effectively classified to limiting factor, and to adopt corresponding solution route at various limiting factors be core content, by the mode of the external control of machine-processed algorithm, obtains the optimal selection path under different situations and different demands.Come from two entity: TED and Policy Table based on the limiting factor in the distribution route computation structure of dual-route computing unit.
Described TED comprises the various parameters relevant with link and network topology, such as the exchange capacity of bandwidth, resource operating position, node and the physical parameter of link etc.;
Described Policy Table, loaded storage own or the various strategies assigned of PCC and webmaster, be provided with etc. as protection, resource optimization and priority a certain link or some nodes;
Algorithm itself will come from two path computing limiting factors in the database and be divided three classes: but that can not add, that can add and cutting.
Preferably, in the described method, the limiting factor controller is controlled certain limiting factor dynamically, defines whether it effective.
When the routing request arrives, request queue is handled.For the situation of a plurality of concurrent, reservations or predictions request, carry out global optimization by the corresponding business strategy, promptly ask in the formation of living in to each before and after request consider as a whole, and the demand of other request is converted into constraints to this request;
Preferably, in dual-route computing unit system,, can solve a large amount of concurrent path requests effectively and will cause serious resource conflict problem especially based on the route computing unit system of GCE;
Described concurrent path request will cause serious resource conflict problem, exist in the distributed routing architecture based on traditional control plane, and a large amount of concurrent path requests will cause serious resource conflict problem, even can cause network lock-up and the whole network paralysis;
Preferably, described GCE is based on the C/S framework, when GCE receives the request that a plurality of GCA send simultaneously, according to regular hour and priority rule queuing, handles successively for the routing request in the formation;
Preferably, described GCE has it to be responsible for the interior overall visual field in zone, can carry out TED timely and upgrade, thereby avoid the resource conflict problem that a large amount of concurrent request caused effectively.
In the present embodiment, Fig. 1 is the route solution schematic diagram that the present invention is based under the multi-constraint condition, and Fig. 3 is concurrent request queue model schematic diagram.
As shown in Figure 1, service request starts the limiting factor resolver by the C/S controller, at canned data among TED and the Policy Table, judge whether to exist to add limiting factor and specifying information, adopt corresponding solution network topology to be converted into the form that can directly utilize.
Described method comprises following feature,
If the consistent wavelength existence is arranged, then network topology is converted into wavelength graph; If have node switching capabilities limits factor to exist, then network topology be converted into channel mapping;
In this step, according to described method, judge successively whether additive property and cutting limiting factor exist, and adopt the shortest path selection algorithm of respective extension shown in Figure 1 to calculate routing, simultaneously the calculating optimum route.
In the present embodiment, described method also comprises following feature:
If routing is calculated successfully, then be back to the algorithm inlet, wait for routing request next time; If failure is calculated in routing, then judge whether to recomputate route, be then to revise the Policy Table, directly carry out the next iteration process, otherwise be back to the algorithm inlet;
Do not obtain a complete path if find this routing, then send uncertain section routing request, be back to the algorithm inlet to peripheral GCE.
As shown in Figure 3, in concurrent request queue model, said method comprising the steps of:
A. rank according to timeslice, timeslice can be decided according to CPU disposal ability and request arriving rate;
B. the priority according to service request is ranked in each timeslice;
C. constitute an integral body by the time, part service request formation according to priority.
Judge successively then whether limiting factor exists, the calculating optimum route, the calculating path request is judged uncertain request, until calculating successfully.
Fig. 4 considers the conflict perception route selection method schematic diagram of priority for the present invention.As shown in Figure 4, in the present embodiment, N service request is unit, adopts the buffer buffer memory, and concrete steps are as follows:
Whether business between have priority exist, if exist then carry out priority queueing, otherwise calculate each professional shortest path successively if A. judging;
B. when all service paths calculating in the buffer memory finish, judge in the situation whether resource contention is arranged between each professional path of setting up by the collision detection module;
If C. clash, then recomputate in the conflict business the former route, whether see can both equal road constructions successes.
In sum, the present invention is based on the dual-route computing unit system of multiple domain optical-fiber network, propose a kind of distribution route computing system based on dual-route computing unit, the present invention adjusts routing algorithm dynamically according to subscriber policy, calculates the optimal path under the various requirement.The present invention also based on the treatment mechanism of multiple concurrent, reservation and prediction, carries out priority queueing to a plurality of requests that arrive simultaneously, considers the request before and after this request simultaneously, accomplishes global optimization's processing.
In addition, the present invention is directed to limiting factor effectively classifies, and be core concept various limiting factors are adopted corresponding solution route, routing algorithm under the complicated constraints of multi-layer multi-domain is optimized processing, by the external mechanism of control algolithm, obtain the optimal selection under different situations and demand, solving in a large number, the information of flooding causes the traffic overload problem.The present invention has established theoretical foundation for the application of extensive ASON.
Should be noted that at last, above embodiment is only unrestricted in order to technical scheme of the present invention to be described, those of ordinary skill in the art is to be understood that, can make amendment or be equal to replacement technical scheme of the present invention, and not breaking away from the spiritual scope of technical solution of the present invention, it all should be encompassed in the middle of the claim scope of the present invention.
Claims (9)
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNA2009100887584A CN101610433A (en) | 2009-07-10 | 2009-07-10 | A multi-constraint routing selection method supporting policy resolution |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNA2009100887584A CN101610433A (en) | 2009-07-10 | 2009-07-10 | A multi-constraint routing selection method supporting policy resolution |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN101610433A true CN101610433A (en) | 2009-12-23 |
Family
ID=41483971
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNA2009100887584A Pending CN101610433A (en) | 2009-07-10 | 2009-07-10 | A multi-constraint routing selection method supporting policy resolution |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101610433A (en) |
Cited By (16)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102006527A (en) * | 2010-11-17 | 2011-04-06 | 北京邮电大学 | Path Computation Method Based on PCE in Optical Network |
| CN102325039A (en) * | 2011-06-09 | 2012-01-18 | 国网电力科学研究院 | An Optimal Design Method of ASON Network Oriented to Power Control Service |
| CN103581006A (en) * | 2012-08-10 | 2014-02-12 | 北京邮电大学 | System architecture for global optimization of flexible grid optical networks and global optimization method thereof |
| CN103780646A (en) * | 2012-10-22 | 2014-05-07 | 中国长城计算机深圳股份有限公司 | Cloud resource scheduling method and system |
| CN105007222A (en) * | 2015-04-20 | 2015-10-28 | 中国电信股份有限公司 | Business transmission path selection method and business transmission path selection device |
| CN105379204A (en) * | 2014-01-14 | 2016-03-02 | 华为技术有限公司 | Methods and systems for selecting resources for data routing |
| WO2016058299A1 (en) * | 2014-10-17 | 2016-04-21 | 中兴通讯股份有限公司 | Path computation method, tunnel establishment method, pcc, pce, path computation system and storage medium |
| CN105959218A (en) * | 2016-05-09 | 2016-09-21 | 中国联合网络通信集团有限公司 | Network route selection method and network route selection system |
| CN107733796A (en) * | 2017-02-07 | 2018-02-23 | 深圳臻云技术股份有限公司 | A kind of preferentially path calculation method and system |
| CN108228356A (en) * | 2017-12-29 | 2018-06-29 | 华中科技大学 | A kind of distributed dynamic processing method of flow data |
| WO2018219298A1 (en) * | 2017-05-31 | 2018-12-06 | 中兴通讯股份有限公司 | Method and device for processing failure of path computation requested by path computation client (pcc) |
| CN109995650A (en) * | 2018-01-03 | 2019-07-09 | 中兴通讯股份有限公司 | Path calculation method and device under multi-dimensional constraints based on SDN network |
| CN110224927A (en) * | 2019-06-11 | 2019-09-10 | 西安电子科技大学 | Based on the determination network multiple constraint dual path method for routing for reversely deleting strategy |
| CN111131028A (en) * | 2019-10-16 | 2020-05-08 | 河南工程学院 | An Inter-Domain Routing Restoration Method Based on Degree Constrained Minimum Spanning Tree |
| CN111310906A (en) * | 2018-12-11 | 2020-06-19 | 清华大学 | Method, apparatus, and apparatus for layout of computational cores in neuromorphic chips |
| WO2022213817A1 (en) * | 2021-04-08 | 2022-10-13 | 华为技术有限公司 | Routing method and routing apparatus |
-
2009
- 2009-07-10 CN CNA2009100887584A patent/CN101610433A/en active Pending
Cited By (25)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102006527B (en) * | 2010-11-17 | 2013-05-01 | 北京邮电大学 | Path calculation method based on PCE in optical network |
| CN102006527A (en) * | 2010-11-17 | 2011-04-06 | 北京邮电大学 | Path Computation Method Based on PCE in Optical Network |
| CN102325039A (en) * | 2011-06-09 | 2012-01-18 | 国网电力科学研究院 | An Optimal Design Method of ASON Network Oriented to Power Control Service |
| CN103581006A (en) * | 2012-08-10 | 2014-02-12 | 北京邮电大学 | System architecture for global optimization of flexible grid optical networks and global optimization method thereof |
| WO2014023268A1 (en) * | 2012-08-10 | 2014-02-13 | 北京邮电大学 | System architecture for global optimization of flexible grid optical network and global optimization method therefor |
| CN103780646B (en) * | 2012-10-22 | 2017-04-12 | 中国长城计算机深圳股份有限公司 | Cloud resource scheduling method and system |
| CN103780646A (en) * | 2012-10-22 | 2014-05-07 | 中国长城计算机深圳股份有限公司 | Cloud resource scheduling method and system |
| CN105379204B (en) * | 2014-01-14 | 2019-04-05 | 华为技术有限公司 | Method and system for the resource for selecting data to route |
| CN105379204A (en) * | 2014-01-14 | 2016-03-02 | 华为技术有限公司 | Methods and systems for selecting resources for data routing |
| WO2016058299A1 (en) * | 2014-10-17 | 2016-04-21 | 中兴通讯股份有限公司 | Path computation method, tunnel establishment method, pcc, pce, path computation system and storage medium |
| CN105007222A (en) * | 2015-04-20 | 2015-10-28 | 中国电信股份有限公司 | Business transmission path selection method and business transmission path selection device |
| CN105959218A (en) * | 2016-05-09 | 2016-09-21 | 中国联合网络通信集团有限公司 | Network route selection method and network route selection system |
| CN107733796A (en) * | 2017-02-07 | 2018-02-23 | 深圳臻云技术股份有限公司 | A kind of preferentially path calculation method and system |
| WO2018219298A1 (en) * | 2017-05-31 | 2018-12-06 | 中兴通讯股份有限公司 | Method and device for processing failure of path computation requested by path computation client (pcc) |
| CN108228356A (en) * | 2017-12-29 | 2018-06-29 | 华中科技大学 | A kind of distributed dynamic processing method of flow data |
| CN108228356B (en) * | 2017-12-29 | 2021-01-15 | 华中科技大学 | Distributed dynamic processing method of stream data |
| CN109995650A (en) * | 2018-01-03 | 2019-07-09 | 中兴通讯股份有限公司 | Path calculation method and device under multi-dimensional constraints based on SDN network |
| WO2019134483A1 (en) * | 2018-01-03 | 2019-07-11 | 中兴通讯股份有限公司 | Path calculation method and device under multi-dimensional constraints, processor and storage medium |
| CN109995650B (en) * | 2018-01-03 | 2022-02-22 | 中兴通讯股份有限公司 | SDN network-based path calculation method and device under multidimensional constraint |
| CN111310906A (en) * | 2018-12-11 | 2020-06-19 | 清华大学 | Method, apparatus, and apparatus for layout of computational cores in neuromorphic chips |
| CN110224927A (en) * | 2019-06-11 | 2019-09-10 | 西安电子科技大学 | Based on the determination network multiple constraint dual path method for routing for reversely deleting strategy |
| CN110224927B (en) * | 2019-06-11 | 2020-07-10 | 西安电子科技大学 | Method for determining multi-constraint dual-path routing of network based on reverse deletion strategy |
| CN111131028A (en) * | 2019-10-16 | 2020-05-08 | 河南工程学院 | An Inter-Domain Routing Restoration Method Based on Degree Constrained Minimum Spanning Tree |
| CN111131028B (en) * | 2019-10-16 | 2021-09-21 | 河南工程学院 | Inter-domain route recovery method based on minimum spanning tree of degree constraint |
| WO2022213817A1 (en) * | 2021-04-08 | 2022-10-13 | 华为技术有限公司 | Routing method and routing apparatus |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101610433A (en) | A multi-constraint routing selection method supporting policy resolution | |
| CA2139111C (en) | System and method for call-by-call source routing with rule-based fallbacks | |
| CN100596102C (en) | Method for establishing label switched path of minimized path preemption cost | |
| CN100454841C (en) | A method and system for calculating multi-domain routing | |
| US8493869B2 (en) | Distributed constraints-based inter-domain network traffic management | |
| EP1938534B1 (en) | Distributed pce-based system and architecture in a multi-layer network | |
| KR102104047B1 (en) | Congestion control in packet data networking | |
| JP4598640B2 (en) | Route selection method and apparatus in telecommunication network | |
| US8320277B2 (en) | Multitopology routing method and system | |
| CN101707788B (en) | Differential pricing strategy based dynamic programming method of multilayer network services | |
| EP1395003A2 (en) | Constraint-based shortest path first method for dynamically switched optical transport networks | |
| CN109600319B (en) | A Traffic Scheduling Method in Real-time Transmission Mechanism | |
| CN109714275A (en) | A kind of SDN controller and its control method for access service transmission | |
| CN1996921B (en) | Method for establishing service connection, routing device, service network | |
| KR101674177B1 (en) | Transport Software-Defined Network controller of providing E-LAN between multi-nodes and method thereof | |
| US7168044B1 (en) | Apparatus and method for automatic network connection provisioning | |
| Scoglio et al. | TEAM: A traffic engineering automated manager for DiffServ-based MPLS networks | |
| JP2003078555A (en) | Adaptive network load distribution system and packet switching device | |
| Shan et al. | Bandwidth management for supporting differentiated service aware traffic engineering | |
| Ali et al. | E2E service class mapping in heterogeneous IOUT: SDN-based architecture | |
| De Oliveira et al. | Label switched path (LSP) preemption policies for MPLS traffic engineering | |
| CN100550830C (en) | A kind of optimization route selection method that is applied on the bearer network Control Server | |
| Lu et al. | Contention reduction in core optical packet switches through electronic traffic smoothing and scheduling at the network edge | |
| Nayyer et al. | Game theory-based routing for software-defined networks | |
| Hoceini et al. | Average-bandwidth delay Q-routing adaptive algorithm |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C02 | Deemed withdrawal of patent application after publication (patent law 2001) | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20091223 |