3.
    发明专利
    未知

    公开(公告)号:DE69328284D1

    公开(公告)日:2000-05-11

    申请号:DE69328284

    申请日:1993-11-04

    Applicant: IBM

    Abstract: A fast bandwidth reservation method and system used in packet-switched networks that reserve bandwidth for a data transfer over links in a path between a source node, at least one intermediate node, and a destination node with minimal latency where the source node desires to send data to the destination node along the specific path using at least a minimum bandwidth and up to a maximum bandwidth. The goal of the method and system is to reserve bandwidth for a data transfer in the minimal amount of time. No link on the path between the source node and destination node has more band-width allocated for the source node than the minimum allocated for the previous forward links on the path. Links on the path between the source node and destination node have their bandwidth allocation for the data transfer adjusted based on the final minimum bandwidth allocated for the data transfer.

    4.
    发明专利
    未知

    公开(公告)号:DE69325957D1

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

    申请号:DE69325957

    申请日:1993-05-19

    Applicant: IBM

    Abstract: A packet communications system provides for point-to-point packet routing and broadcast packet routing to limited subsets of nodes in the network, using a routing field in the packet header which is processed according to two different protocols. A third protocol is provided in which a packet can be broadcast to the limited subset even when launched from a node which is not a member of the subset. The routing field includes a first portion which contains the route labels necessary to deliver the packet to the broadcast subset. A second portion of the routing field contains the broadcast subset identifier which can then be used to deliver the packet to all of the members of the broadcast subset. Provision is made to backtrack deliver the packet to the last node identified before the broadcast subset if that last node is itself a member of the subset.

    5.
    发明专利
    未知

    公开(公告)号:AT183349T

    公开(公告)日:1999-08-15

    申请号:AT93480059

    申请日:1993-05-19

    Applicant: IBM

    Abstract: A packet communications system provides for point-to-point packet routing and broadcast packet routing to limited subsets of nodes in the network, using a routing field in the packet header which is processed according to two different protocols. A third protocol is provided in which a packet can be broadcast to the limited subset even when launched from a node which is not a member of the subset. The routing field includes a first portion which contains the route labels necessary to deliver the packet to the broadcast subset. A second portion of the routing field contains the broadcast subset identifier which can then be used to deliver the packet to all of the members of the broadcast subset. Provision is made to backtrack deliver the packet to the last node identified before the broadcast subset if that last node is itself a member of the subset.

    8.
    发明专利
    未知

    公开(公告)号:DE68926650T2

    公开(公告)日:1997-01-09

    申请号:DE68926650

    申请日:1989-09-28

    Applicant: IBM

    Abstract: A method of transmitting high speed (1 Gbits/sec), packetized, integrated voice/data through a communications network. Also included is a fast contention resolution unit for resolving contention among a plurality of adapters for access to a communications network. Included in the fast contention resolution unit is an apparatus for transmitting a token about a ring from one sound to another bypassing intermediate cells whose associated adapters do not have a request to gain access to the communications network.

    9.
    发明专利
    未知

    公开(公告)号:DE69213062D1

    公开(公告)日:1996-10-02

    申请号:DE69213062

    申请日:1992-02-11

    Applicant: IBM

    Abstract: A arrangement of authenticating communications network users and means for carrying out the arrangement. A first challenge N1 is transmitted from a first user A to a second user B (300). In response to the first challenge, B generates and transmits a first response to the challenge and second challenge N2 to A. A verifies that the first response is correct. A then generates and transmits a second response to the second challenge to B, where the second response is verified. The first response must be of a minimum form and the second response must be of the minimum form S1 and S2 are shared secrets between A and B. S1 may or may not equal to S2, In addition, f() and g() are selected such that the equation cannot be solved for N1 min without knowledge of S1 and S2. f min () and N1 min represent expressions on a second reference connection. Preferably, the function f() may include the direction D1 of flow of the message containing f(), as in f(S1, N1, D1,...). In such a case, f() is selected such that the equation cannot be solved for N1 min without knowledge of S1 and S2. In this equation, D1 min is the flow direction indicator of the message containing f min () on the reference connection. Specific protocols satisfying this condition are protected from so-called intercept attacks.

    10.
    发明专利
    未知

    公开(公告)号:DE3882822T2

    公开(公告)日:1994-03-17

    申请号:DE3882822

    申请日:1988-05-24

    Applicant: IBM

    Abstract: A search dynamically locates resources (e.g., logical units (LUs) and transaction programs and files associated with LUs) in a computer network so that a session can be established between the origin and the destination of the search. The network includes end nodes associated with server nodes,and a resource contained in any node is located by a requesting node. The requesting node initiates a search of the resources residing within itself. If the resource does not reside in the requesting node, the server node searches the resources known to the server node that reside anywhere in the network. If the resource is not known by the server node, it searches all resources that reside in its associated end nodes. If the resource does not reside in the associated end nodes, either a request is sent to a central directory if one exists or a search of all resources in the network is made.

Patent Agency Ranking