公开(公告)号：US10021020B2

公开(公告)日：2018-07-10

申请号：US14902471

申请日：2013-07-01

Applicant: SIEMENS AKTIENGESELLSCHAFT

Inventor： Franz-Josef Götz

IPC: H04L12/707 ,  H04L12/735 ,  H04L12/721 ,  H04L12/803 ,  H04L12/911

CPC classification number: H04L45/22 ,  H04L45/1283 ,  H04L45/66 ,  H04L47/125 ,  H04L47/728

Abstract: A control apparatus includes a first apparatus for ascertaining at least one primary data path between a first and a second data terminal device, which are connected to a data network, a second apparatus for selecting one of the ascertained primary data paths and a third apparatus for ascertaining at least one alternative data path between the first and the second data terminal device, which alternative data path has no common transmission links with the selected primary data path. A corresponding network node and a corresponding method for operating the apparatus are also described.

公开(公告)号：US09674073B2

公开(公告)日：2017-06-06

申请号：US11917112

申请日：2005-12-01

Applicant: Mikael Prytz ,  Joachim Sachs ,  Per Magnusson ,  Johan Lundsjö ,  Peter Larsson

Inventor： Mikael Prytz ,  Joachim Sachs ,  Per Magnusson ,  Johan Lundsjö ,  Peter Larsson

IPC: H04L12/721 ,  H04L12/735 ,  H04W40/00

CPC classification number: H04L45/123 ,  H04L45/12 ,  H04L45/1283 ,  H04W40/00

Abstract: This invention extends routing mechanisms that use link metrics for route selection so that: A link metric cross correlation vector is determined for all links, where each element in the vector corresponds to some other link, and reflects the change in the link metric value if a data flow would already use this other link. The invention further describes a specific embodiment where all cross-correlating links are adjacent to each other, i.e., they terminate or originate in a common node. A mechanism is described to create an extended routing graph. This extended graph permits the use of standard polynomial time algorithms that simultaneously construct the optimal route and find the optimal route metric (such as shortest-path algorithms) also for the adjacent link cross-correlating case.

公开(公告)号：US20160285689A1

公开(公告)日：2016-09-29

申请号：US14665398

申请日：2015-03-23

Applicant: International Business Machines Corporation

Inventor： Aanchal Aggarwal ,  Harsh Chaudhary ,  Yakup Koç ,  Younghun Kim ,  Tarun Kumar ,  Abhishek Raman

IPC: H04L12/24 ,  H04L12/26 ,  H04L12/707

CPC classification number: H04L41/12 ,  H04L41/145 ,  H04L43/0811 ,  H04L45/1283 ,  H04L45/22 ,  Y04S40/164 ,  Y04S40/168

Abstract: A system and method of managing a network that includes assets are described. The method includes modeling the network as a directed graph with each of the assets represented as a node and determining alternative paths to each node from each available corresponding source of the node. The method also includes computing upstream robustness of each node, computing upstream robustness of the network, and computing downstream criticality of each node. Managing the network and each asset of the network is based on the upstream robustness and the downstream criticality of each node.

公开(公告)号：US09294398B2

公开(公告)日：2016-03-22

申请号：US14293921

申请日：2014-06-02

Applicant: International Business Machines Corporation

Inventor： Casimer M. DeCusatis ,  Keshav G. Kamble ,  Abhijit P. Kumbhare

IPC: H04L12/741 ,  H04L12/707 ,  H04L12/735 ,  H04L12/933 ,  H04L12/717

CPC classification number: H04L45/74 ,  H04L45/128 ,  H04L45/1283 ,  H04L45/24 ,  H04L45/42 ,  H04L49/15

Abstract: Each of a network fabric controller device and a network fabric forwarder devices includes network connecting hardware and network managing logic. The network connecting hardware of the devices connects them to a singly contiguous network fabric including switching devices that route data between initiator nodes and target nodes and that have routing logic programmable by the controller device. The controller device does not directly route the data themselves. The network managing logic of the devices effects multipaths for transmission of the data through the singly contiguous network fabric from the initiator node to the target nodes via programming of the routing logic of the switching devices.

公开(公告)号：US20150043330A1

公开(公告)日：2015-02-12

申请号：US14307573

申请日：2014-06-18

Applicant: NEC Laboratories America, Inc.

Inventor： Junqiang HU ,  Yoshinobu OOTO ,  Kazuo TAKAGI ,  Yoshiaki AONO ,  Ting WANG

IPC: H04L12/939 ,  H04L12/721

CPC classification number: H04L49/557 ,  H04L45/1283 ,  H04L45/28 ,  H04L45/50 ,  H04L45/68 ,  H04L45/70 ,  H04L47/34

