Efficient contention-resolution protocol for local multiaccess n

Details Efficient contention-resolution protocol for local multiaccess n Efficient contention-resolution protocol for local multiaccess n

1984-09-21

1986-12-16

Olms, Douglas W.

Multiplex communications

Wide area network

Packet switching

370 94, H04J 302

Patent

active

046302646

ABSTRACT:
A contention-resolution protocol on a single shared bus with asynchronous time-division multiplexing and random access is disclosed. The scheme is equivalent to finding the extremum of a set of random numbers. Each station maintains a common window. A station contending for the use of the bus generates a number. If the number generated falls in the window, the station contends in the next slot of time, otherwise it has to wait until the current contention has been resolved and a packet has been transmitted. A collision-detection rule is applied that detects whether one or more stations have contended. If more than one station has contended, or if no station has contended, a window-control rule is applied at each station to expand, shrink or otherwise change the window. The process is repeated until exactly one station has contended. The packet of data can then be sent.

REFERENCES:
patent: 4456956 (1984-06-01), El-Gohary et al.
patent: 4516205 (1985-05-01), Eing et al.
patent: 4542501 (1985-09-01), Chevalet et al.
patent: 4543574 (1985-09-01), Takagi et al.
J. Capetanakis, "Tree Algorithm for Packet Broadcast Channels," IEEE Trans. Commun., vol. COM-26, pp. 1476-1484, Oct. 1979.
M. G. Hluchyj, Multiple Access Communication: The Finite User Population Problem, Tech. Rep. LIDS-TH-1162, Laboratory for Information and Decision Systems, Massachusetts Institute of Technology, Nov. 1981.
J. H. Hayes, "An Adaptive Technique for Local Distribution," IEEE Transactions on Communications, vol. COM-26, Aug. 1978.
L. Kleinrock and Y. Yemini, "An Optimal Adaptive Scheme for Multiple Access Broadcast Communication," Proc. ICC Conf., pp. 7.2.1-7.2.5, Jun. 1978.
J. F. Kurose and M. Schwartz, "A Family of Window Protocols for Time Constrained Applications in CSMA Networks," Proc. 2nd Joint Conference of Computer and Communication Societies (INFOCOM), pp. 405-413, 1983.
J. Mosely and P. Humblet, A Class of Efficient Contention Resolution Algorithms for Multiple Access Channels, Tech. Rep. LIDS-P-1194, Laboratory for Information and Decision Systems, Massachusetts Institute of Technology, Dec. 1982.
D. Towsley and G. Venkatesh, "Window Random Access Protocols for Local Computer Networks," IEEE Trans. on Computers, vol. C-31, No. 8, pp. 715-722, Aug. 1982.

Affiliated with

Also associated with

Rating

Efficient contention-resolution protocol for local multiaccess n does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Efficient contention-resolution protocol for local multiaccess n, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient contention-resolution protocol for local multiaccess n will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-250397