Multiplex communications – Communication over free space – Having a plurality of contiguous regions served by...
Reexamination Certificate
1999-11-05
2004-05-18
Maung, Nay (Department: 2684)
Multiplex communications
Communication over free space
Having a plurality of contiguous regions served by...
C370S322000, C370S347000, C370S468000, C455S452200, C455S453000, C455S012100, C455S427000
Reexamination Certificate
active
06738363
ABSTRACT:
BACKGROUND
1. Technical Field
The present invention relates generally to wireless communication networks, and more particularly, to controlling call scheduling in satellite and land based wireless communication networks.
2. Related Art
Wireless networks typically comprise a plurality of switching centers, base stations and mobile stations all coupled through wireline and wireless communication links to create communication channels from an originating unit to a terminating unit. Moreover, these cellular networks themselves are coupled to a plurality of wireline networks including the public switched telephone network (PSTN), the Internet, local area networks (LANs) and private branch exchanges (PBXs). The Internet itself is a plurality of data networks coupled together.
An increasing trend includes coupling each of these and other networks through gateway systems, as they are developed to allow any one device to communicate with any other device to exchange communication signals. Accordingly, the various networks are being developed to provide interface ports to create signal paths and communication links from points to other points. Thus, in the context of creating cellular networks, several issues are presented that affect how well a wireless terminal can communicate effectively with these other networks.
One issue is a basic one; namely, there is a need for data streams and, more generally, communication signals to be transported through the cellular network in a reliable manner. In addition to communication signals being transported reliably, there also exists a need to maximize communication network throughput so that a subscriber's communication signals will have the opportunity to be transported reliably, especially at times of peak usage. There is a continuous need, therefore, to maximize communication network efficiencies.
Whether the wireless communication network is a type of land based (terrestrial) network, for example North American Time Division Multiple Access (TDMA) or Global System for Mobile Communications (GSM), or a satellite based communication network, the need for maximizing the networks' efficiency and throughput exists. Along these lines, as some of these wireless networks age and become somewhat less capable in relation to newer networks having higher throughput capacity, there will be a need to extend their capacities to extend their useful lives.
The motivation to increase capacity is not limited to older communication networks. There is an ongoing need to maximize return on investment in infrastructure because communication networks are very expensive. Thus, there exists a need to maximize efficiency even in the newer, higher capacity networks. Moreover, the implementation of efficient systems reduces, in some cases, the size or amount of circuitry required to handle the communication throughput requirements.
In the context of maximizing efficiency in a wireless communication network, there exists a need to maximize the number of subscriber requests granted. To meet this need, the subscribers are ranked based on the requested number of time periods, or time slices, at a given frequency (hereinafter, “communication channels”). In current systems, resource allocation is relatively simple but inefficient. Simply described, subscribers are assigned resources on a first-come-first-served-basis if the resources are available and easily identified.
Accordingly, two basic types of inefficiencies are introduced with this approach. First, with sessions continually coming into and terminating from the network, the available pool, hereafter called the ‘Resource Allocation Table’ (RAT), of communication channels becomes increasingly fragmented. This will be demonstrated later. When this happens, it becomes more difficult to identify available communication channels when subscriber requests are made for multiple communication channels. The problem of how to optimally assign resources for each successive request for service can be solved using an Operations Research technique called “Integer Programming” (IP). However solving IP problems are very time consuming and are generally not solvable in real time (as required in this environment). Consequently, there will be requests that are rejected when resources may be available but not easily identified.
The second type of inefficiency in current systems comes from the fact that resource allocation decisions are being made with incomplete information. In the Operations Research discipline called ‘Scheduling Theory’, “online scheduling” is characterized by the first-come-first-serve approach described above. Decisions are made whether to accept a request for communication channels, and which specific channels to assign to the request, as soon the request is received without knowledge of requests which will arrive later during the predefined period.
What is needed, therefore, is a system that minimizes the problem of communication channel fragmentation and that improves allocation efficiencies.
SUMMARY OF THE INVENTION
To overcome the shortcomings of the prior systems and their operations, the present invention contemplates an apparatus and a method for allocating communication channels in a manner that increases network efficiencies and operator revenue by implementing offline scheduling. Offline scheduling is the task of assigning communication channel resources only after complete knowledge of the requests made during a predefined period of time, tp. Requests for communication channels are formed in a queue for a specified time period (tp). Thereafter, notification of communication channel assignments are returned to the requester. By utilizing a resource manager that waits until all information is available before allocating resources, communication channel allocations may be made more efficiently and, at the same time, may minimize the fragmentation problem described above.
Stated simply, a resource manager accepts and stores (forms a queue) resource requests for a brief period of time and then allocates resources according to specified criteria. The invention herein may be used in any wireless communication network including satellite-based communication networks. Accordingly, the throughput of any network may be increased thereby increasing its useful life and increasing the short and long term revenue for the given network.
After creating a queue of resource requests, the resource manager. (RM) allocates communication channels in a manner that maximizes the number of requests for communication channel resources that are satisfied by giving priority in reverse order of the size of the request. In some embodiments, the RM alternately evaluates the value of connection requests, and allocates communication channels in a manner that increases revenue.
By forming a queue of resource requests before assigning communication channels, the RM is able to select a combination of communication channel assignments that improves efficiency and that increases either the number of requests that are filled or the revenue according to the objective of the network operator.
As will be detailed below, after forming a queue of resource requests for time period tp, the RM allocates communication channels in the following order:
(a) to legacy continuous bit rate (CBR) subscribers;
(b) to ongoing legacy non-CBR; and
(c) to new CBR subscribers.
This will be done in such a way as to leave a single contiguous range in the RAT for the assignment of the new non-CBR subscribers. After complementing the resource allocations as described in (a) through (c) above, the RM will then:
(d) allocate communication channels to the new non-CBR subscribers requesting communication channels in such a way as to either maximize the number of connections, the revenue to be realized from the connection requests granted or the throughput efficiency of the communication channels.
In one embodiment of the invention, communication channel resources are allocated to the new non-CBR requests according to a priority value based upon joint consideration
Abaye Alireza
Abu-Amara Hosame
Best Robert Eugene
Hu Qingyang
Qian Yi
Garlick Bruce
Harrison James
Maung Nay
Nortel Networks Limited
Sobutka Philip J.
LandOfFree
Method and apparatus for scheduling call admission control... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Method and apparatus for scheduling call admission control..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and apparatus for scheduling call admission control... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3230504