Abstract: Techniques and systems for planning of wireless networks are described. A system according to an aspect of the present invention receives inputs describing traffic statistics for a wireless network and computes network specifications. The system uses the traffic statistics and network specifications as inputs to a computationally tractable model used to compute parameters for the user level performance of the wireless network. The model may suitably be a processor sharing queuing model. The model employed by the planning system allows analytical solution for the desired user level parameters, given the characteristics and conditions entered as inputs and the intended network layout characteristics. Once a set of user level performance parameters has been computed, the values of the parameters are examined to determine if they meet predetermined requirements, in an iterative process continuing until a set of specifications has been developed that produces parameters meeting the requirements.

Abstract: Packets are scheduled for transmission over a communication link in a network, using a Largest Weighted Delay First (LWDF) scheduling policy. A delay measure Wi, i=1, 2, . . . N, is computed for each of N packets, each associated with a corresponding one of N data flows and located in a head position in a corresponding one of N data flow queues. The computed delay measures are then weighted using a set of positive weights ?1, ?2, . . . , ?N. The packet having the largest weighted delay Wi/?i associated therewith is then selected for transmission. In an embodiment configured to meet a quality of service (QoS) requirement specified in terms of a deadline Ti and an allowed deadline violation probability ?i, e.g., a requirement specified by P(Wi>Ti)??i, the weights ?i in the set of positive weights ?1, ?2, . . . , ?N may be given by ?i=?Ti/log ?i. The invention can also be used to meet other types of QoS requirements, including, e.g., requirements based on packet loss probabilities.

Abstract: Techniques and systems for planning of wireless networks are described. A system according to an aspect of the present invention receives inputs describing traffic statistics for a wireless network and computes network specifications. The system uses the traffic statistics and network specifications as inputs to a computationally tractable model used to compute parameters for the user level performance of the wireless network. The model may suitably be a processor sharing queuing model. The model employed by the planning system allows analytical solution for the desired user level parameters, given the characteristics and conditions entered as inputs and the intended network layout characteristics. Once a set of user level performance parameters has been computed, the values of the parameters are examined to determine if they meet predetermined requirements, in an iterative process continuing until a set of specifications has been developed that produces parameters meeting the requirements.

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: Packets are scheduled for transmission over a communication link in a network, using a Largest Weighted Delay First (LWDF) scheduling policy. A delay measure Wi, i=1, 2, . . . N, is computed for each of N packets, each associated with a corresponding one of N data flows and located in a head position in a corresponding one of N data flow queues. The computed delay measures are then weighted using a set of positive weights &agr;1, &agr;2, . . . , &agr;N. The packet having the largest weighted delay Wi/&agr;i associated therewith is then selected for transmission. In an embodiment configured to meet a quality of service (QoS) requirement specified in terms of a deadline Ti and an allowed deadline violation probability &dgr;i, e.g., a requirement specified by P(Wi>Ti)≦&dgr;i, the weights &agr;i in the set of positive weights &agr;1, &agr;2, . . . , &agr;N may be given by &agr;i=−Ti/log &dgr;i. The invention can also be used to meet other types of QoS requirements, including, e.g.

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.