Abstract

A novel contention-free multiple-access protocol for bidirectional-passive bus packet networks is proposed. One version has a simple fixed-assignment transmission scheduling similar to that of the time-division multiple-access protocol, except that left-going and right-going packets may be transmitted only in alternate rounds. Another version employs a simple reservation scheme to provide demand-assignment transmission scheduling. In either instance the protocol may offer a maximum throughput exceeding one packet per packet transmission time under appropriate conditions, where throughput is defined as the number of distinct packets transmitted successfully per packet transmission time. This is possible through channel reuse as explained. >

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.