- Queue of messages attached to the link; implemented in one of three ways.
- Zero capacity – 0 messages
- Sender must wait for receiver (rendezvous).
- Bounded capacity – finite length of n messages
- Sender must wait if link full.
- Unbounded capacity – infinite length
- Sender never waits.
No comments:
Post a Comment