Performance analysis of local computer networks
Performance analysis of local computer networks
An Ethernet compatible protocol for real-time voice/data integration
Computer Networks and ISDN Systems - The MIT Press scientific computation series
Virtual Time CSMA Protocols for Hard Real-Time Communication
IEEE Transactions on Software Engineering
Multiple access protocols: performance and analysis
Multiple access protocols: performance and analysis
Some Properties of Timed Token Medium Access Protocols
IEEE Transactions on Software Engineering
A Window Protocol for Transmission of Time-Constrained Messages
IEEE Transactions on Computers
The superchannel scheme for integrated services on multiple access broadcast networks
Computer Networks and ISDN Systems
Design, implementation, and evaluation of a software-based real-time Ethernet protocol
SIGCOMM '95 Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Ethernet: distributed packet switching for local computer networks
Communications of the ACM
Controlling window protocols for time-constrained communication in a multiple access environment
SIGCOMM '83 Proceedings of the eighth symposium on Data communications
Collision Avoidance and Resolution Multiple Access with Transmission Groups
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Distributed multichannel MAC protocol for IEEE 802.11 ad hoc wireless LANs
Computer Communications
| Hi-index | 0.00 |
The Group Allocation Multiple Access with Collision Detection (GAMA/CD) protocol for scheduling variable-length packet transmissions in a local area network is specified and analyzed. GAMA/CD provides the advantages of both TDMA and CSMA/CD by maintaining a dynamically-sized cycle that varies in length depending on the network load; each cycle is composed of a contention period and a group-transmission period. During the contention period, a station with one or more packets to send competes for membership in the transmission group. Once a member of the transmission group, a station is able to send data without collision during each cycle; as long as a station has data to send, it maintains its position in the group. This can be viewed as either allowing stations to ``share the floor'' in an organized manner, or as establishing frames that are not synchronized on a slot-basis and vary their length dynamically based on demand. Both the throughput and the delay of GAMA/CD are presented and analyzed. To validate our analysis, the results of both models are compared to the throughput and delay produced by a simulation of GAMA/CD.