-
公开(公告)号：US06834139B1
公开(公告)日：2004-12-21
申请号：US09969937
申请日：2001-10-02
IPC分类号： G02B628
CPC分类号： H04L43/0811 , G02B6/3546 , G02B6/356 , G02B6/3564 , H04Q2011/0039
摘要： Systems and methods for link discovery and verification technique that minimize the need for line termination resources that generate and interpret packets. Of two nodes verifying a link to one another, only one node need have any line termination capability. The node lacking line termination capability simply loops back packets generated by the other node thus verifying the link. Thus, an optical cross-connect can verify links to a wide variety of node types by employing a single line termination unit capable of terminating any suitable packet type. Alternatively, a router can verify connectivity to an optical cross-connect even when the optical cross-connect lacks any line termination capability at all. This saves greatly on implementation costs for optical networks.
摘要翻译： 用于链接发现和验证技术的系统和方法，其最小化对生成和解释分组的线路终端资源的需求。 在验证彼此链接的两个节点中，只有一个节点需要具有任何线路终止能力。 缺少线路终端能力的节点简单地循环由另一个节点生成的分组，从而验证链路。 因此，光交叉连接可以通过采用能够终止任何合适的分组类型的单个线路终端单元来验证到各种节点类型的链路。 或者，即使光交叉连接缺少任何线路终端功能，路由器也可以验证与光交叉连接的连接。 这大大节省了光网络的实施成本。
-
公开(公告)号：US07065268B2
公开(公告)日：2006-06-20
申请号：US10975279
申请日：2004-10-27
CPC分类号： H04L43/0811 , G02B6/3546 , G02B6/356 , G02B6/3564 , H04Q2011/0039
摘要： Systems and methods for link discovery and verification technique that minimize the need for line termination resources that generate and interpret packets. Of two nodes verifying a link to one another, only one node need have any line termination capability. The node lacking line termination capability simply loops back packets generated by the other node thus verifying the link. Thus, an optical cross-connect can verify links to a wide variety of node types by employing a single line termination unit capable of terminating any suitable packet type. Alternatively, a router can verify connectivity to an optical cross-connect even when the optical cross-connect lacks any line termination capability at all. This saves greatly on implementation costs for optical networks.
摘要翻译： 用于链接发现和验证技术的系统和方法，其最小化生成和解释分组的线路终端资源的需要。 在验证彼此链接的两个节点中，只有一个节点需要具有任何线路终止能力。 缺少线路终端能力的节点简单地循环由另一个节点生成的分组，从而验证链路。 因此，光交叉连接可以通过采用能够终止任何合适的分组类型的单个线路终端单元来验证到各种节点类型的链路。 或者，即使光交叉连接缺少任何线路终端功能，路由器也可以验证与光交叉连接的连接。 这大大节省了光网络的实施成本。
-
公开(公告)号：US07046928B1
公开(公告)日：2006-05-16
申请号：US09968096
申请日：2001-09-28
申请人： Richard Bradford , Daniel C. Tappan
发明人： Richard Bradford , Daniel C. Tappan
CPC分类号： H04B10/00
摘要： Systems and methods for link discovery and verification that minimize the need for line termination resources to generate and interpret packets. To verify a link between two nodes, a first of the nodes toggles light or another signal output by one of its ports while the other node attempts to detect the toggling through its own ports. A link is therefore verified between the port that is toggling and the port that detects the toggling. This link verification technique does not require packet termination capability at either node. Furthermore, this link verification technique is very simple and may be executed very quickly even at nodes having a very large number of ports to which links maybe established.
摘要翻译： 用于链接发现和验证的系统和方法，可最大限度地减少线路终端资源生成和解释数据包的需求。 为了验证两个节点之间的链接，第一个节点切换其中一个端口输出的光或另一个信号，而另一个节点尝试通过其自己的端口检测切换。 因此，在切换的端口和检测切换的端口之间验证链路。 该链路验证技术在任一节点都不需要分组终止能力。 此外，该链路验证技术非常简单，并且即使在具有可能建立链路的非常大数量的端口的节点也可以非常快速地执行。
-
公开(公告)号：US20090169202A1
公开(公告)日：2009-07-02
申请号：US12403649
申请日：2009-03-13
申请人： Richard Bradford , Daniel C. Tappan
发明人： Richard Bradford , Daniel C. Tappan
CPC分类号： H04B10/00
摘要： Systems and methods for link discovery and verification that minimize the need for line termination resources to generate and interpret packets. According to one aspect of the present invention, a method for operating a first node in a data communication network to verify connectivity to a second node includes sending a request for verification of connectivity to the second node that identifies an IP address of the first node, a port of the first node, and an IP address of the second node. The method also includes toggling a signal emitted by the port, and notifying the second node of a toggling mode of the port. Finally, the method includes receiving a first message from the second node indicating whether the second node detected the toggling. The request for verification of connectivity is sent on a control channel via a control message separate from the signal and the first message.
摘要翻译： 用于链接发现和验证的系统和方法，可最大限度地减少线路终端资源生成和解释数据包的需求。 根据本发明的一个方面，一种用于操作数据通信网络中的第一节点以验证与第二节点的连接性的方法包括：向第二节点发送用于验证与第一节点的IP地址的连接的验证请求， 第一节点的端口和第二节点的IP地址。 该方法还包括切换端口发出的信号，并通知端口的切换模式的第二节点。 最后，该方法包括从第二节点接收指示第二节点是否检测到切换的第一消息。 通过与信号和第一消息分开的控制消息在控制信道上发送连接验证请求。
-
公开(公告)号：US20050083835A1
公开(公告)日：2005-04-21
申请号：US10975279
申请日：2004-10-27
申请人： Danny Prairie , Daniel Tappan , Richard Bradford
发明人： Danny Prairie , Daniel Tappan , Richard Bradford
CPC分类号： H04L43/0811 , G02B6/3546 , G02B6/356 , G02B6/3564 , H04Q2011/0039
摘要： Systems and methods for link discovery and verification technique that minimize the need for line termination resources that generate and interpret packets. Of two nodes verifying a link to one another, only one node need have any line termination capability. The node lacking line termination capability simply loops back packets generated by the other node thus verifying the link. Thus, an optical cross-connect can verify links to a wide variety of node types by employing a single line termination unit capable of terminating any suitable packet type. Alternatively, a router can verify connectivity to an optical cross-connect even when the optical cross-connect lacks any line termination capability at all. This saves greatly on implementation costs for optical networks.
摘要翻译： 用于链接发现和验证技术的系统和方法，其最小化生成和解释分组的线路终端资源的需要。 在验证彼此链接的两个节点中，只有一个节点需要具有任何线路终止能力。 缺少线路终端能力的节点简单地循环由另一个节点生成的分组，从而验证链路。 因此，光交叉连接可以通过采用能够终止任何合适的分组类型的单个线路终端单元来验证到各种节点类型的链路。 或者，即使光交叉连接缺少任何线路终端功能，路由器也可以验证与光交叉连接的连接。 这大大节省了光网络的实施成本。
-
6.发明申请公开(公告)号：US20120182885A1
公开(公告)日：2012-07-19
申请号：US13006134
申请日：2011-01-13
申请人： Richard Bradford , Richard Stewart
发明人： Richard Bradford , Richard Stewart
CPC分类号： H04L45/16 , H04L12/18 , H04L43/0811 , H04L43/50
摘要： Techniques are provided for detecting connectivity failures within an OTV network using CFM. In an embodiment, a method and apparatus for using E-OAM to accurately test connectivity in an OTV network is provided. In an embodiment, one method comprises: in a first edge router that is in a local area network (LAN) and that is coupled to a core network: maintaining, for each node of the LAN, a mapping of a source address to one or more delivery multicast groups, each delivery multicast group comprising a set of other edge routers, each of the other edge routers having a connection to a distinct LAN; receiving a frame from a particular source node of a particular source address; sending the frame to a plurality of the delivery multicast groups that are mapped, in the mapping, to the particular source address.
摘要翻译： 提供了使用CFM检测OTV网络内的连接故障的技术。 在一个实施例中，提供了一种使用E-OAM来精确测试OTV网络中的连接性的方法和装置。 在一个实施例中，一种方法包括：在位于局域网（LAN）中并且耦合到核心网络的第一边缘路由器中：为所述LAN的每个节点维护源地址到一个或多个 更多的传送多播组，每个传送组播组包括一组其他边缘路由器，每个其他边缘路由器具有到不同LAN的连接; 从特定源地址的特定源节点接收帧; 将帧发送到在映射中映射到特定源地址的多个传送多播组。
-
7.发明申请SYSTEM AND METHOD FOR RETRIEVING COMPUTED PATHS FROM A PATH COMPUTATION ELEMENT USING ENCRYPTED OBJECTS 有权使用加密对象从路径计算单元检索计算机的系统和方法公开(公告)号：US20090135841A1
公开(公告)日：2009-05-28
申请号：US12361257
申请日：2009-01-28
CPC分类号： H04L45/04 , H04L45/10 , H04L45/12 , H04L45/50 , H04L45/507 , H04L63/0428
摘要： In one embodiment, a path computation client (PCC) generates a path computation request and transmits the path computation request to a path computation element (PCE). The PCC receives from the PCE a response including path segments defining a path, at least one of the path segments being an encrypted path segment that has been encrypted according to an encryption algorithm associated with a remote domain. The PCC then generates a path reservation message that includes the encrypted path segment. This is done without decrypting the encrypted path segment at the PCC. The PCC transmits the path reservation message to one or more nodes along the path, which may be capable of decrypting the encrypted path segment.
摘要翻译： 在一个实施例中，路径计算客户端（PCC）生成路径计算请求，并将路径计算请求发送到路径计算元件（PCE）。 PCC从PCE接收包括定义路径的路径段的响应，至少一个路径段是根据与远程域相关联的加密算法被加密的加密路径段。 PCC然后生成包括加密路径段的路径预留消息。 这样做不需要解密PCC上的加密路径段。 PCC将路径预留消息发送到沿路径的一个或多个节点，该节点可能能够解密加密的路径段。
-
8.发明授权System and method for retrieving computed paths from a path computation element using a path key 有权使用路径密钥从路径计算元素检索计算出的路径的系统和方法公开(公告)号：US07558276B2
公开(公告)日：2009-07-07
申请号：US10982641
申请日：2004-11-05
IPC分类号： H04L12/28
摘要： A technique retrieves computed path segments across one or more domains of a computer network in accordance with a stateful (“semi-stateful”) path computation element (PCE) model. The stateful PCE model includes a data structure configured to store one or more path segments computed by a PCE in response to a path computation request issued by a Path Computation Client (PCC). Notably, each computed path segment stored in the data structure is identified by an associated path-key value (“path key”). The path segment and path key contents of the data structure are temporarily saved (“cached”) at a predetermined location in the network for a configurable period of time.
摘要翻译： 一种技术根据状态（“半状态”）路径计算元件（PCE）模型检索计算机网络的一个或多个域的计算路径段。 有状态PCE模型包括被配置为存储由PCE计算的响应于由路径计算客户端（PCC）发出的路径计算请求而计算的一个或多个路径段的数据结构。 值得注意的是，存储在数据结构中的每个计算的路径段由关联的路径密钥值（“路径密钥”）标识。 数据结构的路径段和路径密钥内容临时保存（“缓存”）在网络中的预定位置一段可配置的时间段内。
-
9.发明申请Methods and apparatus for error recovery in opaque networks using encrypted error locations 审中-公开使用加密错误位置的不透明网络中的错误恢复方法和装置公开(公告)号：US20060274645A1
公开(公告)日：2006-12-07
申请号：US11146520
申请日：2005-06-07
IPC分类号： H04L12/26
摘要： In response to a failure within a sub-network of a heterogeneous network, an external device is signaled that the failure has occurred by inclusion of an encoded identifier of the failure location with the signaling. The encoded identifier enables identification of the failure location within the sub-network while masking the identity of the failure location to the external device, and may be realized by using an encrypted sub-object or a token that is associated with the failure location information, which remains stored within the sub-network. The external device responds by issuing a path-establishment message indicating that a new communications path should be established and should exclude the failure location as identified by the encoded identifier, which is included in the path-establishment message. A device within the sub-network responds by determining whether a path segment for the new communications path can be provided while excluding the failure location as identified by the encoded identifier from the path-establishment message, and further path-setup functions are performed based on the determination.
摘要翻译： 响应于异构网络的子网内的故障，外部设备被发信号通知包含失败位置的编码标识符与信令发生故障。 编码的标识符能够识别子网内的故障位置，同时屏蔽到外部设备的故障位置的身份，并且可以通过使用加密的子对象或与故障位置信息相关联的令牌来实现， 其保持在子网内。 外部设备通过发出指示应该建立新的通信路径的路径建立消息来进行响应，并且应当排除由包含在路径建立消息中的编码标识符标识的故障位置。 子网内的设备通过确定是否可以提供用于新通信路径的路径段，同时从路径建立消息中排除由编码标识符识别的故障位置，并且基于 决心。
-
10.发明申请公开(公告)号：US20060098587A1
公开(公告)日：2006-05-11
申请号：US10983327
申请日：2004-11-05
IPC分类号： H04L12/28
CPC分类号： H04L45/04 , H04L45/10 , H04L45/12 , H04L45/50 , H04L45/507 , H04L63/0428
摘要： A technique retrieves computed path segments across one or more domains of a computer network in accordance with a stateless Path Computation Element (PCE) model. The stateless PCE model includes one or more PCEs configured to compute one or more path segments through the domains in response to a path computation request issued by, e.g., a Path Computation Client (PCC). Notably, each computed path segment is encrypted as a data structure to preserve confidentiality across the domains. Each PCE then cooperates to return a path computation response, including the encrypted path segments and an explicit route object (ERO) containing compressed path descriptions of the computed path segments, to the PCC.
-
-
-
-
-
-
-
-
-
搜索结果
17 条记录 (耗时 0.027 秒)
