利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

57 条记录 (耗时 0.03 秒)

    SIGNALING COMPRESSION INFORMATION USING ROUTING PROTOCOLS
    1.
    发明申请
    SIGNALING COMPRESSION INFORMATION USING ROUTING PROTOCOLS 有权
    使用路由协议的信令压缩信息

    公开(公告)号：US20090052452A1

    公开(公告)日：2009-02-26

    申请号：US11844119

    申请日：2007-08-23

    申请人： Keyur Patel ,  Abhay Roy ,  Robert Raszuk

    发明人： Keyur Patel ,  Abhay Roy ,  Robert Raszuk

    IPC分类号： H04L12/56

    CPC分类号： H04L45/04 ,  H04L69/04

    摘要： An ability to compress packets is announced from a customer edge router (CE) to other CEs through a routing protocol packet. An announcement of that ability is received from another CE through a routing protocol packet. A compression technique is then matched. The CE receives compression information from the other CE in a routing protocol packet, and determines that a compression technique identified therein matches any compression technique the CE is programmed to use. The CE then flags packets transmitted from/received by the CE to be compressed/decompressed according to the matched compression technique. Alternatively, the CE may match by transmitting compression information identifying a compression technique to the another CE in a routing protocol packet; the another CE receives the routing protocol packet and determines that a compression technique identified in the compression information of the routing protocol packet matches any compression technique the another CE is programmed to use.

    摘要翻译： 通过路由协议包从客户边缘路由器（CE）到其他CE，宣布压缩数据包的能力。 通过路由协议包从另一个CE接收到该能力的通知。 然后匹配压缩技术。 CE在路由协议分组中从其他CE接收压缩信息，并确定其中识别的压缩技术与CE被编程使用的任何压缩技术相匹配。 CE然后根据匹配的压缩技术标记由CE发送/接收的数据包以进行压缩/解压缩。 或者，CE可以通过在路由协议分组中向另一CE发送标识压缩技术的压缩信息来匹配; 另一个CE接收路由协议分组，并确定在路由协议分组的压缩信息中识别的压缩技术与另一个CE被编程使用的任何压缩技术匹配。

    Signaling compression information using routing protocols
    2.
    发明授权
    Signaling compression information using routing protocols 有权
    使用路由协议的信令压缩信息

    公开(公告)号：US07885294B2

    公开(公告)日：2011-02-08

    申请号：US11844119

    申请日：2007-08-23

    申请人： Keyur Patel ,  Abhay Roy ,  Robert Raszuk

    发明人： Keyur Patel ,  Abhay Roy ,  Robert Raszuk

    IPC分类号： H04J3/18

    CPC分类号： H04L45/04 ,  H04L69/04

    摘要： An ability to compress packets is announced from a customer edge router (CE) to other CEs through a routing protocol packet. An announcement of that ability is received from another CE through a routing protocol packet. A compression technique is then matched. The CE receives compression information from the other CE in a routing protocol packet, and determines that a compression technique identified therein matches any compression technique the CE is programmed to use. The CE then flags packets transmitted from/received by the CE to be compressed/decompressed according to the matched compression technique. Alternatively, the CE may match by transmitting compression information identifying a compression technique to the another CE in a routing protocol packet; the another CE receives the routing protocol packet and determines that a compression technique identified in the compression information of the routing protocol packet matches any compression technique the another CE is programmed to use.

    摘要翻译： 通过路由协议包从客户边缘路由器（CE）到其他CE，宣布压缩数据包的能力。 通过路由协议包从另一个CE接收到该能力的通知。 然后匹配压缩技术。 CE在路由协议分组中从其他CE接收压缩信息，并确定其中识别的压缩技术与CE被编程使用的任何压缩技术相匹配。 CE然后根据匹配的压缩技术标记由CE发送/接收的数据包以进行压缩/解压缩。 或者，CE可以通过在路由协议分组中向另一CE发送标识压缩技术的压缩信息来匹配; 另一个CE接收路由协议分组，并确定在路由协议分组的压缩信息中识别的压缩技术与另一个CE被编程使用的任何压缩技术匹配。

    Method and apparatus to elect ABRs dynamically and intelligently
    5.
    发明授权
    Method and apparatus to elect ABRs dynamically and intelligently 有权
    动态和智能地选择ABR的方法和装置

    公开(公告)号：US08130638B2

    公开(公告)日：2012-03-06

    申请号：US11339791

    申请日：2006-01-24

    申请人： Yi Yang ,  Alvaro E. Retana ,  Abhay Roy ,  Alfred C. Lindem, III ,  Sina Mirtorabi

    发明人： Yi Yang ,  Alvaro E. Retana ,  Abhay Roy ,  Alfred C. Lindem, III ,  Sina Mirtorabi

    IPC分类号： H04L12/26

    CPC分类号： H04L45/04

    摘要： The present invention elects an area border router from a plurality of potential area border routers by determining a full set of all areas attached to a router. A determination is made as to a full set of area pairs from the determined full set of areas. Routers are identified in a first area of the determined full set of areas that are reachable through an intra-area route in the first area, and routers are identified in a second area of the determined full set of areas that are reachable through an intra-area route in the second area. If there is a router that is unreachable through either an intra-area route in the first area or an intra-area route in the second area, then declare the first router to be an area border router, else new first and second areas are selected.

    摘要翻译： 本发明通过确定连接到路由器的所有区域的完整集合，从多个潜在区域边界路由器中选择区域边界路由器。 根据所确定的整套区域确定一整套区域对。 路由器被识别在通过第一区域中的区域内路由可达到的所确定的全集合区域中的第一区域中，并且路由器被识别在所确定的全集合区域中， 区域路线在第二个地区。 如果存在通过第一区域内的区域内路由或第二区域内的区域内路由不可达的路由器，则将第一路由器声明为区域边界路由器，否则选择新的第一和第二区域 。

    Network element discovery using a network routing protocol
    6.
    发明授权
    Network element discovery using a network routing protocol 有权
    网络元素发现使用网络路由协议

    公开(公告)号：US07991864B2

    公开(公告)日：2011-08-02

    申请号：US11429516

    申请日：2006-05-04

    申请人： Alpesh Patel ,  Abhay Roy ,  Rajeev Koripalli ,  Kui Zhang ,  Praveen Joshi ,  Syam Sundar Appala

    发明人： Alpesh Patel ,  Abhay Roy ,  Rajeev Koripalli ,  Kui Zhang ,  Praveen Joshi ,  Syam Sundar Appala

    IPC分类号： G06F15/173 ,  G06F15/177 ,  H04L12/28

    CPC分类号： H04L45/02 ,  H04L45/308

    摘要： A data processing apparatus comprises instructions to perform sending and receiving one or more messages conforming to a network routing protocol, such as Open Shortest Path First (OSPF); obtaining one or more information elements that specify one or more capabilities of the apparatus; creating a particular routing protocol message comprising an opaque advertisement that includes the one or more information elements; and sending the particular message on one of the network interfaces. For example, a router or switch that implements a network routing protocol can use OSPF Opaque Link State Advertisements to advertise and discover services and capabilities of other routers or switches.

    摘要翻译： 数据处理装置包括执行发送和接收符合诸如开放最短路径优先（OSPF）的网络路由协议的一个或多个消息的指令; 获得指定所述设备的一个或多个能力的一个或多个信息元素; 创建包括包含所述一个或多个信息元素的不透明广告的特定路由协议消息; 并在其中一个网络接口上发送特定消息。 例如，实现网络路由协议的路由器或交换机可以使用OSPF不透明链路状态广告来发布和发现其他路由器或交换机的服务和功能。

    METHOD AND APPARATUS FOR SEQUENCING OPERATIONS FOR AN INCOMING INTERFACE CHECK IN DATA CENTER ETHERNET
    7.
    发明申请
    METHOD AND APPARATUS FOR SEQUENCING OPERATIONS FOR AN INCOMING INTERFACE CHECK IN DATA CENTER ETHERNET 有权
    数据中心以太网接收接口检测操作的方法和装置

    公开(公告)号：US20110038257A1

    公开(公告)日：2011-02-17

    申请号：US12539073

    申请日：2009-08-11

    申请人： Ayan Banerjee ,  Raghava Sivaramu ,  Hariharan Balasubramanian ,  Abhay Roy ,  Santosh Rajagopalan ,  Ronak Desai

    发明人： Ayan Banerjee ,  Raghava Sivaramu ,  Hariharan Balasubramanian ,  Abhay Roy ,  Santosh Rajagopalan ,  Ronak Desai

    IPC分类号： G06F11/00

    CPC分类号： H04L41/0816

    摘要： In one embodiment, a method includes obtaining an indication that a state associated with a node is to be changed and preventing data from being received on a first link. The method also includes updating at least one selected from a group including an incoming interface check (IIC) table and an outgoing interface (OIF) table to reflect the state. The state indicates that a second link is to be activated. Finally, the method includes allowing the data to be received on the second link after updating either or both the IIC table and the OIF table and after the timer duration for the NULL value for IIC has expired.

    摘要翻译： 在一个实施例中，一种方法包括获得与节点相关联的状态将被改变并防止在第一链路上接收数据的指示。 该方法还包括更新从包括入局接口检查（IIC）表和出局接口（OIF）表的组中选出的至少一个以反映该状态。 状态表示第二个链接被激活。 最后，该方法包括允许在更新IIC表和OIF表之一或两者之后以及在IIC的NULL值的定时器持续时间已经到期之后在第二链路上接收数据。

    Tree based wireless mesh for an OSPF network with intra-tree communication optimization
    8.
    发明授权
    Tree based wireless mesh for an OSPF network with intra-tree communication optimization 有权
    一种具有树内通信优化的OSPF网络的基于树的无线网格

    公开(公告)号：US07720010B2

    公开(公告)日：2010-05-18

    申请号：US11537298

    申请日：2006-09-29

    申请人： Vincent Ribiere ,  Abhay Roy ,  Pascal Thubert ,  Patrick Wetterwald

    发明人： Vincent Ribiere ,  Abhay Roy ,  Pascal Thubert ,  Patrick Wetterwald

    IPC分类号： H04L12/28 ,  H04W4/00

    CPC分类号： H04L45/025 ,  H04W8/005 ,  H04W48/08 ,  H04W76/10 ,  H04W88/16 ,  H04W92/24

    摘要： A system for providing a tree topology for a network having an interior gateway protocol. A first router receives a hello message from all connected routers in the network. The hello messages include tree topology information. The first router then uses the tree topology information to determine a parent of the router. The first router then establishes connections with directly connected routers at the same level in the tree topology. The first router also generates link messages that include all of the prefixes for children of the first router and broadcasts the link messages.

    摘要翻译： 一种用于为具有内部网关协议的网络提供树形拓扑的系统。 第一个路由器从网络中的所有连接的路由器收到一条hello消息。 hello消息包括树形拓扑信息。 然后，第一个路由器使用树形拓扑信息来确定路由器的父节点。 然后，第一个路由器建立与树形拓扑中同一级别的直连路由器的连接。 第一个路由器还生成链路消息，其中包含第一个路由器的子节点的所有前缀，并广播链路消息。

    LINK STATE PROTOCOL ROUTING MESSAGE CONTAINMENT
    9.
    发明申请
    LINK STATE PROTOCOL ROUTING MESSAGE CONTAINMENT 有权
    链接协议路由消息容量

    公开(公告)号：US20090172190A1

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

    申请号：US11967931

    申请日：2007-12-31

    申请人： Navindra Yadav ,  Suresh Katukam ,  Abhay Roy

    发明人： Navindra Yadav ,  Suresh Katukam ,  Abhay Roy

    IPC分类号： G06F15/16

    CPC分类号： H04W40/30 ,  H04L45/025 ,  H04L45/04

    摘要： In one example embodiment, a system and method are shown that includes calculating a first SPF tree for a first device, the first SPF tree including a root node and a first child node, the first device being the root node of the first SPF tree. Additionally, the system and method may include calculating a second SPF tree for a second device that is a neighbor of the first device, the second SPF tree including a root node and a first child node, the second device being the root node of the second SPF tree. Further, the system and method may include building a set of interested nodes including the second device, if the first child node if the first SPF tree and the first child node of the second SPF tree are distinct.

    摘要翻译： 在一个示例实施例中，示出了系统和方法，其包括为第一设备计算第一SPF树，第一SPF树包括根节点和第一子节点，第一设备是第一SPF树的根节点。 另外，该系统和方法可以包括为作为第一设备的邻居的第二设备计算第二SPF树，第二SPF树包括根节点和第一子节点，第二设备是第二设备的根节点 SPF树。 此外，所述系统和方法可以包括：如果第一子节点（如果第一SPF树和第二SPF树的第一子节点是不同的），则建立包括第二设备的一组感兴趣的节点。

    Techniques for reducing adjacencies in a link-state network routing protocol
    10.
    发明授权
    Techniques for reducing adjacencies in a link-state network routing protocol 有权
    降低链路状态网络路由协议邻接度的技术

    公开(公告)号：US07515551B2

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

    申请号：US11037964

    申请日：2005-01-18

    申请人： David Anthony Cook ,  Russell White ,  Alvaro Retana ,  Yi Yang ,  Madhavi Chandra ,  Abhay Roy

    发明人： David Anthony Cook ,  Russell White ,  Alvaro Retana ,  Yi Yang ,  Madhavi Chandra ,  Abhay Roy

    IPC分类号： H04L12/56 ,  H04J1/16

    CPC分类号： H04L45/26 ,  H04L45/02

    摘要： A method and apparatus are presented supporting shortest path first (SPF) routing of data packets over a network by establishing link-state data at an router. Link-state data indicates direct links between the router and a different router and establishes an adjacency relationship with the different node. Initial link-state data is stored at a first router. After the initial link-state data is stored, a hello message is received at the first router. The hello message indicates a direct connection with a different second router on one network segment. Based on the initial link-state data, it is determined whether establishing an adjacency relationship with the second router is sufficiently valuable. If not, then an adjacency relationship is not established with the second router in response to the hello message. A shortest path first routing for a data packet traversing the network is determined based on one or more adjacency relationships indicated in link-state data stored at the first router.

    摘要翻译： 通过在路由器处建立链路状态数据来呈现一种通过网络支持数据分组的最短路径优先（SPF）路由的方法和装置。 链路状态数据表示路由器与不同路由器之间的直接链路，并与不同节点建立邻接关系。 初始链路状态数据存储在第一路由器。 在存储初始链路状态数据之后，在第一路由器处接收到hello消息。 hello消息指示与一个网段上的不同第二路由器的直接连接。 基于初始链路状态数据，确定与第二路由器建立邻接关系是否足够有价值。 如果没有，则与第二路由器不响应于hello消息建立邻接关系。 基于在第一路由器上存储的链路状态数据中指示的一个或多个相邻关系来确定穿过网络的数据分组的最短路径第一路由。