公开(公告)号：US09356859B2

公开(公告)日：2016-05-31

申请号：US13585688

申请日：2012-08-14

Applicant: Mohammad Hanif ,  Dilip Kumar ,  Minjie Dai ,  Lisa Hong Nguyen ,  Sundeep Kumar Singh

Inventor： Mohammad Hanif ,  Dilip Kumar ,  Minjie Dai ,  Lisa Hong Nguyen ,  Sundeep Kumar Singh

IPC: H04L12/26 ,  H04L12/723 ,  H04L12/707 ,  H04L12/703

CPC classification number: H04L45/50 ,  H04L45/22 ,  H04L45/28

Abstract: Techniques for reducing the latency in performing a failover from a protected connection to its backup connection when a network event is detected affecting the protected connection. In an MPLS network, techniques are provided for failing a protected LSP to a backup LSP in a fast and efficient manner. In one embodiment, the faster failover is facilitated by storing protected LSPs and their backup LSPs information in the data plane, such as locally on a linecard.

Abstract translation: 当检测到网络事件影响受保护连接时，减少执行从受保护连接到其备份连接故障转移的延迟的技术。 在MPLS网络中，提供了以快速高效的方式将受保护LSP故障转移到备份LSP的技术。 在一个实施例中，通过将受保护的LSP及其备份LSP信息存储在数据平面中，例如本地在线卡上来，便于更快的故障切换。

公开(公告)号：US20130044586A1

公开(公告)日：2013-02-21

申请号：US13585688

申请日：2012-08-14

Applicant: Mohammad Hanif ,  Dilip Kumar ,  Minjie Dai ,  Lisa Hong Nguyen ,  Sundeep Kumar Singh

Inventor： Mohammad Hanif ,  Dilip Kumar ,  Minjie Dai ,  Lisa Hong Nguyen ,  Sundeep Kumar Singh

IPC: H04L12/26

CPC classification number: H04L45/50 ,  H04L45/22 ,  H04L45/28

Abstract: Techniques for reducing the latency in performing a failover from a protected connection to its backup connection when a network event is detected affecting the protected connection. In an MPLS network, techniques are provided for failing a protected LSP to a backup LSP in a fast and efficient manner. In one embodiment, the faster failover is facilitated by storing protected LSPs and their backup LSPs information in the data plane, such as locally on a linecard.

Abstract translation: 当检测到网络事件影响受保护连接时，减少执行从受保护连接到其备份连接故障转移的延迟的技术。 在MPLS网络中，提供了以快速高效的方式将受保护LSP故障转移到备份LSP的技术。 在一个实施例中，通过将受保护的LSP及其备份LSP信息存储在数据平面中，例如本地在线卡上来，便于更快的故障切换。

公开(公告)号：US08165032B1

公开(公告)日：2012-04-24

申请号：US12412786

申请日：2009-03-27

Applicant: Mohammad Hanif ,  Lisa Hong Nguyen

Inventor： Mohammad Hanif ,  Lisa Hong Nguyen

IPC: H04L12/26

CPC classification number: H04L45/50 ,  H04L41/0659 ,  H04L43/0811 ,  H04L45/28

Abstract: Techniques for dynamically establishing and configuring a liveliness detection session for a local repair connection of a connection. In one set of embodiments, a signaling message is received at a node configured to maintain a local repair connection for a connection. A configuration parameter is identified in the signaling message, where the configuration parameter pertains to a liveliness detection mechanism or protocol. A liveliness detection session is then established for the local repair connection based on the configuration parameter.

Abstract translation: 用于动态建立和配置用于连接的本地修复连接的活力检测会话的技术。 在一组实施例中，在被配置为维持连接的本地修复连接的节点处接收信令消息。 在信令消息中识别配置参数，其中配置参数涉及活动度检测机制或协议。 然后基于配置参数为本地修复连接建立活力检测会话。

公开(公告)号：US08830822B2

公开(公告)日：2014-09-09

申请号：US13274216

申请日：2011-10-14

Applicant: Mohammad Hanif ,  Ivy Hsu

Inventor： Mohammad Hanif ,  Ivy Hsu

IPC: G01R31/08

CPC classification number: H04L45/22 ,  H04L45/00 ,  H04L45/02 ,  H04L45/28 ,  H04L45/50

Abstract: Techniques for configuring a local repair connection for a protected connection including determining a path for the local repair connection. The path traversed by a local repair connection starts at a node in the path associated with the protected connection and ends at a merge point node in the path associated with the protected connection that is downstream from the start node. In one embodiment, the merge point node may even be more than two hops downstream from the start node in the path associated with the protected connection. The local repair path may include zero or more nodes that are not included in the path associated with the protected connection. Techniques are also described for optimizing the path associated with a local repair connection.

