2.
    发明专利
    未知

    公开(公告)号:DE60026400T2

    公开(公告)日:2006-11-02

    申请号:DE60026400

    申请日:2000-07-13

    Applicant: IBM

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

    3.
    发明专利
    未知

    公开(公告)号:AT320130T

    公开(公告)日:2006-03-15

    申请号:AT00115178

    申请日:2000-07-13

    Applicant: IBM

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

    6.
    发明专利
    未知

    公开(公告)号:DE69422935D1

    公开(公告)日:2000-03-09

    申请号:DE69422935

    申请日:1994-06-30

    Applicant: IBM

    Abstract: PCT No. PCT/EP94/02135 Sec. 371 Date Dec. 17, 1996 Sec. 102(e) Date Dec. 17, 1996 PCT Filed Jun. 30, 1994 PCT Pub. No. WO96/00945 PCT Pub. Date Jan. 11, 1996The building, maintenance, and use of a database is described having a trie-like structure for storing entries and retrieving an at least partial match, preferably the longest partial match, or all partial matches of a search argument (input key) from said entries, said database having nodes (20), with each node containing first link information (21) leading to at least one previous node (parent pointer) and second link information (25,26) leading to at least one following node (child pointer), at least a stored key (entry, 23, 24), or a combination, thereof. The particular structure of the nodes allows a two-step search process, in which segments of a search argument are firstly used to determine a search path through the trie-like database, said search path being backtracked in the second part of the search. During the second part of the search the entire search argument is compared to entries stored in the nodes until a match is found. The described database allows an efficient use of memories and is advantageously applied to fast data retrieval, in particular related to communication within computer networks. No recursive procedures are applied.

    INTER-DOMAIN MULTICAST ROUTING
    7.
    发明专利

    公开(公告)号:CA2105040C

    公开(公告)日:1998-04-21

    申请号:CA2105040

    申请日:1993-08-27

    Applicant: IBM

    Abstract: Disclosed are a method and a system for transmitting a message or data packet from a single sender to a plurality, i.e. a group of receivers, usually called multicasting, within a conventional unicast transmission network, i.e. a network basically not equipped to handle such multicast transmissions, consisting of a plurality of subnetworks. The nodes or gateways connecting the subnetworks maintain tables of multicast receiving stations (or groups of such) and the header of each message includes information defining the groups of the addressed multicast receiving stations.

    GESTION DE DIRECCIONES EN REDES PNNI JERARQUICAS.

    公开(公告)号:ES2255923T3

    公开(公告)日:2006-07-16

    申请号:ES00115178

    申请日:2000-07-13

    Applicant: IBM

    Abstract: Un método de gestión de direcciones en un nodo que sirve como líder de grupo paritario para un grupo paritario de nodos en un nivel de la jerarquía de una red jerárquica de PNNI por la que el líder del grupo paritario representa el grupo paritario para uno o más nodos próximos en el siguiente nivel superior de la jerarquía, teniendo el líder del grupo paritario una memoria (2) para almacenar datos de topología de grupo paritario (4), que comprende datos de dirección que son suministrados al líder del grupo paritario desde nodos en el grupo paritario y representan direcciones para acceso a través de la red, y datos de topología (5) de líder del grupo paritario, que comprenden datos de dirección que son suministrados a dichos nodos próximos por el líder del grupo paritario y representan direcciones accesibles a través del grupo paritario, caracterizado el método por: comprobar si las direcciones representadas por dichos datos de dirección son accesibles a través del grupo paritario; notificara dichos nodos próximos los cambios en la accesibilidad de direcciones así identificadas; y actualizar dichos datos de topología (5) de líder del grupo paritario de acuerdo con dichos cambios.

    9.
    发明专利
    未知

    公开(公告)号:DE69422935T2

    公开(公告)日:2000-08-17

    申请号:DE69422935

    申请日:1994-06-30

    Applicant: IBM

    Abstract: PCT No. PCT/EP94/02135 Sec. 371 Date Dec. 17, 1996 Sec. 102(e) Date Dec. 17, 1996 PCT Filed Jun. 30, 1994 PCT Pub. No. WO96/00945 PCT Pub. Date Jan. 11, 1996The building, maintenance, and use of a database is described having a trie-like structure for storing entries and retrieving an at least partial match, preferably the longest partial match, or all partial matches of a search argument (input key) from said entries, said database having nodes (20), with each node containing first link information (21) leading to at least one previous node (parent pointer) and second link information (25,26) leading to at least one following node (child pointer), at least a stored key (entry, 23, 24), or a combination, thereof. The particular structure of the nodes allows a two-step search process, in which segments of a search argument are firstly used to determine a search path through the trie-like database, said search path being backtracked in the second part of the search. During the second part of the search the entire search argument is compared to entries stored in the nodes until a match is found. The described database allows an efficient use of memories and is advantageously applied to fast data retrieval, in particular related to communication within computer networks. No recursive procedures are applied.

    10.
    发明专利
    未知

    公开(公告)号:DE69228423T2

    公开(公告)日:1999-09-30

    申请号:DE69228423

    申请日:1992-11-27

    Applicant: IBM

    Abstract: Disclosed are a method and a system for transmitting a message or data packet from a single sender (21) to a plurality, i.e. a group of receivers, usually called multicasting, within a conventional unicast transmission network, i.e. a network basically not equipped to handle such multicast transmissions, consisting of a plurality of subnetworks (22 - 24) The nodes or gateways (25 - 29) connecting the subnetworks maintain tables of multicast receiving stations (or groups of such) and the header of each message includes information defining the groups of the addressed multicast receiving stations.

Patent Agency Ranking