Patents by Inventor Harsha Nagesh
Harsha Nagesh 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).
-
Publication number: 20140188692Abstract: Optimizing fixed rate whole loan trading. Specifically, the invention provides computer-based systems and methods for optimally packaging a population of whole loans into bonds in either a senior/subordinate bond structure or into pools of pass through securities guaranteed by a government agency. Models for each type of bond structure are processed on the population of loans until either an optimal bond package is found or a user determines that a solution of sufficient high quality is found. Additionally, the models can account for bids for whole loans by allocating whole loans that meet requirements of the bid but are least favorable to be securitized.Type: ApplicationFiled: February 20, 2014Publication date: July 3, 2014Inventors: Harsha Nagesh, Rajan Godse
-
Patent number: 8694404Abstract: Optimizing fixed rate whole loan trading. Specifically, the invention provides computer-based systems and methods for optimally packaging a population of whole loans into bonds in either a senior/subordinate bond structure or into pools of pass through securities guaranteed by a government agency. Models for each type of bond structure are processed on the population of loans until either an optimal bond package is found or a user determines that a solution of sufficient high quality is found. Additionally, the models can account for bids for whole loans by allocating whole loans that meet requirements of the bid but are least favorable to be securitized.Type: GrantFiled: July 31, 2009Date of Patent: April 8, 2014Assignee: Credit Suisse Securities (USA) LLCInventors: Harsha Nagesh, Rajan Godse
-
Publication number: 20100057635Abstract: Optimizing fixed rate whole loan trading. Specifically, the invention provides computer-based systems and methods for optimally packaging a population of whole loans into bonds in either a senior/subordinate bond structure or into pools of pass through securities guaranteed by a government agency. Models for each type of bond structure are processed on the population of loans until either an optimal bond package is found or a user determines that a solution of sufficient high quality is found. Additionally, the models can account for bids for whole loans by allocating whole loans that meet requirements of the bid but are least favorable to be securitized.Type: ApplicationFiled: July 31, 2009Publication date: March 4, 2010Applicant: Credit Suisse Securities (USA) LLCInventors: Harsha Nagesh, Rajan Godse
-
Publication number: 20060291392Abstract: Multi-path routing techniques using intra-flow splitting are disclosed. For example, a technique for processing traffic flows at a node in a network comprises the following steps/operations. At least one traffic flow is obtained. The at least one traffic flow comprises multiple packets or bytes. The at least one flow is split into at least two sub-flows, wherein each of the at least two sub-flows comprises a portion of the multiple packets or bytes. The packets or bytes of the at least two sub-flows are respectively routed on at least two paths in the network.Type: ApplicationFiled: June 28, 2005Publication date: December 28, 2006Inventors: Mansoor Alicherry, Jin Cao, Harsha Nagesh, Chitra Phadke, Viswanath Poosala
-
Publication number: 20060293058Abstract: Techniques and systems for designing a network providing communication and location identification services are described. A solution point comprising parameters for each of a plurality of base stations is generated. A coverage and locatability performance value for the solution point is computed, as well as derivatives of the performance value. The coverage and locatability performance value and its derivatives are used to indicate favorable directions for searching for subsequent solution points, and subsequent solution points are generated and compared against previous solution points until an optimum solution point is found. The coverage and locatability performance value is a weighted sum of coverage and locatability values for each point in the service area of the network, with coverage values representing forward and reverse link quality and locatability values representing the probability that a point will experience an acceptable power level from at least four base stations.Type: ApplicationFiled: August 8, 2006Publication date: December 28, 2006Applicant: Lucent Technologies Inc.Inventors: Mansoor Alicherry, Harsha Nagesh, Chitra Phadke, Viswanath Poosala
-
Publication number: 20060291629Abstract: Location enabled voice mail is described. Such capability can be provided by service providers to offer their customers a host of unique location based voice mail services of both an audio and video nature. By way of example, a first calling party may leave a voice mail message for a second called party at a first time. First location information for the calling device is obtained about the first time. Upon retrieving the voice mail message at a second time, the called party is provided with the location enabled voice mail services. For example, the called party may receive a map containing the location of the calling device at a first time plotted thereon.Type: ApplicationFiled: June 10, 2005Publication date: December 28, 2006Applicant: Lucent Technologies Inc.Inventors: Thomas Esh, Harsha Nagesh, Viswanath Poosala, Anurag Srivastava
-
Publication number: 20060291640Abstract: Personalized location enabled indicators, such as ring backs or ring tones are described. Such capability can be provided by wireless service providers to offer their customers a host of unique location based ring tones and ring backs of both an audio and video nature. By way of example, a first calling party may be provided with a video ring back indicative of location, such as a picture of the Golden Gate Bridge when a second called party is in San Francisco, or a ring tone may indicate a called party is at work and busy, at home and not busy, or the like, with different ring tones for different classes of callers, such as coworkers, family, friends or specified individuals.Type: ApplicationFiled: June 10, 2005Publication date: December 28, 2006Applicant: Lucent Technologies Inc.Inventors: Harsha Nagesh, Viswanath Poosala, Shengqiang Wang
-
Patent number: 7099670Abstract: Techniques and systems for designing a network providing communication and location identification services are described. A solution point comprising parameters for each of a plurality of base stations is generated. A coverage and locatability performance value for the solution point is computed, as well as derivatives of the performance value. The coverage and locatability performance value and its derivatives are used to indicate favorable directions for searching for subsequent solution points, and subsequent solution points are generated and compared against previous solution points until an optimum solution point is found. The coverage and locatability performance value is a weighted sum of coverage and locatability values for each point in the service area of the network, with coverage values representing forward and reverse link quality and locatability values representing the probability that a point will experience an acceptable power level from at least four base stations.Type: GrantFiled: June 17, 2003Date of Patent: August 29, 2006Assignee: Lucent Technologies Inc.Inventors: Mansoor Ali Khan Alicherry, Harsha Nagesh, Chitra Phadke, Viswanath Poosala
-
Publication number: 20060140116Abstract: Network design techniques and techniques for routing virtually-concatenated data traffic in a network in a manner which distributes delay to intermediate nodes of the network are disclosed. For example, in one aspect of the invention, a technique for routing virtually-concatenated data traffic in a network comprising a plurality of nodes comprises, for a given traffic demand to be routed from a source node to a destination node in the network, the following steps/operations. Two or more paths are determined to route the given traffic demand. Each of the two or more paths correspond to a member of a virtually-concatenated group. At least one path of the two or more paths comprises the source node, the destination node and at least one other node coupled between the source node and the destination node. Further, at least a subset of the source node, the destination node and the one other node buffer at least a portion of the given traffic demand such that a delay is distributed over the at least one path.Type: ApplicationFiled: December 29, 2004Publication date: June 29, 2006Inventors: Mansoor Alicherry, Harsha Nagesh, Chitra Phadke, Viswanath Poosala
-
Publication number: 20060140118Abstract: Techniques for single-failure protection in load-balanced network architectures are disclosed. For example, in one aspect of the invention, a technique for processing a traffic flow in a communication network comprising a plurality of nodes, the traffic flow being deliverable from a source node to at least one destination node via one or more intermediate nodes, comprises the following steps/operations. The traffic flow is split at the source node into a plurality of parts. The parts are distributed to respective ones of the intermediate nodes such that the parts are routed from the source node to the at least one destination node in a disjoint manner.Type: ApplicationFiled: December 29, 2004Publication date: June 29, 2006Inventors: Mansoor Alicherry, Harsha Nagesh, Chitra Phadke, Viswanath Poosala
-
Publication number: 20060133430Abstract: A load-balanced network architecture is disclosed in which a traffic flow deliverable from a source node to a destination node via intermediate nodes is split into parts, and the parts are distributed to respective ones of the intermediate nodes. Path delay differences for the parts are substantially equalized by delay adjustment at one or more of the intermediate nodes, and packets of one or more of the parts are scheduled for routing from respective ones of the intermediate nodes to the destination node based on arrival times of the packets at the source node.Type: ApplicationFiled: December 21, 2004Publication date: June 22, 2006Inventors: Harsha Nagesh, Viswanath Poosala, Sudipta Sengupta, Peter Winzer
-
Publication number: 20060067702Abstract: Techniques are disclosed for designing optical transmission systems that efficiently compute cost-optimal configurations under one or more constraints. For example, in one aspect of the present invention, a technique for designing an optical transmission system comprises the following steps/operations. A set of one or more demands and a set of optical transmission system elements are obtained. Elements may be consecutively coupled via a span. At least one constraint on the design of the optical transmission system is obtained.Type: ApplicationFiled: September 28, 2004Publication date: March 30, 2006Inventors: Mansoor Alicherry, Harsha Nagesh, Chitra Phadke, Viswanath Poosala
-
Publication number: 20050286425Abstract: Virtually-concatenated data traffic is routed in a network comprising a plurality of nodes, the plurality of nodes including one or more nodes that are differential delay enabled and one or more nodes that are not differential delay enabled. For a given traffic demand to be routed from a source node to a destination node in the network, at least one route is determined for routing the demand between an intermediate node that is differential delay enabled and one of the source node and the destination node that is not differential delay enabled. Also, a set of routes is determined for routing the demand between the intermediate node that is differential delay enabled and at least one other node of the network, that may or may not be differential delay enabled, with each of the routes in the set corresponding to a member of a virtually-concatenated group. The given traffic demand is routed from the source node to the destination node, utilizing the at least one route and the set of routes.Type: ApplicationFiled: May 28, 2004Publication date: December 29, 2005Inventors: Harsha Nagesh, Viswanath Poosala
-
Publication number: 20050239513Abstract: An alert-me management system for a telecommunications infrastructure and a method of providing an alert-me service. In one embodiment, the system includes: (1) distributed alert-me request servers configured to receive and aggregate alert-me requests pertaining to uniquely identified wireless terminals from calling parties and (2) an alert-me service manager configured to receive the alert-me requests from the distributed alert-me request servers, further aggregate the alert-me requests into a table based on the uniquely identified wireless terminals, generate status checks for the uniquely identified wireless terminals and respond to the distributed alert-me request servers with positive alert-me indications to prompt the distributed alert-me request servers to generate alerts to the calling parties.Type: ApplicationFiled: April 7, 2004Publication date: October 27, 2005Applicant: Lucent Technologies Inc.Inventors: Yuh-Jye Chang, Harsha Nagesh, Viswanath Poosala, Anurag Srivastava
-
Publication number: 20050195761Abstract: A method for location tracking on a distributed basis using multiple locations. which utilizes a pairwise application of distance constraints and vicinities for determining locations. The location of a particular node is represented by a group of points (as opposed to a single point) defined by the vicinity.Type: ApplicationFiled: March 8, 2004Publication date: September 8, 2005Inventors: Mansoor Alicherry, Harsha Nagesh, Chitra Phadke, Viswanath Poosala
-
Publication number: 20050185584Abstract: A load-balanced network architecture is disclosed in which a traffic flow at a given network node is split into a plurality of parts, and the parts are distributed to respective ones of the plurality of nodes that are designated as participating in a load balancing process for the traffic flow. Each of at least a subset of the participating nodes receiving one of the parts routes at least a portion of its received part to one or more destination nodes.Type: ApplicationFiled: February 24, 2004Publication date: August 25, 2005Inventors: Harsha Nagesh, Viswanath Poosala, Dimitrios Stiliadis, Peter Winzer, Martin Zirngibl
-
Publication number: 20050124293Abstract: A method and apparatus for determining the current location of a mobile device. More particularly, Bluetooth® enabled mobile devices can be located precisely in an independent fashion, i.e., independent from any communications network associated with the particular mobile device or independent from a GPS or other dedicated system used for location identification purposes.Type: ApplicationFiled: December 4, 2003Publication date: June 9, 2005Inventors: Mansoor Alicherry, Harsha Nagesh, Chitra Phadke, Viswanath Poosala
-
Publication number: 20050063309Abstract: Techniques for network routing and design are provided. A technique for determining a route for a demand in a network, wherein the network comprises primary paths and secondary paths, and at least two secondary paths may share a given link, comprises the following steps/operations. First, a graph representing the network is transformed. Edges of the graph represent channels associated with paths and nodes of the graph represent nodes of the network. The transformation is performed such that costs associated with the edges reflect costs of using channels in secondary paths. Then, the shortest path between nodes corresponding to the demand is found in the transformed graph. The shortest path represents the least-cost path in the network over which the demand may be routed. When the above route determination steps/operations result in a path with at least one loop, an alternative routing process may be executed so as to determine a loopless path for the demand.Type: ApplicationFiled: September 5, 2003Publication date: March 24, 2005Inventors: Mansoor Alicherry, Harsha Nagesh, Chitra Phadke, Viswanath Poosala
-
Patent number: 6842723Abstract: Network design techniques are disclosed for optimally placing OXCs and OADMs in an optical mesh network to minimize network cost by using cheaper OADMs wherever possible and only using more expensive OXCs where required. In one aspect, the techniques are provided for determining the optimal configuration of each OXC in terms of each OXC's switch size and port configuration. In another aspect, the present invention provides network analysis transformation techniques which enable Dijkstra's shortest path algorithm to account for the degree of each network node and determine optimal placement of the OXCs and OADMs.Type: GrantFiled: March 20, 2003Date of Patent: January 11, 2005Assignee: Lucent Technologies Inc.Inventors: Mansoor Ali Khan Alicherry, Harsha Nagesh, Chitra Phadke, Viswanath Poosala
-
Publication number: 20040259522Abstract: Techniques and systems for designing a network providing communication and location identification services are described. A solution point comprising parameters for each of a plurality of base stations is generated. A coverage and locatability performance value for the solution point is computed, as well as derivatives of the performance value. The coverage and locatability performance value and its derivatives are used to indicate favorable directions for searching for subsequent solution points, and subsequent solution points are generated and compared against previous solution points until an optimum solution point is found. The coverage and locatability performance value is a weighted sum of coverage and locatability values for each point in the service area of the network, with coverage values representing forward and reverse link quality and locatability values representing the probability that a point will experience an acceptable power level from at least four base stations.Type: ApplicationFiled: June 17, 2003Publication date: December 23, 2004Applicant: Lucent Technologies, Inc.Inventors: Mansoor Ali Khan Alicherry, Harsha Nagesh, Chitra Phadke, Viswanath Poosala