公开(公告)号：EP2561445B1

公开(公告)日：2016-11-02

申请号：EP11772686.9

申请日：2011-04-21

申请人： Telcordia Technologies, Inc.

发明人： LUSS, Hanan

IPC分类号： G06F15/16 ,  H04L12/24 ,  H04L12/26

CPC分类号： H04L43/0882 ,  H04L41/0896

公开(公告)号：EP2614672A1

公开(公告)日：2013-07-17

申请号：EP11824108.2

申请日：2011-09-08

申请人： Telcordia Technologies, Inc.

发明人： KRISHNAN, Komandur, R. ,  LUSS, Hanan

IPC分类号： H04W36/00

CPC分类号： H04W52/12 ,  H04W24/02 ,  H04W52/143 ,  H04W52/241 ,  H04W52/244 ,  H04W52/367 ,  H04W72/0473 ,  H04W72/082 ,  H04W84/045 ,  H04W92/20

摘要： A distributed method and system are presented for determining the largest Signal-to-Interference-and-Noise Ratio (SINR) that can be achieved by a plurality of small wireless cells, such as femtocells or picocells, while satisfying a specified SINR value for multiple large cells, referred to as macrocells. The method also determines the minimum power levels at each of the femtocells that achieve the maximum SINR for the femtocells. The distributed synchronous algorithm executes all intensive computations independently, locally at each of the femtocells. The computations are synchronized in time and executed simultaneously at all cells where after each of the iterations information of interim power selections at the multiple cells is exchanged among the femtocells. Eventually, the computations converge to the maximum SINR value and the corresponding minimum-power solution.

公开(公告)号：EP2238537A1

公开(公告)日：2010-10-13

申请号：EP09705520.6

申请日：2009-01-29

申请人： Telcordia Technologies, Inc.

发明人： KRISHNAN, Komandur, R. ,  LUSS, Hanan ,  SHALLCROSS, David, F. ,  NEIDHARDT, Arnold, L.

IPC分类号： G06F11/00

CPC分类号： G06F11/079 ,  G05B23/0248 ,  G05B23/0278 ,  G06F11/0706

摘要： A method for distributed computations for fault-diagnosis in a system whose fault propagation model has deterministic couplings between faults and symptoms includes creating a 'relation graph' in which the nodes correspond to the potential faults, with two nodes connected by a 'relational link' if their corresponding faults have an observed symptom in common. The relation graph is then partitioned into several domains, while minimizing the number of cross-domain relational links, which correspond to cross- domain symptoms. In each domain, all the optimal local solutions to the domain's sub- problem are first determined, and then a combination is selected of the local solutions, one from each domain, that explains the maximum number of cross-domain symptoms, where the optimal solution is supplemented, if necessary, with additional faults to explain any remaining unexplained cross-domain symptoms, determining also a bound on the deviation from optimality of the global solution.

公开(公告)号：EP2561445A1

公开(公告)日：2013-02-27

申请号：EP11772686.9

申请日：2011-04-21

申请人： Telcordia Technologies, Inc.

发明人： LUSS, Hanan

IPC分类号： G06F15/16

CPC分类号： H04L43/0882 ,  H04L41/0896

摘要： A distributed method is presented for determining equitable bandwidth allocations in a content distribution tree network, where the root of the tree has a server that broadcasts multiple programs throughout the tree. The intensive computations in the distributed method are done at each of the nodes independently while only minimal information is exchanged among the nodes. Each network link has limited capacity. The allocation problem is formulated as an equitable resource allocation problem with a lexicographic maximin objective function that provides equitable service performance for all requested programs at the various nodes. The constraints include link capacity constraints and tree-like ordering constraints imposed on each of the programs. The distributed method converges to the equitable solution in a finite number of iterations. The distributed method can be applied to a network comprised of multiple trees.

公开(公告)号：EP2156614A1

公开(公告)日：2010-02-24

申请号：EP07853117.5

申请日：2007-11-13

申请人： Telcordia Technologies, Inc. ,  Toyota InfoTechnology Center, U.S.A. Inc.

发明人： LUSS, Hanan ,  CHEN, Wai ,  HIKITA, Toshiro ,  ONISHI, Ryokichi

IPC分类号： H04L12/28

CPC分类号： H04W40/04 ,  H04L45/128 ,  H04W72/04 ,  H04W76/10 ,  H04W84/18

摘要： A communications path is established among an ordered sequence of moving nodes, representing vehicles. Available channels may differ from one node to the next node and a node cannot use the same channel for both receiving and transmitting information. Three methods are described that provide an optimal sequence of channel assignments between the nodes. A sequence of channel assignments is called optimal if it establishes a communications path from the first node in the sequence to the last node in the sequence, or, if such a path does not exist, from the first node to the farthest node possible in the sequence. The first method uses a depth-first search starting from the first node in the sequence. The second method uses a “look ahead” scheme in the depth-first search method. The third method requires only a single pass through the sequence of nodes by identifying optimal channel assignments in subsequences of nodes without a need for backtracking.