会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明申请
    • SIGNALING COMPRESSION INFORMATION USING ROUTING PROTOCOLS
    • 使用路由协议的信令压缩信息
    • US20090052452A1
    • 2009-02-26
    • US11844119
    • 2007-08-23
    • Keyur PatelAbhay RoyRobert Raszuk
    • Keyur PatelAbhay RoyRobert Raszuk
    • H04L12/56
    • H04L45/04H04L69/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被编程使用的任何压缩技术匹配。
    • 2. 发明授权
    • Signaling compression information using routing protocols
    • 使用路由协议的信令压缩信息
    • US07885294B2
    • 2011-02-08
    • US11844119
    • 2007-08-23
    • Keyur PatelAbhay RoyRobert Raszuk
    • Keyur PatelAbhay RoyRobert Raszuk
    • H04J3/18
    • H04L45/04H04L69/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被编程使用的任何压缩技术匹配。
    • 5. 发明授权
    • Method and apparatus to elect ABRs dynamically and intelligently
    • 动态和智能地选择ABR的方法和装置
    • US08130638B2
    • 2012-03-06
    • US11339791
    • 2006-01-24
    • Yi YangAlvaro E. RetanaAbhay RoyAlfred C. Lindem, IIISina Mirtorabi
    • Yi YangAlvaro E. RetanaAbhay RoyAlfred C. Lindem, IIISina Mirtorabi
    • H04L12/26
    • 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.
    • 本发明通过确定连接到路由器的所有区域的完整集合,从多个潜在区域边界路由器中选择区域边界路由器。 根据所确定的整套区域确定一整套区域对。 路由器被识别在通过第一区域中的区域内路由可达到的所确定的全集合区域中的第一区域中,并且路由器被识别在所确定的全集合区域中, 区域路线在第二个地区。 如果存在通过第一区域内的区域内路由或第二区域内的区域内路由不可达的路由器,则将第一路由器声明为区域边界路由器,否则选择新的第一和第二区域 。
    • 9. 发明申请
    • LINK STATE PROTOCOL ROUTING MESSAGE CONTAINMENT
    • 链接协议路由消息容量
    • US20090172190A1
    • 2009-07-02
    • US11967931
    • 2007-12-31
    • Navindra YadavSuresh KatukamAbhay Roy
    • Navindra YadavSuresh KatukamAbhay Roy
    • G06F15/16
    • H04W40/30H04L45/025H04L45/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树的第一子节点是不同的),则建立包括第二设备的一组感兴趣的节点。
    • 10. 发明授权
    • Techniques for reducing adjacencies in a link-state network routing protocol
    • 降低链路状态网络路由协议邻接度的技术
    • US07515551B2
    • 2009-04-07
    • US11037964
    • 2005-01-18
    • David Anthony CookRussell WhiteAlvaro RetanaYi YangMadhavi ChandraAbhay Roy
    • David Anthony CookRussell WhiteAlvaro RetanaYi YangMadhavi ChandraAbhay Roy
    • H04L12/56H04J1/16
    • H04L45/26H04L45/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消息建立邻接关系。 基于在第一路由器上存储的链路状态数据中指示的一个或多个相邻关系来确定穿过网络的数据分组的最短路径第一路由。