Design and analysis of a contention-based lookahead reservation protocol on a multichannel local area network

The contention-based lookahead reservation (CLAR) protocol can provide fast circuit-switching services that are particularly advantageous for networks supporting integrated services. The delay and throughput performance for message transmission are obtained, and they agree closely with that obtained...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on communications 1988-02, Vol.36 (2), p.234-238
Main Authors: Wong, P.C., Yum, T.S.
Format: Article
Language:English
Subjects:
Access protocols
Applied sciences
Delay
Distributed computer systems
Electronics
Exact sciences and technology
Hardware
Intserv networks
Local area networks
Multiaccess communication
Road accidents
Surges
Telecommunication traffic
Throughput
Transceivers
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The contention-based lookahead reservation (CLAR) protocol can provide fast circuit-switching services that are particularly advantageous for networks supporting integrated services. The delay and throughput performance for message transmission are obtained, and they agree closely with that obtained by simulation. The delay performance of CLAR is similar to that of the M-CSMA protocol for an M-channel network, but only CLAR can give a stable maximum throughput of (M-1)/M independent of the cable length. Moreover, CLAR requires only two sets of transceivers, while M-CSMA requires M. The lookahead reservation technique can provide 9% throughput increase for fixed-size messages and 19% for geometrically distributed messages.< >
ISSN:0090-6778
1558-0857
DOI:10.1109/26.2759