Performance of Demand Assignment Multiple Access Schemes in Broadcast Bus Networks
Abstract
Local area communications networks based on packet switching techniques provide simple architectures and efficient and flexible operation. A number of Demand Assignment Multiple Access (DAMA) schemes suitable for broadcast bus networks have emerged which provide conflict free broadcast communications by means of various distributed round-robin scheduling algorithms. In some of these schemes, explicit tokens, i.e., control messages, are used to provide the required scheduling. Other schemes use implicit tokens whereby stations in the network rely on information deduced from the activity on the bus to schedule their transmissions. In this work, three basic access mechanisms, according to which these implicit-token DANA schemes can be classified by them are described together with their network topologies. These schemes overcome some of the performance limitations of existing random access schemes, making them particularly suited to the high bandwidth requirements of an integrated-services digital local network. Two of them, Express-net and Fas- net, are examined operating under various service disciplines. Throughput and delay characteristics over a range of operating conditions are presented and discussed. A combined voice/data protocol is presented suitable for DAMA broadcast networks.
Document Details
- Document Type
- Technical Report
- Publication Date
- Mar 01, 1987
- Accession Number
- ADA221440
Entities
People
- Michael Fine
Organizations
- Stanford University