公开(公告)号：US07177951B1

公开(公告)日：2007-02-13

申请号：US09625624

申请日：2000-07-26

申请人： Douglas Dykeman ,  Michael Osbourne ,  Paolo Scotton ,  Olen Stokes ,  Claude Basso ,  Marianne Aubry ,  Minh-Tri Do Khac

发明人： Douglas Dykeman ,  Michael Osbourne ,  Paolo Scotton ,  Olen Stokes ,  Claude Basso ,  Marianne Aubry ,  Minh-Tri Do Khac

IPC分类号： G06F15/16

CPC分类号： H04L29/12254 ,  H04L29/12009 ,  H04L29/12783 ,  H04L29/12801 ,  H04L41/0893 ,  H04L41/12 ,  H04L45/02 ,  H04L45/04 ,  H04L49/3081 ,  H04L61/2038 ,  H04L61/35 ,  H04L61/6004 ,  H04L2012/5621 ,  H04L2012/5627 ,  H04L2012/5685 ,  H04Q11/0478

摘要： Address management methods and apparatus are provided for a node serving as peer group leader for a peer group of nodes in one level of the hierarchy of a PNNI hierarchical network, whereby the peer group leader represents the peer group to one or more neighboring nodes in the next level up of the hierarchy. The peer group leader has a memory (2) for storing peer group topology data (4), comprising address data which is supplied to the peer group leader from nodes in the peer group and represents addresses for access by the network, and peer group leader topology data (5), comprising address data which is supplied to said neighboring nodes by the peer group leader and represents addresses accessible via the peer group. The address management method comprises: checking whether addresses represented by said address data are accessible via the peer group; notifying said neighboring nodes of changes in the accessibility of addresses so identified; and updating said peer group leader topology data (5) in accordance with said changes.

摘要翻译： 为PNNI分级网络的层级的一个级别中的对等组节点作为对等组组长的节点提供地址管理方法和装置，由此对等组组长表示对等体组到一个或多个相邻节点 下一级别的层次结构。 对等组组长具有用于存储对等组群拓扑数据（4）的存储器（2），包括从对等组中的节点提供给对等组组长的地址数据，表示网络接入的地址和对等组组长 拓扑数据（5），包括由对等组组长提供给所述相邻节点并且表示经由对等组可访问的地址的地址数据。 地址管理方法包括：检查由所述地址数据表示的地址是否可通过对等体组访问; 通知所述相邻节点对所识别的地址的可访问性的变化; 以及根据所述改变更新所述对等群组领导拓扑数据（5）。

公开(公告)号：US06370119B1

公开(公告)日：2002-04-09

申请号：US09036354

申请日：1998-03-06

申请人： Claude Basso ,  Paolo Scotton

发明人： Claude Basso ,  Paolo Scotton

IPC分类号： G01R3108

CPC分类号： H04L45/14 ,  H04L45/12 ,  H04L45/123 ,  H04L45/124

摘要： A method and system is described for determining the optimal path for routing a communication in a communication network between a source node and at least one destination node. The determination is based upon evaluation of the path offering the widest bandwidth in the direction of data transmission, the lowest additive cost, and the lowest hop count. Each link of the network is associated with at least a restrictive cost and an additive cost reflecting selected link characteristics. A path is characterized by a restrictive cost and an additive cost derived from the link costs of its component links. A connection to be routed identifies a source node, a destination node and a maximum restrictive cost allowed for routing the connection. All acceptable paths from the source node to all the other nodes of the network are determined and stored. These paths deemed acceptable and are stored if they have the lowest restrictive cost that allows the routing of the connection, and if they have the lowest additive cost and minimum hop count. Finally, from the plurality of stored acceptable paths, the path that originates from the source node and terminates at the destination node is selected as the optimal path to route the connection.

