Abstract: A method is provided for a dynamic optimization of network resource allocation on the part of a network service provider. In particular, the method of the invention provides an analytical framework for a determination by network service providers of an optimal resource allocation among links in a service provider's own network and links obtained from other network service providers. The analytical framework of the invention also incorporates, as a parameter, the provision of link capacity to other network service providers in the determination of an optimal resource allocation. In a preferred embodiment of the invention, such an optimal resource allocation is determined in respect to revenue maximization for the network service provider.

Abstract: We describe a method for solving the joint problem of optimal routing and optimal bandwidth allocation in a network that supports plural subnetworks and plural communication services. Our method involves, for each source-destination pair communicating via a given subnetwork and a given class of service, determining a traffic rate to be offered to each of a set of permissible routes between that source and that destination, in the given subnetwork and service class. Our method further involves allocating a respective bandwidth to each link of each subnetwork. Significantly, the determinations of traffic rate to be offered, and the allocations of bandwidth to respective links of subnetworks, are performed in a mutually responsive manner.

Abstract: The traffic shaping system according to the principles of the present invention increases the connection-carrying capacity of a network node by shaping the data cells to increase the admissible number of connections. In accordance with certain embodiments of the present invention, the traffic shaping system uses a data buffer at the ingress of the network node to selectively buffer classes of data cells. As such, the traffic shaping system exploits differences in delay tolerances between traffic classes to shape the less delay sensitive traffic classes to reduce the effective bandwidth of a connection of the particular traffic class and thereby increase the nodal connection-carrying capacity. Certain embodiments of the traffic shaping system operate within a framework to provide parameters for the traffic shaping system which increase the connection-carrying capacity for the node while meeting quality of service requirements for the data cells.

Abstract: A method and apparatus use a set of parameters characterizing an interference signal at a base unit for determining power levels for signals transmitted from a communications device to the base unit. The set of parameters comprises second or higher order statistics characterizing the interference signal, and the parameters are used to determine a desired power level for signals received at the base unit. The desired power level is communicated to a communications device via a pilot signal transmitted by the base unit at a predetermined level. The predetermined level and the power of the received pilot signal are used to compute a path gain between the base unit and communications device. The path gain and desired power level are then used to determine the power level of signals transmitted from the communications device to the base unit.

Abstract: The invention concerns a method for a multi-port node having a shared buffer memory to provide enhanced data packet buffering capacity for established virtual circuits (VC's) through the node and one of its output ports while maintaining grades of service commitments. The method admits incoming data packets to a node for an established VC based on a determination of combination of factors including the effective memory requirements for each output port as VC's are created or terminated, the portions of buffer memory in use for conveying packets through the intended output port for the incoming packet, and the total amount of available shared memory in the node. Such determinations enable the node to better decide whether admitting the incoming packet would cause a disproportionate allocation of the shared memory for the intended output port. As a consequence, a relatively high packet buffering capacity can be achieved substantially without violating grades of service commitments.

Abstract: A method is described for network optimization based on a multirate, circuit-switched analysis. Network loss probabilities are determined as a solution of a set of fixed point equations and the sensitivity of network performance, as a function of offered load and loss probabilities, is determined as a solution to a set of linear equations. Because the numerical complexity of solving both the fixed point equations and the sensitivity equations is of an order which renders an exact solution computationally intractable, an asymptotic approximation is applied which yields a solution to the network loss probabilities and network sensitivities. A global optimization procedure is then applied using an iterative, steepest ascent optimization procedure to yield a set of virtual path routings and capacity allocations.

Abstract: A method regulates the admission control of, and requests for routing of, virtual circuits in a network by determining network resource requirements for the virtual circuits. In particular, the network resource requirements are based on a set of parameters used to control the flow of information from a communications device onto the virtual circuit. The requirements for network resources typically include buffer space requirements in network nodes and bandwidth requirements in network links, and the parameter used to control the flow of information are those associated with an access regulator. The network resource determination is made for the case where lossless performance in the network is required and in the case where statistical multiplexing with limited loss is allowed. Both constant bit rate and variable bit rate information is considered.

Abstract: A method of operating a network by sharing resources associated with various classes among calls in the various classes according to a state dependent reservation parameter. Nominal amounts of one or more resources are allocated to each call class. When a call of a class of service operating in the network requires resources in excess of those allocated to the class, resources allocated to other classes of service are advantageously shared with the class of service. The sharing is based on a reservation parameter associated with the class of service of the call. The reservation parameter is advantageously a function of the network state. The role of the reservation parameter is to protect underloaded classes (i.e., those classes not using all of their allocated nominal capacity) from excessive borrowing by overloaded classes (i.e., classes using more than their allocated nominal capacity).

Abstract: Transmission power of a wireless terminal for transmitting a signal representing information of a particular information class to a base station capable of receiving signals for a plurality of information classes is determined based on a probability measure indicating received signal outage durations that would likely occur over a time interval. Moreover, the transmission power is determined to achieve probable signal outage durations according to the measure that are tolerable for the particular information class to be transmitted. The probability measure is further based on an enhanced characterization of a variation and mean of the detected signal interference magnitude over a time interval.

Abstract: The present invention discloses a method of and apparatus for regulating the power of signals transmitted by transmitting units, such as mobiles or base stations, that are using the same channel in a cellular radio system. An iterative process is disclosed in which the demands of synchrony and coordination among the transmitting units are relaxed. The power of the signals converges at a geometric rate to optimal transmission powers, where the optimal transmission powers are defined as the minimum powers required to maintain the ratio of carrier power to co-channel interference power at least as large as some pre-fixed target value obtained from quality of service considerations. As a result of relaxing the demands of synchrony and coordination, expensive clock or timing mechanisms are not required, thereby reducing the costs of power control.

Abstract: Methods are disclosed for the adaptive control of windows and rates in networks. A periodic, one-bit feedback signal is combined with systematic damping and control of a gain signal to achieve a minimum bandwidth and a fair share of excess available bandwidth among virtual circuits in the network in a timely manner. The methods are demonstrated using a First-Come-First-Served service discipline, a Weighted Round-Robin service discipline, or a combination of the two disciplines.

Abstract: Limit cycles are eliminated in digital filters driven by zero, d.c. and period 2 inputs, by adjusting the filter output in response to the state variables present within the filter. The filter includes a quantizer (201) adapted to provide a fixed length output word p in response to an input y, where p<y<p+k and k is the quantizer step size. The filter is further arranged to form the products a.multidot.X.sub.n and b.multidot.X.sub.n, where a and b are multiplier coefficients and X.sub.n and X.sub.n-1, the state variables, are once and twice delayed versions of the filter output X.sub.n+1, and to combine the aforesaid products and the filter input U.sub.n to yield the value y. In accordance with the invention, the quantizer output is adjusted to p+k, ifX.sub.n-1 >p+k orX.sub.n-1 =p and .vertline.X.sub.n +Sgn(a)X.sub.n-1 .vertline..gtoreq.T orX.sub.n-1 =p+k and .vertline.X.sub.n +Sgn(a)S.sub.n-1 .vertline.<T,where T is a fixed threshold value and Sgn(a) is the sign of the multiplier coefficient a.