Data and computer communications (2nd ed.)
Data and computer communications (2nd ed.)
Parallel program design: a foundation
Parallel program design: a foundation
Block acknowledgement: redesigning the window protocol
SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
A note on reliable full-duplex transmission over half-duplex links
Communications of the ACM
Computer Systems: Reliable full-duplex file transmission over half-duplex telephone line
Communications of the ACM
Block acknowledgement: redesigning the window protocol
SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
Efficient message passing interface (MPI) for parallel computing on clusters of workstations
Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
The transport layer: tutorial and survey
ACM Computing Surveys (CSUR)
Reliable bursty convergecast in wireless sensor networks
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
Reliable bursty convergecast in wireless sensor networks
Computer Communications
| Hi-index | 0.00 |
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.