-
1.发明申请公开(公告)号：US20130003730A1
公开(公告)日：2013-01-03
申请号：US13469237
申请日：2012-05-11
IPC分类号： H04L12/56
CPC分类号： H04L45/12
摘要： A computer-readable recording medium having stored therein a program for causing a computer to execute a process includes accepting a start node and finish node that are both terminuses for a circuit that is to be accommodated in a transmission network that includes a plurality of transmission lines, selecting, from the plurality of transmission lines, a transmission line whose arrangement order of arranging a plurality of nodes on the transmission line in an order of an indicated direction determined for the transmission line is the same as an order of the plurality of nodes determined in accordance with a cost order of the shortest path from a node at a terminus of the circuit to the plurality of nodes, and searching for a path from the circuit's start node to the circuit's finish node via the selected transmission line in the order of the indicated direction.
摘要翻译： 其中存储有用于使计算机执行处理的程序的计算机可读记录介质包括接收起始节点和完成节点，所述起始节点和完成节点都是要容纳在包括多个传输线的传输网络中的电路的终端 从所述多条传输线中选择一条传输线，其传输线的排列顺序与所确定的所述多个节点的顺序相同，所述传输线按照所述传输线确定的指示方向的顺序排列在所述传输线上 根据从电路终点处的节点到多个节点的最短路径的成本顺序，并且经由所选择的传输线以从该电路的起始节点到电路的完成节点的顺序搜索路径 指示方向。
-
2.发明授权Apparatus and method for finding a pair of disjoint paths in a communication network 有权在通信网络中找到一对不相交路径的装置和方法公开(公告)号：US08345538B2
公开(公告)日：2013-01-01
申请号：US12853336
申请日：2010-08-10
CPC分类号： H04Q11/0062 , H04J14/0267 , H04J14/0268 , H04L45/1283 , H04L45/1287 , H04L45/22 , H04Q2011/0073
摘要： There is provided topology information including connection states among nodes in a network, and port information including restriction conditions on connectivity among ports within a restricted node. A path search apparatus finds a first path having the minimum total link-cost among a plurality of paths. The topology information is changed so that the first path is not searched for as a path having the minimum total link-cost among the plurality of paths, and the port information is changed based on a port connectivity change rule. Then, the path search apparatus finds a second path different from the first path, based on the changed port information and the changed topology information, and reconfigures a pair of link-disjoint paths satisfying the restriction conditions imposed on the restricted node, by removing a link shared by both the first and second paths from the original topology information.
摘要翻译： 提供了包括网络中的节点之间的连接状态的拓扑信息，以及包括受限节点内的端口之间的连接性的限制条件的端口信息。 路径搜索装置在多个路径中找到具有最小总链路成本的第一路径。 改变拓扑信息，使得第一路径不被搜索为多个路径中具有最小总链路成本的路径，并且基于端口连接性改变规则改变端口信息。 然后，路径搜索装置基于改变的端口信息和改变的拓扑信息，找到与第一路径不同的第二路径，并且通过去除一个对应于限制节点的限制条件来重新配置满足限制条件的一对链路不相交路径 链路由原始拓扑信息由第一和第二路径共享。
-
公开(公告)号：US20120079116A1
公开(公告)日：2012-03-29
申请号：US13218853
申请日：2011-08-26
IPC分类号： G06F15/16
CPC分类号： H04L45/12
摘要： There is provided an apparatus and method for allocating devices to a communication route. Network topology information and device information including a device-cost assigned to each of candidate-devices allowed to be allocated to a plurality of segments on the communication route are provided. An integer/linear programming problem is generated to obtain a feasible device-allocation, and an objective function for calculating an objective function value is defined. A sequence of feasible device-allocations are generated by sequentially generating a next feasible device-allocation from a current feasible device-allocation while improving an objective function value until the objective function value is not improved any more, and the last one of the sequence of feasible device-allocations is determined to be an optimum device-allocation. The next feasible device-allocation is generated from the current feasible device-allocation by replacing a basic candidate-device with an alternative candidate-device selected based on reduced-costs calculated for nonbasic candidate-devices.
摘要翻译： 提供了一种用于将设备分配到通信路由的装置和方法。 提供了网络拓扑信息和设备信息，包括分配给允许分配给通信路由上的多个段的每个候选设备的设备成本。 产生整数/线性规划问题以获得可行的设备分配，并且定义用于计算目标函数值的目标函数。 通过从当前的可行设备分配顺序地生成下一个可行的设备分配，同时改善目标函数值直到目标函数值不再被改善，并且最后的一个序列 可行设备分配被确定为最佳设备分配。 通过使用基于为非基本候选设备计算的降低成本而选择的替代候选设备替换基本候选设备，从当前可行的设备分配生成下一个可行设备分配。
-
公开(公告)号：US08068732B2
公开(公告)日：2011-11-29
申请号：US12479206
申请日：2009-06-05
IPC分类号： H04B10/00
CPC分类号： H04Q11/0062 , H04L41/12 , H04L41/145 , H04Q2011/0086 , H04Q2011/009
摘要： A network design apparatus includes an information acquiring unit acquiring optical network information, a section dividing unit dividing an optical network into linear sections, a combination candidate determining unit determining candidates for combinations of various kinds of optical transmission equipment to be placed in each station in each of the linear sections, a noise amount upper limit determining unit determining an upper limit to the amount of noise allowed for each wavelength path, and an equipment placement unit solving an integer programming problem having an objective function that minimizes the cost of the optical transmission equipment and OEO regenerators, subject to the constraints that one optical transmission equipment combination is selected for each linear section and that the number of OEO regenerators necessary for each wavelength path is determined by the cumulative amount of noise of the wavelength path and the noise upper limit determined for the wavelength path.
摘要翻译： 一种网络设计装置，包括：获取光网络信息的信息获取单元，将光网络划分成线性区段的区段划分单元;组合候选确定单元，确定各放置在每个站中的各种光传输设备的组合的候选项 线性部分的噪声量上限确定单元，确定每个波长路径允许的噪声量的上限;以及解决具有使光传输设备的成本最小化的目标函数的整数规划问题的设备布置单元 和OEO再生器，受到每个线性部分选择一个光传输设备组合的限制，并且每个波长路径所需的OEO再生器的数量由波长路径的累积噪声和确定的噪声上限确定 对于波长 路径
-
5.发明申请APPARATUS FOR SUPPORTING DESIGNING OF OPTICAL NETWORK, PROCESS FOR DESIGNING OPTICAL NETWORK, AND COMPUTER-READABLE, NON-TRANSITORY MEDIUM STORING NETWORK DESIGN PROGRAM 有权支持设计光网络的设备，设计光网络的过程和计算机可读，非终端介质存储网络设计程序公开(公告)号：US20110206371A1
公开(公告)日：2011-08-25
申请号：US13032698
申请日：2011-02-23
CPC分类号： H04B10/2513 , H04J14/0268 , H04J14/0269 , H04J14/0271
摘要： In an apparatus for supporting designing of an optical network including a plurality of nodes and links which connect the plurality of nodes: a storage stores information indicating distances of the links and information indicating amounts of chromatic dispersion in the links; and a path selection unit selects a path for use in transmission of an optical signal, from among a plurality of paths each extending from a start node to a destination node, by reference to the storage. The path selection unit selects the path for use in transmission on the basis of deviations of amounts of chromatic dispersion accumulated by transmission to respective nodes on each of the plurality of paths, from reference amounts at the respective nodes, and the reference amounts at the respective nodes on each of the plurality of paths are determined according to distances from the start node to the respective nodes.
摘要翻译： 在用于支持包括连接多个节点的多个节点和链路的光网络的设计的装置中：存储器存储指示链路的距离的信息和指示链路中的色散量的信息; 并且路径选择单元通过参考存储器从从开始节点到目的地节点延伸的多个路径中选择用于光信号的传输的路径。 路径选择单元根据从多个路径中的每一个路径上的各个节点的传输累积的色散量的偏差，从各个节点的参考量和各个节点的参考量，选择用于发送的路径。 根据从起始节点到相应节点的距离来确定多个路径中的每一个上的节点。
-
6.发明授权Dispersion compensation design method and dispersion compensation design system 有权色散补偿设计方法和色散补偿设计系统公开(公告)号：US08805199B2
公开(公告)日：2014-08-12
申请号：US13301149
申请日：2011-11-21
IPC分类号： H04B10/12 , H04B10/2525
CPC分类号： H04B10/25253
摘要： A dispersion compensation design system includes a changing unit setting a changed value for the amount of dispersion compensation for a span connecting nodes constituting an optical network; a path classification unit determining whether respective paths in the optical network are capable of transmission with the changed value and classifying one or more of the paths as second category paths based on the determination results; an updating unit updating the amount of dispersion compensation with the changed value if the number of the second category paths in the latest classification result is less than the number of the second category paths in the retained previous classification result; and a repeating unit that, if not all of the paths in the optical network are capable of transmission, prevents use of combinations of amounts of dispersion compensation applied to the spans in the second category paths in the latest classification result.
摘要翻译： 色散补偿设计系统包括：改变单元，设置用于构成光网络的节点的跨度的色散补偿量的变化值; 路径分类单元，确定光网络中的相应路径是否能够以改变的值传输，并且基于确定结果将一个或多个路径分类为第二类别路径; 如果最新分类结果中的第二类别路径的数量少于所保留的先前分类结果中的第二类别路径的数量，则更新单元用改变的值更新色散补偿量; 以及如果不是全部光网络中的路径能够传输的重复单元，则防止在最新分类结果中使用在第二类别路径中应用于跨度的色散补偿量的组合。
-
7.发明授权Dispersion compensation design method and dispersion compensation design system 有权色散补偿设计方法和色散补偿设计系统公开(公告)号：US08781329B2
公开(公告)日：2014-07-15
申请号：US13363917
申请日：2012-02-01
CPC分类号： H04B10/275 , H04B10/25253 , H04J14/02
摘要： A dispersion compensation design system includes a segment dividing unit to divide an optical network into segments of a linear network or a ring network, a path classifying unit to classify one of paths of the optical network, as a specific type path, the one of the paths being incapable of transmitting an optical signal and contained in a longer path having a route longer than that of the one of the paths and capable of transmitting the optical signal, a segment reconfiguration unit to reconfigure the segments so as to maximize a number of the specific type paths, a dispersion compensation amount computing unit to compute a dispersion compensation amount in any of spans of the optical network so as to minimize the number of the specific type paths within the reconfigured segment, and an update unit to update the dispersion compensation amount with the computed dispersion compensation amount.
摘要翻译： 色散补偿设计系统包括一个分段单元，用于将光网络划分为线性网络或环网的分段，路径分类单元将光网络中的一条路径分类为特定类型路径， 路径不能发送光信号并且包含在具有比该一个路径的路径长的路径的较长路径中并且能够发送光信号的段重配置单元，以重新配置段，以便最大化 特定类型路径，色散补偿量计算单元，用于计算光网络中的任一跨度的色散补偿量，以便最小化重配置段内的特定类型路径的数量;以及更新单元，用于更新色散补偿量 与计算的色散补偿量。
-
8.发明申请公开(公告)号：US20090220241A1
公开(公告)日：2009-09-03
申请号：US12395709
申请日：2009-03-01
申请人： Toru KATAGIRI , Tomohiro Hashiguchi , Yutaka Takita , Kazuyuki Tajima , Motoyoshi Sekiya , Takashi Toyomaki
发明人： Toru KATAGIRI , Tomohiro Hashiguchi , Yutaka Takita , Kazuyuki Tajima , Motoyoshi Sekiya , Takashi Toyomaki
IPC分类号： H04J14/02
CPC分类号： H04B10/25133 , H04J14/0221
摘要： A residual chromatic dispersion target value at a terminal node is set for each wavelength path, and also, candidates of a dispersion compensation amount settable in each chromatic dispersion compensation module on an optical network are set, and further, computation processing is executed for selecting the dispersion compensation amount in each chromatic dispersion compensation module from the candidates so that the sum of errors between the residual chromatic dispersion amounts and the set residual chromatic dispersion target values at the terminal nodes for all of wavelength paths becomes minimum. As a result, for each wavelength path on the optical network, the dispersion compensation amount in each chromatic dispersion compensation module can be designed in optimum so as to satisfy the desired optical signal quality at the terminal node, while considering the residual chromatic dispersion during the transmission.
摘要翻译： 针对每个波长路径设置终端节点的残留色散目标值，并且设置在光网络上的每个色散补偿模块中可设置的色散补偿量的候选，并且还执行计算处理以选择 每个色散补偿模块中的色散补偿量，使得残留色散量与所有波长路径的终端节点处的残留色散目标值之间的误差之和变得最小。 结果，对于光网络上的每个波长路径，可以将每个色散补偿模块中的色散补偿量最优地设计成在终端节点处满足期望的光信号质量，同时考虑到在 传输。
-
公开(公告)号：US08706882B2
公开(公告)日：2014-04-22
申请号：US13218853
申请日：2011-08-26
IPC分类号： G06F15/173
CPC分类号： H04L45/12
摘要： There is provided an apparatus and method for allocating devices to a communication route. Network topology information and device information including a device-cost assigned to each of candidate-devices allowed to be allocated to a plurality of segments on the communication route are provided. An integer/linear programming problem is generated to obtain a feasible device-allocation, and an objective function for calculating an objective function value is defined. A sequence of feasible device-allocations are generated by sequentially generating a next feasible device-allocation from a current feasible device-allocation while improving an objective function value until the objective function value is not improved any more, and the last one of the sequence of feasible device-allocations is determined to be an optimum device-allocation. The next feasible device-allocation is generated from the current feasible device-allocation by replacing a basic candidate-device with an alternative candidate-device selected based on reduced-costs calculated for nonbasic candidate-devices.
摘要翻译： 提供了一种用于将设备分配到通信路由的装置和方法。 提供了网络拓扑信息和设备信息，包括分配给允许分配给通信路由上的多个段的每个候选设备的设备成本。 产生整数/线性规划问题以获得可行的设备分配，并且定义用于计算目标函数值的目标函数。 通过从当前的可行设备分配顺序地生成下一个可行的设备分配，同时改善目标函数值直到目标函数值不再被改善，并且最后的一个序列 可行设备分配被确定为最佳设备分配。 通过使用基于为非基本候选设备计算的降低成本而选择的替代候选设备替换基本候选设备，从当前可行的设备分配生成下一个可行设备分配。
-
10.发明授权Apparatus for supporting designing of optical network, process for designing optical network, and computer-readable, non-transitory medium storing network design program 有权用于支持光网络设计，光网络设计过程和计算机可读，非暂时介质存储网络设计程序的设备公开(公告)号：US08565596B2
公开(公告)日：2013-10-22
申请号：US13032698
申请日：2011-02-23
IPC分类号： H04B10/2513
CPC分类号： H04B10/2513 , H04J14/0268 , H04J14/0269 , H04J14/0271
摘要： In an apparatus for supporting designing of an optical network including a plurality of nodes and links which connect the plurality of nodes: a storage stores information indicating distances of the links and information indicating amounts of chromatic dispersion in the links; and a path selection unit selects a path for use in transmission of an optical signal, from among a plurality of paths each extending from a start node to a destination node, by reference to the storage. The path selection unit selects the path for use in transmission on the basis of deviations of amounts of chromatic dispersion accumulated by transmission to respective nodes on each of the plurality of paths, from reference amounts at the respective nodes, and the reference amounts at the respective nodes on each of the plurality of paths are determined according to distances from the start node to the respective nodes.
摘要翻译： 在用于支持包括连接多个节点的多个节点和链路的光网络的设计的装置中：存储器存储指示链路的距离的信息和指示链路中的色散量的信息; 并且路径选择单元通过参考存储器从从开始节点到目的地节点延伸的多个路径中选择用于光信号的传输的路径。 路径选择单元根据从多个路径中的每一个路径上的各个节点的传输累积的色散量的偏差，从各个节点的参考量和各个节点的参考量，选择用于发送的路径。 根据从起始节点到相应节点的距离来确定多个路径中的每一个上的节点。
-
-
-
-
-
-
-
-
-
搜索结果
55 条记录 (耗时 0.023 秒)
