公开(公告)号：CA2505630A1

公开(公告)日：2004-06-03

申请号：CA2505630

申请日：2003-10-28

Applicant: IBM

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

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

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 the n manages a request represented by an intercepted message subject to its conte nt and subject to peering specific information.

公开(公告)号：AU1259602A

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

申请号：AU1259602

申请日：2001-11-12

Applicant: IBM

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

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

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.

公开(公告)号：DE69123579T2

公开(公告)日：1997-06-12

申请号：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).

公开(公告)号：DE112014000337T5

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

申请号：DE112014000337

申请日：2014-03-14

Applicant: IBM

Inventor： BUHLER PETER ,  GARCES-ERICE LUIS ,  GSCHWIND THOMAS ,  HOERING FRANK ,  ROONEY JOHN G ,  SCOTTON PAOLO ,  BAENTSCH MICHAEL ,  KUYPER-HAMMOND MICHAEL PETER

IPC: G06F21/57 ,  G06F9/445

Abstract: Die vorliegende Erfindung bezieht sich insbesondere auf ein Verfahren zum Ausführen von Software-Modulen auf einem Computer, wobei das Verfahren aufweist: Ausführen (S4) eines Boot-Ladeprogramms (15, 16) zumindest teilweise (16) auf dem Computer (101); und bei Ausführung des Boot-Ladeprogramms: Zugreifen (S5) auf Anforderungen an einen Anfangssatz (IS) von Software-Modulen SMn; und Hardware-Spezifikationen des Computers; Ermitteln (S6) innerhalb des Anfangssatzes eines oder mehrerer Kandidatensätze (CS1, CS2) von Software-Modulen, die mit den Hardware-Spezifikationen kompatibel sind (S6a) und als RAM-Platte speicherbar sind (S6b); und Speichern (S9) der Software-Module eines Abschlusssatzes (FS) auf einer RAM-Platte (121), wobei es sich bei dem Abschlusssatz (FS) um einen des einen oder der mehreren Kandidatensätze handelt, und Anweisen, die auf der RAM-Platte gespeicherten Software-Module auszuführen, wobei sowohl der Anfangssatz als auch der Abschlusssatz von Software-Modulen Anwendungskomponenten und Betriebssystem-Abbildkomponenten aufweist und des Weiteren bevorzugt Hardware-Komponententreiber aufweist. Die vorliegende Erfindung bezieht sich des Weiteren auf ein Boot-Ladeprogramm, eine für Benutzer vertrauenswürdige Einheit und ein System.

公开(公告)号：GB2512376A

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

申请号：GB201305727

申请日：2013-03-28

Applicant: IBM

Inventor： BAENTSCH MICHAEL ,  BUHLER PETER ,  GARCES-ERICE LUIS ,  GSCHWIND THOMAS ,  HOERING FRANK ,  KUYPER-HAMMOND MICHAEL PETER ,  ROONEY JOHN G ,  SCOTTON PAOLO

IPC: G06F9/44 ,  G06F21/57

Abstract: Disclosed is a method of executing software modules on a computer. The method start by executing S4 a bootloader in the computer and then accessing S5 requirements as to an initial set of software modules and hardware specifications of the computer. Then determining S6 within the initial set, a candidate set CS1 of software modules that are compatible S6a with the hardware specifications and can S6b be stored as a RAM disk and storing S9 the software modules of a final set on a RAM disk , the final set being a candidate set. Executing the software modules stored on the RAM disk, wherein each of the initial set and the final set of software modules comprises application components and operating system image components and hardware component drivers. A trusted device such as a USB drive may hold the bootloader and the software modules.

公开(公告)号：GB2499290A

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

申请号：GB201221591

申请日：2012-11-30

Applicant: IBM

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

IPC: G06F9/455 ,  G06F3/06

Abstract: A method for managing a software image 325 being stored in blocks 320 of physical storage comprises, monitoring each access to the physical blocks, calculating or predicting a probable sequence of access to the physical blocks and re-organising/re-arranging the physical blocks according to the probable sequence. The method may be performed by a plurality of virtual machines 220 running on the software image, with a virtual disk having blocks mapped to the blocks of physical storage. The monitoring of accesses to the physical blocks may occur during the booting of each virtual machine. This method effectively defragments the physical storage. When the pre-fetching and storing in a cache 330 of blocks 320f adjacent to the block last accessed occurs, latency may be reduced by pre-fetching the most relevant blocks and those that are most likely required next.

公开(公告)号：DE102012221814A1

公开(公告)日：2013-06-13

申请号：DE102012221814

申请日：2012-11-29

Applicant: IBM

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

IPC: G06F9/44 ,  G06F9/445 ,  G06F12/02

Abstract: Es wird eine Lösung zum Verwalten eines Software-Abbilds vorgeschlagen, das in einer Vielzahl von physischen Blöcken eines Speichersystems gespeichert wird. Ein entsprechendes Verfahren (A1 bis A15) weist die Schritte des Überwachens (A4 bis A5) eines jeden Zugriffs auf die physischen Blöcke, das Berechnen (A12 bis A13) einer vorhergesagten Abfolge des Zugriffs auf die physischen Blöcke gemäß den überwachten Zugriffen und das Neuanordnen (A14 bis A15) der physischen Blöcke gemäß der vorhergesagten Abfolge auf.

公开(公告)号：DE69840844D1

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

申请号：DE69840844

申请日：1998-08-10

Applicant: IBM

Inventor： ILIADIS ILIAS ,  SCOTTON PAOLO

IPC: H04Q11/04 ,  H04L12/70

Abstract: Scheme for the computation of a restrictive cost between pairs of border nodes of a PNNI peer group. The following steps are carried out to compute the restrictive cost: a.maintaining a sorted list of said links sorted according to their restrictive cost C, b.forming logical sets of nodes by taking one link after the other from said list starting with the cheapest cost C and assigning an identifier to the two nodes connected by the respective link, whereby the nodes of a set of nodes carry a dominant unique identifier if a border node is a member of the respective set, or a unique identifier if there is no border node being a member of the respective set, uniting two sets, if such a link connects a node of a first set and a node of a second set, by assigning a dominant unique identifier to all nodes of both sets if either nodes of the first or the nodes of the second set carry a dominant unique identifier, or by assigning a unique identifier to all nodes of both sets if neither the nodes of the first nor the nodes of the second set carry a dominant unique identifier, c. applying a matrix update algorithm if said link connects a node of a first set and a node of a second set that both already carry dominant unique identifiers.

公开(公告)号：DE69840809D1

公开(公告)日：2009-06-18

申请号：DE69840809

申请日：1998-09-05

Applicant: IBM

Inventor： ILIADIS ILIAS ,  SCOTTON PAOLO

IPC: H04Q11/04 ,  H04L45/02

Abstract: Scheme for the construction of the set of optimal complex node representations of a PNNI peer group based on a restrictive cost database (e.g. a cost matrix) associated with the border nodes. The resulting set of complex node representations is the optimal in that it contains all the possible complex node representations that use the minimum possible number of exception bypasses.

公开(公告)号：DE60317925D1

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

申请号：DE60317925

申请日：2003-10-28

Applicant: IBM

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

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

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.