State transition times for limited contention multiple access schemes

  • Authors:
  • V. Milutinovic;J. Crnkovic

  • Affiliations:
  • School of Electrical Engineering, Purdue University, West Lafyette, IN;Department of Mathematics and Computer Science, University of Miami, Coral Gables, FL

  • Venue:
  • CSC '85 Proceedings of the 1985 ACM thirteenth annual conference on Computer Science
  • Year:
  • 1985

Quantified Score

Hi-index 0.00

Visualization

Abstract

Adaptive limited contention schemes for multiple access broadcast communications are discussed in the environment characterized by a wide load distribution and the need for fast transitions between optimal states of the access schemes. Recently, a number of different limited contention schemes have been introduced and analyzed, usually from the point of view of load and utilization.Here, we are first introducing a classification of different adaptive limited contention access schemes. Next, we are discussing various applications characterized with a load which is predominantly distributed over two extreme values. Then we derive transition times between the states. The process oriented simulation method was used for this purpose. Different schemes are compared based on transition times between the states.