Transport control server, transport control system, and transport control method

Patent metadata

Field	Value
Publication number	US-2016142298-A1
Application number	US-201514684587-A
Country	US
Kind code	A1
Filing date	Apr 13, 2015
Priority date	Dec 10, 2009
Publication date	May 19, 2016
Grant date	—

Abstract

A passage channel is calculated by taking into account a plurality of requirements having different importance degrees. A channel calculation unit ( 202 ) of a transport control server ( 100 ) calculates a plurality of passage channel candidates with respect to a passage setting request wherein an active passage candidate and a standby passage candidate are paired in the passage channel candidate; and calculates the occurrence number of phenomena that violate a predetermined requirement relating an operation of the active passage and the standby passage, or a value of a network element for determining whether the requirement is violated, with respect to each passage channel candidate. A cost calculation unit ( 205 ) calculates the cost of a passage channel from the calculated number of occurrence, network element value, and a predetermined cost calculation coefficient corresponding to the requirement. A GUI control unit (display control unit) 201 displays identification information of the passage channel candidate, the number of occurrences or the network element value, and the cost, as a list on, for example, a management terminal.

First claim

1 .- 14 . (canceled)

15 . A transport control server coupled to a plurality of nodes, the transport control server is configured to
receive designation of a plurality of requirements for operation;
select a group of candidates of path channel to be calculated for the plurality of requirements, among paths obtained by path search for a request for path setting;
calculate a number of phenomenon according to any of the requirements or a value of network element regarding any of the requirements, for each of the plurality of candidates of path channels of the selected group, for each of the designated requirements; and provide results of the calculation for each of the requirements in distinguishable state.

16 . The transport control server according to claim 15 is further configured to
provide an order of the plurality of candidates of path channels of the group in distinguishable state for each requirement, based on the results of the calculation.

17 . The transport control server according to claim 16 is further configured to
receive designation of a coefficient which is given for each of the requirements;
calculate cost for each of the plurality of candidates of path channels of the group, by the number of phenomenon or the value of network elements calculated for each of the requirements, and the coefficient;
calculate the rank of the plurality of candidates of path channels of the group, based on the cost; and
provide the rank of the plurality of candidates of path channels of the group.

18 . The transport control server according to claim 17 ,
wherein the coefficient is permitted to receive correction of the coefficient, after obtaining the results of the calculation of the rank for the designated coefficient; and the transport control server calculates the cost by using the corrected coefficient where the corrected coefficient is designated.

19 . The transport control server according to claim 15 is further configured to
display the calculated number of phenomenon or the calculated value of network elements, for each of the plurality of candidates of path channels of the group, for each of the requirements.

20 . The transport control server according to claim 17 is further configured to
display the calculated number of phenomenon or the calculated value of network elements, and the cost, by corresponding each other, for each of the plurality of candidates of path channels of the group, for each of the requirements.

21 . The transport control server according to claim 15 is further configured to pair a candidate of an active path with a candidate of a backup path, both are selected among the paths obtained by the path search, when selecting each of the groups of candidates of the path channels.

22 . The transport control server according to claim 15 ,
wherein the phenomenon regarding the requirements is one or more selected among link disjoint, node disjoint and package disjoint; and the value of network elements regarding the requirements is one or more selected among a number of hops, a number of package straddles and redundant bandwidths.

Assignees

• Hitachi Ltd

Inventors

• Matsubara Daisuke
• Yabusaki Hitoshi

Classifications

• H04L45/123

  Evaluation of link metrics (techniques for monitoring network metrics H04L43/08) · CPC title

• H04L45/50

  using label swapping, e.g. multi-protocol label switch [MPLS] · CPC title

• H04L45/22

  Alternate routing · CPC title

• H04L45/10 Primary

  Routing in connection-oriented networks, e.g. X.25 or ATM · CPC title

• H04L45/48 Primary

  Routing tree calculation · CPC title