US 6,747,976 B1Granted

Distributed scheduling architecture with efficient reservation protocol and dynamic priority scheme for wireless ATM networks

AssigneeCentre for Wireless Communications of The National University of Science

InventorsBrahim Bensaou, Kee Chaing Chua, Chi Hang Tse

Life of this patent

Estimating the term…

Loading patent…

Abstract

The present distributed scheduling architecture comprise a hierarchy of schedulers comprising one master scheduler and many slave schedulers. The master scheduler is located at the AP. Its basic role is to allocate physical bandwidth to the different terminals. The slave scheduler is located in the data link control layer of a wireless terminal and one is located in the AP. It is important to note that at the AP, both master scheduler and slave scheduler (AP) co-exist while at the wireless terminals only slave schedulers (WT) are implemented. The rationale behind this architecture, is that the AP allocates time slots to the wireless terminals based on the information it receives through the reservation protocol, however, to cope with the problem of this information being out of date, the wireless terminals are allowed to freely distribute the allocated slots among their connections.

Claims10

Dependent claims

In a wireless asynchronous transfer mode (ATM) network having a plurality of wireless terminals (WTs) wirelessly coupled to an access point (AP), said AP having a master scheduler and a first slave scheduler, and said WTs each having a second slave scheduler, a method of scheduling comprising:

grouping traffic classes as real-time group and non-real-time group, said real-time group comprising real-time cells and said non-real-time group comprising non-real-time cells;
creating a deadline curve for the real-time group by said first or second slave scheduler, said deadline curve being a function which provides a time by which each of said real-time cells would expire, and approximating said deadline curve by linear segments;
providing sub-groups of said real-time cells, each of said sub-groups containing cells from a corresponding linear segment, and determining a number of said cells for each of said segments;
sending said number of cells for each segment from said first or second slave scheduler to said master scheduler, said number of cells being used to assign data slots by master scheduler;
grouping all cells by priority levels based on their urgency parameter, determining a number of non-real-time cells from each priority group, and sending said number of cells from said slave scheduler to said master scheduler, said number of cells being used to assign data slots by master schedule;
whereby cells from a group corresponding to a higher priority level are sent before cells from a group corresponding to a lower priority level.

3 more elements

Dependencies are inferred from the claim text.