利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

63 条记录 (耗时 0.025 秒)

    Mechanism to improve concurrency in execution of routing computation and routing information dissemination
    52.
    发明授权
    Mechanism to improve concurrency in execution of routing computation and routing information dissemination 有权
    提高路由计算和路由信息传播执行中并发性的机制

    公开(公告)号：US07558214B2

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

    申请号：US10928866

    申请日：2004-08-27

    申请人： Stefano B. Previdi ,  Clarence Filsfils ,  David D. Ward

    发明人： Stefano B. Previdi ,  Clarence Filsfils ,  David D. Ward

    IPC分类号： H04L12/28

    CPC分类号： H04L45/56 ,  H04L45/02 ,  H04L45/12 ,  H04L47/24 ,  H04L47/6235 ,  H04L49/90 ,  H04L49/9078

    摘要： A technique enables an intermediate network node to efficiently process link-state packets using a single running context (i.e., process or thread). The intermediate network node floods received link-state packets (LSP) before performing shortest path first (SPF) calculations and routing information base (RIB) updates. In addition, the node limits the number of LSPs that are permitted to be flooded before the node performs its SPF calculations. More specifically, if the number of link-state packets that are flooded during a flooding cycle exceeds a first predetermined threshold value, the node performs the SPF calculations before additional packets may be flooded. The intermediate network node also limits how long its RIB update may be delayed in favor of flooding operations. When the number of LSPs flooded after the SPF calculations exceeds a second predetermined threshold value or there are no more packets to be flooded, the node updates the contents of its RIB based on the SPF calculations.

    摘要翻译： 一种技术使得中间网络节点能够使用单个运行的上下文（即，进程或线程）有效地处理链路状态分组。 在执行最短路径优先（SPF）计算和路由信息库（RIB）更新之前，中间网络节点会洪泛接收链路状态分组（LSP）。 此外，节点限制在节点执行其SPF计算之前允许被泛洪的LSP的数量。 更具体地，如果在洪泛周期期间被洪泛的链路状态分组的数量超过第一预定阈值，则节点在附加分组可能被淹没之前执行SPF计算。 中间网络节点还限制其RIB更新可能延迟多长时间，有利于洪水操作。 当在SPF计算之后淹没的LSP的数量超过第二预定阈值或者没有更多的数据包被淹没时，节点基于SPF计算来更新其RIB的内容。

    Technique for optimized routing of data streams on an IP backbone in a computer network
    53.
    发明授权
    Technique for optimized routing of data streams on an IP backbone in a computer network 有权
    用于在计算机网络中的IP骨干网上优化数据流路由的技术

    公开(公告)号：US08825898B2

    公开(公告)日：2014-09-02

    申请号：US11449162

    申请日：2006-06-08

    申请人： Stefano B. Previdi ,  David D. Ward

    发明人： Stefano B. Previdi ,  David D. Ward

    IPC分类号： G06F15/173 ,  H04L29/08 ,  G06F15/16

    CPC分类号： H04L45/70 ,  H04L67/1002 ,  H04L67/1008 ,  H04L67/101 ,  H04L67/2814 ,  H04L67/32

    摘要： A technique optimizes routing of application data streams on an Internet Protocol (IP) backbone in a computer network. According to the novel technique, a client router learns of server states (e.g., number of pending requests, etc.) of a plurality of application servers and also determines metrics of intermediate links between the application servers and the client router (intermediate link metrics), e.g., particularly link metrics in a direction from the application servers to the client router. Upon receiving an application request from an application client (“client request”), the client router determines to which of the application servers the client request is to be sent based on the server states and intermediate link metrics, and sends the client request accordingly.

    摘要翻译： 一种技术优化了计算机网络中的因特网协议（IP）骨干网上的应用数据流的路由。 根据新技术，客户端路由器学习多个应用服务器的服务器状态（例如，等待请求的数量等），并且还确定应用服务器与客户端路由器之间的中间链路的度量（中间链路度量） ，例如，特别是从应用服务器到客户端路由器的方向上的链路度量。 在从应用客户端（“客户端请求”）接收到应用请求时，客户端路由器根据服务器状态和中间链路度量确定哪个应用服务器要发送客户端请求，并相应地发送客户端请求。

    PROXIMITY AGGREGATED NETWORK TOPOLOGY ALGORITHM (PANTA)
    56.
    发明申请
    PROXIMITY AGGREGATED NETWORK TOPOLOGY ALGORITHM (PANTA) 审中-公开
    近似聚合网络拓扑学算法（PANTA）

    公开(公告)号：US20110258257A1

    公开(公告)日：2011-10-20

    申请号：US12763266

    申请日：2010-04-20

    申请人： Stefano B. Previdi

    发明人： Stefano B. Previdi

    IPC分类号： G06F15/16

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

    摘要： In one embodiment, each proximity server of a proximity network computes a distance from each particular location-community for which the proximity server is responsible to each location-community within the proximity network, wherein each distance is from a root location-community to a leaf location-community. The proximity servers may then share each computed distance with the other proximity servers within the proximity network, such that each proximity server in the proximity network maintains a distance between each location-community in the proximity network. Accordingly, a proximity server may then service proximity requests for content through performance of a lookup operation into the shared computed distances based on a root location-community being a location-community of an originator of the content requested within the proximity request and a leaf location-community being a location-community of a receiver of the content requested within the proximity request.

    摘要翻译： 在一个实施例中，邻近网络的每个邻近服务器计算距接近服务器对邻近网络内的每个位置社区负责的每个特定位置社区的距离，其中每个距离从根位置社区到叶 位置社区。 接近服务器然后可以与邻近网络内的其他邻近服务器共享每个计算的距离，使得邻近网络中的每个邻近服务器维持邻近网络中每个位置社区之间的距离。 因此，接近服务器然后可以基于作为接近请求中请求的内容的发起者的位置社区的根位置社区来执行对查找操作的内容的接近请求到共享的计算距离，以及叶位置 社区是接近请求中所请求的内容的接收者的位置社区。

    Technique for efficiently avoiding transient routing disturbances in link state routing protocols with link state packet fragmentation
    57.
    发明授权
    Technique for efficiently avoiding transient routing disturbances in link state routing protocols with link state packet fragmentation 有权
    用于有效地避免链路状态路由协议中具有链路状态分组碎片的瞬时路由干扰的技术

    公开(公告)号：US07751336B2

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

    申请号：US11449282

    申请日：2006-06-08

    申请人： Christian Hopps ,  Stefano B. Previdi

    发明人： Christian Hopps ,  Stefano B. Previdi

    IPC分类号： H04J1/16

    CPC分类号： H04L45/02

    摘要： A technique efficiently avoids transient routing disturbances in link state routing protocols with fragmented link state packets (LSPs) in a computer network. According to the novel technique, a link state router (LSR) specifies which of two or more links are to be advertised in each of two or more corresponding LSP fragments. The LSR advertises the states of the specified links in the corresponding LSP fragments to one or more other LSRs. In other words, each link of the LSR is assigned to a particular LSP fragment, and the state of the link is always to be advertised in that particular LSP fragment (i.e., no fragment wrapping). Upon receiving the LSP fragments, the other LSRs may update the correct link states based on the individual LSP fragments, i.e., without transient routing disturbances caused by fragment wrapping.

    摘要翻译： 一种技术有效地避免了在计算机网络中具有分段链路状态分组（LSP）的链路状态路由协议中的瞬时路由干扰。 根据新技术，链路状态路由器（LSR）规定两个或多个对应的LSP片段中的每一个中要发布两条或多条链路中的哪条链路。 LSR将对应的LSP片段中指定链路的状态通告给一个或多个其他LSR。 换句话说，LSR的每个链路被分配给特定的LSP片段，并且链路的状态总是在该特定的LSP片段中通告（即，没有片段包装）。 在接收到LSP片段时，其他LSR可以基于各个LSP片段来更新正确的链路状态，即没有由片段包装引起的瞬时路由干扰。

    Technique for efficiently determining acceptable link-based loop free alternates in a computer network
    58.
    发明申请
    Technique for efficiently determining acceptable link-based loop free alternates in a computer network 有权
    用于有效地确定计算机网络中可接受的基于链路的无循环交替的技术

    公开(公告)号：US20080008104A1

    公开(公告)日：2008-01-10

    申请号：US11481350

    申请日：2006-07-05

    申请人： Stefano B. Previdi ,  Raffaele Gigantino

    发明人： Stefano B. Previdi ,  Raffaele Gigantino

    IPC分类号： H04L12/28

    CPC分类号： H04L12/66 ,  H04L45/04 ,  H04L45/18 ,  H04L45/22 ,  H04L45/28

    摘要： A technique efficiently determines acceptable link-based loop free alternates (LFAS) in a computer network. According to the novel technique, a protecting network device configured to protect a link (“protected link”) distinguishes other network devices (e.g., of the same domain as the protecting network device) as either network edge devices (i.e., an end point for external network traffic) or network core devices (i.e., not an end point for external network traffic). The protecting network device may then determine whether a neighboring network device loops toward a network edge device. If not, the protecting network device may determine that the neighboring network device is an acceptable LFA (e.g., for external network traffic). Notably, traffic directed to core devices may still loop, however, this traffic is generally internal (e.g., signaling) traffic, and may not be subject to the same operational constraints (e.g., protection) as external traffic.

    摘要翻译： 一种技术有效地确定计算机网络中可接受的基于链路的无环交替（LFAS）。 根据该新技术，被配置为保护链路（“受保护链路”）的保护网络设备与网络边缘设备（即，用于保护网络设备的终点 外部网络流量）或网络核心设备（即，不是外部网络流量的终点）。 保护网络设备然后可以确定相邻网络设备是否循环到网络边缘设备。 如果不是，保护网络设备可以确定相邻网络设备是可接受的LFA（例如，用于外部网络业务）。 值得注意的是，指向核心设备的业务可能仍然循环，然而，该业务通常是内部（例如，信令）业务，并且可能不会受到与外部业务相同的操作限制（例如，保护）。

    Hiding a service node in a network from a network routing topology
    59.
    发明授权
    Hiding a service node in a network from a network routing topology 有权
    从网络路由拓扑中隐藏网络中的服务节点

    公开(公告)号：US09143431B2

    公开(公告)日：2015-09-22

    申请号：US12981444

    申请日：2010-12-29

    申请人： Pradosh Mohapatra ,  Stefano B. Previdi ,  Clarence Filsfils ,  David Ward

    发明人： Pradosh Mohapatra ,  Stefano B. Previdi ,  Clarence Filsfils ,  David Ward

    IPC分类号： H04L12/28 ,  H04L12/751

    CPC分类号： H04L45/025

    摘要： Hiding a service node in a network from a network topology is provided. In one embodiment, for example, an apparatus for hiding a service node in a network from a network topology, the apparatus comprising: a network interface; a processor; and one or more stored sequences of instructions which, when executed by the processor, cause the processor to perform: discovering a service node in a data network in accordance with a link-state protocol wherein the service node provides a network topology dependent service other than packet forwarding; establishing a link-state adjacency with the service node and one or more packet forwarding nodes in accordance with the link-state protocol; receiving a link-state advertisement; in response to identifying the link-state advertisement as an originating link-state advertisement sent from the service node, suppressing flooding of the received link-state advertisement to the one or more packet forwarding nodes.

    摘要翻译： 提供了从网络拓扑中隐藏网络中的服务节点。 在一个实施例中，例如，一种用于从网络拓扑中隐藏网络中的服务节点的装置，所述装置包括：网络接口; 处理器 以及一个或多个存储的指令序列，当由所述处理器执行时，所述指令序列使所述处理器执行：根据链路状态协议在数据网络中发现服务节点，其中所述服务节点提供除 分组转发; 根据链路状态协议与服务节点和一个或多个分组转发节点建立链路状态邻接; 接收链接状态广告; 响应于将所述链路状态广告识别为从所述服务节点发送的始发链路状态广告，抑制所接收的链路状态广告对所述一个或多个分组转发节点的洪泛。

    Method and apparatus for managing forwarding of data in an autonomous system
    60.
    发明授权
    Method and apparatus for managing forwarding of data in an autonomous system 有权
    用于管理自主系统中的数据转发的方法和装置

    公开(公告)号：US07855953B2

    公开(公告)日：2010-12-21

    申请号：US11254468

    申请日：2005-10-20

    申请人： Clarence Filsfils ,  John Galen Scudder ,  Stefano B. Previdi

    发明人： Clarence Filsfils ,  John Galen Scudder ,  Stefano B. Previdi

    IPC分类号： H04L12/26

    CPC分类号： H04L45/22 ,  H04L12/4633 ,  H04L45/04 ,  H04L45/28 ,  H04L45/50

    摘要： A method of managing forwarding of data in a first autonomous system (AS) is described. The first AS includes a plurality of border routers having inter-domain links to one or more remote AS's and an associated exterior communications protocol. The border routers use an interior communications protocol with other border routers in the first AS using primary tunnels. The method comprises the steps, performed at a first border router having a primary route via an inter-domain link to a remote AS, of constructing an alternate route to the remote AS via second border router in the first AS, instigating a backup tunnel to the second border router upon failure of the primary route and sending a failure message to the other border routers.

    摘要翻译： 描述了在第一自治系统（AS）中管理数据转发的方法。 第一AS包括具有到一个或多个远程AS的域间链接和相关联的外部通信协议的多个边界路由器。 边界路由器使用内部通信协议与第一AS中的其他边界路由器使用主隧道。 该方法包括以下步骤：在具有通过到远程AS的域间链路的主路由的第一边界路由器上执行的步骤，通过第一AS中的第二边界路由器构建到远程AS的备用路由，将备用隧道引导到 主路由器故障时的第二个边界路由器，并向其他边界路由器发送故障消息。