会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • Forwarding packets to a directed acyclic graph destination using link selection based on received link metrics
    • 基于接收到的链路指标,使用链路选择将分组转发到有向非循环图目的地
    • US07924722B2
    • 2011-04-12
    • US12751841
    • 2010-03-31
    • Pascal ThubertFrancois Laurent Le FaucheurEric M. Levy-Abegnoli
    • Pascal ThubertFrancois Laurent Le FaucheurEric M. Levy-Abegnoli
    • G01R31/08
    • H04L43/022H04L43/08H04L45/123H04L45/20H04W40/24
    • Each network node having at least one destination-oriented link toward a directed acyclic graph (DAG) destination can receive a corresponding set of path performance metrics via the destination-oriented link. The set of path performance metrics, initiated by the DAG destination outputting initial link metrics on each of its source-connecting links, identifies aggregate link metrics for a corresponding path to the DAG destination via the corresponding destination-oriented link. The network node outputs a corresponding updated set of path performance metrics on each of its source-connecting links based on the received set of path performance metrics and the corresponding link metric for the corresponding source-connecting link. Hence, each network node in the DAG can assess the performance of each connected path to the DAG destination, and forward a data packet via a selected destination-oriented link based on the corresponding path performance metrics and forwarding policies for the forwarded data packet.
    • 具有朝向有向非循环图(DAG)目的地的至少一个目的地定向链路的每个网络节点可以经由目的地定向链路接收相应的一组路径性能度量。 由DAG目的地发起的路由性能度量集合,其每个源连接链路上的初始链路度量在每个源连接链路上输出,通过相应的目的地导向链路来标识到达目​​的地的相应路径的聚合链路度量。 网络节点基于所接收的路径性能度量集合和对应的源连接链路的相应链路度量,在其每个源连接链路上输出对应的更新路径性能度量集合。 因此,DAG中的每个网络节点可以评估到DAG目的地的每个连接路径的性能,并且基于所转发的数据分组的相应路径性能度量和转发策略,经由所选择的目的地定向链路转发数据分组。
    • 2. 发明授权
    • Link state advertisements specifying dynamic routing metrics and associated variation metrics and selective distribution thereof
    • 链接状态广告指定动态路由度量和相关联的变化度量及其选择性分布
    • US07567577B2
    • 2009-07-28
    • US11167239
    • 2005-06-28
    • Pascal ThubertVincent Jean RibiereEric M. Levy-AbegnoliPatrick Wetterwald
    • Pascal ThubertVincent Jean RibiereEric M. Levy-AbegnoliPatrick Wetterwald
    • H04L12/56
    • H04W40/248H04L45/02
    • Each router in a network is configured for executing a link state routing protocol based on outputting a corresponding first link state advertisement message describing a connected link of the router and that specifies a first dynamic routing metric identifying a first cost of the connected link, and a corresponding variation metric identifying a statistical variation of the dynamic routing metric. Each router also is configured for selectively outputting a corresponding second link state advertisement message describing the connected link and that specifies the corresponding variation metric and an updated dynamic routing metric identifying an updated cost of the connected link relative to the first cost, the second link state advertisement message selectively output based on the updated dynamic routing metric differing from the first dynamic routing metric by more than the variation metric, or the router having received another link state advertisement from another router in the network.
    • 网络中的每个路由器被配置为基于输出描述路由器的连接链路的对应的第一链路状态通告消息来执行链路状态路由协议,并且指定识别所连接链路的第一成本的第一动态路由度量,以及 标识动态路由度量的统计变化的相应变化度量。 每个路由器还被配置为选择性地输出描述连接的链路的相应的第二链路状态通告消息,并且其指定对应的变化度量以及更新的动态路由度量,该更新的动态路由度量标识相对于第一成本的连接链路的更新成本,第二链路状态 基于与第一动态路由度量不同的更新的动态路由度量多于变化度量选择性地输出广告消息,或者已经从网络中的另一路由器接收到另一链路状态广告的路由器。
    • 3. 发明授权
    • Arrangement for providing optimized connections between peer routers in a tree-based ad hoc mobile network
    • 用于在基于树的自组织移动网络中的对等路由器之间提供优化连接的布置
    • US07366111B2
    • 2008-04-29
    • US11101394
    • 2005-04-08
    • Pascal ThubertPatrick WetterwaldVincent Jean RibiereEric M. Levy-Abegnoli
    • Pascal ThubertPatrick WetterwaldVincent Jean RibiereEric M. Levy-Abegnoli
    • H04L12/28
    • H04W40/24H04L45/48H04W8/082H04W48/16H04W80/04H04W84/18
    • Mobile routers in a tree-based network topology with a single clusterhead in an ad hoc network establish connectivity based on each attached mobile router sending a neighbor advertisement message to an attachment mobile router via a corresponding egress interface. Any neighbor advertisement message received by a mobile router is used to identify specified network prefixes that are reachable via the source of the neighbor advertisement message. Each attached mobile router outputs to its attachment router another neighbor advertisement message that specifies the network prefix used by the mobile router, and the specified network prefixes from its attached mobile routers. The mobile router also identifies peer mobile routers having the same depth, and selectively shares limited routing information with the peer routers, enabling the mobile router to bypass the clusterhead and reach remote prefixes via the peer routers without burdening the tree.
    • 基于树状网络拓扑中的移动路由器,在自组织网络中具有单个集群头,基于每个附加的移动路由器通过相应的出口接口建立到附件移动路由器发送邻居通告消息的连接。 由移动路由器接收到的任何邻居通告消息用于识别经由邻居广播消息的源可达的指定网络前缀。 每个连接的移动路由器向其附接路由器输出另一个邻居通告消息,其指定移动路由器使用的网络前缀,以及来自其附接的移动路由器的指定的网络前缀。 移动路由器还识别具有相同深度的对等移动路由器,并且选择性地与对等路由器共享有限的路由信息​​,使得移动路由器能够绕过群集头并且经由对等路由器到达远程前缀,而不加重树。
    • 4. 发明授权
    • Directed acyclic graph computation by orienting shortest path links and alternate path links obtained from shortest path computation
    • 通过定向从最短路径计算获得的最短路径链路和备用路径链路的定向非循环图计算
    • US07656857B2
    • 2010-02-02
    • US11251765
    • 2005-10-18
    • Pascal ThubertEric M. Levy-Abegnoli
    • Pascal ThubertEric M. Levy-Abegnoli
    • H04L12/28
    • H04W40/02H04L45/12
    • Each network node in a network is configured for calculating a directed acyclic graph that provides at least one path from all the other network nodes toward the one network node. The network node performs a modified shortest path first calculation by identifying next-hop nodes adjacent to the network node, and orienting the link of each next-hop node toward itself (i.e., the origin). The network node also identifies secondary adjacent nodes, adjacent to each of the next hop nodes, and extends paths from next-hop nodes to the associated secondary adjacent nodes while orienting each of the links of the path between adjacent nodes and next-hop nodes toward the next hop nodes. The paths of the nodes form a directed acyclic graph from any other network node toward the origin, enabling distribution of the directed acyclic graph to the other network nodes for optimized reachability to the network node.
    • 网络中的每个网络节点被配置用于计算从所有其他网络节点向一个网络节点提供至少一条路径的有向非循环图。 网络节点通过识别与网络节点相邻的下一跳节点,并且将每个下一跳节点的链路朝向其自身(即,原点)来执行修改的最短路径第一计算。 网络节点还识别与每个下一跳节点相邻的辅助相邻节点,并且将从下一跳节点到相关联的次相邻节点的路径扩展,同时将相邻节点和下一跳节点之间的路径的每个链路朝向 下一跳节点。 节点的路径形成从任何其他网络节点朝向原点的有向无环图,使有向非循环图分布到其他网络节点,以优化到网络节点的可达性。
    • 5. 发明授权
    • Arrangement in a router for generating a route based on a pattern of a received packet
    • 路由器中的布置,用于基于接收到的分组的模式生成路由
    • US06917618B2
    • 2005-07-12
    • US10404064
    • 2003-04-02
    • Pascal ThubertMarco MolteniPatrick WetterwaldEric M. Levy-Abegnoli
    • Pascal ThubertMarco MolteniPatrick WetterwaldEric M. Levy-Abegnoli
    • H04L12/56H04L12/28
    • H04L45/54H04L45/00H04L45/245H04W40/02
    • A router (e.g., a home agent for an IPv6 mobile router) is configured for determining a destination router (e.g., the IPv6 mobile router) for a received packet based on accessing a routing table having multiple routing entries, each routing entry including a routing key and a routing field that specifies one of a prescribed address specifying the destination router and a computation tag. The computation tag specifies a prescribed function to be executed to calculate a determined address for the destination router (e.g., the home address for the IPv6 mobile router). The router identifies, for each received packet, the matching routing entry based on the corresponding routing key, and in response to detecting the computation tag in the routing field, selectively executes the corresponding function to calculate the determined address for the destination router.
    • 路由器(例如,IPv6移动路由器的归属代理)被配置为基于访问具有多个路由条目的路由表来确定接收到的分组的目的地路由器(例如,IPv6移动路由器),每个路由条目包括路由 密钥和指定指定目的地路由器的规定地址之一和计算标签的路由字段。 计算标签指定要执行的规定功能以计算目的地路由器的确定的地址(例如,IPv6移动路由器的归属地址)。 路由器根据相应的路由密钥,为每个收到的报文识别匹配的路由条目,响应于检测到路由选择字段中的计算标签,选择性地执行相应的功能,以计算目的路由器确定的地址。
    • 8. 发明授权
    • System and method for coordinated hierarchical caching and cache replacement
    • 用于协调层次缓存和缓存替换的系统和方法
    • US06338117B1
    • 2002-01-08
    • US09141979
    • 1998-08-28
    • James R. H. ChallengerPaul Michael DantzigDaniel Manuel DiasArun Kwangil IyengarEric M. Levy-Abegnoli
    • James R. H. ChallengerPaul Michael DantzigDaniel Manuel DiasArun Kwangil IyengarEric M. Levy-Abegnoli
    • G06F1200
    • G06F12/0811G06F12/121
    • A system and method for hierarchically caching objects includes one or more level 1 nodes, each including at least one level 1 cache; one or more level 2 nodes within which the objects are permanently stored or generated upon request, each level 2 node coupled to at least one of the one or more level 1 nodes and including one or more level 2 caches; and a storage control device for storing, in a coordinated manner, one or more objects in at least one level 1 cache and/or at least one level 2 cache, based on a set of one or more criteria. Furthermore, in a system for receiving requests for objects from one or more clients, the system having a set of one or more level 1 nodes, each containing at least one level 1 cache, a method for managing a level 1 cache includes the steps of applying, for part of the at least one level 1 cache, a cache replacement policy designed to minimize utilization of a set of one or more resources in the system; and using, for other parts of the at least on level 1 cache, one or more other cache replacement policies designed to minimize utilization of one or more other sets of one or more resources in the system.
    • 用于分级缓存对象的系统和方法包括一个或多个1级节点,每个节点包括至少一个级别1高速缓存; 一个或多个2级节点,其中对象在请求时永久地存储或生成,每个级别2节点耦合到一个或多个级别1节点中的至少一个并且包括一个或多个级别2高速缓存; 以及存储控制设备,用于基于一组或多个标准,以协调的方式存储至少一级1缓存和/或至少一级2缓存中的一个或多个对象。 此外,在用于从一个或多个客户端接收对象的请求的系统中,系统具有一个或多个1级节点的集合,每个节点包含至少一个级别1高速缓存,用于管理级别1高速缓存的方法包括以下步骤: 对所述至少一个级别1缓存的一部分应用设计为最小化所述系统中的一个或多个资源的集合的利用的高速缓存替换策略; 以及为所述至少一级缓存的其他部分使用被设计为最小化所述系统中的一个或多个资源的一个或多个其他集合的利用的一个或多个其他高速缓存替换策略。
    • 10. 发明申请
    • FORWARDING PACKETS TO A DIRECTED ACYCLIC GRAPH DESTINATION USING LINK SELECTION BASED ON RECEIVED LINK METRICS
    • 使用基于接收的链接度量的链接选择将分组转发到指向的集合图表目标
    • US20100188979A1
    • 2010-07-29
    • US12751841
    • 2010-03-31
    • Pascal THUBERTFrancois Laurent LE FAUCHEUREric M. LEVY-ABEGNOLI
    • Pascal THUBERTFrancois Laurent LE FAUCHEUREric M. LEVY-ABEGNOLI
    • G01R31/08H04J1/16
    • H04L43/022H04L43/08H04L45/123H04L45/20H04W40/24
    • Each network node having at least one destination-oriented link toward a directed acyclic graph (DAG) destination can receive a corresponding set of path performance metrics via the destination-oriented link. The set of path performance metrics, initiated by the DAG destination outputting initial link metrics on each of its source-connecting links, identifies aggregate link metrics for a corresponding path to the DAG destination via the corresponding destination-oriented link. The network node outputs a corresponding updated set of path performance metrics on each of its source-connecting links based on the received set of path performance metrics and the corresponding link metric for the corresponding source-connecting link. Hence, each network node in the DAG can assess the performance of each connected path to the DAG destination, and forward a data packet via a selected destination-oriented link based on the corresponding path performance metrics and forwarding policies for the forwarded data packet.
    • 具有朝向有向非循环图(DAG)目的地的至少一个目的地定向链路的每个网络节点可以经由目的地定向链路接收相应的一组路径性能度量。 由DAG目的地发起的路由性能度量集合,其每个源连接链路上的初始链路度量在每个源连接链路上输出,通过相应的目的地导向链路来标识到达目​​的地的相应路径的聚合链路度量。 网络节点基于所接收的路径性能度量集合和对应的源连接链路的相应链路度量,在其每个源连接链路上输出对应的更新路径性能度量集合。 因此,DAG中的每个网络节点可以评估到DAG目的地的每个连接路径的性能,并且基于所转发的数据分组的相应路径性能度量和转发策略,经由所选择的目的地定向链路转发数据分组。