3.
    发明专利
    未知

    公开(公告)号:DE68918970T2

    公开(公告)日:1995-04-27

    申请号:DE68918970

    申请日:1989-01-31

    Applicant: IBM

    Abstract: A method is disclosed for allowing two nodes (12, 14) in a communications network to dynamically establish the transmission group number used to partially identify a given link (18) between the nodes. When the link is being activated, both nodes simultanesouly propose either a zero or a non-zero number to each other in an exchange of exchange identification (XID) messages. If only one of the nodes proposed a non-zero number, that non-zero number is selected as the transmission group number. If both nodes had proposed zero or both had proposed non-zero numbers, predetermined criteria are employed to select a controlling node. The controlling node chooses the final transmission group number and communicates that choice to the non-controlling node.

    4.
    发明专利
    未知

    公开(公告)号:DE68918765T2

    公开(公告)日:1995-04-27

    申请号:DE68918765

    申请日:1989-06-07

    Applicant: IBM

    Abstract: In a communications network, each network node can maintain its own list of network resources in a topology database. When the state of a resource "owned" by a particular node changes, that node broadcasts a topology database update (TDU) message to adjacent nodes. Each adjacent node updates its own topology database and rebroadcasts the message. To minimize the amount of information that must be included in TDU messages when two nodes are reconnected after an outage, each node assigns flow reduction sequence numbers (FRSNs) to TDU messages and keeps a record of the FRSN for the last TDU message sent to an adjacent node. The node also records, for each resource in its database, the FRSN of the last TDU message including that resource. When two nodes are reconnected, the sending node includes in the TDU message only those resources having a FRSN greater than the FRSN assigned to the last TDU sent to the adjacent node to which the TDU message is directed.

    5.
    发明专利
    未知

    公开(公告)号:DE68918970D1

    公开(公告)日:1994-12-01

    申请号:DE68918970

    申请日:1989-01-31

    Applicant: IBM

    Abstract: A method is disclosed for allowing two nodes (12, 14) in a communications network to dynamically establish the transmission group number used to partially identify a given link (18) between the nodes. When the link is being activated, both nodes simultanesouly propose either a zero or a non-zero number to each other in an exchange of exchange identification (XID) messages. If only one of the nodes proposed a non-zero number, that non-zero number is selected as the transmission group number. If both nodes had proposed zero or both had proposed non-zero numbers, predetermined criteria are employed to select a controlling node. The controlling node chooses the final transmission group number and communicates that choice to the non-controlling node.

    TECHNIQUE FOR ENABLING MESSAGING SYSTEMS TO USE ALTERNATIVE MESSAGE DELIVERY MECHANISMS

    公开(公告)号:CA2468115A1

    公开(公告)日:2001-02-03

    申请号:CA2468115

    申请日:2000-06-02

    Applicant: IBM

    Abstract: A method, system, and computer program product for enabling messaging system s to use alternative message delivery mechanisms. In existing instant messaging systems, messages cannot be delivered to an intended recipient unless the recipient is currently logg ed on to an instant messaging system. According to the present invention, users may register one or more alternative message delivery mechanisms (such as pagers, cell phones, etc.) through whic h they are available as an alternative to an instant messaging system. Constraints may optionally be added to these registered alternatives, such as specifying a limitation on days of the week and/or hours of the day when a particular alternative may be used. Providing that an alternative messaging mechanism is registered, and any constraints for this alternative are satisfied, in the first preferred embodiment the extended IMS will select a suitable alternative and deliver the message. In a second and third preferred embodiment, the sender of the "instant" message will be informed o f the available alternative(s). The sender may then choose to have his message delivered eve n though the intended receiver is not currently logged on to an instant messaging system. Fourth a nd fifth embodiments enable a message to be delivered to a recipient using a registered mechanism (that may include an IMS), and provide for determining availability of a selected user. Using the se techniques, the real- time awareness of potential message receivers in instant messaging systems i s extended.

    9.
    发明专利
    未知

    公开(公告)号:DE3853022T2

    公开(公告)日:1995-08-10

    申请号:DE3853022

    申请日:1988-04-12

    Applicant: IBM

    Abstract: Method of disseminating information in a computer network wherein, upon activating any link in the network, a first exchange of signals between nodes attached to said link is automatically initiated for providing each of the attached nodes with information indicating the availability of the node at the other end of the link for participating in a predetermined type session. If both nodes are available for participating in a the session, a second exchange of signals between the nodes is initiated for establishing a session. Then a third exchange is automatically initiated for providing the nodes with information needed to make effective use of the session. Upon completion of said third exchange, internal operations are conducted at said nodes designating the session as a predetermined type session and making said session available to transaction programs at the nodes for exchanging additional network state information as needed.

    10.
    发明专利
    未知

    公开(公告)号:DE68918765D1

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

    申请号:DE68918765

    申请日:1989-06-07

    Applicant: IBM

    Abstract: In a communications network, each network node can maintain its own list of network resources in a topology database. When the state of a resource "owned" by a particular node changes, that node broadcasts a topology database update (TDU) message to adjacent nodes. Each adjacent node updates its own topology database and rebroadcasts the message. To minimize the amount of information that must be included in TDU messages when two nodes are reconnected after an outage, each node assigns flow reduction sequence numbers (FRSNs) to TDU messages and keeps a record of the FRSN for the last TDU message sent to an adjacent node. The node also records, for each resource in its database, the FRSN of the last TDU message including that resource. When two nodes are reconnected, the sending node includes in the TDU message only those resources having a FRSN greater than the FRSN assigned to the last TDU sent to the adjacent node to which the TDU message is directed.

Patent Agency Ranking