epts, Theory and Practice, therefore positively identified. Similarly in frame D users 61 and 66 Prentice-Hall. identify themselves by their second digit. Therefore in this example Bux, W. (1989) Token Ring Local-Area Networks and Their Perfor- 30 reservation time slots are used as opposed to 100 which would mance, Proceedings of the IEEE 77, (2), February. be needed in MSAP/BRAP. As before each user keeps track of how Capetanakis, J.I. (1979a) Generalised TDMA: The Multi-Accessing many reservations have been made and the queue length. Tree Protocol, IEEE Trans. Commun., COM- 27, pp. 1476- 1484, October. Capetanakis, J.I. (1979b) Tree Algorithms for Packet Broadcast 13.7.3.5 Channels, IEEE Trans. Inf. Theory, IT-25, pp. 505-515, Sep- tember. The Priority-Oriented Demand Assignment protocol (Jacobs and Chen, M.S. et al. (1990) A Multi-Access Protocol for Packet- Lee, 1977; Jacobs, Binder and Hoverstein, 1978; Hsu and Lee, Switched Wavelength Division Multiaccess Metropolitan Area 1978; Jacobs et al., 1979) is a demand assignment system. Like Networks, IEEE J. Selected Areas in Commun., 8, (6), August. R-ALOHA the channel is divided into frames and each frame has Chlamtac, I. (1976) Radio Packet Broadcasted Computer Network data and reservation slots. Sophisticated scheduling and control The Broadcast Recognition Access Method, MS thesis, Tel algorithms are used, which makes this protocol unique. Aviv University. 0123456789 Frame A All users transmit Frame C Users 45 and 49 transmit Frame D Users 61 and 66 transmit Figure 13.38 Illustration of MLMA 13/22 Multiple access techniques Chou, W. (ed.) (1983) Computer Communications, Prentice-Hall. Kleinrock, L. and Yemini, Y. (1978) An Optimal Adaptive Scheme Clare, L.P. et al. (1990) A performance comparison of control for Multiple Access Broadcast Communications, Proc. ICC, pp. policies for slotted ALOHA frequency-hopped multiple access 7.2.1 to 7.2.5. systems. In Proceedings of the new era IEEE military communi- Ko, C.C., Lye, K.M. nad Wong, W.C. (1990) Simple priorit