摘要翻译： 描述了一种方法和系统，用于确定用于在源节点和至少一个目的地节点之间的通信网络中路由通信的最佳路径。 该决定是基于在数据传输方向上提供最宽带宽的路径评估，最低附加成本和最低跳数。 网络的每个链路至少具有限制性成本和反映所选链路特征的附加成本。 路径的特征在于限制性成本和来自其组件链路的链路成本的附加成本。 要路由的连接标识源节点，目的地节点和允许路由连接的最大限制性成本。 确定并存储从源节点到网络的所有其他节点的所有可接受的路径。 这些路径被认为是可接受的，并且如果它们具有允许连接路由的限制性成本最低，并且如果它们具有最低的附加成本和最小跳数，则被存储。 最后，从多个存储的可接受路径中，选择源自源节点并终止于目的节点的路径作为路由连接的最佳路径。

公开(公告)号：US10057106B2

公开(公告)日：2018-08-21

申请号：US13597651

申请日：2012-08-29

申请人： David Clerc ,  Jacques Fontignie ,  Luis Garcés-Erice ,  John G. Rooney ,  Paolo Scotton

发明人： David Clerc ,  Jacques Fontignie ,  Luis Garcés-Erice ,  John G. Rooney ,  Paolo Scotton

IPC分类号： G06F15/167 ,  H04L29/08

CPC分类号： H04L67/06 ,  H04L29/08729 ,  H04L65/604 ,  H04L65/607 ,  H04L67/1097 ,  H04N21/2181

摘要： A method and system for transmitting data including pieces of data. The method includes the steps of: placing a piece of data on at least one cache memory; and sending a signal indicating a presence of the piece of data on the cache memory to at least one client, where at least one of the steps is carried out by a computer device.

公开(公告)号：US20110007663A1

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

申请号：US12500397

申请日：2009-07-09

申请人： Paolo Scotton ,  John G. Rooney

发明人： Paolo Scotton ,  John G. Rooney

IPC分类号： H04L12/28

CPC分类号： H04L45/00 ,  H04L45/128 ,  H04W40/246

摘要： A system of nodes including processors within a wireless sensor network includes an arrangement of the nodes with data connections therebetween within the wireless sensor network, wherein the data connections are limited to a set of distinct, non-intersecting paths, wherein each source node of the nodes is connected with a root nodes of the nodes by at least a predetermined number of the paths

摘要翻译： 包括无线传感器网络内的处理器的节点系统包括在无线传感器网络内具有数据连接的节点的布置，其中数据连接限于一组不同的不相交路径，其中， 节点通过至少预定数量的路径与节点的根节点连接

公开(公告)号：US20080269957A1

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

申请号：US12099242

申请日：2008-04-08

申请人： John G. Rooney ,  Paolo Scotton

发明人： John G. Rooney ,  Paolo Scotton

IPC分类号： G06F17/00 ,  B61L25/02

CPC分类号： B61L25/028

摘要： The present invention relates to a method and apparatus for determining the order of wagons in a train. The invention configures a plurality of wagons of a train to sense at least one environmental condition that the wagons are respectively exposed to when the train is moving. The invention configures the wagons to generate a corresponding announcement message in response to a change in state of the environmental condition. The invention configures the first wagon of the train to listen for the announcement message generated by any of the plurality of wagons. The invention configures the first wagon to compute a sequence of the announcement messages from an order in which the wagons have been heard.

摘要翻译： 本发明涉及一种用于确定列车中车辆顺序的方法和装置。 本发明构成了一列火车的多个货车，以便感测到货车在火车运行时分别暴露于的至少一个环境条件。 本发明根据环境状态的变化来配置货车以产生相应的通知消息。 本发明构成列车的第一车厢，以收听由多个货车中的任何一个产生的通知消息。 本发明将第一辆货车配置成从已经听到货车的顺序计算公告消息的序列。

公开(公告)号：US07355980B2

公开(公告)日：2008-04-08

申请号：US10432453

申请日：2001-11-12

