G. M. Brown
ABSTRACT
We describe a new version of the window protocol where message sequence numbers are taken from a finite domain and where both message disorder and loss can be tolerated. Most existing window protocols achieve only one of these two goals. Our protocol is based on a new method of acknowledgement, called block acknowledgement, where each acknowledgement message has two numbers m and n to acknowledge the reception of all data messages with sequence numbers ranging from m to n. Using this method of acknowledgement, the proposed protocol achieves the two goals while maintaining the same data transmission capability of the traditional window protocol.
- 1.K.A. Bartlett, R. A. Scantlebury, and P. Wilkinson, "A Note on Reliable Full Duplex Transmission over Half-Duplex Links," Communications of the ACM, vol. 12, pp. 260-261, I969. Google Scholar
Digital Library
- 2.G.M. Brown, M. G. Gouda, and R. E. Miller, "Block Acknowledgement, Redesigning the Window Protocol," TR-89-2, Department of Computer Sciences, University of Texas at Austin; submitted for journal publication. Google ScholarDigital Library
- 3.V.G. Cerf and R. E. Kahn, "A Protocol for Packet Network Intercommunication," IEEE Transactions on Communications, vol. com-22, no. 5, pp. 637-648, 1974.Google ScholarCross Ref
- 4.K.M. Chandy and J. Misra, Parallel Program Design' A Foundation, Chapter 17, Addison-Wesley Publishing Co., 1988. Google ScholarDigital Library
- 5.M.G. Gouda, "On a Simple Protocol Whose Proof in Not: The State Machine Approach," IEEE Transactions on Communications, vol. com-33, no. 4, pp. 380-382, 1985.Google ScholarCross Ref
- 6.B. Hailpem and S. S. Owicki, "Modular Verification of Computer Communication Protocols," IEEE Transactions on Communications, vol. corn-31, no. 1, pp. 56-68, 1983.Google ScholarCross Ref
- 7.D.E. Knuth, "Verification of Link Level Protocols," BIT, vol. 21, pp. 31-36, 1981.Google ScholarCross Ref
- 8.W. C. Lynch. "Reliable Full-Duplex File Transmission over Half-Duplex Telephone Lines," Communications of the ACM, vol. 11, pp. 407-410, 1968. Google ScholarDigital Library
- 9.A.U. Shankar and S. S. Lain, "Time-Dependent Distributed Systems: Proving Safety, Liveness, and Real-Time Properties," Distributed Computing, vol. 2, no. 2, pp. 61-79, 1987.Google ScholarDigital Library
- 10.W. Stallings, Data and Computer Communications, 2nd edition, New York, Macmillan, 1988. Google ScholarDigital Library
- 11.N. V. Stenning, "A Data Transfer Protocot," Computer Networks, vol. 1, pp. 99-110, 1976.Google Scholar
Index Terms
- Block acknowledgement: redesigning the window protocol
Recommendations
Block acknowledgement: redesigning the window protocol
We describe a new version of the window protocol where message sequence numbers are taken from a finite domain and where both message disorder and loss can be tolerated. Most existing window protocols achieve only one of these two goals. Our protocol is ...
Generalization of the basic sliding window protocol: Research Articles
A new protocol called generalized sliding window protocol is described and formally specified using the Specification and Description Language (SDL). The protocol generality was achieved by appropriately combining the classical go-back-n and selective-...
Comments