Multiplex communications – Channel assignment techniques – Combining or distributing information via time channels...
Patent
1998-05-22
2000-09-05
Maung, Zarni
Multiplex communications
Channel assignment techniques
Combining or distributing information via time channels...
370348, H04B 7212
Patent
active
061153907
ABSTRACT:
In a method for conflict resolution among remote hosts in a wireless network where remotes make bandwidth requests to the base station via uplink frames partitioned into one or more reservation minislots, a collision occurs where two or more remotes have transmitted a request in the same minislot. Each remote is characterized by a stack level, and only remotes with a stack level equal to 0 are permitted to transmit access request packets. Newly active remotes are allowed to join in with those remotes already having stack level 0 during any particular conflict resolution period by setting their stack levels to 0 and entering the request state. If the stack level of a remote is 0, the remote randomly picks a minislot for transmission of an access request. If the outcome is SUCCESS, and the queue at the remote is empty, the remote transmits the current packet after receiving a transmit permit and exits the request state. If the queue is not empty, then, after receiving a permit, the current packet is transmitted with a piggybacked reservation request for transmission of the next packet in the queue, continuing until the queue is empty. If the outcome of the reservation request was not SUCCESS, the remote participates in a random draw to determine whether to increment its stack level by 1 or leave it at 0. If the stack level of any remote is not 0, then in one embodiment if the outcome of the previous reservation request was COLLIDED, the remote increments its stack level by 1, otherwise decrementing it by 1. In an alternate embodiment, if the outcome of all the reservation requests during the previous cycle was COLLIDED for greater than or equal to some threshold, the remote increments its stack level by 1, otherwise decrementing it by 1. The number of reservation minislots available in any particular uplink frame may be dynamically changed based on the percentage of idle minislots and the total uplink queue length.
REFERENCES:
patent: 4352183 (1982-09-01), Davis et al.
patent: 4612637 (1986-09-01), Davis et al.
patent: 4907224 (1990-03-01), Scoles et al.
patent: 5012469 (1991-04-01), Sardana
patent: 5185737 (1993-02-01), Nassehi et al.
patent: 5295140 (1994-03-01), Crisler et al.
patent: 5363428 (1994-11-01), Nagashima
patent: 5384777 (1995-01-01), Ahmadi et al.
patent: 5636223 (1997-06-01), Reardon et al.
patent: 5751708 (1998-05-01), Eng et al.
patent: 5896385 (1999-04-01), Achilleoudis
patent: 5917813 (1999-06-01), Van Driel et al.
patent: 5949768 (1999-09-01), Citta et al.
patent: 5953321 (1999-09-01), Berrada et al.
patent: 5953344 (1999-09-01), Dail et al.
patent: 5956325 (1999-09-01), Citta et al.
patent: 5960000 (1999-09-01), Ruszczyk et al.
patent: 5963557 (1999-10-01), Eng
patent: 5978382 (1999-11-01), Citta et al.
Dail, J., et al., "Adaptive Digital Access Protocol: A MAC Protocol for Multiservice Broadband Access Networks," IEEE Communications, vol. 34, No. 3, pp. 104-112, Mar. 1996.
Qing Guo et al., "Sliding Frame R-Aloha (SFRA) Protocol For Microcellular Systems", Gateway To The Future-Technology In Motion, 41st Vehicular Technology Conference, May 19-22, 1991, pp. 351-356.
European Search Report, Apr. 1, 1999, 5 pages.
Lu et al., Fair Scheduling in Wireless Packet Networks, Sigcom '97.
Kautz, R., A Distributed Self-Clocked Fair Queueing Architecture for Wireless ATM Networks, (1996).
Kautz and Leon-Garcia, A Distributed Self-Clocked Fair Queueing Architecuture for Wireless ATM Networks, Int'l Symposium on Personal Indoor and Mobile Radio Communications (1997).
Karol et al., Distributed-Queueing Request Update Multiple Access (DORUMA) for Wireless Packet (ATM) Networks, pp. 1224-1229 (1995).
Karol et al., An efficient demand-assignment multiple access protocol for wireless packet (ATM) networks, Wireless Networks 1:267-279 (1995).
Doshi et al., A Broadband Multiple Access Protocol for STM, ATM, and Variable Length Data Services on Hybrid Fiber-Coax Networks, Bell Labs Technical Journal. pp. 36-65 (Summer, 1996).
Golestani, S. J., A Self-Clocked Fair Queueing Scheme for Broadband Applications, IEEE INFOCOM '94: Proceedings: Conference on Computer Commun., Toronto, Ontario, Jun. 12-16, 1994, pp. 636-646.
CDMA Access Channel Power Control, International Standard IS95, pp. 6-106-6-112.
Zhang, L., VirtualClock: A New Traffic Control Algorithm for Packet-Switched Networks, ACM Transactions on Computer Systems 9:101-124 (1991).
Rege, K., Equivalent Bandwidth and Related Admission Criteria for ATM Systems--A Performance Study, Int'l J. of Commun. Systems 7:181-197 (1994).
Parekh and Gallager, A Generalized Processor Sharing Approach to Flow Control in Integrates Services Networks: The Single-Node Case, IEEE/ACM Transactions on Networking 1:344-357 (1993).
Sriram and Magill, Enhanced Throughput Efficiency by Use of Dynamically Variable Request Mini-Slots in MAC Protocols for HEC and Wireless Access Networks, submitted to INFOCOM '98.
Caldwell Andrew
Lucent Technologies - Inc.
Maung Zarni
LandOfFree
Bandwidth reservation and collision resolution method for multip does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Bandwidth reservation and collision resolution method for multip, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Bandwidth reservation and collision resolution method for multip will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2220076