Abstract: A base station of a code division, multiple access (CDMA) telecommunications system employs scheduling of data transmission signals to corresponding user transceivers in down-link channels of a data network. One or more user transceivers may be in communication with a base station within a cell, and each user may have a minimum data rate requirement. In accordance with the present invention, the scheduling of user data transmission follows the constraints that 1) each base station transmits to user transceivers one at a time, and 2) the base station uses full available power for the down-link channel when transmitting (for data networks only). Given a data network of users, the method of scheduling and data rates may be modeled in accordance with a linear programming problem optimized according to a predefined criterion. In addition, the present method may be employed in a hybrid CDMA/time-share system to reduce power of data channels in communication with user transceivers near the base station.

Abstract: The scheduling of data transmissions for a CDMA system downlink or other type of communication network is implemented on a dynamic basis using a revenue-based policy. For a given transmission slot or other transmission interval, a maximum-rate user is identified from among a set of users requesting data transmissions, and a data transmission of the maximum-rate user is scheduled for the given interval. The maximum-rate user is identified based on application of coefficients of a revenue vector to corresponding feasible rates of the requesting users. The revenue vector is determined in an iterative manner using an adaptive algorithm which updates the revenue vector periodically to compensate for observed deviations between actual and target throughput, such that the deviations are reduced over time and the revenue vector converges to an optimal revenue vector.

Abstract: We disclose a method of dynamic channel assignment for wireless transmission systems that employ time or frequency multiplexing, or both time and frequency multiplexing. The invention is specifically addressed to the problem of avoiding interference in the channels of such systems. In a broad aspect, the invention involves partitioning base stations of a network into non-interfering sets. Channels are allocated to the non-interfering sets according to need. Stages of channel reallocation take place periodically. The reallocation takes place through coordinated activity by the base stations. That is, the channel reallocation is carried out in response to information that is exchanged between base stations, or it is centrally directed by the network in response to information passed to the network by the base stations.

Abstract: The alternate destination redirection (ADR) feature (102) of telephone switching systems (101) or an equivalent is used to implement a “post-route” routing architecture having the benefits of a “pre-route” routing architecture in a network ACD (FIG. 1). The ADR feature is administered in the network (100) for individual ACD systems and individual call types at each ACD system to identify another ACD system as an alternative destination for calls of the individual call type rejected by the individual ACD system. The network distributes (302) calls to the plurality of ACD systems (110-112) on a basis (e.g., fixed percentage, round-robin) that does not require the network to know the status of the individual ACD systems. Upon having a call of an individual type routed thereto, an individual ACD system checks (304) the status of the ACD system that is administered as the alternative destination for its rejected calls of the individual type.

Abstract: In a cellular system, channels are assigned for new calls using a flexible channel allocation algorithm that is a hybrid of a measurement-based dynamic channel assignment (MBDCA) algorithm and a reuse-distance criterion algorithm, such as a cost-function-based DCA (CFBDCA). In one embodiment, the MBDCA algorithm is implemented at each cell site in the cellular system and generates a list of candidate channels for each new call. The list is transmitted to the mobile switching center (MSC), which implements the CFBDCA algorithm to select a particular channel from the list of candidate channels for the new call.

Abstract: Operations in a cellular system are controlled based on cost values that are generated using neighbor association. In neighbor association, each cost value corresponds to a cost of assigning a candidate channel to a first cell in the cellular system, assuming that the candidate channel is already assigned to a second cell in the cellular system and each cost value is based on an average power attenuation for all of the cells in the cellular system that share the same tier as the second cell with respect to the first cell, wherein the average power attenuation is based on the reuse distances between the first cell and the cells in the same tier. In one embodiment, the cost values are used in a cost-function-based dynamic channel assignment (DCA) algorithm that is, but does not have to be, applied to a list of candidate channels generated using a measurement-based DCA algorithm.

Abstract: In a cellular system, channels are assigned for new calls using a cost-function-based dynamic channel assignment (CFBDCA) algorithm. In one embodiment, the CFBDCA algorithm is implemented in the cellular system's mobile switching center (MSC), which maintains a database containing one or more cost tables and a busy channel table. The entries in the cost tables reflect the costs of using a candidate channel in one particular cell of the cellular system, assuming that the channel is already being used in another particular cell. The entries in the busy channel table identify which channels are currently being used in which cells. The CFBDCA algorithm uses the cost tables and the busy channel table to generate cost of reusing the channel (CORC) values. Depending on the implementation, the CFBDCA algorithm of the present invention may or may not be used in conjunction with a measurement-based DCA (MBDCA) algorithm.

Abstract: An interference based dynamic channel assignment scheme for a wireless communication network, for self configuring dynamic channel assignment of a plurality of channels, comprises the steps of: prioritizing a channel list and prioritizing a selected subset of the prioritized channel list. In further enhancements of the present invention, prioritizing a channel list is distributed on a per cell/sector basis so that prioritization is independent of frequency usage information from other cells/sectors and prioritization is based upon uplink and downlink characteristics.

Abstract: An advantageous scheduling template slot ordering for use in establishing a scheduling order of events such as transmitting communication signals in a communication network is determined by assigning at least two initial slot positions to a particular signal class and then determining a regularity measure based on a lower bound for the regularity measure of such assignments and the remaining unassigned slot positions. This lower bound for the regularity measure of the unassigned slots is advantageously based on a hypothetical assignment of fractions of the slot positions to different signal classes instead of limiting the assignment of a slot to a single signal class. This fractional slot assignment produces a regularity measure that is better than or equal to a corresponding regularity measure based on assigning a whole slot to a particular signal class. The lower bound of the regularity measure is then compared with a threshold regularity measure, such as from a known reference scheduling template.

Abstract: An advantageous measurement technique for evaluating the overall scheduling regularity producible by a scheduling template having particular slot assignment orderings for respective classes of events such as, for example, transmitting order of communication signals over respective virtual circuits by a node of a network. This measurement technique is used for measuring the overall scheduling regularity producible by each of a plurality of different scheduling templates to select the template having a desirable regularity measure for use in establishing a scheduling order of events for a network.