| Synthesis of two-party error-recoverable protocols |
| Full text |
Pdf
(1.00 MB)
|
| Source
|
Applications, Technologies, Architectures, and Protocols for Computer Communication
archive
Proceedings of the ACM SIGCOMM conference on Communications architectures & protocols
table of contents
Stowe, Vermont, United States
Pages: 227 - 235
Year of Publication: 1986
ISBN:0-89791-201-2
Also published in ...
|
|
Authors
|
|
C V Ramamoorthy
|
Computer Science Division, Department of Electrical Engineering and Computer Science, University of California, Berkeley, California
|
|
Y Yaw
|
Computer Science Division, Department of Electrical Engineering and Computer Science, University of California, Berkeley, California
|
|
R Aggarwal
|
Computer Science Division, Department of Electrical Engineering and Computer Science, University of California, Berkeley, California
|
|
J Song
|
Computer Science Division, Department of Electrical Engineering and Computer Science, University of California, Berkeley, California
|
|
| Sponsor |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 2, Downloads (12 Months): 8, Citation Count: 7
|
|
|
ABSTRACT
We have developed a correct, general, and efficient procedure of synthesizing two-party error-recoverable protocols for noisy channels where messages could be lost, corrupted, and/or missequenced. The state explosion problem has been tackled by synthesizing the error-recoverable protocol (ERP) from its noiseless local entity model using certain rules. This reduction arises from the approaches of local modeling and elaboration. We expect that these two approaches will also play a major role in tackling the complexity problems in designing multi-party protocols. Measures of efficiency and functionality improvements have been discussed.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
CHO 84
|
Choi, T.Y., "On the recoverability of finite state protocols,'' manuscript, March 1984.
|
| |
DON 83
|
|
| |
MAR 81
|
|
| |
MAR 73
|
|
| |
MER 76
|
Merlin, P.M. and Father, D.J., "Recoverability of Communication Protocols : Implication of Theoretical Study," IEEE Trans. on Comm., Vol. COM-24, No. 9, Sep. 1976, pp. 1936-1043.
|
| |
RAM 85
|
|
| |
RAM 82
|
Ramamo0rthy, C.V., and Dong, S.T., "Communication Protocol Synthesis," Proc. COMSAC, Chicago I11., Nov. 1982.
|
| |
RAZ 80
|
Razouk, R. R., and Estrin, G., "Validation of the X.21 Interface Specification Using SARA," Proc. Trends and Application: 1980 Computer Network Protocols, NBS, Gaithersberg.
|
 |
SID 82
|
|
| |
SUN 76
|
Sunshine, C.A., "Factors in Interprocess Communication Protocol Efficiency for Computer Networks," Proc. AFIPS Conf. 45, 1976, pp. 571-576.
|
| |
TAN 81
|
|
| |
WES 78
|
West, C.H., and Zafiropulo, P., "Automated Validation of Communication Protocols : The CCITT X.21 Recommendation," IBM J. Res. Develop., Vol. 22, No. 1, Jan. 1978.
|
| |
ZAF 80
|
Zafiropulo, P., et al., "Towards Analyzing and Synthesizing Protocols," IEEE Trans. on Comm., Vol. COM-28, No. 4, April 1980, pp. 651-660.
|
Peer to Peer - Readers of this Article have also read:
-
Data structures for quadtree approximation and compression
Communications of the ACM
28, 9
Hanan Samet
-
A hierarchical single-key-lock access control using the Chinese remainder theorem
Proceedings of the 1992 ACM/SIGAPP Symposium on Applied computing
Kim S. Lee
, Huizhu Lu
, D. D. Fisher
-
The GemStone object database management system
Communications of the ACM
34, 10
Paul Butterworth
, Allen Otis
, Jacob Stein
-
Putting innovation to work: adoption strategies for multimedia communication systems
Communications of the ACM
34, 12
Ellen Francik
, Susan Ehrlich Rudman
, Donna Cooper
, Stephen Levine
-
An intelligent component database for behavioral synthesis
Proceedings of the 27th ACM/IEEE conference on Design automation
Gwo-Dong Chen
, Daniel D. Gajski
|