专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

51. 发明申请

US20060215577A1 System and methods for identifying network path performance 审中-公开
标题翻译：用于识别网络路径性能的系统和方法
公开(公告)号：US20060215577A1
公开(公告)日：2006-09-28
申请号：US11086007
申请日：2005-03-22
申请人： James Guichard , Jean-Philippe Vasseur , Thomas Nadeau , David Ward
发明人： James Guichard , Jean-Philippe Vasseur , Thomas Nadeau , David Ward
IPC分类号： H04L12/28
CPC分类号： H04L43/50 , H04L41/12 , H04L41/5003 , H04L45/00 , H04L45/121 , H04L45/123 , H04L45/124 , H04L45/22 , H04L45/26 , H04L45/302 , H04L45/42 , H04L45/50
摘要： A system and method for aggregating performance characteristics for core network paths allows computation of message traffic performance over each of the available candidate paths through the core for identifying an optimal core network path. Particular network traffic, or messages, include attributes indicative of performance, such as transport time, delay, jitter, and drop percentage, over individual hops along the candidate path. A diagnostic processor parses these messages to identify the attributes corresponding to performance, and analyzes the resulting parsed routing information to compute an expected performance, such as available bandwidth (e.g. transport rate) over the path. Messages including such attributes may include link state attribute (LSA) messages, diagnostic probe messages specifically targeted to enumerate such attributes, or other network suitable network traffic. In a particular configuration, the messages may be Path Verification Protocol (PVP) messages.
摘要翻译：用于聚合核心网络路径的性能特征的系统和方法允许通过核心的每个可用候选路径计算消息业务性能，用于识别最佳核心网路径。特定网络流量或消息包括指示性能的属性，例如沿着候选路径的单个跳跃的传输时间，延迟，抖动和丢弃百分比。诊断处理器解析这些消息以识别与性能相对应的属性，并分析所得到的解析路由信息以计算期望的性能，例如路径上的可用带宽（例如传输速率）。包括这些属性的消息可以包括链路状态属性（LSA）消息，专门用于枚举这样的属性的诊断探测消息，或其他网络合适的网络业务。在特定配置中，消息可以是路径验证协议（PVP）消息。

52. 发明申请

US20060171320A1 Inter-domain path computation technique 有权
标题翻译：域间路径计算技术
公开(公告)号：US20060171320A1
公开(公告)日：2006-08-03
申请号：US11049587
申请日：2005-02-02
申请人： Jean-Philippe Vasseur , Muthurajah Sivabalan , David Ward
发明人： Jean-Philippe Vasseur , Muthurajah Sivabalan , David Ward
IPC分类号： H04J3/14 , H04L12/28
CPC分类号： H04L45/04 , H04J3/14 , H04J3/16 , H04L45/02 , H04L45/42 , H04L45/44 , H04L45/50
摘要： A technique computes a traffic engineering (TE) label switched path (LSP) that spans multiple domains of a computer network from a head-end node of a local domain to a tail-end node of a remote domain. The novel inter-domain TE-LSP computation technique comprises a computation algorithm executed by the head-end node, which utilizes Path Computation Elements (PCEs) located within the remote domains (i.e., other than the local domain). Specifically, the head-end node requests path segments from a PCE in each of the remote domains, in which the path segments represent paths between all entry border routers to either all exit border routers of the particular remote domain (i.e., through the domain), or to the tail-end node. Upon receiving path segments from each remote domain, the head-end node combines the path segments with local domain information, and performs a forward path computation from the head-end node to the tail-end node to find the best (i.e., “shortest”) path.
摘要翻译：一种技术计算跨越计算机网络的多个域的流量工程（TE）标签交换路径（LSP），从本地域的头端节点到远程域的尾端节点。新颖的域间TE-LSP计算技术包括由前端节点执行的计算算法，其利用位于远程域内的路径计算元素（PCE）（即，除本地域之外）。特别地，前端节点从每个远程域中的PCE请求路径段，其中路径段表示所有入口边界路由器之间到特定远程域的所有出口边界路由器（即，通过域）的路径，，或到尾端节点。在从每个远程域接收路径段时，前端节点将路径段与本地域信息相结合，并且执行从前端节点到尾端节点的前向路径计算，以找到最佳（即“最短” “）路径。

