CN101651621A - Method and device for distributing network service routing - Google Patents
Method and device for distributing network service routing Download PDFInfo
- Publication number
- CN101651621A CN101651621A CN200910150252A CN200910150252A CN101651621A CN 101651621 A CN101651621 A CN 101651621A CN 200910150252 A CN200910150252 A CN 200910150252A CN 200910150252 A CN200910150252 A CN 200910150252A CN 101651621 A CN101651621 A CN 101651621A
- Authority
- CN
- China
- Prior art keywords
- node
- cost
- link
- route
- current business
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/12—Shortest path evaluation
Abstract
The invention discloses a method and a device for distributing network service routing. In the method, services to be routed are ordered and stored according to the priority order; each node in a network is provided with an available device with lowest cost by searching in a predetermined device storeroom and the device can use a cross board with lowest cost; each services is respectively acquiredas the current service according to the priority order; the current service is distributed with routing according to the preset rules, and the configuration of node devices passing through by the routing is changed according to the current service, so that consumed cost right value of the routing passed by the current service is lower than those of multiple optional routing, wherein the cost right value comprises cost right values of nodes and links. According to the technical scheme, the planning results of the entire network with low cost can be obtained, and nodes passed by service routingcan be provided with devices meeting requirements.
Description
Technical field
The present invention relates to the communications field, in particular to a kind of Network route distribution method and device.
Background technology
In transmitting net, introduce ASON (Automatically SwitchedOptical Network, abbreviate ASON as) after the technology, the network topology structure complexity, the business demand amount is big, and service needed can dynamically be recovered when breaking down, and therefore, makes the manual planning mode that is used for legacy network be difficult to meet consumers' demand, because its troublesome poeration, and be difficult to obtain more excellent planning effect.At the problems referred to above, the automated network planning software can address this problem.
The network planning need be finished following two basic functions: professional route and node device configuration, because different user may be different to network planning result's target call, cost optimization should be the focus that most of users pay close attention to.Network cost is mainly reflected on optical fiber cost and the node device cost, the target of cost optimization be exactly the professional route of distributing the node of process can both dispose the equipment that satisfies the demands, and the total cost of optical fiber that uses and equipment is minimum.
In the correlation technique, simple relatively network plan method is that professional route and equipment disposition are divided into the processing of two steps, the first step, choose professional route according to planning targets such as minimum hop count or shortest paths, in second step, the cross-capacity and the port operating position of the node that obtains according to professional route results are carried out equipment disposition.Cost optimization was mainly reflected in for second step when giving node configuration equipment, if there are a plurality of equipment to satisfy the demands in the equipment library, and the minimum equipment of alternative costs then.There are following two technical problems in such scheme: at first, do not consider cost factor in the routing procedure, consider that in the equipment disposition process there is significant limitation in cost optimization again, all can't obtain the more excellent program results of cost under a lot of situations; Secondly, on the fixed basis of route, carry out equipment disposition and may exist some node can't be configured to the equipment that satisfies the demands, cause program results unavailable.
Summary of the invention
There is big limitation at cost optimization in the correlation technique, and possibly can't be configured to the problem of the equipment that satisfies the demands and propose the present invention, for this reason, main purpose of the present invention is to provide a kind of improved Network route assignment scheme, one of to address the above problem at least.
According to an aspect of the present invention, provide a kind of Network route distribution method.
Network route distribution method according to the present invention comprises: will treat that routing service sorts according to priority orders and preserves; In the premise equipment storehouse, search, for equipment and this equipment that each the node configuration cost in the network is minimum can be used and the minimum cross board of cost; Obtain every business respectively according to priority orders, as current business; For current business, distribute route according to preset rules, and according to the node device configuration of current business demand change route process, make current business through this route, expend the least cost weights with comparing through the too much optional route of bar, wherein, the cost weights comprise: the cost weights of node that route comprises and link.
According to a further aspect in the invention, provide a kind of Network route assignment device.
Network route assignment device according to the present invention comprises: memory cell, unit, acquiring unit, allocation units are set, wherein, memory cell is used for the routing service for the treatment of that sorts according to priority orders is stored; Equipment and this equipment that each the node configuration cost in the network is minimum the unit is set, is used for searching, for can be used and the minimum cross board of cost in the premise equipment storehouse; Acquiring unit is used for obtaining every business respectively as current business according to priority orders from memory cell; Allocation units, be used for distributing route according to preset rules, and according to the node device configuration of current business demand change route process, make current business through this route, expend the least cost weights with comparing through the too much optional route of bar, wherein, the cost weights comprise: the cost weights of node that route comprises and link.
By the present invention, shortest path first according to professional route dynamic calculation weights, from many feasible paths of current business correspondence, select and configure the minimum route of cost, carrying route as current business, solved the big limitation of cost optimization existence in the correlation technique, and possibly can't be configured to the problem of the equipment that satisfies the demands, and then can obtain the more excellent program results of the whole network cost, and professional route the node of process can both dispose the equipment that satisfies the demands.
Other features and advantages of the present invention will be set forth in the following description, and, partly from specification, become apparent, perhaps understand by implementing the present invention.Purpose of the present invention and other advantages can realize and obtain by specifically noted structure in the specification of being write, claims and accompanying drawing.
Description of drawings
Accompanying drawing described herein is used to provide further understanding of the present invention, constitutes the application's a part, and illustrative examples of the present invention and explanation thereof are used to explain the present invention, do not constitute improper qualification of the present invention.In the accompanying drawings:
Fig. 1 is the flow chart according to the Network route distribution method of the embodiment of the invention;
Fig. 2 is the flow chart of Network route distribution method according to the preferred embodiment of the invention;
Fig. 3 is the detail flowchart at the minimum route of a service selection and deployment cost according to the embodiment of the invention;
Can Fig. 4 be through the detail flowchart of certain bar link according to a certain business of the judgement of the embodiment of the invention;
Fig. 5 is the network topology structure schematic diagram of the example according to the present invention;
Fig. 6 is a structural representation of determining device according to the route of the Network of the embodiment of the invention;
Fig. 7 determines the structural representation of device for the route of Network according to the preferred embodiment of the invention.
Embodiment
Functional overview
The embodiment of the invention provides the route of improved Network to determine scheme, shortest path first according to professional route dynamic calculation weights, from many feasible paths of current business correspondence, select and configure the minimum route of cost weights, as the carrying route of current business.In embodiments of the present invention, will treat that at first routing service sorts according to priority orders and preserves; In the premise equipment storehouse, search afterwards, for equipment and this equipment that each the node configuration cost in the network is minimum can be used and the minimum cross board of cost; Obtain every business respectively according to priority orders again, as current business; For current business, distribute route according to preset rules, and according to the node device configuration of current business demand change route process, make current business through this route, expend the least cost weights with comparing through the too much optional route of bar, wherein, the cost weights comprise: the cost weights of node that route comprises and link.
Under the situation of not conflicting, embodiment and the feature among the embodiment among the application can make up mutually.
Below in conjunction with accompanying drawing the preferred embodiments of the present invention are described, should be appreciated that preferred embodiment described herein only is used for description and interpretation the present invention, and be not used in qualification the present invention.
Method embodiment
According to the embodiment of the invention, at first provide a kind of Network route distribution method.
Fig. 1 is the flow chart according to the Network route distribution method of the embodiment of the invention.As shown in Figure 1, the Network route distribution method according to the embodiment of the invention mainly comprises following processing (step S101-step S103):
Step S101: all business are sorted according to priority orders and preserve;
Preferably, for the business for the treatment of route, at first above-mentioned business is sorted according to priority orders, preferably, above-mentioned priority can be determined for standard according to the service attribute of business (for example, Ye Wu protection and recover attribute), traffic carrying capacity etc.For example, if treat that the protection of routing service is identical with the recovery attribute, then can sort from big to small according to traffic carrying capacity.
Preferably, after the above-mentioned business of having determined priority is sorted in order.And this is stored in proper order, preferably, can store by the mode of service lists.
Step S103: in the premise equipment storehouse, search, for equipment and this equipment that each the node configuration cost in the network is minimum can be used and the minimum cross board of cost;
Preferably, in predetermined equipment library, at first carry out initial configuration according to the node that comprises in the network topology structure, wherein, can in the premise equipment storehouse, search, with the minimum equipment of cost in the equipment disposition equipment library of each node in the network, and be that this equipment of this equipment disposition can be used and the minimum cross board of cost.
Step S105: obtain every business respectively according to priority orders, as current business;
Step S107: for current business, distribute route according to preset rules, and according to the node device configuration of current business demand change route process, make current business through this route, expend the least cost weights with comparing through the too much optional route of bar, wherein, the cost weights comprise: the cost weights of node that route comprises and link.
Preferably, above-mentioned preset rules is the Network route assignment rule of setting according to the present invention, among the step S107, distribute route, and comprise according to the node device configuration of current business demand change route process and mainly to comprise following processing (steps A-step G) according to preset rules:
Steps A. all nodes that network is set are first preset value to the cost of the source node of current business, and the state of all nodes in the network is set, with source node as present node;
Preferably, in the route deterministic process of business, for each node, can write down following information: the professional cost weights, forerunner's node, optical fiber (preferably, between two nodes, can have one or more optical fiber), the information such as routing state of node that are routed to this node from source node from forerunner's node to this node process.Wherein, can write down routing state in the following manner :-1: expression does not find source node to arrive the route of this node; 0: expression has found source node to arrive the route of this node but uncertain optimum; 1: expression has found source node to arrive the best route of this node.If realize a plurality of objects of planning simultaneously, for example, minimum hop count, shortest path, and maximum reliability, then each node also needs to write down jumping figure, path and the reliability that is routed to this node from professional source node.
Step B. searches undressed link in all links that are connected with the present node of current business in network;
Step C. is for every link in the undressed link, whether business board, cross board and the equipment of judging two end nodes of the link capacity of link and link correspondence satisfy the current business demand, if not, then enlarge link capacity, and configuration service plate, cross board and equipment, wherein, the link capacity after the expansion is less than intrinsic maximum link capacity;
Preferably, for above-mentioned expansion link capacity, and configuration service plate, cross board and equipment can be realized by following processing:
At first, judge whether link has the capacity of carrying current business, and if not, then the capacity with link enlarges at double, and until carrying current business, wherein, the link capacity after the expansion is less than the intrinsic maximum link capacity of link;
Preferably, for above-mentioned link, for example, optical fiber link is limited by the optical fiber maximum rate, and in the process of bearer service, its actual capacity can be planned according to business demand, but value is STM-1～STM256, but its speed is no more than maximum rate.
Secondly, under the extended situation of the capacity of link, according to the business board configuration of current business demand change present node and next node;
For example, the optical fiber speed after the expansion is STM-n, and this optical fiber must be connected on the port of STM-n, needs the business board configuration of change optical fiber two end nodes, if change business board configuration failure, then definite this business can not be passed through this optical fiber.Wherein, the rule of change node traffic plate configuration is: whether all business boards of at first considering the current configuration of node have the idle port of STM-n speed, if the veneer that has direct modification optical fiber to connect, otherwise whether the equipment of checking the current configuration of node can also add the veneer of STM-n speed, if could would add a veneer and revise the veneer that optical fiber connects, otherwise node must be changed the equipment that speed is bigger, need in all equipment that can meet the demands, select a cost minimum, if do not find the equipment that satisfies the demands then change node traffic plate configuration failure.
Once more, judge whether the cross board capacity of present node and next node satisfies the current business demand, if not, then change the cross board configuration.
Preferably, the step of change node cross board configuration comprises: at first consider to enlarge the cross board capacity that has disposed, concrete rule is for constantly replacing to the bigger and cross board that cost is minimum of cross-capacity with the cross board of current capacity minimum, satisfies the demands or all cross boards of having disposed have all replaced to the cross-capacity maximum up to cross-capacity.If all cross boards all replace to behind the cross board of heap(ed) capacity cross-capacity and still do not satisfy the demands then consider and add some cross boards to node, add the minimum cross board of a block cost earlier, if capacity is not enough it is replaced to the bigger and cross board that cost is minimum of cross-capacity, still do not satisfy the demands behind the cross board of maximum cross-capacity then add a cross board again if change into, this process that circulates satisfies the demands or all available slot items have all been plugged the cross board of heap(ed) capacity up to cross-capacity.If all available slot items are all plugged and are not still satisfied business demand behind the cross board of heap(ed) capacity then can only change the equipment that cross-capacity is bigger to node, also need be in the equipment that can meet the demands alternative costs minimum, change node cross board configuration failure if all devices does not all satisfy the demands.
Step D. is according to the result after disposing, calculate current business is routed to next node through this optical fiber value at cost, if this value at cost cost weights more current than next node are little, then upgrade the cost weights of next node, and forerunner's node of next node is changed to present node, and the routing state that present node is set is optional state;
Preferably, current business is routed to the cost of next node this jump through value at cost (being current business is routed to next node through this link (for example, optical fiber) cost the weights)=cost weights+business of present node that this optical fiber is routed to next node from present node.
Preferably, business further comprises link (for example, optical fiber) cost weights and next node cost weights from the cost that present node is routed to the next node this jump, can calculate in the following manner:
Wherein, optical fiber cost=optical fiber total cost * volume of business/fiber capacity.
Wherein, if node has been changed equipment, the node cost is new equipment cost-original equipment cost, otherwise for intersecting cost+port cost.The node cost is considered present node and next node simultaneously.
Wherein, if node is not changed cross board, then intersect cost=total cross-capacity of cross board total cost * volume of business/cross board, otherwise, the exchange device more not if node has been changed cross board then intersects the preceding cross board total cost of cross board total cost-replacing after cost=replacings.
If optical fiber does not enlarge capacity, veneer port unit cost * traffic carrying capacity/veneer port speed of connecting of port cost=optical fiber then, otherwise, if optical fiber uses is the existing idle port of equipment, the veneer port unit cost that connects of port cost=optical fiber then; A new business board, then the business board cost of port cost=increase have been used if increase.
Wherein, above-mentioned link includes but are not limited to optical fiber link.Concrete weights account form can be decided according to actual conditions.
Step e. judge in the optical fiber tabulation that links to each other with present node whether have untreated optical fiber, if return step C;
Step F. check that whether having routing state is the node of optional state, if there is no, then distribute routing failure for current business;
Step G. chooses the node of cost weights minimum or choose one wantonly in the node of a plurality of cost weights minimums in the node that current all routing states are optional state.The node of choosing is set to present node, and routing state is set to find source node to arrive the best routing state of this node.If present node is the destination node of current business, then obtain the carrying route of current business, otherwise, return execution in step B.
Preferably, if will consider a plurality of objects of planning simultaneously during planning, during calculating, then above-mentioned cost weights summation need the while computing service to be routed to each target weights (cost, jumping figure, path or reliability) of next node, with the current weight of next node relatively the time, can at first compare first object of planning weights, if first object of planning weights equate, compare second object of planning weights again, the rest may be inferred.
Preferably, if with not only one of minimum cost weights summation link corresponding, be many, can from this multilink, choose wantonly one as the carrying current business link.
Preferably, if the next node of the link of the carrying current business of selecting is the destination node of current business, can obtain this professional route of carrying by the mode that destination node dates back to last node.Otherwise, next node as present node, is returned and is carried out above-mentioned steps B.
The route of above-mentioned Network determines that method is not only applicable to the SDH network, can also be applicable to ASON network and traditional sluggish network.And be not limited only to this, under the situation of not conflicting, can also be applicable to other networks.
By the foregoing description, a kind of Network route distribution method is provided, adopt the method can obtain the more excellent program results of the whole network cost, and professional route the node of process can both dispose the equipment that satisfies the demands.
Fig. 2 is the flow chart of Network route distribution method according to the preferred embodiment of the invention.As shown in Figure 2, the Network route distribution method mainly comprises following processing (step S201-step S209) according to the preferred embodiment of the invention:
Step S201: the service lists that will treat route is according to the grade of service and traffic carrying capacity descending;
Preferably, the business for the treatment of route is arranged according to priority orders, wherein, priority orders can be waited to determine by the protection and the recovery attribute of business.
Step S203: allocate the equipment that fixed cost is minimum in advance for each node, and dispose this equipment cross board that can use, that cost is minimum, but configuration service plate not;
Step S205: from the service lists for the treatment of route, obtain a pending business according to the order of sequence;
Step S207: give above-mentioned traffic assignments route, and give cost on the node of this route process and the link configuration minimum and satisfy the equipment of business demand;
Wherein, the process of specifically distributing route repeats no more referring to the description among Fig. 1 herein.
Step S209: in service lists, search whether there is untreated business, if, return execution in step S205, if not, process ends then.
Fig. 3 is the detail flowchart at the minimum route of a service selection and deployment cost according to the embodiment of the invention.As shown in Figure 3, mainly comprise following processing (step S301-step S317) at a service selection and the minimum route of deployment cost:
Step S301: the routing state of all nodes of initialization is-1, is 0 to the cost weights of source node.The service source node is made as present node (CurNode), and routing state is changed to 1.
Wherein, routing state is set to-1 or 0 or 1, is in order to identify the state of this node better in routing process, to be convenient to according to above-mentioned ident value route be selected.
Step S303: obtain the optical fiber tabulation that links to each other with CurNode;
For example, the continuous optical fiber link of present node has: optical fiber 1, optical fiber 2, optical fiber 3 then comprises these three optical fiber in this tabulation.
Step S305: from the optical fiber tabulation, take out a untreated optical fiber, if the other end node in optical fiber two end nodes except that CurNode is next node (NextNode), if the routing state of NextNode is 1, execution in step S311 then, otherwise, execution in step S307;
Step S307: can the inspection business through this optical fiber link to next node (NextNode), if, execution in step S309 then, otherwise, execution in step S311 then;
Wherein, can the inspection business through this optical fiber link to next node, need to judge whether fiber capacity and optical fiber two end node devices capacity can satisfy business demand, if can not satisfy, can enlarge fiber capacity and change the equipment disposition of optical fiber two end nodes, but can not surpass the restriction of optical fiber maximum rate.The specific implementation step can repeat no more referring to the description among Fig. 1 herein.
Step S309: calculate the professional value at cost NewCost that is routed to NextNode through this optical fiber, if NewCost cost weights more current than NextNode are littler, the cost weights that then upgrade NextNode are NewCost, and forerunner's node of NextNode is changed to CurNode, routing state is changed to 0;
Step S311: judge in the optical fiber tabulation that links to each other with CurNode whether have untreated optical fiber;
Step S313: check that whether have routing state is 0 node, if not, and then professional routing failure, process ends, if, execution in step then;
Step S315: find out all routing states and be the node of cost weights minimum in 0 the node, if exist a plurality of then select one at random.The node that finds is changed to CurNode, and routing state is changed to 1, if CurNode is not destination node (destination node), and execution in step S303 then, otherwise, execution in step S317;
Step S317: the route previous dive nodal information according to each nodes records turns back to source node from professional destination node, then forms this professional route, and distribution service takies time slot in the optical fiber of process, upgrades the node device configuration of process.
Can Fig. 4 be through the detail flowchart of certain bar link according to a certain business of the judgement of the embodiment of the invention.As shown in Figure 4, can mainly comprise following processing (step S401-step S421) through certain bar link according to a certain business of the judgement of the embodiment of the invention:
Step S401: check whether optical fiber has enough idle capacities, if, execution in step S403, otherwise, execution in step S407;
Step S403: check whether fiber capacity has reached maximum rate, if then this business can not be passed through this optical fiber, process ends, if not, execution in step S405 then;
Step S405: the fiber capacity expansion is twice;
Step S407: the capacity of judging this optical fiber is through enlarging, if, execution in step S409 then, otherwise, execution in step S417;
Step S409: the business board configuration of change present node and next node;
Step S411: whether the business board configuration of judging change present node and next node is all successful, if then execution in step 413, otherwise, then return execution in step S403;
Step S413: whether the cross board capacity of judging present node and next node satisfies the current business demand, if, execution in step S419, otherwise, execution in step S415;
Step S415: the cross board configuration of change next node;
Step S417: judge whether all success of change cross board configuration, if, execution in step S419, otherwise, execution in step S421;
Step S419: determine that business can pass through this optical fiber;
Step S421: determine that business can not pass through this optical fiber.
Fig. 5 is the network topology structure schematic diagram of the example according to the present invention.Wherein, this example is described a SDH network planning process in detail, as shown in Figure 5, the network topology structure of example comprises node and optical fiber link according to the present invention, wherein, there is shown six optical fiber links, be respectively: optical fiber 1, optical fiber 2, optical fiber 3, optical fiber 4, optical fiber 5 and optical fiber 6; There is shown five nodes, be respectively: node A, Node B, node C, node D, node E.Specifically describe this example below in conjunction with above-mentioned network topology structure.
There are following five business to treat route, as follows respectively:
Professional 1:A-＞B, 2 STM-1
Professional 2:A-＞C, 2 STM-1
Professional 3:B-＞C, 1 STM-1
Professional 4:B-＞D, 1 STM-1
Professional 5:C-＞E, 1 STM-1
Wherein, for above-mentioned business, the protection of this business is identical with the recovery attribute.In this network topology structure, every of the cost of optical fiber link is 20.
In equipment library, created following business board, wherein, comprising: OL1, OL4
OL1: speed is STM-1, and fixed cost is 10, and port number is 4, and the port unit cost is 20
OL4: speed is STM-4, and fixed cost is 40, and port number is 1, and the port unit cost is 80
In equipment library, also created following cross board:
CS: cross grain is VC4, and the cross unit number is 100, and the cost that intersects is 100
In equipment library, also created following equipment:
Device1: maximum rate is STM-1, and fixed cost is 100, and available business board is OL1, and the available slot item is 1,2, and cross board is CS, and the available slot item is 3,4.
Device2: maximum rate is STM-4, and fixed cost is 200, and available business board is OL1 and OL4, and the available slot item is 1,2,3,4; Available cross board is CS, and the available slot item is 5,6.
Route according to the Network of the embodiment of the invention determines to comprise following processing:
(1) professional ordering, because the grade of service of above-mentioned 5 business is identical, sorting from big to small by traffic carrying capacity is: professional 1-＞professional 2-＞professional 3-＞professional 4-＞business 5;
(2) give the pre-configured equipment that fixed cost is minimum of node, node A, B, C, D, E all select Device1, and plug the CS veneer.
(3) at first give professional 1 to distribute route, initialization node weights are as shown in table 1.
Table 1
| Node | Cost | Forerunner's node | Routing state | Equipment disposition |
| ??A | ??0 | ??- | ??1 | Equipment: Device1 veneer: CS |
| ??B | ??0 | ??- | ??-1 | Equipment: Device1 veneer: CS |
| ??C | ??0 | ??- | ??-1 | Equipment: Device1 |
| Veneer: CS | ||||
| ??D | ??0 | - | ??-1 | Equipment: Device1 veneer: CS |
| ??E | ??0 | - | ??-1 | Equipment: Device1 veneer: CS |
(4) obtain the optical fiber that node A links to each other: optical fiber 1 and optical fiber 2.Consider that at first professional route is through optical fiber 1, then the speed needs according to professional 1 traffic carrying capacity optical fiber 1 are planned to STM-4, node A and Node B need be replaced by Device2 with Device1, and plug OL4 veneer and CS veneer, the cost that expends is: the cost weights of node A+(cost/2 of the fixed cost of the fixed cost of Device2+OL4 veneer cost+CS veneer cost-Devicel-CS veneer cost+optical fiber 1) * 2=460.
Wherein, to the processing of optical fiber 2 with similar to the processing of optical fiber 1.As shown in table 2 behind the cost right value update of Node B and node C.
Table 2
| Node | Cost | Forerunner's node | Routing state | Equipment disposition |
| ??A | ??0 | ??- | ??1 | Equipment: Device2 veneer: CS, OL4 |
| ??B | ??460 | ??A | ??0 | Equipment: Device2 veneer: CS, OL4 |
| ??C | ??460 | ??A | ??0 | Equipment: Device2 veneer: CS, OL4 |
| ??D | ??0 | - | ??-1 | Equipment: Device1 veneer: CS |
| ??E | ??0 | - | ??-1 | Equipment: Device1 veneer: CS |
(5) selecting routing state from node A, B, C is 0 and the node of cost weights minimum, and the value at cost of B and C is identical, selects one at random, supposes to select B, and then B is business purpose node (destination node), and professional 1 route finishes, and route is from A to B, through optical fiber 1.
(6) professional 2 routing procedure and business 1 are similar, repeat no more, and route results is from A to C, through optical fiber 2.
(7) give professional 3 to seek route then, initialization node weights are as shown in table 3.
Table 3
| Node | Cost | Forerunner's node | Routing state | Equipment disposition |
| ??A | ??0 | ??- | ??-1 | Equipment: Device2 veneer: CS, OL4 (2) |
| ??B | ??0 | ??- | ??1 | Equipment: Device2 veneer: CS, OL4 |
| ??C | ??0 | ??- | ??-1 | Equipment: Device2 veneer: CS, OL4 |
| ??D | ??0 | ??- | ??-1 | Equipment: Device1 |
| Veneer: CS | ||||
| ??E | ??0 | - | ??-1 | Equipment: Device1 veneer: CS |
(8) all optical fiber that find Node B to be connected: optical fiber 1, optical fiber 3 and optical fiber 4.If professional route is through optical fiber 1, optical fiber 1 just has the idle time slot of a STM-1, do not need to revise the equipment disposition of node A and Node B, the port cost that node A expends is: (professional 3 numbers of the professional 3 speed * of OL4 veneer port cost */OL4 veneer speed=20, the intersection cost that node A expends is: CS veneer cost * (professional 3 numbers of professional 3 speed */cross grain * 2)/cross unit number=2, Node B is identical with the intersection cost with the port cost that node A expends, and the professional cost that expends from B to A through optical fiber 1 is: 2* (port cost+intersection cost)+optical fiber cost/4=49.Consider route again through optical fiber 3, then the speed of optical fiber 3 is planned to STM-1, and Node B and node C need to insert an OL1 plate again, and the professional cost that expends from B to C through optical fiber 3 is: 2* (OL1 veneer cost+intersection cost)+optical fiber cost=204.Route is similar through the result of optical fiber 4 and optical fiber 3, and more the weights of new node A, C, E are as shown in table 4.
Table 4
| Node | Cost | Forerunner's node | Routing state | Equipment disposition |
| ??A | ??49 | ??B | ??0 | Equipment: Device2 veneer: CS, OL4 (2) |
| ??B | ??0 | ??- | ??1 | Equipment: Device2 veneer: CS, OL4 |
| ??C | ??204 | ??B | ??0 | Equipment: Device2 veneer: CS, OL4, |
| ?OL1 | ||||
| ??D | ??0 | ??- | ??-1 | Equipment: Device1 veneer: CS |
| ??E | ??204 | ??B | ??0 | Equipment: Device1 veneer: CS, OL1 |
(9) find the node of cost weights minimum in all routing states are 0 node, select A, the routing state of A is changed to 1.
(10) obtain the optical fiber that links to each other with node A: optical fiber 1 and optical fiber 2.Optical fiber 1 is the professional optical fiber of process, the no longer consideration from A to the B route.If professional route is through optical fiber 2, because optical fiber 2 just has the time slot free time of a STM-1, so node A and node C do not need to change equipment disposition, the cost of professional process optical fiber 2 from A to C is: 2* port cost+intersection cost+optical fiber cost/4=47, the intersection cost of a computing node C herein is because the intersection cost of node A counts to the A this jump from B.Professional is node A cost weights+47=96 from B via the cost that A is routed to C, and the cost weights 204 more current than node C are littler, and the weights that renewal C is ordered are as shown in table 5.
Table 5
| Node | Cost | Forerunner's node | Routing state | Equipment disposition |
| ??A | ??49 | ??B | ??1 | Equipment: Device2 veneer: CS, OL4 (2) |
| ??B | ??0 | ??- | ??1 | Equipment: Device2 veneer: CS, OL4, OL1 |
| ??C | ??96 | ??A | ??0 | Equipment: Device2 |
| Veneer: CS, OL4, OL1 | ||||
| ??D | ??0 | ??- | ??-1 | Equipment: Device1 veneer: CS |
| ??E | ??204 | ??B | ??0 | Equipment: Device1 veneer: CS, OL1 |
(11) finding routing state is that the node of cost weights minimum is C in 0 the node, and C has been the business purpose node.So professional 3 routes finish, route is from B-＞A-＞C, successively via optical fiber 1 and optical fiber 2.
(12) professional 4 route deterministic process and business 3 are similar, because optical fiber 1 and optical fiber 2 also have the idle capacity of a STM-1, do not need to change the equipment disposition of Node B, A, C, if walked optical fiber 3 Node B and C need to insert an OL1 veneer cost again can be higher, so professional 4 route can be selected B-＞A-＞C-＞D, passes through optical fiber 1, optical fiber 2 and optical fiber 4 successively.
(13) give professional 5 to seek route at last, initialization node weights are as shown in table 6.
Table 6
| Node | Cost | Forerunner's node | Routing state | Equipment disposition |
| ??A | ??0 | ??- | ??-1 | Equipment: Device2 veneer: CS, OL4 (2) |
| ??B | ??0 | ??- | ??-1 | Equipment: Device2 veneer: CS, OL4 |
| ??C | ??0 | - | ??1 | Equipment: Device2 veneer: CS, OL4, OL1 |
| ??D | ??0 | - | ??-1 | Equipment: Device1 veneer: CS, OL1 |
| ??E | ??0 | - | ??-1 | Equipment: Device1 veneer: CS |
(14) obtain the optical fiber that node C is connected: optical fiber 2, optical fiber 3, optical fiber 4.If professional 5 through optical fiber 2, then the speed of optical fiber 2 must expand STM-16 to, but does not have the veneer of STM-16 and above speed in the equipment library, so professional 5 can not pass through optical fiber 2.If select optical fiber 3, then optical fiber 3 speed are planned to STM-1, and node C just has the idle port of STM-1, and Node B need increase an OL1 veneer, and the cost that expends is that OL1 port cost+OL1 veneer cost+2* intersects cost+optical fiber cost=134.If select optical fiber 4, then the speed of optical fiber 4 must be expanded as STM-4, and node C and node D must replace with the OL1 veneer OL4 veneer, and the cost that expends is 2* (OL4 veneer cost-OL1 veneer cost+intersection cost)+optical fiber cost/4=69.The weights that upgrade Node B and node D are as shown in table 7.
Table 7
| Node | Cost | Forerunner's node | Routing state | Equipment disposition |
| ??A | ??0 | ??- | ??-1 | Equipment: Device2 veneer: CS, OL4 (2) |
| ??B | ??134 | ??C | ??0 | Equipment: Device2 |
| Veneer: CS, OL4, OL1 | ||||
| ??C | ??0 | ??- | ??1 | Equipment: Device2 veneer: CS, OL4, OL1 |
| ??D | ??69 | ??C | ??0 | Equipment: Device1 veneer: CS, OL1 |
| ??E | ??0 | ??- | ??-1 | Equipment: Device1 veneer: CS |
(15) be that the node of alternative costs weights minimum 0 the node is D from all routing states, the routing state of D is changed to 1.
(16) obtain the optical fiber that is connected with node D: optical fiber 4 and optical fiber 5, optical fiber 4 are the optical fiber from C to the D process, no longer consider.If it is professional through optical fiber 5, then node D and node E need to increase an OL1 veneer, the cost that expends is 2*OL1 veneer cost+intersection cost+optical fiber cost=202, professional is cost weights+202=271 of node D from node C through the cost that optical fiber 5 is routed to node E, and more the weights of new node E are as shown in table 8.
Table 8
| Node | Cost | Forerunner's node | Routing state | Equipment disposition |
| ??A | ??0 | ??- | ??-1 | Equipment: Device2 veneer: CS, OL4 (2) |
| ??B | ??134 | ??C | ??0 | Equipment: Device2 veneer: CS, OL4, |
| ?OL1 | ||||
| ??C | ??0 | ??- | ??1 | Equipment: Device2 veneer: CS, OL4, OL1 |
| ??D | ??69 | ??C | ??1 | Equipment: Device1 veneer: CS, OL4 |
| ??E | ??271 | ??D | ??0 | Equipment: Device1 veneer: CS, OL1 |
(17) be that the node of alternative costs weights minimum 0 the node is B from all routing states, the routing state of Node B is changed to 1.
(18) obtain all optical fiber that link to each other with Node B: optical fiber 1, optical fiber 3 and optical fiber 6.If business passes through optical fiber 1 then the speed of optical fiber 1 must expand STM-16 to, and does not have the optical fiber of STM-16 and above speed in the equipment library, so business 5 can not be passed through optical fiber 1; Optical fiber 3 is the optical fiber of process, no longer considerations from C to the Node B; If through optical fiber 6 then Node B just has the idle port of STM-1, and node E need increase OL 1 veneer, the cost that expends is OL1 port cost+OL1 veneer cost+intersection cost+optical fiber cost=132, professional is the cost weights+132=266 of Node B from node C through the cost that optical fiber 6 is routed to node E, the cost weights more current than node E are littler, and more the cost weights of new node E are as shown in table 9.
Table 9
| Node | Cost | Forerunner's node | Routing state | Equipment disposition |
| ??A | ??0 | ??- | ??-1 | Equipment: Device2 veneer: CS, OL4 (2) |
| ??B | ??134 | ??C | ??1 | Equipment: Device2 veneer: CS, OL4, OL1 |
| ??C | ??0 | ??- | ??1 | Equipment: Device2 veneer: CS, OL4, OL1 |
| ??D | ??69 | ??C | ??1 | Equipment: Device1 veneer: CS, OL4 |
| ??E | ??271 | ??B | ??0 | Equipment: Device1 veneer: CS, OL1 |
(19) be that the littler node of alternative costs weights is E 0 the node from all routing states, and E has been professional destination node, professional 5 routes finish, and route is C-＞B-＞E, passes through optical fiber 3 and optical fiber 6 successively.
The node device total cost that calculates according to table 9 is: 2140, and the optical fiber total cost is 20*6=120, the whole network total cost is 2260.
According to the network planning scheme of correlation technique, if do not consider cost when route, directly by jete or shortest path planning, the Network route results of then obtaining is as follows:
Professional 1:A-＞B
Professional 2:A-＞C
Professional 3:B-＞C
Professional 4:B-＞C-＞D
Professional 5:C-＞B-＞E
Carry out equipment disposition according to route results then, the result is as shown in table 10.
Table 10
| Node | Cost | Equipment | Veneer |
| ??A | ??540 | ??Device2 | ??CS，OL4(2) |
| ??B | ??630 | ??Device2 | ??CS，OL4(2)，OL1 |
| ??C | ??630 | ??Device2 | ??CS，OL4(2)，OL1 |
| ??D | ??290 | ??Device1 | ??CS，OL?1 |
| ??E | ??290 | ??Device1 | ??CS，OL?1 |
The total cost of this scheme node device is 2380, and the whole network total cost is 2500, and the cost of the scheme that proposes than this paper has exceeded 240.
By the foregoing description, can draw, the route of the Network that proposes according to this paper determines that scheme can access the more excellent network planning result of cost.Determine that with the route of Network in the correlation technique scheme compares, effectively saved the cost of the network planning, the node of professional route process can be configured to the equipment that satisfies the demands.And, this planing method is carried out suitable expansion, can satisfy the multiple objective programming target call.
Device embodiment
According to the embodiment of the invention, also provide a kind of Network route assignment device.
Fig. 6 is the structural representation according to the Network route assignment device of the embodiment of the invention.Fig. 7 is the structural representation of the device of Network route assignment according to the preferred embodiment of the invention.As shown in Figure 6, according to the Network route assignment device of the embodiment of the invention comprise memory cell 1, unit 2 be set, acquiring unit 3, allocation units 4, be described in detail below in conjunction with Fig. 7.
Memory cell 1 is used for the routing service for the treatment of that sorts according to priority orders is stored;
Equipment and this equipment that each the node configuration cost in the network is minimum unit 2 is set, is used for searching, for can be used and the minimum cross board of cost in the premise equipment storehouse;
Acquiring unit 3 is used for obtaining every business respectively as current business according to priority orders from memory cell;
Allocation units 4, be used for distributing route according to preset rules, and according to the node device configuration of current business demand change route process, make current business through this route, expend the least cost weights with comparing through the too much optional route of bar, wherein, the cost weights comprise: the cost weights of node that route comprises and link.
Preferably, as shown in Figure 7, allocation units 4 further comprise: module 40, first is set searches module 42, maintenance module 44, computing module 46, judge module 48, second are searched module 50, route selection module 52.
Wherein, module 40 is set, all nodes that are used to be provided with network are first preset value to the cost of the source node of current business, and the state of all nodes in the network is set, and source node are set as present node;
First searches module 42, is connected to module 40 is set, and is used for searching undressed link in all links that are connected with the present node of current business at network;
Maintenance module 44 is connected to first and searches module 42, is used for the link capacity according to current business expanded demand link, business board, cross board and the equipment of two end nodes of configuration link correspondence;
Preferably, as shown in Figure 7, above-mentioned maintenance module 44 may further include: first updating submodule 440, second updating submodule the 442, the 3rd are upgraded submodule 444, wherein, first updating submodule 440 is used for not having under the situation of the capacity that carries current business at link, the capacity of link is enlarged at double, until carrying current business, wherein, the link capacity after the expansion is less than the intrinsic maximum link capacity of link; Second updating submodule 442 is used under the extended situation of the capacity of link, according to the business board configuration of current business demand change present node and next node; The 3rd upgrades submodule 444, is used for whether satisfying under the situation of current business demand at the cross board capacity of present node and next node the configuration of change cross board.
Computing module 46, be connected to maintenance module 44, be used for according to the result after the configuration, calculate current business is routed to next node through this optical fiber value at cost, if this value at cost cost weights more current than next node are little, then upgrade the cost weights of next node, and forerunner's node of next node is changed to present node, and the routing state that present node is set is optional state;
Preferably, aforementioned calculation module 46 can comprise the accumulator (not shown), is used for for every link, current business is arrived the cost of last node of this link and current business and adds up through link cost, the node cost of this link.
Judge module 48 is connected to computing module 46 and maintenance module 44, whether has untreated optical fiber with $ in judging the optical fiber tabulation that links to each other with present node;
Second searches module 50, is connected to judge module 48, is used for. check that whether having routing state is the node of optional state;
Route selection module 52 is connected to first and searches module 42 and second and search module 50, is used for choosing the node of cost weights minimum or in the node of a plurality of cost weights minimums optional one at the node that current all routing states are optional state.The node of choosing is set to present node, and routing state is set to find source node to arrive the best routing state of this node, wherein, if present node is the destination node of current business, then obtains the carrying route of current business.
Pass through the foregoing description, a kind of Network route assignment device is provided,, interosculating of unit, acquiring unit and allocation units has been set by memory cell, determine all to consider cost factor in the routing procedure to each bar is professional, can obtain the more excellent program results of cost; And the node of professional route process can both be configured to the equipment that satisfies the demands, and program results can be used.
In sum, by the above embodiment of the present invention, the Network route assignment scheme that provides can obtain the more excellent program results of the whole network cost, and professional route the node of process can both dispose the equipment that satisfies the demands.Range of application is wider, is applicable to the SDH network, ASON network etc., and this route determined that scheme carries out suitable expansion, can satisfy the multiple objective programming target call.
Obviously, those skilled in the art should be understood that, above-mentioned each module of the present invention or each step can realize with the general calculation device, they can concentrate on the single calculation element, perhaps be distributed on the network that a plurality of calculation element forms, alternatively, they can be realized with the executable program code of calculation element, thereby, they can be stored in the storage device and carry out by calculation element, perhaps they are made into each integrated circuit modules respectively, perhaps a plurality of modules in them or step are made into the single integrated circuit module and realize.Like this, the present invention is not restricted to any specific hardware and software combination.
The above is the preferred embodiments of the present invention only, is not limited to the present invention, and for a person skilled in the art, the present invention can have various changes and variation.Within the spirit and principles in the present invention all, any modification of being done, be equal to replacement, improvement etc., all should be included within protection scope of the present invention.
Claims (7)
1. a Network route distribution method is characterized in that, comprising:
To treat that routing service sorts according to priority orders and preserves;
In the premise equipment storehouse, search, for equipment and this equipment that each the node configuration cost in the described network is minimum can be used and the minimum cross board of cost;
Obtain every business respectively according to described priority orders, as current business;
For described current business, distribute route according to preset rules, and change the node device configuration of described route process according to described current business demand, make described current business through this route, expend the least cost weights with comparing through the too much optional route of bar, wherein, described cost weights comprise: the cost weights of node that described route comprises and link.
2. method according to claim 1 is characterized in that, distributes route according to preset rules, and comprises according to the node device configuration that described current business demand is changed described route process:
Steps A. all nodes that described network is set are first preset value to the cost of the source node of described current business, and the state of all nodes in the described network is set, with described source node as present node;
Step B. searches undressed link in all links that are connected with the present node of described current business in described network;
Step C. is for every link in the described undressed link, whether business board, cross board and the equipment of judging two end nodes of the link capacity of described link and described link correspondence satisfy described current business demand, if not, then enlarge described link capacity, and dispose described business board, described cross board and described equipment, wherein, the link capacity after the expansion is less than intrinsic maximum link capacity;
Step D. is according to the result after disposing, calculate described current business is routed to next node through this optical fiber value at cost, if this value at cost cost weights more current than described next node are little, then upgrade the cost weights of described next node, and forerunner's node of described next node is changed to described present node, and the routing state that described present node is set is optional state;
Step e. judge in the optical fiber tabulation that links to each other with described present node whether have untreated optical fiber, if return step C;
Step F. checking that whether having routing state is the node of optional state, if there is no, then is that described current business is distributed routing failure;
Step G. chooses the node of cost weights minimum or choose one wantonly in the node of a plurality of cost weights minimums in the node that current all routing states are optional state.The node of choosing is set to described present node, and routing state is set to find the best routing state of described source node to this node.If described present node is the destination node of described current business, then obtain the carrying route of described current business, otherwise, return execution in step B.
3. method according to claim 2 is characterized in that, further comprises at described step C:
Judge whether described link has the capacity of the described current business of carrying, and if not, then the capacity with described link enlarges at double, and until carrying described current business, wherein, the link capacity after the expansion is less than the intrinsic maximum link capacity of described link;
Under the extended situation of the capacity of described link, change the business board configuration of described present node and described next node according to described current business demand;
Whether the cross board capacity of judging described present node and described next node satisfies described current business demand, if not, then changes described cross board configuration.
4. a Network route assignment device is characterized in that, comprising:
Memory cell is used for the routing service for the treatment of that sorts according to priority orders is stored;
Equipment and this equipment that each the node configuration cost in the described network is minimum the unit is set, is used for searching, for can be used and the minimum cross board of cost in the premise equipment storehouse;
Acquiring unit is used for obtaining every business respectively as current business according to described priority orders from described memory cell;
Allocation units, be used for distributing route according to preset rules, and change the node device configuration of described route process according to described current business demand, make described current business through this route, expend the least cost weights with comparing through the too much optional route of bar, wherein, described cost weights comprise: the cost weights of node that described route comprises and link.
5. device according to claim 4 is characterized in that, described allocation units comprise:
Module is set, and all nodes that are used to be provided with described network are first preset value to the cost of the source node of described current business, and the state of all nodes in the described network is set, and described source node are set as present node;
First searches module, is used for searching undressed link in all links that are connected with the present node of described current business at described network;
Maintenance module is used for the link capacity according to the described link of described current business expanded demand, disposes business board, cross board and the equipment of two end nodes of described link correspondence;
Computing module, be used for according to the result after the configuration, calculate described current business is routed to next node through this optical fiber value at cost, if this value at cost cost weights more current than described next node are little, then upgrade the cost weights of described next node, and forerunner's node of described next node is changed to described present node, and the routing state that described present node is set is optional state;
Judge module is used for judging whether the optical fiber tabulation that links to each other with described present node exists untreated optical fiber;
Second searches module, is used for. check that whether having routing state is the node of optional state;
Route selection module is used for choosing the node of cost weights minimum or choose one wantonly in the node of a plurality of cost weights minimums at the node that current all routing states are optional state.The node of choosing is set to described present node, routing state is set to find the best routing state of described source node to this node, wherein, if described present node is the destination node of described current business, then obtain the carrying route of described current business.
6. device according to claim 5 is characterized in that, described maintenance module further comprises:
First updating submodule, be used for not having under the situation of capacity of the described current business of carrying, the capacity of described link enlarged at double, until carrying described current business at described link, wherein, the link capacity after the expansion is less than the intrinsic maximum link capacity of described link;
Second updating submodule is used under the extended situation of the capacity of described link, changes the business board configuration of described present node and described next node according to described current business demand;
Whether the 3rd upgrades submodule, be used for satisfying under the situation of described current business demand at the cross board capacity of described present node and described next node, changes described cross board configuration.
7. device according to claim 5 is characterized in that, described computing module comprises:
Integrating instrument is used for for described every link, described current business is arrived the cost of last node of this link and described current business and adds up through link cost, the node cost of this link.
Priority Applications (3)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN200910150252A CN101651621B (en) | 2009-06-23 | 2009-06-23 | Method and device for distributing network service routing |
| PCT/CN2009/074079 WO2010148595A1 (en) | 2009-06-23 | 2009-09-21 | Allocating method and apparatus for the network service route |
| BRPI0924503A BRPI0924503A2 (en) | 2009-06-23 | 2009-09-21 | method and apparatus for network service route allocation |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN200910150252A CN101651621B (en) | 2009-06-23 | 2009-06-23 | Method and device for distributing network service routing |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101651621A true CN101651621A (en) | 2010-02-17 |
| CN101651621B CN101651621B (en) | 2012-09-05 |
Family
ID=41673741
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN200910150252A Expired - Fee Related CN101651621B (en) | 2009-06-23 | 2009-06-23 | Method and device for distributing network service routing |
Country Status (3)
| Country | Link |
|---|---|
| CN (1) | CN101651621B (en) |
| BR (1) | BRPI0924503A2 (en) |
| WO (1) | WO2010148595A1 (en) |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102025529A (en) * | 2010-08-04 | 2011-04-20 | 华信邮电咨询设计研究院有限公司 | Traffic route selection method based on optimal-cost intelligent optical network system |
| WO2015131724A1 (en) * | 2014-09-24 | 2015-09-11 | 中兴通讯股份有限公司 | Network control method and device |
| CN105721192A (en) * | 2014-12-05 | 2016-06-29 | 中兴通讯股份有限公司 | Method and apparatus for realizing capacity planning |
| WO2016145903A1 (en) * | 2015-08-11 | 2016-09-22 | 中兴通讯股份有限公司 | Network routing path, management method and device |
| CN106789139A (en) * | 2015-11-24 | 2017-05-31 | 大唐移动通信设备有限公司 | A kind of multipoint fault processing method and processing device |
| CN107959528A (en) * | 2017-12-13 | 2018-04-24 | 苏州大学 | The network plan method and network of multi-core optical fiber network traffics asymmetric traffic transmission |
Family Cites Families (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CA2206165C (en) * | 1994-11-30 | 2002-10-22 | British Telecommunications Public Limited Company | Routing in a communication network |
| JP3622648B2 (en) * | 2000-08-25 | 2005-02-23 | 日本電気株式会社 | Route update method in micro mobility network |
| US7020087B2 (en) * | 2003-01-13 | 2006-03-28 | Motorola, Inc. | Segmented and distributed path optimization in a communication network |
| US7352852B1 (en) * | 2003-04-29 | 2008-04-01 | Sprint Communications Company L.P. | Method and system for determining a least cost path for routing international communications traffic |
| CN101218794B (en) * | 2005-06-22 | 2013-03-27 | 艾利森电话股份有限公司 | Method and arrangement for route cost determination and selection with link cost interaction |
| US7936681B2 (en) * | 2006-03-06 | 2011-05-03 | Cisco Technology, Inc. | Cross-layer design techniques for interference-aware routing configuration in wireless mesh networks |
-
2009
- 2009-06-23 CN CN200910150252A patent/CN101651621B/en not_active Expired - Fee Related
- 2009-09-21 BR BRPI0924503A patent/BRPI0924503A2/en active Search and Examination
- 2009-09-21 WO PCT/CN2009/074079 patent/WO2010148595A1/en active Application Filing
Cited By (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102025529A (en) * | 2010-08-04 | 2011-04-20 | 华信邮电咨询设计研究院有限公司 | Traffic route selection method based on optimal-cost intelligent optical network system |
| CN102025529B (en) * | 2010-08-04 | 2012-07-25 | 华信邮电咨询设计研究院有限公司 | Traffic route selection method based on optimal-cost intelligent optical network system |
| WO2015131724A1 (en) * | 2014-09-24 | 2015-09-11 | 中兴通讯股份有限公司 | Network control method and device |
| CN105515805A (en) * | 2014-09-24 | 2016-04-20 | 中兴通讯股份有限公司 | Network planning method and apparatus |
| CN105721192A (en) * | 2014-12-05 | 2016-06-29 | 中兴通讯股份有限公司 | Method and apparatus for realizing capacity planning |
| WO2016145903A1 (en) * | 2015-08-11 | 2016-09-22 | 中兴通讯股份有限公司 | Network routing path, management method and device |
| CN106789139A (en) * | 2015-11-24 | 2017-05-31 | 大唐移动通信设备有限公司 | A kind of multipoint fault processing method and processing device |
| CN106789139B (en) * | 2015-11-24 | 2020-05-05 | 大唐移动通信设备有限公司 | Multipoint fault processing method and device |
| CN107959528A (en) * | 2017-12-13 | 2018-04-24 | 苏州大学 | The network plan method and network of multi-core optical fiber network traffics asymmetric traffic transmission |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101651621B (en) | 2012-09-05 |
| BRPI0924503A2 (en) | 2016-02-16 |
| WO2010148595A1 (en) | 2010-12-29 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101651621B (en) | Method and device for distributing network service routing | |
| CA2141353C (en) | Method of on-line permanent virtual circuit routing | |
| CN100409618C (en) | Technique of determining connectivity solutions for network elements | |
| Gavish et al. | Backbone network design tools with economic tradeoffs | |
| US8443079B2 (en) | Mixed integer programming model for minimizing leased access network costs | |
| US20030142627A1 (en) | Method of optimizing network capacity and fault tolerance in deadlock-free routing | |
| CN109800936B (en) | Scheduling method based on tree search and electronic device using the same | |
| US6339587B1 (en) | Network management system | |
| CN110300130B (en) | Resource scheduling method and device, electronic equipment and storage medium | |
| CN109451540A (en) | A kind of resource allocation methods and equipment of network slice | |
| US7003300B2 (en) | Method for routing in telecommunications networks | |
| US7308494B1 (en) | Reprovisioning technique for an interconnect fabric design | |
| EP1378841A1 (en) | Method and apparatus for routing optimisation | |
| CN114630214A (en) | Service route calculation method and device, electronic equipment and readable storage medium | |
| US7152113B2 (en) | Efficient system and method of node and link insertion for deadlock-free routing on arbitrary topologies | |
| JPH0646131A (en) | Method for detection of routine loop of telephone communication network, telephone communication network for use of above method and detection device used for telephone communication network | |
| Riedl | A versatile genetic algorithm for network planning | |
| CN117176638A (en) | Routing path determining method and related components | |
| CN109586984B (en) | SDN-based distributed virtual network mapping method | |
| Akkanen et al. | Case study of the evolution of routing algorithms in a network planning tool | |
| CN101309222A (en) | Method, apparatus and system for regulating network routing | |
| CN100559742C (en) | The method of grouped data stream in transporting the transmission net of circuit traffic | |
| CN111601376B (en) | Message transmission method, system, terminal device and storage medium | |
| Amer et al. | Performance evaluation of a hierarchical hybrid adaptive routing algorithm for large scale computer communication networks | |
| Daamen | Heuristic methods for the design of edge disjoint circuits |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20120905 Termination date: 20170623 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |