Patent
1996-03-12
1998-03-31
Asta, Frank J.
3952006, 39520083, G06F 1300
Patent
active
057348332
ABSTRACT:
A system and method for collision resolution in a communication system having multiple transmission stations communicating on a shared slotted communication channel. The system and method includes a procedure for organizing the stations in a structure wherein each station has a fixed address corresponding to a static location in the structure. The procedure further indicates to the multiple transmission stations a slot type for each communication slot, the slot type selected from a group including contention slot type and reservation slot type, and accepts transmissions of contention slot data packets in contention slots on the communication channel from the stations, the contention slot data packets each optionally containing a reservation quantity for reservation slot data packets to be sent by an originating station upon successful transmission of a contention slot data packet originating at the originating station, the reservation slot data packets transmitted in reservation slots dedicated to the originating station. The procedure detects collisions in the transmissions of packets originating from the transmitting station with packets transmitted from other transmitting stations; and upon detecting a collision in a contention slots, recursively entitles a subset of the locations in the structure to transmit in the subsequent contention slot regardless of whether the station transmitted during the contention slot in which the collision occurred, wherein membership in the subset indicates that a station corresponding to a location in the subset is entitled.
Further systems and methods are disclosed.
REFERENCES:
patent: 4745599 (1988-05-01), Raychaudhuri
patent: 4774707 (1988-09-01), Raychaudhuri
patent: 5229993 (1993-07-01), Foudriat et al.
patent: 5297144 (1994-03-01), Gilbert et al.
patent: 5541924 (1996-07-01), Tran et al.
patent: 5570355 (1996-10-01), Dail et al.
patent: 5594738 (1997-01-01), Crisler et al.
Capetanakis, John I., "Generalized TDMA: The Multi-Accessing Tree Protocol", IEEE Transactions on Communications, vol. Com-27, No. 10, Oct. 1979, pp. 1476-1484.
Capetanakis, John I., "Tree Algorithms for Packet Broadcast Channels", IEEE transactions on Information Theory, vol. IT-25, No. 5, Sep. 1979, pp. 505-515.
Mathys, Peter et al., "Q-ary Collision Resolution Algorithm in Random-Access Systems with Free or Blocked Channel Access", IEEE Transactions on Information, Theory, vol. IT-31, No. 2, Mar. 1985, pp. 217-243.
Oie, Yuji, et al., "Throughput and Delay Analysis of Free Access Tree Algorithm with Minislots", IEEE Transactions of Communications, vol. 38, No. 2, Feb. 1990.
Wu, Cheng-Shong et al., "Delay Analysis of Tree Conflict Resolution Algorithm With and Without Broadcast Reservation Using Random or Pseudo Random Addressing", pp. 1324-1328.
Merakos, Lazaeros F., et al., "Delay Analysis of the n-Ary Random-Access Algorithm", IEEE Transactions on Information Theory, vol. 34, No. 5, Sep. 1988.
Polyzos, George C. et al., "Performance Analysis of Finite Nonhomogeneous Population Tree Conflict Resolution Algorithms Using Constant Size Window Access", IEEE Transactions on Communications, vol. Com-35, No. 11, Nov. 1987.
Molle, Mart L. and Polyzos, George C.; "Conflict Resolution Algorithms and their Performance Analysis", Technical Report No. CS93-300, Computer Systems Research Institute, University of Toronto, Jul. 1993.
Bi Ning
Chiu Ran-Fun
Asta Frank J.
Hewlett--Packard Company
Luu Le Hien
LandOfFree
Shared communications channel with enhanced reservation and coll does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Shared communications channel with enhanced reservation and coll, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Shared communications channel with enhanced reservation and coll will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-60484