53. 发明授权

US09319962B2 Local path repair in a wireless deterministic network 有权
标题翻译：无线确定性网络中的本地路径修复
公开(公告)号：US09319962B2
公开(公告)日：2016-04-19
申请号：US14043974
申请日：2013-10-02
申请人： Patrick Wetterwald , Jean-Philippe Vasseur , Pascal Thubert
发明人： Patrick Wetterwald , Jean-Philippe Vasseur , Pascal Thubert
IPC分类号： H04W40/04 , H04W72/04 , H04W40/34 , H04W40/38 , H04L12/721 , H04L12/707 , H04L12/703
CPC分类号： H04W40/04 , H04L45/12 , H04L45/22 , H04L45/28 , H04W40/34 , H04W40/38 , H04W72/0446 , Y02D70/144 , Y02D70/32
摘要： In one embodiment, an initial path is established in a wireless deterministic network between a source and a destination through one or more intermediate nodes, which are typically informed of a required metric between the source and the destination for communicating a packet. The initial path is locally (e.g., without contacting a path computation engine) reconfigured to bypass at least one of the intermediate nodes creating a new path, with the new path meeting the requirement(s) of the metric. Note, “locally reconfiguring” refers to the network nodes themselves determining a replacement path without reliance on a path computation engine or other entity (e.g., network management system, operating support system) in determining the replacement path. In one embodiment, a network node not on the initial path replaces a node on the initial path while using the same receive and send timeslots used in the initial path.
摘要翻译：在一个实施例中，通过一个或多个中间节点在源和目的地之间的无线确定性网络中建立初始路径，所述中间节点通常被通知源和目的地之间用于传送分组的所需度量。初始路径在本地（例如，不接触路径计算引擎）被重新配置为绕过创建新路径的至少一个中间节点，新路径满足度量的要求。注意，“本地重新配置”是指网络节点本身在不依赖路径计算引擎或其他实体（例如，网络管理系统，操作支持系统））确定替换路径时确定替换路径。在一个实施例中，不在初始路径上的网络节点替换初始路径上的节点，同时使用在初始路径中使用的相同的接收和发送时隙。

54. 发明授权

US09306831B2 Technique for efficient load balancing of TE-LSPs 有权
标题翻译： TE-LSP高效负载均衡技术
公开(公告)号：US09306831B2
公开(公告)日：2016-04-05
申请号：US11057641
申请日：2005-02-14
申请人： Jean-Philippe Vasseur
发明人： Jean-Philippe Vasseur
IPC分类号： H04L12/26 , G06F15/173 , H04L12/701 , H04L12/707 , H04L12/723
CPC分类号： H04L45/00 , H04L45/24 , H04L45/502
摘要： A technique efficiently load balances traffic engineering (TE) label switched paths (LSPs) from a head-end node to a tail-end node of a computer network. The novel load balancing technique identifies (e.g., at the head-end node or a path computation element, PCE) a set of paths with equal costs from the head-end node to the tail-end node, where each path of the set is composed of one or more associated links. “Link values” such as, e.g., the number of unconstrained TE-LSPs on the link, the amount of available bandwidth on the link, or the percent of total available bandwidth already in use on the link, are applied to each link of each path. The most restrictive link values (link availability) of each path of the set, such as, e.g., the link with the lowest amount of available bandwidth, etc., are then compared. Upon comparing the link availability, the novel technique load balances established and/or new TE-LSPs from the head-end node to the tail-end node over the set of paths accordingly.
摘要翻译：技术有效地将流量工程（TE）标签交换路径（LSP）从头端节点负载平衡到计算机网络的尾端节点。新颖的负载平衡技术在头端节点到尾端节点识别（例如，在头端节点或路径计算元件PCE）具有相同成本的路径集合，其中集合的每个路径为由一个或多个相关联的链接组成。 “链路值”例如链路上的无约束TE-LSP的数量，链路上的可用带宽的数量或链路上已经使用的总可用带宽的百分比被应用于每个链路的每个链路路径。然后比较集合的每个路径的最严格的链路值（链路可用性），例如具有最低可用带宽量的链路等。在比较链路可用性时，新技术相应地通过该组路径从前端节点到尾端节点建立和/或新的TE-LSP平衡。

