-
公开(公告)号：DE69230199D1
公开(公告)日：1999-12-02
申请号：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.
-
Patent Agency Ranking
公开(公告)号：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.
-
公开(公告)号：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.
-
公开(公告)号：DE69213062T2
公开(公告)日：1997-03-13
申请号：DE69213062
申请日：1992-02-11
Applicant: IBM
Inventor： BIRD RAYMOND FREDERICK , GOPAL INDER SARAT , JANSON PHILIPPE ARNAUD , KUTTEN SHAY , MOLVA REFIK AHMET , YUNG MARCEL MORDECHAI
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.
-
公开(公告)号：DE69213062D1
公开(公告)日：1996-10-02
申请号：DE69213062
申请日：1992-02-11
Applicant: IBM
Inventor： BIRD RAYMOND FREDERICK , GOPAL INDER SARAT , JANSON PHILIPPE ARNAUD , KUTTEN SHAY , MOLVA REFIK AHMET , YUNG MARCEL MORDECHAI
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.
-
公开(公告)号：DE3787567T2
公开(公告)日：1994-05-11
申请号：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
6
records
(took 0.018 seconds)
