利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

57 条记录 (耗时 0.027 秒)

    Managing a position-dependent data set that is stored in a content addressable memory array at a network node
    51.
    发明授权
    Managing a position-dependent data set that is stored in a content addressable memory array at a network node 有权
    管理存储在网络节点上的内容可寻址存储器阵列中的与位置相关的数据集

    公开(公告)号：US06961809B2

    公开(公告)日：2005-11-01

    申请号：US10321871

    申请日：2002-12-17

    申请人： Ram Krishnan ,  Apurva Mehta ,  Michael R. MacFaden

    发明人： Ram Krishnan ,  Apurva Mehta ,  Michael R. MacFaden

    IPC分类号： G06F12/00 ,  G06F21/00

    CPC分类号： G06F21/604 ,  G06F2221/2141

    摘要： Managing a position-dependent data set that is stored in a content addressable memory (CAM) array involves identifying an instance of a base position-dependent data set that exists in software, identifying an instance of an edited position-dependent data set that exists in software, determining differences between the instance of the base position-dependent data set that exists in software and the instance of the edited position-dependent data set that exists in software, and incorporating the differences between the instance of the base position-dependent data set that exists in software and the instance of the edited position-dependent data set that exists in software into an instance of said base position-dependent data set that exists in a CAM array.

    摘要翻译： 管理存储在内容可寻址存储器（CAM）阵列中的与位置相关的数据集涉及识别存在于软件中的基于位置的数据集的实例，识别编辑的位置相关数据集的实例，其存在于 软件，确定软件中存在的基于位置的基本数据集的实例与存在于软件中的与位置相关的数据集的实例之间的差异，并且将基本位置相关数据集的实例 其存在于软件中，并且存在于软件中的编辑的位置相关数据集的实例成为存在于CAM阵列中的所述基于位置的数据集的实例。

    CONNECTING MULTIPLE CUSTOMER SITES OVER A WIDE AREA NETWORK USING AN OVERLAY NETWORK
    52.
    发明申请
    CONNECTING MULTIPLE CUSTOMER SITES OVER A WIDE AREA NETWORK USING AN OVERLAY NETWORK 有权
    使用覆盖网络连接多个区域网络的多个客户站点

    公开(公告)号：US20140198794A1

    公开(公告)日：2014-07-17

    申请号：US14150640

    申请日：2014-01-08

    申请人： Apurva Mehta ,  Shivaprakash Shenoy ,  Ramanarayanan Ramakrishnan ,  Krishna Sankaran

    发明人： Apurva Mehta ,  Shivaprakash Shenoy ,  Ramanarayanan Ramakrishnan ,  Krishna Sankaran

    IPC分类号： H04L12/741

    CPC分类号： H04L12/4633 ,  H04L29/06095 ,  H04L45/04 ,  H04L45/28 ,  H04L45/74

    摘要： A method and apparatus for connecting multiple customer sites over a wide area network (WAN) using an overlay network is described. In one embodiment of the invention, each one of multiple customer edge (CE) routers establishes a Border Gateway Protocol (BGP) session with one or more BGP route reflectors and announces their private IP network prefixes and one or more transport IP addresses to reach that CE router. The BGP route reflector(s) reflect those IP network prefixes and the one or more transport IP addresses to reach that specific CE router to the other CE routers. The CE routers receive those reflected IP network prefixes and the corresponding transport IP address(es) to reach that CE router in which those IP network prefixes belong and register them in their corresponding routing/forwarding data structures. In this way, the CE routers learn how to reach each other.

    摘要翻译： 描述了使用覆盖网络在广域网（WAN）上连接多个客户站点的方法和装置。 在本发明的一个实施例中，多个客户边缘（CE）路由器中的每一个路由器与一个或多个BGP路由反射器建立边界网关协议（BGP）会话，并且宣布其专用IP网络前缀和一个或多个传输IP地址以达到该 CE路由器 BGP路由反射器反映这些IP网络前缀和一个或多个传输IP地址，以到达其他CE路由器的特定CE路由器。 CE路由器接收到这些反映的IP网络前缀和相应的传输IP地址，以到达那些IP网络前缀所属的CE路由器，并将其注册到相应的路由/转发数据结构中。 以这种方式，CE路由器学习如何相互接触。

    POINT-TO-MULTIPOINT SERVICE IN A LAYER TWO ETHERNET NETWORK
    54.
    发明申请
    POINT-TO-MULTIPOINT SERVICE IN A LAYER TWO ETHERNET NETWORK 有权
    两层以太网网络中的点对多点服务

    公开(公告)号：US20110292937A1

    公开(公告)日：2011-12-01

    申请号：US12847505

    申请日：2010-07-30

    申请人： Manish Gupta ,  Apurva Mehta

    发明人： Manish Gupta ,  Apurva Mehta

    IPC分类号： H04L12/56

    CPC分类号： H04L45/16 ,  H04L45/50 ,  H04L45/68

    摘要： Techniques are described for providing point-to-multipoint (P2MP) Ethernet service in a L2 network. Routers providing the Ethernet service allow an administrator to classify local attachment circuits as either “leaf” attachment circuits or “root” attachment circuits to define a tree-like architecture for forwarding Ethernet frames within a VPLS domain. Based on the classifications, each of router constructs flood domains, referred to herein as mesh groups, that control switching behavior between attachment circuits and pseudowires that transport the L2 communications through the VPLS domain. The routers utilize the mesh groups when switching L2 communications to enforce the requirements of E-TREE service or other L2 services in which L2 traffic is constrained within the L2 VPN to tree-like connectivity.

    摘要翻译： 描述了在L2网络中提供点对多点（P2MP）以太网服务的技术。 提供以太网服务的路由器允许管理员将本地连接电路分类为“叶”附件电路或“根”连接电路，以定义用于转发VPLS域内的以太网帧的树状架构。 基于分类，每个路由器构造泛洪域（这里称为网格组），其控制连接电路之间的交换行为和通过VPLS域传输L2通信的伪线。 当切换L2通信时，路由器利用网状组来实现E-TREE业务或其他L2业务限制在L2 VPN内的树状连接的其他L2业务的需求。

    Managing routes in a router utilizing threshold-specific discard algorithms
    55.
    发明授权
    Managing routes in a router utilizing threshold-specific discard algorithms 有权
    使用特定于阈值的丢弃算法来管理路由器中的路由

    公开(公告)号：US07733880B2

    公开(公告)日：2010-06-08

    申请号：US10222125

    申请日：2002-08-16

    申请人： Krishna Sankaran ,  Apurva Mehta

    发明人： Krishna Sankaran ,  Apurva Mehta

    IPC分类号： H04L12/56 ,  G06F15/173 ,  G06F17/00

    CPC分类号： H04L45/02

    摘要： Managing routes in a router involves the implementation of threshold-specific discard algorithms to discard redundant routes in an intelligent fashion based upon the volume of routes in the router. By employing threshold-specific discard algorithms to intelligently discard redundant routes within a router, the storage capacity of the router is utilized in a more efficient fashion because the routes are not dropped indiscriminately. A method and system comprise identifying a volume of routes in the router, determining whether the volume of routes has reached a threshold and applying a threshold-specific discard algorithm to routes in the router if the volume of routes has reached the threshold.

    摘要翻译： 管理路由器中的路由器涉及实施特定于阈值的丢弃算法，以基于路由器中的路由量的智能方式丢弃冗余路由。 通过采用特定于阈值的丢弃算法来智能地丢弃路由器中的冗余路由，路由器的存储容量以更有效的方式被利用，因为路由不会随意丢弃。 方法和系统包括：识别路由器中的路由量，确定路由量是否达到阈值，并且如果路由量达到阈值，则对路由器中的路由应用特定于阈值的丢弃算法。

    Efficient rendezvous point tree to shortest path tree switch-over process
    56.
    发明授权
    Efficient rendezvous point tree to shortest path tree switch-over process 有权
    高效会合点树到最短路径树切换过程

    公开(公告)号：US07453807B2

    公开(公告)日：2008-11-18

    申请号：US10453974

    申请日：2003-06-04

    申请人： Juan Diego Sanchez ,  Apurva Mehta

    发明人： Juan Diego Sanchez ,  Apurva Mehta

    IPC分类号： G01R31/08 ,  G06F11/00 ,  G08C15/00 ,  H04J1/16 ,  H04J3/14 ,  H04L1/00 ,  H04L12/26

    CPC分类号： H04L45/00 ,  H04L12/185 ,  H04L12/1886 ,  H04L45/16 ,  H04L47/10 ,  H04L47/15

    摘要： A method of operating a network node in PIM-SM (Protocol Independent Multicast-Sparse Mode) is disclosed. In one embodiment, a Rendezvous Point Tree (RPT) to Shortest Path Tree (SPT) switch over process is initiated after the packet flow rate of the RPT data stream is compared against a predetermined threshold using a reverse rate limiting technique. If the packet flow rate of the RPT data stream exceeds the threshold, further analysis can be performed to decide whether the RPT to SPT switch over process should be initiated. Otherwise, if the packet flow rate does not exceed a predetermined threshold, the network node continues to receive multicast packets via the RPT until the predetermined threshold is reached.

    摘要翻译： 公开了一种在PIM-SM（Protocol Independent Multicast-Sparse Mode）中操作网络节点的方法。 在一个实施例中，在使用反向速率限制技术将RPT数据流的分组流量与预定阈值进行比较之后，启动到最短路径树（SPT）切换过程的集合点树（RPT）到切换过程。 如果RPT数据流的报文流速超过阈值，可以进一步分析，以决定是否启动RPT到SPT切换过程。 否则，如果分组流量不超过预定阈值，则网络节点经由RPT继续接收多播分组，直到达到预定阈值。

    Efficient reverse path forwarding check mechanism
    57.
    发明授权
    Efficient reverse path forwarding check mechanism 失效
    有效的反向路径转发检查机制

    公开(公告)号：US07289505B2

    公开(公告)日：2007-10-30

    申请号：US10454217

    申请日：2003-06-04

    申请人： Juan Diego Sanchez ,  Apurva Mehta

    发明人： Juan Diego Sanchez ,  Apurva Mehta

    IPC分类号： H04L12/28

    CPC分类号： H04L12/2854

    摘要： An efficient Reverse Path Forwarding (RPF) check mechanism is disclosed. In one embodiment, when a network node receives a multicast packet on an incoming interface, the network node obtains an expected incoming interface identifier from either a unicast routing table or a multicast forwarding information table. A RPF Flag stored in association with multicast flow information determines from which table the interface identifier is obtained. If the expected incoming interface does not match the actual incoming interface, the multicast packet is discarded.

    摘要翻译： 公开了一种有效的反向路径转发（RPF）检查机制。 在一个实施例中，当网络节点在入局接口上接收到组播分组时，网络节点从单播路由表或组播转发信息表中获取预期的入接口标识符。 与组播流信息相关联地存储的RPF标志确定从哪个表获得接口标识符。 如果预期的入接口与实际进入接口不匹配，则丢弃该组播数据包。