申请人： Daniel Bauer ,  John N. Daigle ,  Ilias Iliadis ,  Paolo Scotton

发明人： Daniel Bauer ,  John N. Daigle ,  Ilias Iliadis ,  Paolo Scotton

IPC分类号： H04L12/28

CPC分类号： H04Q11/0478 ,  H04L45/124

摘要： A method for deriving a set of efficient path costs for a group of nodes comprising a source node and a plurality of destination nodes in a data communications networks, wherein the path costs for paths between nodes in the group are defined in the network and each path cost comprises a restrictive cost and an additive cost, comprises iteratively identifying the paths of higher bandwidth first and, when two or more paths of equal bandwidth are encountered, selecting the path having a lower transit delay associated therewith.

摘要翻译： 一种用于导出包括数据通信网络中的源节点和多个目的地节点的节点组的一组有效路径成本的方法，其中，所述组中的节点之间的路径的路径开销在网络中定义，并且每个路径 成本包括限制性成本和附加成本，包括首先迭代地识别较高带宽的路径，并且当遇到两个或更多个相等带宽的路径时，选择具有与之相关联的较低传输延迟的路径。

公开(公告)号：US5495479A

公开(公告)日：1996-02-27

申请号：US262089

申请日：1994-06-20

申请人： Claude Galaand ,  Paolo Scotton

发明人： Claude Galaand ,  Paolo Scotton

IPC分类号： H04L12/24 ,  H04L12/56 ,  H04L12/44

CPC分类号： H04L45/04 ,  H04L41/0803 ,  H04L45/46 ,  Y04S40/162

摘要： The object of the invention is to perform an automatic decomposition of a packet switching network in backbone nodes and subareas nodes to speed up the routing path search without degrading the optimization criterion of the routing algorithm and without generating additional control messages on the network.Currently, routing algorithms compute all the available paths in the network, from the source node to the destination node before to select an optimal route. However, networks are rarely fully meshed. They are usually built around a hierarchical structure: a set of nodes, interconnected by high throughput lines, are used to build a backbone with a high degree of meshing and then, local nodes are grouped in geographical subareas themselves attached to the backbone. Routing algorithms can take advantage of this particular network topology to drastically reduce the complexity of paths computation. For a given connection, only a limited number of nodes are defined as usable and are taken in account by the algorithm in its path calculation.

摘要翻译： 本发明的目的是在骨干节点和子区域节点中执行分组交换网络的自动分解，以加速路由路径搜索，而不会降低路由算法的优化准则，而不会在网络上生成额外的控制消息。 目前，路由算法在从源节点到目的地节点之前计算网络中的所有可用路径，以选择最优路由。 然而，网络很少完全网格化。 它们通常围绕层次结构构建：通过高吞吐量线互连的一组节点用于构建具有高度网格划分的骨干网，然后将本地节点分组到附属于骨干网的地理子区域中。 路由算法可以利用这种特定的网络拓扑，大大降低了路径计算的复杂度。 对于给定的连接，只有有限数量的节点被定义为可用的，并且在其路径计算中由算法考虑。

公开(公告)号：US20140317394A1

公开(公告)日：2014-10-23

申请号：US14347650

申请日：2012-07-04

申请人： Peter Buhler ,  David Clerc ,  Luis Garcés-Erice ,  Thomas Gschwind ,  John G. Rooney ,  Andreas Schade ,  Paolo Scotton

发明人： Peter Buhler ,  David Clerc ,  Luis Garcés-Erice ,  Thomas Gschwind ,  John G. Rooney ,  Andreas Schade ,  Paolo Scotton

IPC分类号： G06F9/44

CPC分类号： G06F9/4416 ,  G06F21/575

