公开(公告)号：EP2761523A4

公开(公告)日：2015-04-29

申请号：EP12837063

申请日：2012-07-04

Applicant: IBM

Inventor： BUHLER PETER ,  CLERC DAVID ,  GARCES-ERICE LUIS ,  GSCHWIND THOMAS ,  ROONEY JOHN G ,  SCHADE ANDREAS ,  SCOTTON PAOLO

IPC: G06F21/57 ,  G06F9/44

CPC classification number: G06F9/4416 ,  G06F21/575

Abstract: 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).

公开(公告)号：JP2000101631A

公开(公告)日：2000-04-07

申请号：JP23659899

申请日：1999-08-24

Applicant: IBM

Inventor： ILIADIS ILIAS ,  SCOTTON PAOLO

IPC: H04L12/70 ,  H04L12/751 ,  H04Q11/04 ,  H04L12/46 ,  H04L12/28

Abstract: PROBLEM TO BE SOLVED: To obtain a method which is fast and reliable by deciding several nodes as border nodes, providing a data base which has cost items between all pairs of the border nodes, checking the cost items, constituting the optimum composite node representation of a logical group, and deriving the optimum composite node representation of a PNNI equal group. SOLUTION: The whole PNNI group is represented as a single node by using a PNNI layer. When this principle is used, the complexity in line design is reduced. Nodes A, B, and C in a layer (k) are clustered to form a node of a layer k+1. Three of nodes of the PNNI equal groups A in the layer (k) have links 10, 11, and 12 connecting the equal group A to other equal groups B, C, and D, so they have special duties. Those nodes are called border nodes. The equal groups include nodes and links connecting pairs of nodes and some of the nodes are border nodes.

公开(公告)号：JP2000069005A

公开(公告)日：2000-03-03

申请号：JP21012699

申请日：1999-07-26

Applicant: IBM

Inventor： ILIADIS ILIAS ,  SCOTTON PAOLO

IPC: H04L12/70 ,  H04Q11/04 ,  H04L12/28

Abstract: PROBLEM TO BE SOLVED: To provide a high-speed and high-reliability method for calculating a complex node representation. SOLUTION: In order to calculate a restrictive cost between a pair of boundary nodes in a PNNI equal group, a list sorted according to a restrictive cost C of a link is maintained (a). Then, the links are provided successively from the lowest cost C in the logic set of nodes, identifiers are allocated to respective two connected nodes, and the node in the set carries any controlling unique identifier in the case that the boundary nodes are the elements of the set but carriers the unique identifier in the other case, and when the nodes in the first and second sets are connected through the link, in the case that any one of these nodes carries the controlling unique identifier, the controlling unique identifier is allocated to all the nodes in both the sets but in the other case, the unique identifier is allocated to all the nodes in both the groups so that two sets are merged (b). When the said link is to connect the nodes of the first and second sets already carrying the controlling unique identifier and a matrix update algorithm is applied (c).

公开(公告)号：WO0243324A3

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

申请号：PCT/IB0102078

申请日：2001-11-12

Applicant: IBM ,  BAUER DANIEL ,  DAIGLE JOHN ,  ILIADIS ILIAS ,  SCOTTON PAOLO

Inventor： BAUER DANIEL ,  DAIGLE JOHN ,  ILIADIS ILIAS ,  SCOTTON PAOLO

IPC: H04L12/18 ,  H04L12/721 ,  H04Q11/04 ,  H04L12/56

CPC classification number: H04Q11/0478 ,  H04L45/124

Abstract: 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.

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

公开(公告)号：WO2004086681A3

公开(公告)日：2004-12-16

申请号：PCT/IB2004001055

申请日：2004-03-24

Applicant: IBM ,  ROONEY SEAN ,  SCOTTON PAOLO

Inventor： ROONEY SEAN ,  SCOTTON PAOLO

IPC: H04L12/28 ,  H04L12/56 ,  H04W8/02 ,  H04W36/00 ,  H04W84/12

CPC classification number: H04W48/20 ,  H04W8/02 ,  H04W36/32 ,  H04W84/12

Abstract: A method and a mobile station (1) are introduced for providing access to a wireless local area network. As wireless local area networks (3,4,5) cannot be accessed by a mobile station (1) moving with high speed, the establishment of a connection to the wireless local area network (3,4,5) is subject to a motion value (mv). The motion value (mv) is provided by the mobile station (1) itself or by a services unit (21) of the transport mechanism (2) the mobile station (1) is traveling with.