Abstract: A method and system are described for providing hitless protection in a packet switched network having source nodes and destination nodes. The method includes enabling a working path and a protecting path between the source and destination nodes. The working path is non-overlapping with respect to the protecting path. The method further includes replicating traffic in a given one of the source nodes to generate replicated traffic. The method also includes forwarding the traffic and the replicated traffic through a working path and a protecting path, respectively, from the given one of the source nodes to a particular one of the destination nodes. The method additionally includes delivering a hitless-protected service in the particular one of the destination nodes by selecting traffic packets received from either the working path or the protecting path.

Abstract translation: 描述了一种用于在具有源节点和目的地节点的分组交换网络中提供无中断保护的方法和系统。 该方法包括启用源节点和目的节点之间的工作路径和保护路径。 工作路径与保护路径不重叠。 该方法还包括在给定的一个源节点中复制业务以生成复制业务。 该方法还包括将业务和复制的业务分别通过工作路径和保护路径转发到从给定的一个源节点到目标节点的特定一个。 该方法还包括通过选择从工作路径或保护路径接收到的业务分组来递送目标节点中的特定一个节点中的无受保护的服务。

公开(公告)号：US08792474B2

公开(公告)日：2014-07-29

申请号：US13827479

申请日：2013-03-14

Applicant: International Business Machines Corporation

Inventor： Casimer M. DeCusatis ,  Keshav G. Kamble ,  Abhijit P. Kumbhare

IPC: H04L12/28 ,  H04L12/56

CPC classification number: H04L45/74 ,  H04L45/128 ,  H04L45/1283 ,  H04L45/24 ,  H04L45/42 ,  H04L49/15

Abstract: Each of a network fabric controller device and a network fabric forwarder devices includes network connecting hardware and network managing logic. The network connecting hardware of the devices connects them to a singly contiguous network fabric including switching devices that route data between initiator nodes and target nodes and that have routing logic programmable by the controller device. The controller device does not directly route the data themselves. The network managing logic of the devices effects multipaths for transmission of the data through the singly contiguous network fabric from the initiator node to the target nodes via programming of the routing logic of the switching devices.

Abstract translation: 网络结构控制器设备和网络结构转发器设备中的每一个包括网络连接硬件和网络管理逻辑。 设备的网络连接硬件将它们连接到单独连续的网络结构，包括在启动器节点和目标节点之间路由数据并且具有由控制器设备可编程的路由逻辑的交换设备。 控制器设备不直接路由数据本身。 设备的网络管理逻辑通过编程开关设备的路由逻辑来实现多路径，用于通过单独连续的网络结构从发起者节点向目标节点传输数据。

公开(公告)号：US08681607B2

公开(公告)日：2014-03-25

申请号：US13457192

申请日：2012-04-26

Applicant: Wenhu Lu ,  Sriganesh Kini

Inventor： Wenhu Lu ,  Sriganesh Kini

IPC: G01R31/08

CPC classification number: H04L45/42 ,  H04L45/00 ,  H04L45/02 ,  H04L45/123 ,  H04L45/1283 ,  H04L45/28 ,  H04L45/50

Abstract: A network element implementing Multiprotocol Label Switching to automatically create an optimal deterministic back-up Label Switch Path (LSP) that is maximally disjointed from a primary LSP to provide a reliable back up to the primary LSP. The network element receives a request for a generation of an LSP, determines that the request for the generation of the LSP is for the back-up LSP, locates each link of the primary LSP in a traffic engineering database, modifies each link of the primary LSP to have a link cost significantly greater than an actual link cost to discourage use of each link of the primary LSP in the back-up LSP, executes a Constrained Shortest Path First algorithm to obtain the back-up LSP, wherein the back-up LSP has a maximum disjointedness from the primary LSP due to a modified cost of each link of the primary LSP, and returns the back-up LSP.

Abstract translation: 实现多协议标签交换的网元，自动创建一个最佳的确定性备份标签交换路径（LSP），最大限度地脱离主LSP，以提供可靠的备份到主LSP。 网元接收到生成LSP的请求，确定生成LSP的请求是用于备份LSP，将主LSP的每个链路定位在流量工程数据库中，修改主链路的每个链路 LSP具有明显大于实际链路成本的链路成本，以阻止在备用LSP中使用主LSP的每个链路，执行约束最短路径优先算法以获得备份LSP，其中备份LSP 由于主LSP的每个链路的修改成本，LSP与主LSP的最大不相容性，并返回备用LSP。

公开(公告)号：US20130223277A1

公开(公告)日：2013-08-29

申请号：US13484202