摘要： Methods and apparatus are provided for provisioning an operating system image from a server (2) to an untrusted user terminal (4) via a data communications network (3). A trusted device (5) such as a pocket USB device has tamper-resistant storage (9) containing bootloader logic, for controlling booting of a user terminal, and security data. On connection of the trusted device (5) to an untrusted user terminal (4), the user terminal is booted via the bootloader logic on the trusted device. Under control of the bootloader logic, a connection is established to the server (2) via the network (3) and the server is authenticated using the security data on the trusted device (5). An operating system boot image is received from the server (2) via this connection. The boot image is used to provision an operating system image from the server (2) to the user terminal (4) for execution of the operating system at the user terminal (4).

摘要翻译： 提供了用于经由数据通信网络（3）将操作系统映像从服务器（2）提供给不可信用户终端（4）的方法和装置。 诸如口袋USB设备的可信设备（5）具有包含引导加载器逻辑的防篡改存储器（9），用于控制用户终端的引导和安全数据。 在可信设备（5）连接到不受信任的用户终端（4）时，用户终端通过可信设备上的引导加载程序逻辑引导。 在引导加载器逻辑的控制下，经由网络（3）建立到服务器（2）的连接，并且使用可信设备（5）上的安全数据对服务器进行认证。 通过该连接从服务器（2）接收操作系统引导映像。 引导映像用于将操作系统映像从服务器（2）提供给用户终端（4），以在用户终端（4）处执行操作系统。

公开(公告)号：US20130219161A1

公开(公告)日：2013-08-22

申请号：US13882247

申请日：2011-11-03

申请人： Jacques Fontignie ,  Claudio Marinelli ,  Paolo Scotton ,  Marc Vuilleumier Stueckelberg

发明人： Jacques Fontignie ,  Claudio Marinelli ,  Paolo Scotton ,  Marc Vuilleumier Stueckelberg

IPC分类号： G06F9/44

CPC分类号： G06F9/4401 ,  G06F8/63

摘要： A mechanism is provided for migrating a software image installed on a source data-processing entity to a target data-processing entity. The target data-processing entity is booted from a preliminary bootstrap program. The software image is mounted as a remote mass memory on the target data-processing entity. A primary bootstrap program of the software image is copied onto a local mass memory of the target data-processing entity. The target data-processing entity is re-booted from the primary bootstrap program thereby loading a streaming function, and serving each request of accessing a memory block on the target data-processing entity by the streaming function. In response to the memory block missing from the local mass storage, the streaming function downloads the memory block from the software image and stores the memory block into the local mass memory. Otherwise, the streaming function retrieves the memory block from the local mass memory otherwise.

摘要翻译： 提供了一种用于将安装在源数据处理实体上的软件映像迁移到目标数据处理实体的机制。 目标数据处理实体从初步引导程序启动。 该软件映像作为远程大容量存储器安装在目标数据处理实体上。 将软件映像的主引导程序复制到目标数据处理实体的本地大容量存储器中。 目标数据处理实体从主引导程序重新启动，从而加载流传输功能，并通过流传输功能为目标数据处理实体提供访问存储块的每个请求。 响应于本地大容量存储器丢失的存储器块，流式传输功能从软件映像下载存储器块，并将存储器块存储到本地大容量存储器中。 否则，流功能从本地批量存储器中检索内存块。

公开(公告)号：US20130031199A1

公开(公告)日：2013-01-31

申请号：US13483141

申请日：2012-05-30

申请人： David Clerc ,  Jacques Fontignie ,  Luis Garcés-Erice ,  John G. Rooney ,  Paolo Scotton

发明人： David Clerc ,  Jacques Fontignie ,  Luis Garcés-Erice ,  John G. Rooney ,  Paolo Scotton

IPC分类号： G06F15/167

CPC分类号： H04L29/08729 ,  H04L65/604 ,  H04L65/607 ,  H04L67/06 ,  H04L67/1097 ,  H04N21/2181

摘要： A method and system for transmitting data including pieces of data. The method includes the steps of: placing a piece of data on at least one cache memory; and sending a signal indicating a presence of the piece of data on the cache memory to at least one client, where at least one of the steps is carried out by a computer device.