会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 11. 发明申请
    • METHOD AND APPARATUS TO ENABLE AN IPe DOMAIN THROUGH EIGRP
    • 通过EIGRP启动IPe域的方法和设备
    • US20090238076A1
    • 2009-09-24
    • US12052861
    • 2008-03-21
    • Alvaro E. RetanaRussell I. WhiteYi Yang
    • Alvaro E. RetanaRussell I. WhiteYi Yang
    • H04L12/56
    • H04L45/12H04L45/02H04L45/025
    • In one embodiment, a system, method, and apparatus for preventing excessive transmission of routing information in a communications network occurs by receiving a network routing address at a connection node in a communications network, the network routing address allowing the transmission of data packets from a source node to a destination node in the communications network; determining a longest summary route covering a path to the destination node; creating a list comprising a summary of all neighbor connection nodes of the connection node; and transmitting an update of the longest summary route of the network routing address towards all neighbor nodes advertising a destination address comprising a shorter address prefix, wherein the transmitting process occurs sequentially beginning with a first neighbor connection node entered in the list.
    • 在一个实施例中,通过在通信网络中的连接节点处接收网络路由地址来发生用于防止通信网络中的路由信息​​的过度传输的系统,方法和装置,所述网络路由地址允许从 源节点到通信网络中的目的地节点; 确定覆盖到目的地节点的路径的最长汇总路由; 创建包括所述连接节点的所有邻居连接节点的摘要的列表; 以及向所述广播包含较短地址前缀的目的地地址的所有邻居节点发送所述网络路由地址的最长摘要路由的更新,其中,所述发送处理以从所述列表中输入的第一邻居连接节点顺序发生。
    • 15. 发明授权
    • Method and apparatus to enable an IPe domain through EIGRP
    • 通过EIGRP实现IPe域的方法和装置
    • US07940668B2
    • 2011-05-10
    • US12052861
    • 2008-03-21
    • Alvaro E. RetanaRussell I. WhiteYi Yang
    • Alvaro E. RetanaRussell I. WhiteYi Yang
    • H04J1/16
    • H04L45/12H04L45/02H04L45/025
    • In one embodiment, a system, method, and apparatus for preventing excessive transmission of routing information in a communications network occurs by receiving a network routing address at a connection node in a communications network, the network routing address allowing the transmission of data packets from a source node to a destination node in the communications network; determining a longest summary route covering a path to the destination node; creating a list comprising a summary of all neighbor connection nodes of the connection node; and transmitting an update of the longest summary route of the network routing address towards all neighbor nodes advertising a destination address comprising a shorter address prefix, wherein the transmitting process occurs sequentially beginning with a first neighbor connection node entered in the list.
    • 在一个实施例中,通过在通信网络中的连接节点处接收网络路由地址来发生用于防止通信网络中的路由信息​​的过度传输的系统,方法和装置,所述网络路由地址允许从 源节点到通信网络中的目的地节点; 确定覆盖到目的地节点的路径的最长汇总路由; 创建包括所述连接节点的所有邻居连接节点的摘要的列表; 以及向所述广播包含较短地址前缀的目的地地址的所有邻居节点发送所述网络路由地址的最长摘要路由的更新,其中,所述发送处理以从所述列表中输入的第一邻居连接节点顺序发生。
    • 17. 发明申请
    • Border Router with Selective Filtering of Link State Advertisements
    • 具有选择性过滤链路状态广告的边界路由器
    • US20090041037A1
    • 2009-02-12
    • US11834445
    • 2007-08-06
    • Yi YangRussell Ivan WhiteAlvaro E. RetanaAbhay Kumar Roy
    • Yi YangRussell Ivan WhiteAlvaro E. RetanaAbhay Kumar Roy
    • H04L12/56
    • H04L45/02
    • An example embodiment of the present invention provides a process relating to the selective filtering of an LSA at a not-so-stubby-sub-area (NSSSA) border router. In one embodiment, the border router receives an LSA from another router inside the NSSSA, which might be in the access layer of the hierarchical network design model and which might use OSPF as its IGP. If the LSA is Type 1 and includes a subnet route or forwarder address, the border router floods it to its neighboring routers, regardless of whether they are inside the NSSSA. If the LSA is Type 7 and includes a host address, the border router floods it to a neighboring router if the neighboring router is inside the NSSSA, but filters the LSA if the neighboring router is outside the NSSSA, for example, in an OSPF area in the distribution layer of the hierarchical network design model.
    • 本发明的一个示例性实施例提供了一种涉及在不那样的子区域(NSSSA)边界路由器上的LSA的选择性过滤的过程。 在一个实施例中,边界路由器从NSSSA内部的另一个路由器接收LSA,该LSA可能位于分层网络设计模型的接入层中,并且可能使用OSPF作为其IGP。 如果LSA为Type 1,并且包含子网路由或转发地址,则边界路由器会将其泛洪到邻近路由器,而不管它们是否位于NSSSA内。 如果LSA为Type 7并且包含主机地址,则如果相邻路由器位于NSSSA内,则边界路由器会将其洪泛到邻近路由器,如果相邻路由器在NSSSA之外,则过滤LSA,例如OSPF区域 在分层层次的网络设计模型中。
    • 18. 发明授权
    • Method of establishing bi-directional connectivity of a network element in a network
    • 在网络中建立网元的双向连接的方法
    • US07325069B1
    • 2008-01-29
    • US10010919
    • 2001-12-07
    • Timothy M. GageYi YangDonnie V. Savage
    • Timothy M. GageYi YangDonnie V. Savage
    • G06F15/16
    • H04L45/02
    • The present invention describes a method and apparatus to ensure bi-directional connectivity between neighbor network elements in distance-vector protocol (e.g., EIGRP). The method further defines the dampening of neighbors that cannot establish a bi-directional connectivity. When a router receives an unreliable packet from a neighbor, the router adds the neighbor in neighbor table by gradually developing the reliability of the neighbor. First, the router adds neighbor's address into a dampening table and a ‘neighbor pending’ table. The router establishes a reliable communication with the neighbor. If the router cannot establish the reliable communication with the neighbor, the router dampens the neighbor and removes neighbor's address from ‘neighbor pending’ table. When the router establishes a reliable communication with the neighbor, the router ‘promotes’ the neighbor to the neighbor table. The router does not ‘advertise’ neighbor in its neighbor table until the neighbor is ‘promoted’ to the neighbor table.
    • 本发明描述了一种确保距离矢量协议(例如,EIGRP)中的相邻网络元件之间的双向连接的方法和装置。 该方法进一步定义了不能建立双向连接的邻居的衰减。 当路由器收到邻居不可靠的报文时,路由器逐渐增加邻居的可靠性,在邻居表中添加邻居。 首先,路由器将邻居的地址添加到阻尼表和“邻居待处理”表中。 路由器与邻居建立可靠的通信。 如果路由器无法建立与邻居的可靠通信,路由器会阻塞邻居,并从邻居挂起表中删除邻居的地址。 当路由器与邻居建立可靠的通信时,路由器“促进邻居邻居”。 路由器在其邻居表中没有“通告”邻居,直到邻居被“升级”到邻居表。
    • 19. 发明授权
    • 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消息建立邻接关系。 基于在第一路由器上存储的链路状态数据中指示的一个或多个相邻关系来确定穿过网络的数据分组的最短路径第一路由。
    • 20. 发明申请
    • Method and Apparatus for Passing Routing Information Among Mobile Routers
    • 移动路由器传递路由信息的方法和装置
    • US20080062947A1
    • 2008-03-13
    • US11531259
    • 2006-09-12
    • Alvaro RetanaYi YangAbhay RoyAlfred Lindem
    • Alvaro RetanaYi YangAbhay RoyAlfred Lindem
    • H04B7/216
    • H04L45/026H04L45/04H04W40/246
    • A method and apparatus for sharing routing information include receiving first domain data that indicates domains of a first mobile router. A domain is a collection of routers that share uniform routing information at a particular level of detail. An inbound data packet is received from a second mobile router over a particular link. The inbound control plane packet lists second domain data that indicates domains of the second mobile router. The first domain data and the second domain data together include multiple domains. A particular domain is automatically selected from the first domain data and the second domain data. The second mobile router independently selects the same particular domain. The particular link is assigned to the particular domain; and routing information for the particular domain is shared between the first mobile router and the second mobile router over the particular link.
    • 用于共享路由信息的方法和装置包括接收指示第一移动路由器的域的第一域数据。 一个域是一个路由器的集合,它们以特定的详细级别共享统一的路由信息​​。 通过特定链路从第二移动路由器接收入站数据分组。 入站控制平面分组列出了指示第二移动路由器的域的第二域数据。 第一域数据和第二域数据一起包括多个域。 从第一域数据和第二域数据自动选择特定域。 第二移动路由器独立地选择相同的特定域。 特定链接被分配给特定的域; 并且特定域的路由信息​​在特定链路上在第一移动路由器和第二移动路由器之间共享。