-
公开(公告)号：DE69230199T2
公开(公告)日：2000-04-27
申请号：DE69230199
申请日：1992-06-22
Applicant: IBM
Inventor： BIRD RAYMOND FREDERICK , BRITTON KATHRYN HENINGER , CHUNG TIEN-YAW DAVID , EDWARDS ALLAN KENDRICK , MATHEW JOHNY , POZEFSKY DIANE PHYLIS , SARKAR SOUMITRA , TURNER ROGER DON , CHUNG WINSTON WEN-KAI , YEUNG YUE TAK , GRAY JAMES PEYTON , DYKEMAN HAROLD DOUGLAS , DOERINGER WILLIBALD AUGUST , AUERBACH JOSHUA SETH , WILSON JOHN HAYDEN
Abstract: A Transport Layer Protocol Boundary (TLPB) architecture is described which will permit an application program to run over a non-native transport protocol without first generating a protocol compensation package tailored to the transport protocols assumed by the program's application programming interface and by the available transport provider. All transport functions required by the program are converted to standardized or TLPB representations. When a connection between the first application program and a second remote application is requested, the individual required TLPB transport functions are compared to corresponding functions supported by the transport provider. Compensations are invoked only where there is a mismatch. The node on which the remote application program runs is informed of the compensations so that necessary decompensation operations can be performed before the data is delivered to the remote application program.
-
公开(公告)号：DE69132065D1
公开(公告)日：2000-04-27
申请号：DE69132065
申请日：1991-05-02
Applicant: IBM
-
公开(公告)号：DE68918970T2
公开(公告)日：1995-04-27
申请号：DE68918970
申请日：1989-01-31
Applicant: IBM
Inventor： GRAY JAMES PEYTON , KNAUTH JEFFREY GALE , POZEFSKY DIANE PHYLIS , RAFALOW LEE MARK
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.
-
公开(公告)号：DE69122487D1
公开(公告)日：1996-11-07
申请号：DE69122487
申请日：1991-12-20
Applicant: IBM
Abstract: Data communication nodes in a network comprising a plurality of nodes linked together to form communication paths negotiate by passing messages to identify to one another the maximum supportable degree of data compression capability. Logical comparisons are made at each node between indications received from upstream and downstream nodes, if any, regarding their own or their received indications of data compression capability with the present node's own degree of compression capability. This enables logical decisions to be made to support the maximum degree of compression capability over each link or portion of a link between terminal nodes which define the ends of the overall link, thus improving data transmission by providing the highest degree of supportable compression over the longest path length.
-
公开(公告)号：DE68923489T2
公开(公告)日：1996-03-07
申请号：DE68923489
申请日：1989-05-23
Applicant: IBM
-
Patent Agency Ranking
公开(公告)号：DE3887572T2
公开(公告)日：1994-08-18
申请号：DE3887572
申请日：1988-05-27
Applicant: IBM
Inventor： ARROWOOD ANDREW HILLIARD , BARATZ ALAN EDWARD , CHIMENTO PHILIP FRANCIS , DRAKE JOHN ELLIS , EISENBIES JOHN LAWRENCE , GRAY JAMES PEYTON , NORSWORTHY KARLA JEAN , POSEFSKY DIANE PHYLIS
Abstract: Each network node in a communications network maintains its own copy of the network topology database defining network resources. Each resource record contains a "timer" field which is initially set to a maximum value but which may be decremented on a daily basis. If the timer field is decremented to zero without being reset, the node unilaterally removes the resource record from its copy of the database. The timer field will normally reach zero only for obsolete resource records since each network node responsible for a resource broadcasts a timer-resetting message for the resource (1) each time the resource status changes, (2) when the node first joins or rejoins the network, and (3) on a periodic (weekly) basis regardless of whether conditions (1) or (2) have occurred.
-
公开(公告)号：DE68923831T2
公开(公告)日：1996-05-02
申请号：DE68923831
申请日：1989-05-23
Applicant: IBM
Inventor： CITRON ANDREW PAUL , DRAKE JOHN ELLIS , FERREE MARSHA ELLEN , FETVEDT JOHN ENGUM , GRAY JAMES PEYTON , ORDANIC ZVONIMIR
Abstract: The links in a data communications network following Systems Network Architecture may be categorized as limited resource links if those links are shared access transport facilities, such as a switched telephone network, X.21, X.25 or token ring local area network facilities. In setting up LU-LU sessions between network users, a limited resource session identifier field is set to a specific value if any of the links in the session data path is defined as a limited resource link. In a conversation between two users ends (20, 22), the primary logical unit (32) responds by determining whether the session has been identified as a limited resource session. If it has, the primary logical unit initiates action to deactivate the session without waiting for network control operation action. Allowing the primary logical unit to deactivate a limited resource session assures that the limited resource link or links will not remain allocated needlessly to an unused session.
-
公开(公告)号：DE68918765T2
公开(公告)日：1995-04-27
申请号：DE68918765
申请日：1989-06-07
Applicant: IBM
Inventor： ARROWOOD ANDREW HILLIARD , CLARKE KATHRYN E , DRAKE JOHN ELLIS , EISENBIES JOHN LAWRENCE , GRAY JAMES PEYTON , NORSWORTHY KARLA JEAN , POZEFSKY DIANE PHYLIS , SMETANKA TERENCE DALE
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.
-
公开(公告)号：DE68918970D1
公开(公告)日：1994-12-01
申请号：DE68918970
申请日：1989-01-31
Applicant: IBM
Inventor： GRAY JAMES PEYTON , KNAUTH JEFFREY GALE , POZEFSKY DIANE PHYLIS , RAFALOW LEE MARK
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.
-
公开(公告)号：DE3787567D1
公开(公告)日：1993-11-04
申请号：DE3787567
申请日：1987-05-08
Applicant: IBM
Inventor： BARZILAI TSIPORA PIRCHIA , BIRD RAYMOND FREDERICK , GRAY JAMES PEYTON , KADABA BHARATH KUMAR , KALMBACH JAMES BOOTH , KNAUTH JEFFREY GALE , POZEFSKY DIANE PHYLLIS
Abstract: A technique called "Adaptive Pacing" permits a receiving node, in a computing networking, to change the size of an information window during an active session. To effect the change, the receiving node sends an "Isolated Pacing Message" (IPM) to the sending node. Thereafter, the sending node adjusts the window size to conform with a window size value in the IPM. The IPM includes a type field, a reset window indicator and a next window size field. There are three types of isolated pacing messages. Two of the messages are used by the receiving node to control the flow of data; while the third message is used, by the sending node, to confirm the beginning of a new window and the ending of an old one.
-
-
-
-
-
-
-
-
-
Search Results
22
records
(took 0.018 seconds)