55. 发明授权

US09300569B2 Compressing data packet routing information using bloom filters 有权
标题翻译：使用布隆过滤器压缩数据包路由信息
公开(公告)号：US09300569B2
公开(公告)日：2016-03-29
申请号：US13563077
申请日：2012-07-31
申请人： Jonathan W. Hui , Jean-Philippe Vasseur , Wei Hong
发明人： Jonathan W. Hui , Jean-Philippe Vasseur , Wei Hong
IPC分类号： H04L12/54 , H04L12/721 , H04L12/751 , G06F17/30 , H04L12/743
CPC分类号： H04L45/14 , G06F17/30162 , H04L45/02 , H04L45/12 , H04L45/7453 , H04L47/70
摘要： In one embodiment, a Transit Information Bloom Filter (TIBF) signal component is generated for use with a routing protocol control message, the TIBF signal component identifying at least one parent node for a corresponding routing topology. The TIBF signal component is encoded in a generated Bloom filter. The parameters of the generated Bloom filter are based at least on one parent node to be encoded and a desired false positive rate for the Bloom filter. The address for each parent node is also encoded in the Bloom filter.
摘要翻译：在一个实施例中，生成与路由协议控制消息一起使用的传输信息布隆过滤器（TIBF）信号分量，所述TIBF信号组件标识用于相应路由拓扑的至少一个父节点。 TIBF信号分量在生成的Bloom过滤器中进行编码。生成的Bloom过滤器的参数至少基于要编码的一个父节点和Bloom过滤器的所需假阳性率。每个父节点的地址也在Bloom过滤器中进行编码。

56. 发明授权

US09288066B2 Dynamic multicast mode selection in a communication network 有权
标题翻译：通信网络中的动态组播模式选择
公开(公告)号：US09288066B2
公开(公告)日：2016-03-15
申请号：US13293871
申请日：2011-11-10
申请人： Jonathan W. Hui , Jean-Philippe Vasseur
发明人： Jonathan W. Hui , Jean-Philippe Vasseur
IPC分类号： H04L12/28 , H04L12/18 , H04L12/751 , H04L12/721 , H04L12/761 , H04J1/16
CPC分类号： H04L12/18 , H04L45/02 , H04L45/14 , H04L45/16
摘要： In one embodiment, a network device selectively operates according to a sparse multicast mode where the network device stores individual devices interested in one or more multicast groups and distributes corresponding multicast group traffic based on the individual devices. Alternatively, the network device selectively operates according to a dense multicast mode where the network device maintains a list of the one or more multicast groups in which at least one device is interested and distributes corresponding multicast group traffic through broadcasting. By determining one or more resource-related characteristics, the network device may then select between operation in the sparse multicast mode and the dense multicast mode based on the resource-related characteristics.
摘要翻译：在一个实施例中，网络设备根据稀疏多播模式选择性地操作，其中网络设备存储对一个或多个多播组感兴趣的各个设备，并且基于各个设备分发相应的多播组业务。或者，网络设备根据密集组播模式选择性地操作，其中网络设备维护其中至少一个设备感兴趣的一个或多个多播组的列表，并且通过广播来分发对应的多播组业务。通过确定一个或多个资源相关特征，网络设备然后可以基于资源相关特性在稀疏组播模式和密集组播模式之间进行选择。

