CN107465615A - A kind of route determining methods and controller based on layering multiple domain - Google Patents

A kind of route determining methods and controller based on layering multiple domain Download PDF

Info

Publication number
CN107465615A
CN107465615A CN201710657780.0A CN201710657780A CN107465615A CN 107465615 A CN107465615 A CN 107465615A CN 201710657780 A CN201710657780 A CN 201710657780A CN 107465615 A CN107465615 A CN 107465615A
Authority
CN
China
Prior art keywords
controller
path
domain
control device
level control
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
Application number
CN201710657780.0A
Other languages
Chinese (zh)
Other versions
CN107465615B (en
Inventor
刘川
李炳林
郭经红
王菲
郁小松
赵永利
陈磊
王向群
沈文
陶静
陈伟
姚启桂
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
State Grid Corp of China SGCC
State Grid Zhejiang Electric Power Co Ltd
Beijing University of Posts and Telecommunications
Global Energy Interconnection Research Institute
Original Assignee
State Grid Corp of China SGCC
State Grid Zhejiang Electric Power Co Ltd
Beijing University of Posts and Telecommunications
Global Energy Interconnection Research Institute
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by State Grid Corp of China SGCC, State Grid Zhejiang Electric Power Co Ltd, Beijing University of Posts and Telecommunications, Global Energy Interconnection Research Institute filed Critical State Grid Corp of China SGCC
Priority to CN201710657780.0A priority Critical patent/CN107465615B/en
Publication of CN107465615A publication Critical patent/CN107465615A/en
Application granted granted Critical
Publication of CN107465615B publication Critical patent/CN107465615B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/02Topology update or discovery
    • H04L45/04Interdomain routing, e.g. hierarchical routing
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/302Route determination based on requested QoS
    • H04L45/306Route determination based on the nature of the carried application

Abstract

The invention discloses a kind of route determining methods based on layering multiple domain, including:Obtain the source node identification and destination node information in service request;The type of service request is determined according to source node identification and destination node information;The optimal path of route is determined according to the type of service request.Method provided by the invention utilizes the collaboration route selection between multi-controller, can effectively improve the utilization rate of resource, reduce the cost of controller, select the path of cost minimization as optimal path.

Description

A kind of route determining methods and controller based on layering multiple domain
Technical field
The present invention relates to technical field of information communication, and in particular to a kind of route determining methods and control based on layering multiple domain Device processed.
Background technology
One larger network would generally be divided into multiple according to the otherness or different operators of equipment Domain, coordinated management is carried out by multiple controllers.Cooperating type control technology based on layering multiple domain has become industrial quarters and science One generally acknowledged large scale network control technology solution on boundary.It is network size and data traffic to be layered multiple domain SDON frameworks Be continuously increased the guarantee for providing network normal operation.
Under SDN framework, existing Kandoo frameworks are to be carried by SoheilHassas Yeganeh etc. in 2007 A kind of advanced application control framework based on SDN control platform for going out and designing, is that a kind of new distributed AC servo system is put down Face, it is made up of two layers of controller, lower floor is that local controller execution is locally applied, and upper strata is the one of the non-local application program of operation The root controller of individual logical centralization.This framework changes the control plane structure of the single control of tradition, is by multiple controller lists First distribution is interconnected to form the control plane framework of more control units.But the distributed control plane of two layers of controller is not The large-scale network system can be used for, and efficiently real-time management service is provided to numerous network equipments, so layering multiple domain Cooperating type control technology has become industrial quarters and a generally acknowledged large scale network control technology solution of academia.
Controller not only administrative section subdomain controller direct administrative section network element again is considered in existing research Situation, routing problem in this case are not solved effectively.
The content of the invention
Therefore, the technical problem to be solved in the present invention is to overcome and of the prior art both administrative section subdomain can not controlled Device and directly administrative section network element defect, so as to provide a kind of route determining methods and controller based on layering multiple domain.
A kind of route determining methods based on layering multiple domain provided by the invention, it is characterised in that including:
Obtain the source node identification and destination node information in service request;
The type of the service request is determined according to the source node identification and destination node information;
The optimal path of route is determined according to the type of the service request.
Further, the type of the request includes same area service request and cross-domain service is asked.
It is described that route is determined most according to the type of the service request when the service request is same area service request The step of shortest path, including:
It is determined that manage the controller of the source node and destination node;
The controller calculates at least one candidate road according to road construction demand, constraints and current network topological information Footpath, and determine the path with minimum cost as optimal path from least one path candidate.
Further, when the source node and destination node directly manage by subdomain controller, the controller is controlled At least one path candidate is calculated according to road construction demand, constraints and current network topological information, and from described at least one The path with minimum cost is determined in bar path candidate as optimal path, including:
As the domain where top level control device determines the source node and destination node;
The subdomain controller in domain issues road construction signaling where the top level control device to the source node and destination node;
After the subdomain controller in domain receives road construction signaling where the source node and destination node, according to building for top level control device Road demand, constraints and current network topological information calculate at least one path candidate;
The subdomain controller calculates the cost of at least one path candidate, and determines the path conduct of cost minimization Optimal path, and return to the top level control device layer by layer recurrence to top layer global controller;
The optimal path is replied to access controller by the global controller.
Further, when the source node and destination node are directly managed by interlayer controller, the controller is according to building Road demand, constraints and current network topological information calculate at least one path candidate, and from least one candidate The path with minimum cost is determined in path as optimal path, including:
The controller of layer is according to road construction demand, constraints and current network topology where the source node and destination node Information calculates at least one path candidate;
The controller of layer where the source node and destination node calculates the cost of at least one path candidate, and determines The path of cost minimization as optimal path, and upwards layer by layer recurrence to top layer global controller;
The optimal path is replied to access controller by the global controller.
Further, when the service request is that cross-domain service is asked, the type according to the service request is true Surely the step of optimal path routeing, including:
It is determined that manage the controller of the source node and destination node;
The border gateway nodes in domain where determining the source node and destination node, the controller is according to the borde gateway Node and road construction demand, constraints and current network topological information calculate at least one path candidate, and from it is described to Determine the path with minimum cost as optimal path in a few path candidate.
Further, when the source node and destination node directly manage by subdomain controller, the controller according to Road construction demand, constraints and current network topological information calculate at least one path candidate, and are waited from described at least one The step of path with minimum cost is as optimal path is determined in routing footpath, including:
The border gateway nodes GWs and GWd in domain where selecting the source node and destination node respectively by top level control device;
The top level control device determines the domain sequence between GWs and GWd border gateway nodes;
Border gateway nodes between selected traveled through adjacent domains are as the peer node for calculating road;
The subdomain controller in domain where the source node is sent to the top level control device calculates road request;
The top level control device is calculated extremely according to domain sequence and selected peer node based on current abstract network topology A few path candidate, and issue road construction signaling to the subdomain controller of traversal;
After the subdomain controller of traversal receives road construction signaling, according to road construction demand, the constraints of the top level control device Road construction in domain is carried out respectively with current network topological information;
The subdomain controller calculates the cost in institute's road construction footpath respectively, and returns to the top level control device recurrence is extremely layer by layer The global controller of top layer;
The path cost information that the global controller is replied based on the subdomain controller that is traveled through, calculate described at least one The cost of bar path candidate, and determine the path of cost minimization as optimal path;
The optimal path is replied to access controller by the global controller.
Further, when the source node and destination node directly manage by interlayer controller, the control control Device processed according to road construction demand, constraints and current network topological information calculate at least one path candidate, and from it is described to The step of path with minimum cost is as optimal path is determined in a few path candidate, including:
The border gateway nodes GWs and GWd in domain where selecting the source node and destination node respectively by top level control device;
The top level control device determines the domain sequence between GWs and GWd border gateway nodes;
Border gateway nodes between selected traveled through adjacent domains are as the peer node for calculating road;
The top level control device according to domain sequence and selected peer node, based on current part abstract network topology and Part real network topology, calculates at least one path candidate, and issue road construction signaling to the subdomain controller of traversal;
After the subdomain controller of traversal receives road construction signaling, according to the road construction demand of top level control device, constraints and work as Preceding network topological information carries out road construction in domain respectively;
The subdomain controller calculates the cost in institute's road construction footpath respectively, and returns to the top level control device recurrence is extremely layer by layer The global controller of top layer;
The global controller is traveled through based on the path cost information that the subdomain controller traveled through is replied with when calculating road The network element directly managed by top level control device cost information, calculate the cost of at least one path candidate, and determine The path of cost minimization is as optimal path;
The optimal path is replied to access controller by the global controller.
Further, when one in the source node and destination node directly manages by subdomain controller, another is by upper When layer controller directly manages, the control controller is believed according to road construction demand, constraints and current network topology Breath calculates at least one path candidate, and determines the path with minimum cost as most from least one path candidate The step of shortest path, including:
The border gateway nodes GWs and GWd in domain where selecting the source node and destination node respectively by top level control device;
The top level control device determines the domain sequence between GWs and GWd border gateway nodes;
Border gateway nodes between selected traveled through adjacent domains are as the peer node for calculating road;
The subdomain controller in domain where the source node is sent to the top level control device calculates road request;
The top level control device according to domain sequence and selected peer node, based on current part abstract network topology and Part real network topology, calculates at least one path candidate, and issue road construction signaling to the subdomain controller of traversal;
After the subdomain controller of traversal receives road construction signaling, according to road construction demand, the constraints of the top level control device Road construction in domain is carried out respectively with current network topological information;
The subdomain controller calculates the cost in institute's road construction footpath respectively, and returns to the top level control device recurrence is extremely layer by layer The global controller of top layer;
The global controller is traveled through based on the path cost information that the subdomain controller traveled through is replied with when calculating road The network element directly managed by top level control device cost information, calculate the cost of at least one path candidate, and determine The path of cost minimization is as optimal path;
The optimal path is replied to access controller by the global controller.
Further, the optimal path of the cross-domain request is expressed as:
op(ns, nd)=op (ns, nbs)+op(nbs, nbd)+op(nbd,nd),
Wherein, op (ns, nd) represent source node nsWith destination node ndBetween optimal path, op (ns, nbs) represent source node nsBorder gateway nodes n between adjacent domainsbsBetween optimal path, op (nbs, nbd) represent adjacent domains between borde gateway section Point nbsBorder gateway nodes n between adjacent domainsbdBetween optimal path, op (nbd,nd) represent adjacent domains between borde gateway Node nbdWith destination node ndBetween optimal path.
Correspondingly, the present invention also provides a kind of controller, it is characterised in that including:At least one processor and The memory being connected with least one processor communication;Wherein, have can be by least one place for the memory storage The instruction that device performs is managed, the instruction is by least one computing device, so that at least one computing device institute The route determining methods based on layering multiple domain stated.
Technical solution of the present invention, have the following advantages that:By obtaining source node identification and destination node letter in service request Breath, the type of service request is determined according to source node identification and destination node information, route is determined according to the type of service request Optimal path, this method take into account the collaboration routing between multi-layer controller, can effectively improve the utilization rate of resource, reduce The cost of controller.
Brief description of the drawings
, below will be to specific in order to illustrate more clearly of the specific embodiment of the invention or technical scheme of the prior art The required accompanying drawing used is briefly described in embodiment or description of the prior art, it should be apparent that, in describing below Accompanying drawing is some embodiments of the present invention, for those of ordinary skill in the art, before creative work is not paid Put, other accompanying drawings can also be obtained according to these accompanying drawings.
Fig. 1 is that the route system of the framework based on layering multiple domain SDON in the embodiment of the present invention forms figure;
Fig. 2 is the flow chart of a specific example of the route determining methods based on layering multiple domain in the embodiment of the present invention;
Fig. 3 is a kind of specific method flow diagram for determining optimal path in the embodiment of the present invention;
Fig. 4 is another specific method flow diagram for determining optimal path in the embodiment of the present invention;
Fig. 5 is the specific method flow diagram for determining optimal path of the third in the embodiment of the present invention;
Fig. 6 is the 4th kind of specific method flow diagram for determining optimal path in the embodiment of the present invention;
Fig. 7 is the 5th kind of specific method flow diagram for determining optimal path in the embodiment of the present invention;
Fig. 8 is the theory diagram of a specific example of controller in the embodiment of the present invention.
Embodiment
Technical scheme is clearly and completely described below in conjunction with accompanying drawing, it is clear that described implementation Example is part of the embodiment of the present invention, rather than whole embodiments.Based on the embodiment in the present invention, ordinary skill The every other embodiment that personnel are obtained under the premise of creative work is not made, belongs to the scope of protection of the invention.
In the description of the invention, it is necessary to which explanation, unless otherwise clearly defined and limited, term " connected ", " connects Connect " it should be interpreted broadly, for example, it may be being fixedly connected or being detachably connected, or it is integrally connected;It can be machine Tool connects or electrical connection;Can be joined directly together, can also be indirectly connected by intermediary, can also be two The connection of element internal, can be wireless connection or wired connection.For the ordinary skill in the art, The concrete meaning of above-mentioned term in the present invention can be understood with concrete condition.
As long as in addition, technical characteristic involved in invention described below different embodiments non-structure each other It is be combined with each other into conflict can.
Fig. 1 shows the route system of a framework based on layering multiple domain SDON, and wherein top layer is global controller, the palm Global abstract network view is held, control below includes N straton domain controllers, and N stratons domain controller manages respective domain respectively Topology, subdomain controller only grasp the topology information of local domain, are realized and the control of other subdomains by being interacted with global controller The information exchange of device, or the information exchange with other subdomain controllers is realized by interface.Network element node therein, both can be with By subdomain controller management, can also directly be managed by its last layer manager.The present embodiment provides a kind of more based on being layered The route determining methods in domain, are performed in unison with by controller noted above, as shown in Fig. 2 comprising the following steps:
S1:Obtain the source node identification and destination node information in service request;
When business, which arrives, carries out route calculation road, global controller obtains source node s and destination node d information first.
S2:The type of the service request is determined according to source node identification and destination node information;
The present embodiment multiple domain SDON network central controls device not only administrative section subdomain controller but also direct administrative section network element, root Determine whether s and d nodes belong to same controller and directly manage according to source node s and destination node d information, judge that the business is Belong to same area business or cross-domain service.Wherein, same area business is drawn according to whether s and d nodes are directly managed by interlayer controller It is divided into two kinds of situations:1. s and d same areas and directly managed by subdomain controller;2. s is with d same areas and by N (N >=2) layer controller Directly manage;Cross-domain service is divided into three kinds of situations according to whether s and d nodes are directly managed by interlayer controller:1. s and d across Domain and directly managed by subdomain controller;2. s and d is cross-domain and is directly managed by interlayer controller;3. s is cross-domain with d, s (or D) directly managed by subdomain controller, d (or s) is directly managed by interlayer controller.
S3:The optimal path of route is determined according to the type of service request.
According to the information of sourcesink node, determine that sourcesink node is direct by top level control device directly management or subdomain controller Management, final to determine k bar path candidates, global controller selects the road of cost minimization by calculating the costs of k bar path candidates Footpath is as optimal path.
The route determining methods based on layering multiple domain provided according to embodiments of the present invention, by obtaining in service request Source node identification and destination node information, the type of service request is determined according to source node identification and destination node information, according to business The type of request determines the optimal path of route, and this method take into account the collaboration routing between multi-layer controller, can be effective The utilization rate of resource is improved, reduces the cost of controller.
The first situation, i.e., when service request is same area service request, above-mentioned steps S3 is specifically included:
S31:It is determined that manage the controller of the source node and destination node;
S32:The controller calculates at least one according to road construction demand, constraints and current network topological information and waited Routing footpath, and determine the path with minimum cost as optimal path from least one path candidate.
Further, in same area service request when source node and destination node directly manage by subdomain controller, such as Fig. 3 Shown, above-mentioned steps S32 is specifically included:
S321a:As the domain where top level control device determines source node and destination node;
S321b:The subdomain controller in domain issues road construction signaling where top level control device to source node and destination node;
S321c:After the subdomain controller in domain receives road construction signaling where source node and destination node, according to top level control device Road construction demand, constraints and current network topological information calculate at least one path candidate;
S321d:Subdomain controller calculates the cost of at least one path candidate, and determines the path of cost minimization as most Shortest path, and return to top level control device layer by layer recurrence to top layer global controller;
S321e:Optimal path is replied to access controller by global controller.
Controller is the domain last layer manager where source node and destination node to the present embodiment at the middle and upper levels, for example, source node It is N-1 layer controllers with the domain where destination node, then its top level control device is n-th layer controller, and top level control device is N-th layer controller issues road construction signaling, the control of N-1 layers to the subdomain controller N-1 layer controllers in domain where s and d nodes After device receives road construction signaling, according to the road construction demand, constraints and current network topological information of top level control device, control is utilized Zhi Qisuan roads module calculates k bar path candidates;Subdomain controller can calculate the cost of k bar path candidates while road construction, lead to The final path for determining cost minimization is as optimal path after crossing relatively.The controller in domain where access controller is included in s, directly The controller of adapter reason s nodes, after determining optimal path, optimal path is replied to access controller by global controller.
With in domain request when source node and destination node are directly managed by interlayer controller, as shown in figure 4, above-mentioned steps S32 is specifically included:
S322a:The controller of layer is opened up according to road construction demand, constraints and current network where source node and destination node Flutter information and calculate at least one path candidate;
S322b:The controller of layer where source node and destination node calculates the cost of at least one path candidate, and determine into This minimum path as optimal path, and upwards layer by layer recurrence to top layer global controller;
S322c:Optimal path is replied to access controller by global controller.
S and d nodes same area and directly managed by N (N >=2) layer controller, N (N >=2) layer controller in the present embodiment According to road construction demand, constraints and current network topological information, directly perform controller and calculate road module, calculate k bars time Routing footpath, the cost of k bar path candidates is calculated while road construction, the final path for determining cost minimization is as optimal path.
Second of situation, i.e., when service request is that cross-domain service is asked, above-mentioned steps S3 is specifically included:
S31’:It is determined that manage the controller of the source node and destination node;
S32’:The border gateway nodes in domain where determining source node and destination node, controller according to border gateway nodes with And road construction demand, constraints and current network topological information calculate at least one path candidate, and from least one candidate Determine the path with minimum cost as optimal path in path.
Further, in cross-domain request, when source node and destination node directly manage by subdomain controller, such as Fig. 5 Shown, above-mentioned steps S32 ' is specifically included:
S32’1a:The border gateway nodes GWs in domain where selecting source node and destination node respectively by top level control device and GWd;
S32’1b:Top level control device determines the domain sequence between GWs and GWd border gateway nodes;
S32’1c:Border gateway nodes between selected traveled through adjacent domains are as the peer node for calculating road;
S32’1d:The subdomain controller in domain where source node is sent to upper strata controller calculates road request;
S32’1e:Top level control device is according to domain sequence and selected peer node, based on current abstract network topology meter At least one path candidate is calculated, and road construction signaling is issued to the subdomain controller of traversal;
S32’1f:After the subdomain controller of traversal receives road construction signaling, according to the road construction demand of top level control device, constraint bar Part and current network topological information carry out road construction in domain respectively;
S32’1g:Subdomain controller calculates the cost in institute's road construction footpath respectively, and returns to top level control device recurrence is extremely layer by layer The global controller of top layer;
S32’1h:The path cost information that global controller is replied based on the subdomain controller traveled through, calculate at least one The cost of bar path candidate, and determine the path of cost minimization as optimal path;
S32’1i:Optimal path is replied to access controller by global controller.
In the present embodiment, s nodes and d fathers of node controller are according to domain sequence and selected peer node, based on current Abstract network topology, random to calculate k bar path candidates, the path cost information replied according to subdomain controller calculates k bars and waited The cost in routing footpath, the minimum path of alternative costs is as optimal path.When cross-domain request finds optimal path, equity is utilized Node improves the probability that selected path is optimal path, the border gateway nodes of so-called peer node, i.e. adjacent domains.Only Suitable peer node can be found, it is possible to reach the result of global optimum.
In cross-domain request, when source node and destination node directly manage by interlayer controller, as shown in fig. 6, above-mentioned Step S32 ' is specifically included:
S32’2a:The border gateway nodes GWs in domain where selecting source node and destination node respectively by top level control device and GWd;
S32’2b:Top level control device determines the domain sequence between GWs and GWd border gateway nodes;
S32’2c:Border gateway nodes between selected traveled through adjacent domains are as the peer node for calculating road;
S32’2d:Top level control device is opened up according to domain sequence and selected peer node based on current part abstract network , calculating at least one path candidate topological with part real network is flutterred, and road construction signaling is issued to the subdomain controller of traversal;
S32’2e:After the subdomain controller of traversal receives road construction signaling, according to the road construction demand of top level control device, constraint bar Part and current network topological information carry out road construction in domain respectively;
S32’2f:Subdomain controller calculates the cost in institute's road construction footpath respectively, and returns to top level control device recurrence is extremely layer by layer The global controller of top layer;
S32’2g:The path cost information and calculate road when institute time that global controller is replied based on the subdomain controller traveled through The cost information for the network element directly managed by top level control device gone through, calculate at least one path candidate cost, and determine into This minimum path is as optimal path;
S32’2h:Optimal path is replied to access controller by global controller.
In the present embodiment, because source node and destination node are directly managed by the manager of different layers, they are common Last layer manager will be based on the part real network topology between the part abstract network topology inside current domain and network element It is random to calculate k bar path candidates, and road construction signaling is issued to the subdomain controller of traversal, what the subdomain controller traveled through was replied Path cost information and the cost information for calculating the network element directly managed by top level control device traveled through during road, calculate k bar candidates The cost in path, the minimum path of alternative costs is as optimal path.
In cross-domain request, when one in source node and destination node directly manages by subdomain controller, another is by upper When layer controller directly manages, as shown in fig. 7, above-mentioned steps S32 ' is specifically included:
S32’3a:The border gateway nodes GWs in domain where selecting the source node and destination node respectively by top level control device And GWd;
S32’3b:Top level control device determines the domain sequence between GWs and GWd border gateway nodes;
S32’3c:Border gateway nodes between selected traveled through adjacent domains are as the peer node for calculating road;
S32’3d:The subdomain controller in domain where source node is sent to the top level control device calculates road request;
S32’3e:Top level control device is opened up according to domain sequence and selected peer node based on current part abstract network , calculating at least one path candidate topological with part real network is flutterred, and road construction signaling is issued to the subdomain controller of traversal;
S32’3f:After the subdomain controller of traversal receives road construction signaling, according to the road construction demand of top level control device, constraint bar Part and current network topological information carry out road construction in domain respectively;
S32’3g:Subdomain controller calculates the cost in institute's road construction footpath respectively, and returns to top level control device recurrence is extremely layer by layer The global controller of top layer;
S32’3h:The path cost information and calculate road when institute time that global controller is replied based on the subdomain controller traveled through The cost information for the network element directly managed by top level control device gone through, calculate at least one path candidate cost, and determine into This minimum path is as optimal path;
S32’3i:Optimal path is replied to access controller by global controller.
S nodes (or d) are directly managed by subdomain controller in the present embodiment, and d nodes (or s) are directly managed by interlayer controller During reason, the subdomain controller in domain is to upper strata controller from where s nodes, by their common upper level controllers based on current Part abstract network topology and the random calculating k bar path candidates of part real network topology, based on the subdomain controller traveled through The path cost information of reply and the cost information for calculating the network element directly managed by top level control device traveled through during road, calculate k The cost of bar path candidate, the path of final choice cost minimization is as optimal path.
As a preferred embodiment, the optimal path of cross-domain request can be expressed as in the present embodiment:
op(ns, nd)=op (ns, nbs)+op(nbs, nbd)+op(nbd,nd),
Wherein, op (ns, nd) represent source node nsWith destination node ndBetween optimal path, op (ns, nbs) represent source node nsBorder gateway nodes n between adjacent domainsbsBetween optimal path, op (nbs, nbd) represent adjacent domains between borde gateway section Point nbsBorder gateway nodes n between adjacent domainsbdBetween optimal path, op (nbd,nd) represent adjacent domains between borde gateway Node nbdWith destination node ndBetween optimal path.
If entrance domain includes m border gateway nodes, outlet domain includes n border gateway nodes, then at most existed M*n peer node.When calculating road, each pair peer node can realize that the probability in global optimum path is 1/m*n, if selection k K bar path candidates i.e. are established to peer node, then according to the cost function per paths, select optimal path, global optimum Probability bring up to 1- (1-1/m*n)k, it is as a result bigger for the probability of global optimum so that with k increase, specifically calculated in domain Roadbed calculates road module in controller.
Correspondingly, the present embodiment also includes a kind of controller, as shown in figure 8, including:At least one processor 210 and The memory 220 being connected with least one processor communication;Wherein, have can be by least one computing device for memory storage Instruction, is instructed by least one computing device, so that route determination side of at least one computing device based on layering multiple domain Method.The system can also include:Input block 230.
Processor 210, memory 220, input block 230 can be connected by bus 200 or other modes, in Fig. 3 Exemplified by being connected by bus 200.
Memory 220 is used as a kind of non-transient computer readable storage medium storing program for executing, available for storing non-transient software program, non- Transient computer executable program and module, as corresponding to the method for shortest path between the determination power equipment in the present embodiment Programmed instruction/module.
Processor 210 is stored in non-transient software program, instruction and module in memory 220 by operation, so as to Method in the various function application of execute server and data processing, i.e. the present embodiment.
Input block 230 can receive the numeral or character information of input, and produce the processing unit with list items operation User set and function control it is relevant key signals input.
One or more of modules are stored in the memory 220, when by one or more of processors During 210 execution, method as shown in Figure 2 is performed.
The said goods can perform the method that the embodiment of the present invention is provided, and possesses the corresponding functional module of execution method and has Beneficial effect.The ins and outs of detailed description, the correlation that for details, reference can be made in embodiment as shown in Figure 2 are not retouched in the present embodiment State.
Obviously, above-described embodiment is only intended to clearly illustrate example, and is not the restriction to embodiment.It is right For those of ordinary skill in the art, can also make on the basis of the above description it is other it is various forms of change or Change.There is no necessity and possibility to exhaust all the enbodiments.And the obvious change thus extended out or Among changing still in the protection domain of the invention.

Claims (11)

  1. A kind of 1. route determining methods based on layering multiple domain, it is characterised in that including:
    Obtain the source node identification and destination node information in service request;
    The type of the service request is determined according to the source node identification and destination node information;
    The optimal path of route is determined according to the type of the service request.
  2. 2. the route determining methods according to claim 1 based on layering multiple domain, it is characterised in that the type of the request Asked including same area service request and cross-domain service.
  3. 3. the route determining methods according to claim 2 based on layering multiple domain, it is characterised in that when the service request For same area service request when, it is described according to the type of the service request determine route optimal path the step of, including:
    It is determined that manage the controller of the source node and destination node;
    The controller calculates at least one path candidate according to road construction demand, constraints and current network topological information, And determine the path with minimum cost as optimal path from least one path candidate.
  4. 4. the route determining methods according to claim 3 based on layering multiple domain, it is characterised in that when the source node and When destination node directly manages by subdomain controller, the controller is controlled according to road construction demand, constraints and current net Network topology information calculates at least one path candidate, and the road with minimum cost is determined from least one path candidate Footpath as optimal path, including:
    As the domain where top level control device determines the source node and destination node;
    The subdomain controller in domain issues road construction signaling where the top level control device to the source node and destination node;
    After the subdomain controller in domain receives road construction signaling where the source node and destination node, according to the road construction need of top level control device Ask, constraints and current network topological information calculate at least one path candidate;
    The subdomain controller calculates the cost of at least one path candidate, and determines the path of cost minimization as optimal Path, and return to the top level control device layer by layer recurrence to top layer global controller;
    The optimal path is replied to access controller by the global controller.
  5. 5. the route determining methods according to claim 3 based on layering multiple domain, it is characterised in that when the source node and When destination node is directly managed by interlayer controller, the control controller is according to road construction demand, constraints and current Network topological information calculates at least one path candidate, and is determined from least one path candidate with minimum cost Path as optimal path, including:
    The controller of layer is according to road construction demand, constraints and current network topological information where the source node and destination node Calculate at least one path candidate;
    The controller of layer where the source node and destination node calculates the cost of at least one path candidate, and determines cost Minimum path is as optimal path, and upward recurrence layer by layer is to the global controller of top layer;
    The optimal path is replied to access controller by the global controller.
  6. 6. the route determining methods according to claim 2 based on layering multiple domain, it is characterised in that when the service request When being asked for cross-domain service, the described the step of optimal path routeing is determined according to the type of the service request, including:
    It is determined that manage the controller of the source node and destination node;
    The border gateway nodes in domain where determining the source node and destination node, the controller is according to the border gateway nodes And road construction demand, constraints and current network topological information calculate at least one path candidate, and from described at least one Determine the path with minimum cost as optimal path in bar path candidate.
  7. 7. the route determining methods according to claim 6 based on layering multiple domain, it is characterised in that when the source node and When destination node directly manages by subdomain controller, the control controller is according to road construction demand, constraints and current Network topological information calculate at least one path candidate, and from least one path candidate determine there is minimum cost Path as optimal path the step of, including:
    The border gateway nodes GWs and GWd in domain where selecting the source node and destination node respectively by top level control device;
    The top level control device determines the domain sequence between GWs and GWd border gateway nodes;
    Border gateway nodes between selected traveled through adjacent domains are as the peer node for calculating road;
    The subdomain controller in domain where the source node is sent to the top level control device calculates road request;
    The top level control device calculates at least one according to domain sequence and selected peer node based on current abstract network topology Bar path candidate, and issue road construction signaling to the subdomain controller of traversal;
    After the subdomain controller of traversal receives road construction signaling, according to the road construction demand of the top level control device, constraints and work as Preceding network topological information carries out road construction in domain respectively;
    The subdomain controller calculates the cost in institute's road construction footpath respectively, and return to the top level control device layer by layer recurrence to top layer Global controller;
    The path cost information that the global controller is replied based on the subdomain controller traveled through, calculate described at least one and wait The cost in routing footpath, and determine the path of cost minimization as optimal path;
    The optimal path is replied to access controller by the global controller.
  8. 8. the route determining methods according to claim 6 based on layering multiple domain, it is characterised in that when the source node and When destination node directly manages by interlayer controller, the control controller is according to road construction demand, constraints and current Network topological information calculate at least one path candidate, and from least one path candidate determine there is minimum cost Path as optimal path the step of, including:
    The border gateway nodes GWs and GWd in domain where selecting the source node and destination node respectively by top level control device;
    The top level control device determines the domain sequence between GWs and GWd border gateway nodes;
    Border gateway nodes between selected traveled through adjacent domains are as the peer node for calculating road;
    The top level control device is according to domain sequence and selected peer node, based on current part abstract network topology and part Real network topology, calculates at least one path candidate, and issue road construction signaling to the subdomain controller of traversal;
    After the subdomain controller of traversal receives road construction signaling, according to the road construction demand of top level control device, constraints and current Network topological information carries out road construction in domain respectively;
    The subdomain controller calculates the cost in institute's road construction footpath respectively, and returns to top level control device recurrence is complete to top layer layer by layer Office's controller;
    Path cost information that the global controller is replied based on the subdomain controller that is traveled through and calculating traveled through during road by The cost information for the network element that top level control device directly manages, calculates the cost of at least one path candidate, and determines cost Minimum path is as optimal path;
    The optimal path is replied to access controller by the global controller.
  9. 9. the route determining methods according to claim 6 based on layering multiple domain, it is characterised in that when the source node and One in destination node directly managed by subdomain controller, another is by top level control device when directly being managed, described in the control Controller calculates at least one path candidate according to road construction demand, constraints and current network topological information, and from described The step of path with minimum cost is as optimal path is determined at least one path candidate, including:
    The border gateway nodes GWs and GWd in domain where selecting the source node and destination node respectively by top level control device;
    The top level control device determines the domain sequence between GWs and GWd border gateway nodes;
    Border gateway nodes between selected traveled through adjacent domains are as the peer node for calculating road;
    The subdomain controller in domain where the source node is sent to the top level control device calculates road request;
    The top level control device is according to domain sequence and selected peer node, based on current part abstract network topology and part Real network topology, calculates at least one path candidate, and issue road construction signaling to the subdomain controller of traversal;
    After the subdomain controller of traversal receives road construction signaling, according to the road construction demand of the top level control device, constraints and work as Preceding network topological information carries out road construction in domain respectively;
    The subdomain controller calculates the cost in institute's road construction footpath respectively, and return to the top level control device layer by layer recurrence to top layer Global controller;
    Path cost information that the global controller is replied based on the subdomain controller that is traveled through and calculating traveled through during road by The cost information for the network element that top level control device directly manages, calculates the cost of at least one path candidate, and determines cost Minimum path is as optimal path;
    The optimal path is replied to access controller by the global controller.
  10. 10. the route determining methods based on layering multiple domain according to any one of claim 6-9, it is characterised in that institute Optimal path is stated to be expressed as:
    op(ns, nd)=op (ns, nbs)+op(nbs, nbd)+op(nbd,nd),
    Wherein, op (ns, nd) represent source node nsWith destination node ndBetween optimal path, op (ns, nbs) represent source node nsWith Border gateway nodes n between adjacent domainsbsBetween optimal path, op (nbs, nbd) represent adjacent domains between border gateway nodes nbs Border gateway nodes n between adjacent domainsbdBetween optimal path, op (nbd,nd) represent adjacent domains between border gateway nodes nbdWith destination node ndBetween optimal path.
  11. A kind of 11. controller, it is characterised in that including:At least one processor and with least one processor The memory of communication connection;Wherein, have can be by the instruction of at least one computing device, the finger for the memory storage Order by least one computing device so that described at least one computing device claim 1-10 based on point The route determining methods of layer multiple domain.
CN201710657780.0A 2017-08-03 2017-08-03 Routing determination method based on layered multi-domain and controller Active CN107465615B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201710657780.0A CN107465615B (en) 2017-08-03 2017-08-03 Routing determination method based on layered multi-domain and controller

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201710657780.0A CN107465615B (en) 2017-08-03 2017-08-03 Routing determination method based on layered multi-domain and controller

Publications (2)

Publication Number Publication Date
CN107465615A true CN107465615A (en) 2017-12-12
CN107465615B CN107465615B (en) 2020-05-05

Family

ID=60548277

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201710657780.0A Active CN107465615B (en) 2017-08-03 2017-08-03 Routing determination method based on layered multi-domain and controller

Country Status (1)

Country Link
CN (1) CN107465615B (en)

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110336753A (en) * 2019-06-19 2019-10-15 腾讯科技(深圳)有限公司 A kind of service calling method, device, equipment and the storage medium in across a network region
CN111030928A (en) * 2018-10-10 2020-04-17 中国移动通信有限公司研究院 Routing information determination method, node, system and storage medium
CN111083177A (en) * 2018-10-19 2020-04-28 中国电子科技集团公司第十五研究所 Cross-domain collaborative interaction method based on collaborative gateway
CN111163005A (en) * 2019-12-16 2020-05-15 联想(北京)有限公司 Information processing method, device, terminal and storage medium
CN111211890A (en) * 2019-12-31 2020-05-29 江苏省未来网络创新研究院 SDN-based network security defense system and working method thereof

Citations (12)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101699803A (en) * 2009-11-02 2010-04-28 北京科技大学 Inter-domain routing method based on distribution type multi-layer multi-domain optical network
CN104009871A (en) * 2014-06-06 2014-08-27 中国科学院声学研究所 SDN controller implementation method and SDN controller
EP2784993A1 (en) * 2013-03-29 2014-10-01 Alcatel Lucent Method and device for setting up paths between network elements belonging to different network domains of a software-defined network
CN104702512A (en) * 2013-12-06 2015-06-10 智梵网络科技有限公司 Hierarchical control in software-defined network (sdn)
CN104780056A (en) * 2014-01-13 2015-07-15 中国联合网络通信集团有限公司 Network management method and equipment
CN105282025A (en) * 2014-07-11 2016-01-27 中兴通讯股份有限公司 Method of determining end-to-end routing and apparatus thereof
CN105577540A (en) * 2015-12-08 2016-05-11 中国联合网络通信集团有限公司 Service link establishment method, device and system
CN105656771A (en) * 2014-11-12 2016-06-08 中国移动通信集团公司 Service path determining method, device and system
CN106302153A (en) * 2015-05-11 2017-01-04 中兴通讯股份有限公司 Multiple domain controller, single domain controller, software definition optical network system and method
CN106375214A (en) * 2016-11-10 2017-02-01 北京邮电大学 SDN-based tiered routing path determination method and device
CN106817306A (en) * 2015-11-27 2017-06-09 中国移动通信集团设计院有限公司 A kind of method and device for determining target route
US20170187606A1 (en) * 2015-12-29 2017-06-29 Futurewei Technologies, Inc. Communication Among Network Controllers

Patent Citations (12)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101699803A (en) * 2009-11-02 2010-04-28 北京科技大学 Inter-domain routing method based on distribution type multi-layer multi-domain optical network
EP2784993A1 (en) * 2013-03-29 2014-10-01 Alcatel Lucent Method and device for setting up paths between network elements belonging to different network domains of a software-defined network
CN104702512A (en) * 2013-12-06 2015-06-10 智梵网络科技有限公司 Hierarchical control in software-defined network (sdn)
CN104780056A (en) * 2014-01-13 2015-07-15 中国联合网络通信集团有限公司 Network management method and equipment
CN104009871A (en) * 2014-06-06 2014-08-27 中国科学院声学研究所 SDN controller implementation method and SDN controller
CN105282025A (en) * 2014-07-11 2016-01-27 中兴通讯股份有限公司 Method of determining end-to-end routing and apparatus thereof
CN105656771A (en) * 2014-11-12 2016-06-08 中国移动通信集团公司 Service path determining method, device and system
CN106302153A (en) * 2015-05-11 2017-01-04 中兴通讯股份有限公司 Multiple domain controller, single domain controller, software definition optical network system and method
CN106817306A (en) * 2015-11-27 2017-06-09 中国移动通信集团设计院有限公司 A kind of method and device for determining target route
CN105577540A (en) * 2015-12-08 2016-05-11 中国联合网络通信集团有限公司 Service link establishment method, device and system
US20170187606A1 (en) * 2015-12-29 2017-06-29 Futurewei Technologies, Inc. Communication Among Network Controllers
CN106375214A (en) * 2016-11-10 2017-02-01 北京邮电大学 SDN-based tiered routing path determination method and device

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
田睿,郁小松等: "《基于SDN的空间信息网络多路径承载策略》", 《无线电工程》 *

Cited By (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111030928A (en) * 2018-10-10 2020-04-17 中国移动通信有限公司研究院 Routing information determination method, node, system and storage medium
CN111083177A (en) * 2018-10-19 2020-04-28 中国电子科技集团公司第十五研究所 Cross-domain collaborative interaction method based on collaborative gateway
CN111083177B (en) * 2018-10-19 2022-10-11 中国电子科技集团公司第十五研究所 Cross-domain collaborative interaction method based on collaborative gateway
CN110336753A (en) * 2019-06-19 2019-10-15 腾讯科技(深圳)有限公司 A kind of service calling method, device, equipment and the storage medium in across a network region
CN110336753B (en) * 2019-06-19 2021-10-22 腾讯科技(深圳)有限公司 Cross-network-area service calling method, device, equipment and storage medium
CN111163005A (en) * 2019-12-16 2020-05-15 联想(北京)有限公司 Information processing method, device, terminal and storage medium
CN111211890A (en) * 2019-12-31 2020-05-29 江苏省未来网络创新研究院 SDN-based network security defense system and working method thereof

Also Published As

Publication number Publication date
CN107465615B (en) 2020-05-05

Similar Documents

Publication Publication Date Title
CN107465615A (en) A kind of route determining methods and controller based on layering multiple domain
Kotb et al. Cloud-based multi-agent cooperation for IoT devices using workflow-nets
Atif et al. Internet of things approach to cloud-based smart car parking
De Armas et al. Variable neighborhood search for a dynamic rich vehicle routing problem with time windows
CN109033718B (en) Dynamic emergency evacuation method for urban rail transit line failure
CN108540876A (en) Service path choosing method, SDN controllers, storage medium and electronic equipment
Li et al. A self-adaptive virtual network embedding algorithm based on software-defined networks
RU2016132883A (en) SYSTEM AND METHOD OF ZONING IN SOFTWARE DETERMINED NETWORKS
CN104113596A (en) Cloud monitoring system and method for private cloud
CN109446628A (en) The building of multilayer city traffic network and key node recognition methods based on complex network
CN105083336A (en) System and method for generating vehicle movement plans in a large railway network
CN109104464A (en) A kind of distributed data update method towards collaboration storage under edge calculations environment
Bi et al. Time-constrained big data transfer for SDN-enabled smart city
CN104363104B (en) A kind of magnanimity multivariate data battle state display System and method for of Users ' Need-oriented
Lam et al. Opportunistic routing for vehicular energy network
CN109286528A (en) A kind of SDN network multi-controller dispositions method based on time delay
CN105656771A (en) Service path determining method, device and system
CN109995580A (en) VN mapping method based on GA_PSO hybrid algorithm in 5G network slice
CN106780064A (en) A kind of region partitioning method, device and the network equipment
Hou et al. A novel method for solving the multiple traveling salesmen problem with multiple depots
CN110097218A (en) Unmanned commodity distribution method and system under changing environment when a kind of
CN106817306A (en) A kind of method and device for determining target route
Sergeeva et al. Dynamic airspace configurations generated by evolutionary algorithms
Knapen et al. Analysis of the co-routing problem in agent-based carpooling simulation
CN115714741A (en) Routing decision method and system based on collaborative multi-agent reinforcement learning

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
CB02 Change of applicant information
CB02 Change of applicant information

Address after: 102209 18 Riverside Avenue, Changping District science and Technology City, Beijing

Applicant after: Global energy Internet Institute, Inc.

Applicant after: Beijing University of Posts and Telecommunications

Applicant after: State Grid Zhejiang Electric Power Company

Applicant after: State Grid Corporation of China

Address before: 102209 18 Riverside Avenue, Changping District science and Technology City, Beijing

Applicant before: Global energy Internet Institute, Inc.

Applicant before: Beijing University of Posts and Telecommunications

Applicant before: State Grid Zhejiang Electric Power Company

Applicant before: State Grid Corporation of China

GR01 Patent grant
GR01 Patent grant