Wenxin Xu
ABSTRACT
For decades there has been a search for a multiple access protocol for a broadcast channel that would provide a performance that approached that of the ideal M/D/1 queue. This ideal performance would provide immediate access at light loads and then seamlessly move to a reservation system at high offered loads. DQRAP (distributed queueing random access protocol) provides a performance which approaches this ideal. Furthermore it is accomplished using as few as three control minislots which suggests that, aside from establishing new theoretical bounds, DQRAP will be of great practical value.DQRAP requires that channel time be divided into slots each of which consists of one data slot and m control minislots, and that each station maintain two common distributed queues. One queue is called the data transmission queue, or simply TQ, used to organize the order of data transmission, the other queue is the collision resolution queue, or simply RQ, which is used to resolve the collisions and to prevent collisions by new arrivals. The protocol includes data transmission rules, request transmission rules and queuing discipline rules. Modelling and simulation indicate that DQRAP, using as few as 3 minislots, achieves a performance level which approaches that of a hypothetical perfect scheduling protocol, i.e., the M/D/1 system, with respect to throughput and delay. DQRAP could prove useful in packet radio, satellite, broadband cable, cellular voice, WAN, and passive optical networks.
- 1.N. Abramson, "The ALOHA system -- Another alternative for computer communication," in AFIPS Conf. Proc. Fall Joint Comput. Conf. 1970, pp. 281-285.Google Scholar
- 2.L. G. Roberts, "ALOHA packet system with and without slots and capture," ARPA Network Inform. Center, Stanford Inst., Menlo Park Calif., ASS Note 8 (NIC 11290), June 1972. Also see Computer Communications Review, vol. 5, pp. 28-42, Apr. 1975. Google ScholarDigital Library
- 3.L. Kleinrock and F. A. Tobagi, "Packet switching in radio channel: Part I -- Carrier sense multiple-access modes and their throughput-delay characteristics," IEEE Trans. on Communications, vol. COM-23, no. 12, pp. 1400-1416, Dec. 1975.Google Scholar
- 4.F. A. Tobagi and V. B. Hunt, "Performance Analysis of carrier sense multiple access with collision detection," in Proc. Local area commun, network symp., Boston MA. May 1979.Google Scholar
- 5.F. A. Tobagi, "Mulfiaccess protocols in packet communication systems," IEEE Trans. on Commun., COM-28, no. 4, pp. 468-488, April, 1980.Google ScholarCross Ref
- 6.M. K. Molloy and L. Kleinrock, "Virtual time CSMA: Why two docks are better than one," IEEE Trans. Commun. vol. COM-33, no. 9, pp. 919-933, Sept. 1985.Google Scholar
- 7.J. I. Capetanakis, "The multiple access broadcast channel: protocol and capacity considerations," Ph.D. Dissertation, Mass. Inst. Tech. Cambridge, MA, Aug. 1977,Google Scholar
- 8.J. I. Capetankis, "Tree algorithm for packet broadcasting channel,'' IEEE Trans. Inform. Theory, vol. 1T-25, pp. 505-515, Sept. 1979.Google Scholar
- 9.J. L. Massey, "Collision resolution algorithm and random access commmunications," in Multiuser Communication Systems, G. Longo Ed. New York: Springer-Verlag, 1981. pp. 73-137.Google Scholar
- 10.R. G. Gallager, "Conflict resolution in random access broadcast networks," in Proc. AFOSR Workshop Commun. Theory Appl. Provincetown, MA. Sept. 1978.Google Scholar
- 11.J. Mosely and P. Humbler, "A class of efficient contention resolution algorithms for multiple access channels," IEEE Trans. on Commun. vol. COM-33, no. 2, pp. 145-151, Feb. 1985.Google Scholar
- 12.TSYB 78 B. S. Tsybakov and V. A. Mikhailov, "Free synchronous packet access in a broadcast channel with feedback," Problems of Information Transmission, vol. 14, no. 4, pp. 259-280 Oct. - Dec. 1978. Translated from Ptolemy Peredachi Informatsii, vol. 14, no. 4, pp. 32-59, Oct.-Dec. 1978.Google Scholar
- 13.B. S. Tsybakov and V. A. Mikhailov, "Random multiple packet access: part-and-try algorithm," Problem of Information Transmission, vol. 16, no. 4, pp. 305-317 Oct.-Dec. 1980. Translated from Ptolemy Peredachi Informatsii, vol. 16, no. 4, pp. 65-79, Oct.-Dec. 1980.Google Scholar
- 14.R. G. GaUager, "A Perspective on multiaccess channels," IEEE Trans. on Information Theory, vol. 1T-31, no. 2, pp. 124-142, March 1985.Google Scholar
- 15.F. A. Tobagi and L. Kleinrock, "Packet switching in radio channels: Part IV -- Stability considerations and dynamic control in carrier sense multiple access," IEEE Trans. on Communications, COM-25, no. 10, pp. 1103-1120, Oct., 1977.Google ScholarCross Ref
- 16.G. Fayolle, E. Gelembe, and J. Labetoulee, "Stability and optimal control of the packet-switching broadcast channels," J. Ass. Comput. Mach., vol. 24, pp. 357-386, July 1977. Google ScholarDigital Library
- 17.B. S. Tsybakov, and N. B. Likhanov," Upper bound on the capacity of a random multiple access system, "Problems of Information Transmission, vol. 23, no. 3, pp. 224-236, July - Sept. 1987. Translated from Prolemy Peredachi lnformatsii, vol. 23, no. 3, pp. 64-78, July - Sept, 1987.Google Scholar
- 18.N. Pippenger, "Bounds on performance of protocols for a multiple-access broadcast channel," IEEE Trans. on Information Theory, vol. iT-27, no. 2, pp. 145-151, March 1981.Google Scholar
- 19.L. Georgiadis and P. Papantoni-Kazakos, "A collision resolution protocol for random access channel with energy detectors, "IEEE Trans. Commun., vol. COM-30, no.ll, pp. 2413- 2420, Nov. 1982.Google Scholar
- 20.B. S. Tsybakov, "Resolution of conflict with known multiplicity, "Problem of information Transmission, vol. 16, no. 2, pp. Apr.-June, 1980. Translated from Ptolemy Peredachi Informatsii, vol. 16, no. 2, pp. 69-82, Apr.-June., 1980, Moscow, USSR.Google Scholar
- 21.E. Gulko, "Tree based multiaccess where collision multiplicities are known," iEEE Trans. Commun. vol. COM-33, no. 9, pp. 999-1001, Sept., 1985.Google Scholar
- 22.J. Huang and B. Xu, "Pretested random tree protocol for packet conflict resolution," IEEE Trans. on Information Theory, vol. iT-29, no. 6, pp. 910-913, June 1983.Google Scholar
- 23.J. C. Huang and Berger, "Delay analysis of interval searching contention resolution algorithm," IEEE Trans. on information Theory vol. IT-31, no. 2, pp. 264-273, March 1985.Google Scholar
- 24.L. Merakos and D. Kazakos, "Multiaccess of a slotted channel using a control mini-slot," in Proc. Int. Conf. Commun., 1983. pp. C5.3.1 -C5.3.6.Google Scholar
- 25.D. Raychaudhuri, "Announced retransmission random access protocols," IEEE Trans. on Communications, COM-33, no. 11, pp. 1183-1190, Nov. 1985.Google ScholarCross Ref
- 26.T. Towsley and P. O. Vales, "Announced arrival random access protocols," IEEE Trans. Commun. vol. COM-35, no. 5, pp. 513-521, May 1987.Google Scholar
- 27.L. Kleinrock, Queueing Systems, volume 1: Theory. New York, Wiley, 1975. Google ScholarDigital Library
- 28.W. Xu, "Distributed Queueing Random Access Protocols for a Broadcast Channel," Ph.D.Dissertation' illinois Institute of Technology, 1990. Google ScholarDigital Library
- 29.S. Sirazi, "Trllnet - A Demand-Adaptive Protocol Medim- Access Protocol for Metropolitan Area Networks." Ph.D. Dissertation, Illinois institute of Technology, 1986. Google ScholarDigital Library
- 30.Xianyu Zhang and Graham Campbell, "Performance Analysis of Distributed Queueing Random Access Protocol -- DQRAP", Internal Report, Computer Science Dept., Illinois Institute of Technology, 1993.Google Scholar
Index Terms
- A distributed queueing random access protocol for a broadcast channel
Recommendations
A distributed queueing random access protocol for a broadcast channel
For decades there has been a search for a multiple access protocol for a broadcast channel that would provide a performance that approached that of the ideal M/D/1 queue. This ideal performance would provide immediate access at light loads and then ...
Analysis of Enhanced Collision Avoidance Scheme Proposed for IEEE 802.11e-Enhanced Distributed Channel Access Protocol
In enhanced distributed channel access (EDCA) protocol, small contention window (CW) sizes are used for frequent channel access by high-priority traffic (such as voice). But these small CW sizes, which may be suboptimal for a given network scenario, can ...
Comments