57. 发明授权

US09231850B2 Keepalive mechanism to maintain links in a lossy environment 有权
标题翻译：保持机制在有损环境中保持联系
公开(公告)号：US09231850B2
公开(公告)日：2016-01-05
申请号：US13400819
申请日：2012-02-21
申请人： Navneet Agarwal , Jean-Philippe Vasseur
发明人： Navneet Agarwal , Jean-Philippe Vasseur
IPC分类号： G06F15/16 , H04L12/751 , H04W40/12 , H04L12/721
CPC分类号： H04L45/026 , H04L45/70 , H04W40/12
摘要： In one embodiment, a particular device determines a selected link from the particular device toward a root device in a computer network, wherein traffic destined away from the root device via the particular device utilizes the selected link in reverse. By monitoring a link quality of the selected link in reverse based on received traffic over the selected link, the particular device may determine whether the link quality is below a lower threshold. In response to the link quality being below the lower threshold, the particular device activates use of keepalive messages from the particular device over the selected link.
摘要翻译：在一个实施例中，特定设备确定从特定设备到计算机网络中的根设备的选定链路，其中通过特定设备远离根设备的业务相反地使用所选择的链路。通过基于所选择的链路上的接收到的业务来反向监视所选择的链路的链路质量，特定设备可以确定链路质量是否低于较低的阈值。响应于链路质量低于较低阈值，特定设备激活在所选链路上使用来自特定设备的保持活动消息。

58. 发明授权

US09198203B2 System and method for routing critical communications 有权
标题翻译：关键通信路由系统和方法
公开(公告)号：US09198203B2
公开(公告)日：2015-11-24
申请号：US12942972
申请日：2010-11-09
申请人： Shmuel Shaffer , Jean-Philippe Vasseur , Sandeep Jay Shetty
发明人： Shmuel Shaffer , Jean-Philippe Vasseur , Sandeep Jay Shetty
IPC分类号： G06F15/16 , H04W76/00 , H04L29/06 , H04L12/701 , H04L12/707 , H04W4/00 , H04W84/18
CPC分类号： H04W76/007 , H04L29/06 , H04L45/00 , H04L45/24 , H04W4/38 , H04W40/22 , H04W40/28 , H04W76/50 , H04W84/18 , Y02D70/142 , Y02D70/144 , Y02D70/22
摘要： According to one or more implementations of the disclosure, packets may be transmitted in a low power and lossy network (LLN) by receiving, on a first node, a message from a sending node, and by activating a critical message configuration to be applied in routing the message. A message identifier (e.g., signature) for the message may also be received or gleaned. The message identifier can be compared at the first node to a list of stored message identifiers, created based on routing history, to determine if the message has already been received. As such, if the message has not been received at the first node previously, a first parent and a second parent for the message are identified and the message, along with the critical message indication, can be transmitted to the first parent and the second parent, thereby achieving redundancy in the routing of the message.
摘要翻译：根据本公开的一个或多个实现方式，分组可以通过在第一节点上从发送节点接收消息并且通过激活要应用的关键消息配置来在低功率和有损网络（LLN）中发送路由消息。消息的消息标识符（例如，签名）也可以被接收或收集。可以将消息标识符在第一节点处与基于路由历史创建的存储消息标识符列表进行比较，以确定消息是否已经被接收。因此，如果先前还没有在第一个节点处接收到消息，则识别该消息的第一个父节点和第二个父节点，并将该消息连同关键消息指示一起发送到第一个父节点和第二个父节点从而在消息的路由中实现冗余。

59. 发明申请