Abstract translation: 用于配置受保护连接的本地修复连接的技术，包括确定本地修复连接的路径。 由本地修复连接遍历的路径从与受保护连接相关联的路径中的一个节点开始，并以与起始节点下游的受保护连接相关联的路径中的合并点节点结束。 在一个实施例中，合并点节点甚至可以在与受保护连接相关联的路径中的起始节点下游多于两个跳。 本地修复路径可以包括不包括在与受保护连接相关联的路径中的零个或多个节点。 还描述了用于优化与局部修复连接相关联的路径的技术。

公开(公告)号：US6141677A

公开(公告)日：2000-10-31

申请号：US542834

申请日：1995-10-13

Applicant: Mohammad Hanif ,  Kazuhisa Yanagihara

Inventor： Mohammad Hanif ,  Kazuhisa Yanagihara

IPC: H04L29/06 ,  H04L29/08 ,  G06G9/00

CPC classification number: H04L29/06 ,  H04L69/32

Abstract: A method and system for processing active AFP sessions by a multithreaded file system process. The file server is coupled to entities on a network, wherein an open AFP session is created when the file server and an entity on the network establish communication, and an active AFP session is created when an AFP session has a pending request. The method and system comprises monitoring the file server for active AFP sessions. When a first active AFP session having at least one AFP request becomes available, the method and system assigns a first one of the threads to the first active AFP session for processing. The method and system preempts the processing of the first active AFP session by the first one of the threads when additional active AFP sessions are available so that the first one of the threads becomes available to process additional active AFP sessions, whereby equal processing time is provided to each one of the active AFP sessions.

Abstract translation: 一种用于通过多线程文件系统进程处理活动的AFP会话的方法和系统。 文件服务器耦合到网络上的实体，其中当文件服务器和网络上的实体建立通信时创建打开的AFP会话，并且当AFP会话具有未决请求时，创建活动的AFP会话。 该方法和系统包括监视文件服务器以进行活动的AFP会话。 当具有至少一个AFP请求的第一活动AFP会话可用时，该方法和系统将第一个线程分配给第一活动AFP会话进行处理。 当附加活动AFP会话可用时，该方法和系统抢先由第一个线程处理第一活动AFP会话，以便第一个线程变得可用于处理附加的活动AFP会话，从而提供相等的处理时间 到每个活跃的AFP会议。

公开(公告)号：US08358576B2

公开(公告)日：2013-01-22

申请号：US11866861

申请日：2007-10-03

Applicant: Mohammad Hanif

Inventor： Mohammad Hanif

IPC: G01R31/08

CPC classification number: H04L45/28 ,  H04L41/0668 ,  H04L43/0811

Abstract: Techniques for computing a path for a local repair connection to be used to protect a connection traversing an original path from an ingress node to an egress node. The computed path originates at a node (start node) in the original path and terminates at another node (end node) in the original path that is downstream from the start node. A Constraint Shortest Path First (CSPF) algorithm may be used to compute the path. The computed path is such that it satisfies one or more constraints and does not traverse a path from a first node in the original path to a second node in the original path, wherein the first and second nodes are upstream from the start node in the original path and the second node is downstream from the first node in the original path. A local repair connection may then be signaled using the computed path.

Abstract translation: 用于计算本地修复连接的路径以用于保护穿过原始路径从入口节点到出口节点的连接的技术。 计算的路径起始于原始路径中的节点（起始节点），并终止于起始节点下游的原始路径中的另一个节点（终端节点）。 约束最短路径优先（CSPF）算法可用于计算路径。 所计算的路径使得其满足一个或多个约束并且不穿过从原始路径中的第一节点到原始路径中的第二节点的路径，其中第一和第二节点在原始路径中的起始节点的上游 路径，而第二个节点在原始路径中的第一个节点的下游。 然后可以使用计算的路径来发出局部修复连接。

公开(公告)号：US5721818A

公开(公告)日：1998-02-24

申请号：US591860

申请日：1996-01-25

Applicant: Mohammad Hanif ,  Michael Vierling ,  Kazuhisa Yanagihara

Inventor： Mohammad Hanif ,  Michael Vierling ,  Kazuhisa Yanagihara

IPC: H04L29/06 ,  H04L29/08 ,  G06F13/00 ,  G06F15/163

CPC classification number: H04L29/06 ,  H04L69/18 ,  H04L69/32

Abstract: A system and method for enabling a file server to service a plurality of physical networks, wherein each of the networks has a network protocol of the same type. The system and method comprises a single instance of a filing protocol, and an object-oriented class for implementing a session protocol. The system and method further comprises means for invoking a plurality of session protocol instances, where each one of the plurality of session protocol instances corresponds to one of the plurality of physical networks. Each one of the plurality of session protocol instances services the corresponding physical network and communicates with the single instance of the filing protocol, which enables the single instance of the filing protocol to service the plurality of physical networks.

