Patents by Inventor Komandur R. Krishnan
Komandur R. Krishnan 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: 9053448Abstract: A system and method for modeling and evaluating resource requirements of services is disclosed. The system and method in one aspect enable describing an application session in a software model, for example, as a sequence of events in a sequence diagram, annotating the sequence diagram with information and using the sequence diagram and the information to create a mathematical model such as a Markov model that represents the application session. Once in Markov form the service can be analyzed. The system may include a user interface for allowing a user to enter annotations to the sequence diagram.Type: GrantFiled: September 4, 2013Date of Patent: June 9, 2015Assignee: Telcordia Technologies, Inc.Inventors: Benjamin W. Falchuk, Komandur R. Krishnan, Shoshana K. Loeb, David F. Shallcross
-
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
-
Publication number: 20140006093Abstract: A system and method for modeling and evaluating resource requirements of services is disclosed. The system and method in one aspect enable describing an application session in a software model, for example, as a sequence of events in a sequence diagram, annotating the sequence diagram with information and using the sequence diagram and the information to create a mathematical model such as a Markov model that represents the application session. Once in Markov form the service can be analyzed. The system may include a user interface for allowing a user to enter annotations to the sequence diagram.Type: ApplicationFiled: September 4, 2013Publication date: January 2, 2014Applicant: Telcordia Technologies, Inc.Inventors: Benjamin W. Falchuk, Komandur R. Krishnan, Shoshana K. Loeb, David F. Shallcross
-
Patent number: 8554825Abstract: A system and method for modeling and evaluating resource requirements of services is disclosed. The system and method in one aspect enable describing an application session in a software model, for example, as a sequence of events in a sequence diagram, annotating the sequence diagram with information and using the sequence diagram and the information to create a mathematical model such as a Markov model that represents the application session. Once in Markov form the service can be analyzed. The system may include a user interface for allowing a user to enter annotations to the sequence diagram.Type: GrantFiled: May 26, 2006Date of Patent: October 8, 2013Assignee: Telcordia Technologies, Inc.Inventors: Benjamin W. Falchuk, Komandur R. Krishnan, Shoshana K. Loeb, David F. Shallcross
-
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
-
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
-
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
-
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
-
Publication number: 20070282610Abstract: 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: ApplicationFiled: May 31, 2006Publication date: December 6, 2007Inventors: Hanan Luss, Arnold L. Neidhardt, Komandur R. Krishnan
-
Patent number: 6366559Abstract: A method and system for routing multi-rate traffic in a communications network determines a first expected admission cost difference that corresponds to admission of the traffic onto a single-link route. If the first expected admission cost difference is less than a pre-determined cost threshold, the network routes the traffic through the single-link route. If the first expected admission cost difference is equal to or greater than the cost threshold, the network determines a second set of expected admission cost differences that corresponds to admission of the traffic onto a set of multi-link routes, and selects the multi-link route that has a minimum expected admission cost difference. If the minimum expected admission cost difference is less than the cost threshold, the network routes the traffic through the selected multi-link route.Type: GrantFiled: June 5, 1998Date of Patent: April 2, 2002Assignee: Telcordia Technologies, Inc.Inventors: Komandur R. Krishnan, Frank Huebner-Szabo de Bucs
-
Patent number: 5155851Abstract: A process controls the routing of an arriving job in a job stream through a switch to one of a plurality of processing stations. At predetermined time intervals, occupancy factors associated with the stations are computed as determined by station configuration information and job stream information. Upon the arrival of an incoming job, the occupancy factors corresponding to the current processing status of the stations are used to compute station utilization values. The station having the minimum utilization value is selected to receive and process the incoming job provided this minimum value is less than a preselected threshold; otherwise, the incoming job is denied processing permission.Type: GrantFiled: September 19, 1991Date of Patent: October 13, 1992Assignee: Bell Communications Research, Inc.Inventor: Komandur R. Krishnan
-
Patent number: 5142570Abstract: A process is disclosed for routing service requests through a network comprising nodes interconnected with links. The network is also arranged so that each node may communicate with each of the other nodes. At preselected time intervals, sets of routes through the network are generated in response to the network configuration and traffic information. Also, at predetermined time intervals, occupancy factors are computed as determined by the network configuration and in response to traffic information. These occupancy factors are proportional to unassociated occupancy factrors and allocation factors associated with calls of the various node-pairs; each of these latter factors is derived from a nominal routing scheme in which a call of the corresponding node-pair is treated as lost only if it is blocked on all of its permitted routes. At predetermined intervals, traffic usage data is measured.Type: GrantFiled: June 15, 1990Date of Patent: August 25, 1992Assignee: Bell Communications Research, Inc.Inventors: Ved P. Chaudhary, Komandur R. Krishnan
-
Patent number: 4931941Abstract: A process is disclosed for adaptively routing service requests through a network comprising nodes interconnected with links. The network is also arranged so that each node may communicate with each of the other nodes. At preselected time intervals, sets of routes through the network are generated in response to the network configuration and traffic information. Over predetermined periods, traffic data is measured to determine carried load and blocking for each link. Also, at predetermined time intervals, occupancy factors are computed as determined by the network configuration and in response to traffic information including measured traffic data. Each of the occupany factors is derived from a nominal routing scheme in which a call blocked on a single route is treated as a lost call as in separable routing. Upon a request for service, the occupany factors corresponding to the busy-idle status of the links are used to compute an occupany value associated with each of the routes.Type: GrantFiled: July 25, 1988Date of Patent: June 5, 1990Assignee: Bell Communications Research, Inc.Inventor: Komandur R. Krishnan
-
Patent number: 4704724Abstract: A process is disclosed for routing service requests through a network comprising nodes interconnected with links. The network is also arranged so that each node may communicate with each of the other nodes. At preselected time intervals, sets of routes through the network are generated in response to the network configuration and traffic information. Also, at predetermined time intervals, occupancy factors are computed as determined by the network configuration and in response to traffic information. Upon a request for service, the occupancy factors corresponding to the busy-idle status of the links are used to compute an occupancy value associated with each of the routes. Each route is converted to a candidate route based on traffic load at the initiation of the service request. The minimum occupancy value for each set of routes is selected as the candidate route for bridging a given node pair.Type: GrantFiled: December 5, 1985Date of Patent: November 3, 1987Assignee: Bell Communications Research, Inc.Inventors: Komandur R. Krishnan, Teunis J. Ott