Accession Number:

ADA461746

Title:

Group Allocation Multiple Access with Collision Detection

Descriptive Note:

Conference paper

Corporate Author:

CALIFORNIA UNIV SANTA CRUZ DEPT OF COMPUTER ENGINEERING

Report Date:

1997-01-01

Pagination or Media Count:

10.0

Abstract:

The Group Allocation Multiple Access with Collision Detection GAMACD protocol for scheduling variable-length packet transmissions in a local area network is specified and analyzed. GAMACD provides the advantages of both TDMA and CSMACD 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 as long as a station has data to send, it maintains its position in the group. This can be viewed as either allowing station to share the floor in 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 GAMACD 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 GAMACD.

Subject Categories:

  • Computer Systems
  • Radio Communications

Distribution Statement:

APPROVED FOR PUBLIC RELEASE