US20150263811A1 Network Server Layer Providing Disjoint Channels in Response to Client-Layer Disjoint Path Requests 审中-公开
标题翻译：网络服务器层提供响应于客户端层不连续路径请求的不相交通道
公开(公告)号：US20150263811A1
公开(公告)日：2015-09-17
申请号：US14726585
申请日：2015-05-31
申请人： Clarence Filsfils , Ornan Alexander Gerstel , Gabriele Maria Galimberti , Jean-Philippe Vasseur , David Delano Ward , Walid Wakim
发明人： Clarence Filsfils , Ornan Alexander Gerstel , Gabriele Maria Galimberti , Jean-Philippe Vasseur , David Delano Ward , Walid Wakim
IPC分类号： H04B10/27 , H04B10/25 , H04L12/723
CPC分类号： H04B10/27 , H04B10/25 , H04J14/0267 , H04L45/128 , H04L45/50 , H04L67/42 , H04Q11/0005 , H04Q11/0066 , H04Q2011/0077
摘要： In one embodiment, a network server layer provides disjoint channels in response to client-layer disjoint path requests. For example, the network layer can be an optical network, and the client layer may be a packet switching layer (e.g., label switching, Internet Protocol). In one embodiment, a server-layer node receives a client-layer disjoint path request to provide a server-layer channel through a server-layer network. The client-layer disjoint path request includes an identifier corresponding to an existing client-layer path that traverses a current channel through the server-layer network that does not include the server-layer node. The server-layer network determines a particular channel through the server-layer network that is disjoint to the current channel based on route information of the current channel, and then signaling is performed within the server-layer network to establish the particular channel.
摘要翻译：在一个实施例中，网络服务器层响应于客户端层不相交路径请求而提供不相交的信道。例如，网络层可以是光网络，并且客户端层可以是分组交换层（例如，标签交换，因特网协议）。在一个实施例中，服务器层节点接收客户端层不相交路径请求，以通过服务器层网络提供服务器层信道。客户端层不相交路径请求包括对应于穿过不包括服务器层节点的服务器层网络的当前信道的现有客户端层路径的标识符。服务器层网络基于当前信道的路由信息，通过服务器层网络确定与当前信道不相关的特定信道，然后在服务器层网络内执行信令以建立特定信道。

60. 发明授权

US09124482B2 Delay budget based forwarding in communication networks 有权
标题翻译：在通信网络中延迟基于预算的转发
公开(公告)号：US09124482B2
公开(公告)日：2015-09-01
申请号：US13185805
申请日：2011-07-19
申请人： Jean-Philippe Vasseur , Jonathan W. Hui
发明人： Jean-Philippe Vasseur , Jonathan W. Hui
IPC分类号： H04L12/875 , H04L12/751 , H04W72/12 , H04L12/727 , H04L12/26 , H04W72/04 , H04L12/823
CPC分类号： H04L47/283 , H04L43/00 , H04L43/08 , H04L45/02 , H04L45/121 , H04L45/24 , H04L45/30 , H04L47/32 , H04L47/56 , H04W72/048 , H04W72/12
摘要： In one embodiment, certain nodes in a computer network maintain a plurality of routing topologies, each associated with a different corresponding delay (e.g., dynamically adjusted). Upon receiving a packet with an indicated delay budget at a particular node, the node updates the delay budget based on an incurred delay up to and including the particular node since the indicated delay budget was last updated, and selects a particular routing topology on which to forward the packet based on the updated delay budget and the corresponding routing topology delays. The packet may then be forwarded with the updated delay budget on the selected routing topology, accordingly.
摘要翻译：在一个实施例中，计算机网络中的某些节点维护多个路由拓扑，每个路由拓扑与不同的对应延迟（例如，动态调整）相关联。在特定节点接收到具有指示的延迟预算的分组之后，节点根据所指示的延迟预算最近更新时，基于直到并包括特定节点的发生的延迟来更新延迟预算，并且选择特定路由拓扑基于更新的延迟预算和相应的路由拓扑延迟来转发分组。相应地，可以在所选择的路由拓扑上以更新的延迟预算转发分组。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式