公开(公告)号：US5513379A

公开(公告)日：1996-04-30

申请号：US238138

申请日：1994-05-04

申请人： Mathilde Benveniste ,  Albert G. Greenberg ,  Frank K. Hwang ,  Boris D. Lubachevsky ,  Paul E. Wright

发明人： Mathilde Benveniste ,  Albert G. Greenberg ,  Frank K. Hwang ,  Boris D. Lubachevsky ,  Paul E. Wright

IPC分类号： H04B7/26 ,  H04W16/06 ,  H04W16/14 ,  H04W28/26 ,  H04W72/04 ,  H04W74/00 ,  H04Q7/00

CPC分类号： H04W28/26 ,  H04W16/06 ,  H04W72/06 ,  H04W74/00

摘要： 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.

摘要翻译： 一种有序借用的通信系统和方法，其有助于对已经被划分成子集的全局信道集的动态访问，其中系统的每个小区被分配了信道集的特定子集。 以这样的方式执行信道子集的分配，以便尊重由物理布局施加的各种约束。 起始于小区的呼叫首先按照小区确定的顺序分配给分配给该小区的基站的信道。 一旦分配的信道被耗尽，即处于忙状态，小区尝试以指定的顺序从分配给相邻小区的基站的信道中借用信道。 借用单元在返回到特定单元格借用附加通道之前，从每个邻居借用指定数量的通道。 从邻居借用的信道以与所有者小区访问顺序基本相反的顺序被访问。 这规定了对于每个小区，预先指定的顺序，其中整个信道组可以通过源自该小区的呼叫来访问。

公开(公告)号：US5375074A

公开(公告)日：1994-12-20

申请号：US468524

申请日：1990-01-23

申请人： Albert G. Greenberg ,  Boris D. Lubachevsky ,  Israel Mitrani

发明人： Albert G. Greenberg ,  Boris D. Lubachevsky ,  Israel Mitrani

IPC分类号： G06F11/26 ,  G06F17/50 ,  G06F19/00 ,  G06F15/60

CPC分类号： G06F17/5009

摘要： 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.

摘要翻译： 通过采用要模拟的事件的高效排序来实现有效的模拟。 具体来说，要模拟的事件被分组成层，并且按顺序模拟层。 每个层由严格独立于层中的其他事件或依赖于层中的其他事件而具有特定属性的事件组成。 该属性是允许使用关联运算符的属性。 该运算符允许在O（log N）计算迭代中模拟N个事件。

公开(公告)号：US4901260A

公开(公告)日：1990-02-13

申请号：US114369

申请日：1987-10-28

申请人： Boris D. Lubachevsky

发明人： Boris D. Lubachevsky

IPC分类号： G06F19/00 ,  G06F17/50

CPC分类号： G06F17/5009

摘要： 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.

公开(公告)号：US06973059B1

公开(公告)日：2005-12-06

申请号：US09659590

申请日：2000-09-11

申请人： Simon C. Borst ,  Terry Si-Fong Cheng ,  Adrian R. Flewitt ,  Sudheer A. Grandhi ,  Roland K. Henter ,  Martine M. Herpers ,  Hans-Juergen Kettschau ,  Boris D. Lubachevsky ,  Michael Soellner

发明人： Simon C. Borst ,  Terry Si-Fong Cheng ,  Adrian R. Flewitt ,  Sudheer A. Grandhi ,  Roland K. Henter ,  Martine M. Herpers ,  Hans-Juergen Kettschau ,  Boris D. Lubachevsky ,  Michael Soellner

IPC分类号： H04B1/713 ,  H04W72/08 ,  H04Q7/00

CPC分类号： H04B1/7136 ,  H04B1/715 ,  H04W72/08

摘要： 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.

摘要翻译： 在空闲时隙中以第一速率在第一时间段内测量对可用通信频率的干扰。 基于干扰测量对可用频率进行优先排列，并且由具有最低干扰测量的频率形成列表。 在比第一周期少的第二时间段内以大于第一速率的第二速率进行干扰测量。 当分配呼叫时，给出呼叫的干扰电平要求，并测量呼叫的载波功率电平。 使用第二干涉测量和所测量的载波功率来确定列表中每个频率的载波干扰比。 然后选择满足呼叫的干扰电平要求的列表中的频率，并且使用所选择的频率来执行服务呼叫期间的跳频。