发明授权
US06895248B1 Dynamic resource allocation and media access control for a wireless ATM network
失效
无线ATM网络的动态资源分配和媒体访问控制
- 专利标题: Dynamic resource allocation and media access control for a wireless ATM network
- 专利标题(中): 无线ATM网络的动态资源分配和媒体访问控制
-
申请号: US09324367申请日: 1999-06-02
-
公开(公告)号: US06895248B1公开(公告)日: 2005-05-17
- 发明人: Bora A. Akyol , Donald C. Cox
- 申请人: Bora A. Akyol , Donald C. Cox
- 申请人地址: US CA Stanford
- 专利权人: The Board of Trustees of the Leland Stanford Junior University
- 当前专利权人: The Board of Trustees of the Leland Stanford Junior University
- 当前专利权人地址: US CA Stanford
- 代理机构: Lumen Intellectual Property Services, Inc.
- 主分类号: H04L12/28
- IPC分类号: H04L12/28 ; H04L12/56 ; H04Q7/20
摘要:
A resource allocation method for use in a wireless ATM network comprises receiving on a wireless signaling channel a request for access to a shared frequency-time sliced wireless medium. A channel matrix is then searched for a set of available frequency-time slots. The channel matrix represents a time frame within the shared frequency-time sliced wireless medium, and is used to keep track of resource allocation in the time-frequency sliced medium. The set of available time-slots is then allocated if the allocation does not violate a frequency switching constraint, and if the set of available frequency-time slots contains a number of slots no smaller than a requested number of slots. In a preferred embodiment of the invention, the searching step uses a greedy resource allocation strategy to search a channel-chunk matrix comprising a list of contiguous chunks of available time slots in each frequency of the shared frequency-time sliced wireless medium. The greedy resource allocation strategy comprises the following successive allocation steps: searching for a single contiguous set of available time slots in a single frequency, where the size of the set of available slots is equal to the requested size [60]; searching for a single contiguous set of available time slots in a single frequency, where the size of the set of available slots is greater than the requested size [64]; searching for separate chunks of available time slots in a single frequency [66]; and searching for separate chunks of available time slots in multiple frequencies [68]. Each allocation step comprises checking whether the allocation violates a frequency switching constraint.