Abstract translation: 一种用于使文件服务器能够服务多个物理网络的系统和方法，其中每个网络具有相同类型的网络协议。 该系统和方法包括文件协议的单个实例和用于实现会话协议的面向对象的类。 所述系统和方法还包括用于调用多个会话协议实例的装置，其中所述多个会话协议实例中的每一个对应于所述多个物理网络中的一个。 多个会话协议实例中的每一个服务对应的物理网络并与归档协议的单个实例进行通信，这使得归档协议的单个实例能够为多个物理网络服务。

公开(公告)号：US08040792B2

公开(公告)日：2011-10-18

申请号：US11833168

申请日：2007-08-02

Applicant: Mohammad Hanif ,  Ivy Hsu

Inventor： Mohammad Hanif ,  Ivy Hsu

IPC: G01R31/08

CPC classification number: H04L45/22 ,  H04L45/00 ,  H04L45/02 ,  H04L45/28 ,  H04L45/50

Abstract: Techniques for configuring a local repair connection for a protected connection including determining a path for the local repair connection. The path traversed by a local repair connection starts at a node in the path associated with the protected connection and ends at a merge point node in the path associated with the protected connection that is downstream from the start node. In one embodiment, the merge point node may even be more than two hops downstream from the start node in the path associated with the protected connection. The local repair path may include zero or more nodes that are not included in the path associated with the protected connection. Techniques are also described for optimizing the path associated with a local repair connection.

Abstract translation: 用于配置受保护连接的本地修复连接的技术，包括确定本地修复连接的路径。 由本地修复连接遍历的路径从与受保护连接相关联的路径中的一个节点开始，并以与起始节点下游的受保护连接相关联的路径中的合并点节点结束。 在一个实施例中，合并点节点甚至可以在与受保护连接相关联的路径中的起始节点下游多于两个跳。 本地修复路径可以包括不包括在与受保护连接相关联的路径中的零个或多个节点。 还描述了用于优化与局部修复连接相关联的路径的技术。

公开(公告)号：US20100106999A1

公开(公告)日：2010-04-29

申请号：US11866861

申请日：2007-10-03

Applicant: Mohammad Hanif

Inventor： Mohammad Hanif

IPC: G06F11/07

CPC classification number: H04L45/28 ,  H04L41/0668 ,  H04L43/0811

Abstract: Techniques for computing a path for a local repair connection to be used to protect a connection traversing an original path from an ingress node to an egress node. The computed path originates at a node (start node) in the original path and terminates at another node (end node) in the original path that is downstream from the start node. A Constraint Shortest Path First (CSPF) algorithm may be used to compute the path. The computed path is such that it satisfies one or more constraints and does not traverse a path from a first node in the original path to a second node in the original path, wherein the first and second nodes are upstream from the start node in the original path and the second node is downstream from the first node in the original path. A local repair connection may then be signaled using the computed path.

Abstract translation: 用于计算本地修复连接的路径以用于保护穿过原始路径从入口节点到出口节点的连接的技术。 计算的路径起始于原始路径中的节点（起始节点），并终止于起始节点下游的原始路径中的另一个节点（终端节点）。 约束最短路径优先（CSPF）算法可用于计算路径。 所计算的路径使得其满足一个或多个约束并且不穿过从原始路径中的第一节点到原始路径中的第二节点的路径，其中第一和第二节点在原始路径中的起始节点的上游 路径，而第二个节点在原始路径中的第一个节点的下游。 然后可以使用计算的路径来发出局部修复连接。

公开(公告)号：US08711676B2

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

申请号：US11833167

申请日：2007-08-02

Applicant: Sandeep Bhat ,  Mohammad Hanif ,  Sriniwas Polavarapu

Inventor： Sandeep Bhat ,  Mohammad Hanif ,  Sriniwas Polavarapu

IPC: H04B7/185

CPC classification number: H04L43/0811 ,  H04L41/0668

Abstract: Techniques for finding an optimized local repair path that may be used to signal a local repair connection for a protected connection. The optimized local repair path starts at a node in the path associated with the protected connection and ends at a merge point node in the path associated with the protected connection that is downstream from the start node. Various techniques may be used for finding an optimized local repair path.

Abstract translation: 用于查找可用于发出受保护连接的本地修复连接的优化的本地修复路径的技术。 优化的本地修复路径从与受保护连接相关联的路径中的节点开始，并在与起始节点下游的受保护连接相关联的路径中的合并点节点处结束。 可以使用各种技术来找到优化的局部修复路径。