Lucent Technologies Inc.

At+t Corp.

American Telephone & Telegraph Co., At&t Bell Laboratories

American Telephone and Telegraph, Co.

Boris Dmitrievich Lubachevsky

Sudheer A Grandhi

Simon C Borst

Terry Si-Fong Cheng

Albert Gordon Greenberg

Mathilde Benveniste

Philip Alfred Whiting

Chih-Lin I

Donna Michaels Sand

Frank K Hwang

Balakrishnan Narendran

Martine Madelaine Herpers

Alan Weiss

Joseph Samuel Kaufman

Paul E Wright

Lynell Earline Cannell

Ibrahim Emre Telatar

Adrian Robert Flewitt

Michael Soellner

Lindsey Chew

Nefatiti Anderson

Israel Mitrani

Hans-Juergen Kettschau

Roland K Henter

Paul Emerson Wright

Lynell E Cannell

Donna M Sand

An efficient parallel event simulation method is implemented by simulating blocks of M edge events, where M is approximately equal to e logN, and N being the number of interconnected processing elements. Following a simulation iteration, each processing element shares information with adjacent processing elements that relates to events that the processing elements simulated which may affect the simulation of events at the neighbor processing elements. When the communication reveals that the information that is shared by a neighbor processing elements is different from the information that the processing element assumed, then the arriving information is kept and the simulation process is repeated. In executing the repeated simulations of a block, the same random variable values are employed. When all of the processing elements find that the arriving shared information is the same as the information already known to the receiving processing element, simulation of the block ends. A new simulation floor is ascertained, and another block of event is simulated.

Discrete event parallel simulation

The interference on the available communication frequencies is measured during an idle time slot over a first period of time at a first rate. The available frequencies are prioritized based on the interference measurements, and a list is formed of the frequencies having the lowest interference measurements. Interference measurements are made at a second rate, greater than the first rate, for a second period of time less than the first period. When a call is assigned, the interference level requirements for the call are given, and the carrier power level of the call is measured. The carrier-to-interference ratio of each frequency in the list is determined using the second interference measurements and the measured carrier power. The frequencies in the list meeting the interference level requirements for the call are then selected, and frequency hopping while serving the call is performed using the selected frequencies.

Method for frequency hopping in a TDMA wireless communication system

Disclosed is a method for improving call quality and capacity by integrating a dynamic channel allocation technique into an intelligent antenna system. The intelligent antenna systems includes beams which are grouped into sets, wherein each set has associated a long list and a primary short list, and each beam has associated a secondary short list. In one embodiment, long term interference levels are measured on each beam in a set of beams for a plurality of communication channels to produce the long list; short term interference levels are measured on each beam in the set of beams for a portion of the plurality of communication channels to produce a plurality of secondary short lists and the primary short list; and communication channels are assigned to a mobile-station from the portion of the plurality of communication channels based on the measured short term interference levels on each beam in the set of beams. The long list and the primary short list are based upon highest measured long and short term interference levels, respectively, for each of the plurality of communication channels across each beam in the set of beams.

Dynamic channel assignment for intelligent antennas

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.

Interference based dynamic channel assignment

A method and apparatus for visually rendering a three dimensional structure as an image on a two dimensional display without specialized hardware. The invention renders each object of the structure one at a time on the display in descending order according to a measured distance, i.e., rear to front of the structure, of the object from a predetermined view point. As each object is rendered, depth relationships between the objects are conveyed to users. To reduce the number of computations required for rendering the objects, the present method and apparatus use a reference point to determine the measured distance from the predetermined view point to each object.

Method and apparatus for viewing large ensembles of three-dimensional

A service establishes called party mailboxes (CPMB) for specified duration of time upon request of a calling party when a called party is unable or unwilling to respond to the calling party. The CPMB service permits a CPMB to be accessed by a called party and permits a CPMB to be modified by authorized users. The status of access information is available to the calling party which access information characterizes the extent of access to the established mailbox by the called party. The CPMB is advantageously implemented by a CPMB control system comprising a processor and memory which CPMB control system is connected to a communications network.

Called party mailbox service

A service establishes conference mailboxes (CMB) for specified durations of time upon request by a user. The CMB service permits a CMB to be accessed by any number of other users authorized by the requesting user. The CMB service also advantageously conferences together authorized users accessing a CMB concurrently. The CMB is advantageously implemented by a CMB control system comprising a processor and memory which CMB control system is connected to a communications network.

Conference mailbox service

A communications system and method of ordered borrowing which facilitates dynamic access to a global channel set that has been partitioned into subsets, with each cell of the system being assigned a particular subset of the channel set. The assignment of channel subsets is performed in such a way as to respect various constraints imposed by the physical layout. Calls originating in a cell are first assigned to the channels allocated to the base station of that cell, in an order determined by the cell. Once the allotted channels are exhausted, i.e. in the busy state, the cell attempts to borrow channels from those allotted to the base stations of neighboring cells in a specified order. The borrowing cell borrows a specified number of channels from each neighbor before returning to a particular cell to borrow additional channels. The channels borrowed from a neighbor are accessed in an order which is substantially the reverse of the order in which they are accessed by the owner cell. This prescribes, for each cell, a prespecified order in which the entire set of channels may be accessed by calls originating in that cell.

Apparatus and method for dynamic resource allocation in wireless

Efficient simulation is achieved by employing a highly efficient ordering of the events to be simulated. Specifically, the events to be simulated are grouped into layers and the layers are simulated in order. Each of the layers consists of events that are either strictly independent of the other events in the layer or are dependent of other events in the layer but possess a particular attribute. That attribute is one that permits the use of an associative operator. This operator allows the simulation of N events in O(log N) computation iterations.

Unboundedly parallel simulations

A discrete event simulation system that avoids all blocking and advances the simulation time in an efficient manner by treating the simulated system as a set of subsystems and simulating the subsystems concurrently. The simulation proceeds iteratively by restricting the simulation of scheduled events for each subsystem at any one time to a chosen simulated time segment (bounded lag) beginning with the lowest simulation time found among the subsystems. With each simulation iteration, an 'at risk', demarcation time is evaluated based only on a subset of the subsystems that can potentially affect the simulation at the considered subsystem. Events scheduled for a time earlier than the 'at risk' time are simulated. In simulating systems where some subsystems affect other subsystems only through intermediate subsystems, opaque periods can be experienced when, because of the specific process that is being simulated, such an intermediate subsystem 'promises' that a particular route emanating from this subsystem would be busy for a set period of time, and thereby also 'promises' that no other subsystem can use this route as a conduit to affect other subsystems. That tends to push forward the 'at risk' demarcation time.

Bounded lag distributed discrete event simulation method and apparatus

Growing community of inventors

Bridgewater, NJ, United States of America

Boris Dmitrievich Lubachevsky