Abstract translation: 引入方法和移动台（1）以提供对无线局域网的接入。 由于无线局域网（3,4,5）不能以高速移动的移动台（1）来访问，所以建立到无线局域网（3,4,5）的连接受到运动 值（mv）。 运动值（mv）由移动台（1）本身或由移动台（1）正在行进的传送机构（2）的服务单元（21）提供。

公开(公告)号：WO2004047408A8

公开(公告)日：2004-07-29

申请号：PCT/IB0304800

申请日：2003-10-28

Applicant: IBM ,  ROONEY SEAN ,  SCOTTON PAOLO ,  BAUER DANIEL ,  WALDVOGEL MARCEL

Inventor： ROONEY SEAN ,  SCOTTON PAOLO ,  BAUER DANIEL ,  WALDVOGEL MARCEL

IPC: H04L12/24 ,  H04L29/06 ,  H04L29/08

CPC classification number: H04L67/104 ,  H04L67/1046 ,  H04L67/2814 ,  H04L67/2819 ,  H04L69/329

Abstract: A method and an electronic unit are disclosed for controlling traffic on a network, especially for controlling peer-to-peer related traffic. A filter unit is intercepting messages related to peer-to-peer application from a network line, irrespective of the messages' destination, A control logic then manages a request represented by an intercepted message subject to its content and subject to peering specific information.

Abstract translation: 公开了用于控制网络上的业务，特别是用于控制对等相关业务的方法和电子单元。 过滤器单元正在拦截与来自网络线的对等应用有关的消息，而不管消息的目的地。然后，控制逻辑管理由截取的消息所表示的受其内容并且服从对等特定信息的请求。

公开(公告)号：GB2525409A

公开(公告)日：2015-10-28

申请号：GB201407187

申请日：2014-04-24

Applicant: IBM

Inventor： BUHLER PETER ,  GSCHWIND THOMAS ,  SCOTTON PAOLO

IPC: G06F21/57 ,  G06F21/78

Abstract: An external device 20 comprises a boot loader 24 for an external operating system (OS) and partitioning information 22 of an expected location of a partition in data storage 11 of a computer 10 to which it can be connected. Preferably the external device also includes second encrypted data units of reference partition table data 220 for the data storage. The data storage 11 comprises a partition 122 and first encrypted data units of partition table data 120. Allowing the external OS to access the encrypted data, upon connection of the external device to the computer, by instructing to boot the computer from the boot loader; and during or after booting of the computer: comparing the partition information of the first and second encrypted data units; and if they match, allowing the external OS (112) to access, based on the partitioning information, the data storage. The comparison may be of hashes of the partition table data and the method allows users to bring your own device (BYOD).

公开(公告)号：GB2499290B

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

申请号：GB201221591

申请日：2012-11-30

Applicant: IBM

Inventor： MARINELLI CLAUDIO ,  MACLELLAN SCOT ,  SCOTTON PAOLO ,  FONTIGNIE JACQUES

IPC: G06F9/455 ,  G06F3/06

Abstract: A solution for managing a software image being stored in a plurality of physical blocks of a storage system comprises monitoring each access to the physical blocks, calculating a predicted sequence of access to the physical blocks according to the monitored accesses, and reorganizing the physical blocks according to the predicted sequence. The monitoring may be performed as the physical blocks are accessed during the booting of virtual images on the software image.

公开(公告)号：DE69331054T2

公开(公告)日：2002-06-20

申请号：DE69331054

申请日：1993-07-30

Applicant: IBM

Inventor： GALAND CLAUDE ,  SCOTTON PAOLO

IPC: H04L12/24 ,  H04L12/56

Abstract: 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.

公开(公告)号：DE69123579D1

公开(公告)日：1997-01-23

申请号：DE69123579

申请日：1991-09-06

Applicant: IBM

Inventor： MENEZ JEAN ,  ROSSO MICHELE ,  SCOTTON PAOLO

IPC: H03H15/00 ,  H03H17/00 ,  H03H21/00 ,  H04B3/23

Abstract: The echo cancellation method includes starting with an arbitrary set of echo filter coefficients. The coefficients are first sequentially re-estimated using a fast converging method. These operations are repeated a predefined number of times, and then the coefficients estimation is switched to a low converging but more precise method. In addition, an adaptive threshold is being defined and readjusted and all filter coefficients lower than said threshold are being discarded. Finally, sampling time boundaries are adaptively defined based on non-discarded filter coefficients with reference to said threshold, and in such a way the final echo cancelation algorighm is adaptive to echo variations (backtracking algorithm).