申请日：2012-05-30

Applicant: Casimer M. DeCusatis ,  Keshav G. Kamble ,  Abhijit P. Kumbhare ,  Renato J. Recio ,  Simarbir Singh

Inventor： Casimer M. DeCusatis ,  Keshav G. Kamble ,  Abhijit P. Kumbhare ,  Renato J. Recio ,  Simarbir Singh

IPC: H04L12/28

CPC classification number: H04L45/021 ,  H04L45/1283 ,  H04L45/24 ,  H04L49/357 ,  H04L67/1097

Abstract: A method for determining disjoint multi-paths in a data center fabric network system, according to one embodiment, includes creating a topology of a data center fabric network system, wherein the system comprises a plurality of switches; determining paths between the plurality of switches; calculating one or more disjoint multi-paths from a source device to a destination device in the system; and writing the one or more disjoint multi-paths into a forwarding table of at least one of the source device and a nearest shared switch to the source device.

Abstract translation: 根据一个实施例的用于确定数据中心结构网络系统中的不相交多路径的方法包括创建数据中心结构网络系统的拓扑，其中所述系统包括多个交换机; 确定所述多个开关之间的路径; 计算系统中从源设备到目标设备的一个或多个不相交的多路径; 以及将所述一个或多个不相交的多路径写入到所述源设备中的至少一个的转发表和到所述源设备的最近的共享交换机。

公开(公告)号：US08233387B2

公开(公告)日：2012-07-31

申请号：US12614323

申请日：2009-11-06

Applicant: Wenhu Lu ,  Sriganesh Kini

Inventor： Wenhu Lu ,  Sriganesh Kini

IPC: G01R31/08

CPC classification number: H04L45/42 ,  H04L45/00 ,  H04L45/02 ,  H04L45/123 ,  H04L45/1283 ,  H04L45/28 ,  H04L45/50

Abstract: A network element implementing Multiprotocol Label Switching to automatically create an optimal deterministic back-up Label Switch Path (LSP) that is maximally disjointed from a primary LSP to provide a reliable back up to the primary LSP. The network element receives a request for a generation of an LSP, determines that the request for the generation of the LSP is for the back-up LSP, locates each link of the primary LSP in a traffic engineering database, modifies each link of the primary LSP to have a link cost significantly greater than an actual link cost to discourage use of each link of the primary LSP in the back-up LSP, executes a Constrained Shortest Path First algorithm to obtain the back-up LSP, wherein the back-up LSP has a maximum disjointedness from the primary LSP due to a modified cost of each link of the primary LSP, and returns the back-up LSP.

Abstract translation: 实现多协议标签交换的网元，自动创建一个最佳的确定性备份标签交换路径（LSP），最大限度地脱离主LSP，以提供可靠的备份到主LSP。 网元接收到生成LSP的请求，确定生成LSP的请求是用于备份LSP，将主LSP的每个链路定位在流量工程数据库中，修改主链路的每个链路 LSP具有明显大于实际链路成本的链路成本，以阻止在备用LSP中使用主LSP的每个链路，执行约束最短路径优先算法以获得备份LSP，其中备份LSP 由于主LSP的每个链路的修改成本，LSP与主LSP的最大不相容性，并返回备用LSP。

公开(公告)号：US20090190478A1

公开(公告)日：2009-07-30

申请号：US12019797

申请日：2008-01-25

Applicant: Guangzhi LI ,  Dongmei Wang

Inventor： Guangzhi LI ,  Dongmei Wang

IPC: G01R31/08

CPC classification number: H04L45/28 ,  H04L12/18 ,  H04L12/42 ,  H04L41/0654 ,  H04L45/02 ,  H04L45/12 ,  H04L45/128 ,  H04L45/1283 ,  H04L45/16 ,  H04L45/22 ,  H04L2212/00

Abstract: Disclosed herein are systems, methods, and computer readable media for modifying IP backbone link weights such that multicast traffic and unicast traffic will not travel on a same path between nodes. The method comprises assigning link weights to nodes within an IP backbone such that multicast forwarding paths and unicast forwarding paths are failure disjoint, and delivering undelivered multicast packets using IP unicast encapsulation to the loopback address of next hop router on a multicast tree upon link/interface failure.

Abstract translation: 这里公开的是用于修改IP骨干链路权重的系统，方法和计算机可读介质，使得多播业务和单播业务不会在节点之间的同一路径上行进。 该方法包括：将链路权重分配给IP骨干网内的节点，使组播转发路径和单播转发路径成为故障中断，并在链路/接口上使用IP单播封装向组播树上的下一跳路由器的环回地址传递未传递的组播报文 失败。