Patents by Inventor Hanan Luss
Hanan Luss has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Patent number: 9131117Abstract: A method provides for the optimal location of servers and the optimal assignment of programs to the servers in a video-on-demand (VOD) network with a tree topology. Each node may have demands for multiple VOD programs. The central server at the root of the network stores all programs, and each of the other servers may store some of these programs. The cost considered include cost of servers, cost of assigning programs to servers, and cost of link bandwidths used for broadcasting programs from servers to demands at various nodes. The demand for a specific program is served by the closest server that has this program along the path that connects the requesting node to the root of the tree network. The invention consists of a dynamic programming method that determines optimal server locations and optimal program assignments for minimizing the costs.Type: GrantFiled: September 18, 2006Date of Patent: September 8, 2015Assignee: Telcordia Technologies, Inc.Inventor: Hanan Luss
-
Patent number: 9042931Abstract: 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.Type: GrantFiled: September 8, 2011Date of Patent: May 26, 2015Assignee: Telcordia Technologies, Inc.Inventors: Komandur R. Krishnan, Hanan Luss
-
Patent number: 8774627Abstract: The design of telecommunication networks is such that there is provision of end-to-end path protection to multiple demands under a single link or node failure in the networks. Restoration routes are provided on Preconfigured Virtual Cycles (PVC's), where each demand is assigned one restoration route and specific restoration wavelengths on a segment of one cycle. Multiple demands may share restoration wavelengths, and the number of restoration wavelengths may vary among the PVC links. First, a plurality of candidate PVC's are generated where each demand may be assigned to multiple candidates. Assignment of demands with common failure scenarios are allowed, under certain conditions, to the same PVC. Next, a set of PVC's is selected from among the candidates, while minimizing total reserved restoration capacity and ensuring that all demands are protected. Next duplicate assignments are eliminated. Finally, conflicts of wavelength assignments are resolved. The invention focuses primarily on optical networks.Type: GrantFiled: August 16, 2012Date of Patent: July 8, 2014Assignee: Telcordia Technologies, Inc.Inventors: Hanan Luss, Martin Eiger, David Shallcross
-
Publication number: 20130194108Abstract: Avoiding vehicle collisions using an in-vehicle device is provided. The method comprises receiving a connection request from an in-vehicle device within a moving vehicle when the moving vehicle is within a selected distance from a traffic intersection, establishing connection with the in-vehicle device within a moving vehicle via a serving base station, receiving position information from the in-vehicle device within a moving vehicle corresponding to a position of the moving vehicle, receiving control information for a traffic light at the traffic intersection from a traffic management center and relaying the control information for the traffic light to the in-vehicle device within a moving vehicle. A warning is issued based upon a vehicle speed, a location and a position relative to a traffic intersection. A warning is also issued based upon multiple vehicles speed, relative locations to each other and each position relative to a traffic intersection.Type: ApplicationFiled: January 30, 2012Publication date: August 1, 2013Applicant: Telcordia Technologies, Inc.Inventors: George Lapiotis, Jyh-Cheng Chen, Hanan Luss, Tao Zhang
-
Publication number: 20130055020Abstract: 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. Each relational link is assigned a weight equal to the sum, taken over the symptoms represented by the relational link, of the reciprocal of the number of distinct fault-pairs that produce each such symptom. The relation graph is then partitioned into several domains, while minimizing the number of cross-domain relational links, which correspond to cross-domain symptoms.Type: ApplicationFiled: August 21, 2012Publication date: February 28, 2013Applicant: TELCORDIA TECHNOLOGIES, INC.Inventors: Komandur R. Krishnan, Hanan Luss, David F. Shallcross, Arnold L. Neidhardt
-
Publication number: 20120328282Abstract: The design of telecommunication networks is such that there is provision of end-to-end path protection to multiple demands under a single link or node failure in the networks. Restoration routes are provided on Preconfigured Virtual Cycles (PVC's), where each demand is assigned one restoration route and specific restoration wavelengths on a segment of one cycle. Multiple demands may share restoration wavelengths, and the number of restoration wavelengths may vary among the PVC links. First, a plurality of candidate PVC's are generated where each demand may be assigned to multiple candidates. Assignment of demands with common failure scenarios are allowed, under certain conditions, to the same PVC. Next, a set of PVC's is selected from among the candidates, while minimizing total reserved restoration capacity and ensuring that all demands are protected. Next duplicate assignments are eliminated. Finally, conflicts of wavelength assignments are resolved. The invention focuses primarily on optical networks.Type: ApplicationFiled: August 16, 2012Publication date: December 27, 2012Applicant: TELCORDIA TECHNOLOGIES, INC.Inventors: Martin Eiger, Hanan Luss, David Shallcross
-
Patent number: 8320274Abstract: 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.Type: GrantFiled: April 21, 2010Date of Patent: November 27, 2012Assignee: Telcordia Technologies, Inc.Inventor: Hanan Luss
-
Patent number: 8301026Abstract: The design of optical telecommunication networks is such that there is provision of end-to-end path restoration to specified demands under up to two links or nodes failures. Restoration routes are provided on Path Protecting Preconfigured Cycles (PP-PCs), where each demand is assigned one or two restoration routes and restoration wavelengths on a segment of one cycle. Splitting of demand across multiple restoration routes is not allowed. All restoration routes and restoration wavelengths are predetermined where multiple demands may share restoration wavelengths without resorting to intermediate switching or wavelength conversions along restoration routes. First, numerous candidate PP-PCs are generated. Assignment of demands with common failure scenarios are allowed, under certain conditions, to the same PP-PC. Next, a set of PP-PCs is selected from among the candidates, while minimizing total reserved restoration wavelengths cost and ensuring that all demands are protected as required.Type: GrantFiled: September 11, 2009Date of Patent: October 30, 2012Assignee: Telcordia Technologies, Inc.Inventors: Martin I. Eiger, Hanan Luss, David F. Shallcross
-
Patent number: 8280835Abstract: 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. Each relational link is assigned a weight equal to the sum, taken over the symptoms represented by the relational link, of the reciprocal of the number of distinct fault-pairs that produce each such symptom. The relation graph is then partitioned into several domains, while minimizing the number of cross-domain relational links, which correspond to cross-domain symptoms.Type: GrantFiled: January 29, 2009Date of Patent: October 2, 2012Assignee: Telcordia Technologies, Inc.Inventors: Komandur R. Krishnan, Hanan Luss, David F. Shallcross, Arnold L. Neidhardt
-
Patent number: 8275260Abstract: The design of telecommunication networks is such that there is provision of end-to-end path protection to multiple demands under a single link or node failure in the networks. Restoration routes are provided on Preconfigured Virtual Cycles (PVC's), where each demand is assigned one restoration route and specific restoration wavelengths on a segment of one cycle. Multiple demands may share restoration wavelengths, and the number of restoration wavelengths may vary among the PVC links. First, a plurality of candidate PVC's are generated where each demand may be assigned to multiple candidates. Assignment of demands with common failure scenarios are allowed, under certain conditions, to the same PVC. Next, a set of PVC's is selected from among the candidates, while minimizing total reserved restoration capacity and ensuring that all demands are protected. Next duplicate assignments are eliminated. Finally, conflicts of wavelength assignments are resolved. The invention focuses primarily on optical networks.Type: GrantFiled: February 19, 2009Date of Patent: September 25, 2012Assignee: Telcordia Technologies, Inc.Inventors: Hanan Luss, Martin Eiger, David Shallcross
-
Publication number: 20120238278Abstract: 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.Type: ApplicationFiled: September 8, 2011Publication date: September 20, 2012Applicant: TELCORDIA TECHNOLOGIES, INC.Inventors: Komandur R. Krishnan, Hanan Luss
-
Patent number: 8116269Abstract: 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.Type: GrantFiled: May 8, 2007Date of Patent: February 14, 2012Assignees: Telcordia Technologies, Inc., Toyota Infotechnology Center, U.S.A., Inc.Inventors: Hanan Luss, Wai Chen, Toshiro Hikita, Ryokichi Onishi
-
Publication number: 20110261703Abstract: 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.Type: ApplicationFiled: April 21, 2010Publication date: October 27, 2011Applicant: TELCORDIA TECHNOLOGIES, INC.Inventor: Hanan Luss
-
Patent number: 8019576Abstract: A limited number of sensors are placed at selected locations in order to achieve equitable coverage levels to all locations that need to be monitored. The coverage level provided to any specific location depends on all sensors that monitor the location and on the properties of the sensors, including probability of object detection and probability of false alarm. These probabilities may depend on the monitoring and monitored locations. An equitable coverage to all locations is obtained by finding the lexicographically largest vector of coverage levels, where these coverage levels are sorted in a non-decreasing order. The method generates a lexicographic maximin optimization model whose solution provides equitable coverage levels. In order to facilitate computations, a nonlinear integer optimization model is generated whose solution provides the same coverage levels as the lexicographic maximin optimization model.Type: GrantFiled: March 20, 2007Date of Patent: September 13, 2011Assignee: Telcordia Licensing Company, LLCInventor: Hanan Luss
-
Patent number: 7957397Abstract: A method and apparatus is provided for determining bandwidth allocation that includes initiating a transmission of a plurality of at least portions of content from a root node of a tree topology network along a path having a plurality of links connecting nodes to at least one destination node, allocating bandwidth for the plurality of at least portions of content carried on a respective link with an available bandwidth capacity such that a sum of the allocated bandwidths of all of the plurality of at least portions of content carried on the respective link does not exceed the available bandwidth capacity, and using a Lexicographic Minimax Algorithm for a Flexible or Constrained Bandwidth Allocation Model to provide bandwidth allocations to the plurality of at least portions of content and to determine an ordered list from the plurality of links from a most critical link to a least critical link.Type: GrantFiled: January 13, 2010Date of Patent: June 7, 2011Assignee: TTI Inventions C LLCInventor: Hanan Luss
-
Publication number: 20110064404Abstract: The design of optical telecommunication networks is such that there is provision of end-to-end path restoration to specified demands under up to two links or nodes failures. Restoration routes are provided on Path Protecting Preconfigured Cycles (PP-PCs), where each demand is assigned one or two restoration routes and restoration wavelengths on a segment of one cycle. Splitting of demand across multiple restoration routes is not allowed. All restoration routes and restoration wavelengths are predetermined where multiple demands may share restoration wavelengths without resorting to intermediate switching or wavelength conversions along restoration routes. First, numerous candidate PP-PCs are generated. Assignment of demands with common failure scenarios are allowed, under certain conditions, to the same PP-PC. Next, a set of PP-PCs is selected from among the candidates, while minimizing total reserved restoration wavelengths cost and ensuring that all demands are protected as required.Type: ApplicationFiled: September 11, 2009Publication date: March 17, 2011Applicant: Telcordia Technologies, Inc.Inventors: Martin I. Eiger, Hanan Luss, David F. Shallcross
-
Patent number: 7801177Abstract: A method is presented for determining bandwidth allocations in a content distribution network that comprises multiple trees, where the root of each tree has a server that broadcasts multiple programs throughout the tree. Each network link has limited capacity and may be used by one or more of these trees. The allocation problem is formulated as an equitable resource allocation problem with a lexicographic maximin objective function that attempts to provide 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 algorithm provides an equitable solution in polynomial time for wide classes of performance functions. At each iteration, the algorithm solves single-link maximin optimization problems while relaxing the ordering constraints, selects a bottleneck link and fixes various variables at their optimal value.Type: GrantFiled: February 25, 2008Date of Patent: September 21, 2010Assignee: Telcordia Technologies, Inc.Inventor: Hanan Luss
-
Publication number: 20100209099Abstract: The design of telecommunication networks is such that there is provision of end-to-end path protection to multiple demands under a single link or node failure in the networks. Restoration routes are provided on Preconfigured Virtual Cycles (PVC's), where each demand is assigned one restoration route and specific restoration wavelengths on a segment of one cycle. Multiple demands may share restoration wavelengths, and the number of restoration wavelengths may vary among the PVC links. First, a plurality of candidate PVC's are generated where each demand may be assigned to multiple candidates. Assignment of demands with common failure scenarios are allowed, under certain conditions, to the same PVC. Next, a set of PVC's is selected from among the candidates, while minimizing total reserved restoration capacity and ensuring that all demands are protected. Next duplicate assignments are eliminated. Finally, conflicts of wavelength assignments are resolved. The invention focuses primarily on optical networks.Type: ApplicationFiled: February 19, 2009Publication date: August 19, 2010Applicant: TELCORDIA TECHNOLOGIES, INC.Inventors: Martin Eiger, Hanan Luss, David Shallcross
-
Publication number: 20100192013Abstract: 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.Type: ApplicationFiled: January 29, 2009Publication date: July 29, 2010Applicant: TELCORDIA TECHNOLOGIESInventors: Komandur R. Krishnan, Hanan Luss, David F. Shallcross, Arnold L. Neidhardt
-
Patent number: 7730520Abstract: This invention provides an automated adaptive method for identity verification of claimants that attempt to get access into a resource by responding to a sequence of identifiers. The sequence has a specified maximal length and the identifiers are partitioned into multiple groups where identifiers in the same group are correlated and identifiers in different groups are not correlated. The method guarantees that an impostor will be accepted with a probability that does not exceed a specified parameter and that a legitimate claimant will be rejected with a probability that does not exceed a different specified parameter. The method also computes the probabilities that a legitimate claimant, or an impostor, will terminate an interrogation session with an inconclusive result, which would necessitate further manual interrogation. The method is adaptive as the conditional probabilities of an impostor's responses change throughout a session of interrogation.Type: GrantFiled: May 31, 2006Date of Patent: June 1, 2010Assignee: Telcordia Technologies, Inc.Inventors: Hanan Luss, Arnold L. Neidhardt, Komandur R. Krishnan