Jogalekar
Anushka Prasad Jogalekar, San Jose, CA US
Patent application number | Description | Published |
---|---|---|
20150134386 | COLLECTIVELY OPTIMIZING GROUP SCHEDULES TO MINIMIZE PROJECT COMPLETION TIME AND COST - A system and method for collectively optimizing group schedules to minimize completion time and project cost is disclosed. The method of some embodiments uses optimization techniques to collectively minimize the time and cost for the whole project, given the tasks, members and their attributes and dependencies. The system includes a project and task data store, a data validation engine, an analytics and correlation engine to resolve task prerequisites and dependencies, an optimizer to identify optimal task schedules according to a set of team members and associated project attributes, and an output generator to format a project calendar with all tasks and member assignments. | 05-14-2015 |
Ashutosh S. Jogalekar, Decatur, GA US
Patent application number | Description | Published |
---|---|---|
20100261683 | Selective Inhibitors for Cyclin-Dependent Kinases - This invention provides a class of compounds which are useful for specifically inhibiting cyclin-dependent kinases. This class of compounds finds use in treating diseases resulting from inappropriate activity of cyclin-dependent kinases, including cancer, viral infections (e.g., HIV) neurodegenerative disorders (e.g. Alzheimer's disease), and cardiovascular disorders (e.g. atherosclerosis). Moreover, certain members of this class are particularly useful for inhibiting cyclin-dependent kinase 7 and are especially useful for the treatment of breast cancer. | 10-14-2010 |
20120041198 | Process for Preparing 5,7 Diaminopyrazolo [1,5-a] Pyrimidine Compounds - Processes for the preparation of certain 5,7-diaminopyrazolo[1,5-α]pyrimidine compounds comprising the reaction of a primary or secondary amine and a protected 5-halo-7-aminopyrazolo[1,5-α]pyrimidine compound in solvent system comprising water and one or more organic solvents, optionally in the presence of an exogenous base. | 02-16-2012 |
Prachi Prasad Jogalekar, San Jose, CA US
Patent application number | Description | Published |
---|---|---|
20150134386 | COLLECTIVELY OPTIMIZING GROUP SCHEDULES TO MINIMIZE PROJECT COMPLETION TIME AND COST - A system and method for collectively optimizing group schedules to minimize completion time and project cost is disclosed. The method of some embodiments uses optimization techniques to collectively minimize the time and cost for the whole project, given the tasks, members and their attributes and dependencies. The system includes a project and task data store, a data validation engine, an analytics and correlation engine to resolve task prerequisites and dependencies, an optimizer to identify optimal task schedules according to a set of team members and associated project attributes, and an output generator to format a project calendar with all tasks and member assignments. | 05-14-2015 |
Prasad Jogalekar, San Jose, CA US
Patent application number | Description | Published |
---|---|---|
20140362686 | TECHNIQUES FOR END-TO-END NETWORK BANDWIDTH OPTIMIZATION USING SOFTWARE DEFINED NETWORKING - Techniques for end-to-end network bandwidth optimization using software defined networking are provided. In one embodiment, a computer system can receive information regarding a flow to be admitted to a network, where the flow is associated with a source and a destination. The computer system can further calculate, for each path in a plurality of paths between the source and the destination, a projected utilization of the path in view of the flow. If the projected utilization of the shortest path in the plurality of paths is less than or equal to a target utilization threshold, the computer system can assign the flow to the shortest path. Otherwise, the computer system can select a path in the plurality of paths that comes closest to the target utilization threshold without exceeding the threshold and can assign the flow to that selected path. | 12-11-2014 |
Prasad P. Jogalekar, San Jose, CA US
Patent application number | Description | Published |
---|---|---|
20150117256 | EXTENDED ETHERNET FABRIC SWITCHES - One embodiment of the present invention provides a switch. The switch includes a fabric switch module and a learning module. The fabric switch module maintains a membership in a first fabric switch. A fabric switch includes a plurality of switches and operates as a single switch. The first fabric switch is in an extended fabric switch which further comprises a second fabric switch. The learning module identifies from a notification message from the second fabric switch a media access control (MAC) address learned at the second fabric switch. The learning module stores the MAC address in a local MAC table in association with an Internet Protocol (IP) address of the second fabric switch. | 04-30-2015 |
Prasad P. Jogalekar, Sunnyvale, CA US
Patent application number | Description | Published |
---|---|---|
20090092064 | ROUTING SWITCH DETECTING CHANGE IN SESSION IDENTIFIER BEFORE RECONFIGURING ROUTING TABLE - An automatic network topology identification technique is described herein. Each node in the network periodically or constantly transmits its unique address to its neighboring node. Once a node receives a different message from its neighbor, the node identifies a topology change in the network. In one embodiment, a current topology is associated with a session number. When a change in the topology is detected, the detecting node increments the session number and broadcasts the change in topology. The other nodes, detecting the changed session number, now know that there has been a change in the network. In response, the nodes in the network modify routing tables and other information stored at the node related to the topology. In one embodiment, the technique is used to reassign shortened addresses to each device on the network to support a dual-addressing mode of the network. The dual addressing mode substitutes reduced-length addresses (referred to as short addresses) for standard addresses (referred to as long addresses) for traffic whose source or destination is internal to a given virtual network topology. The required length of short addresses used for a given virtual topology is dependent on the number of devices reachable within the topology. | 04-09-2009 |
20090141621 | BANDWIDTH RESERVATION REUSE IN DYNAMICALLY ALLOCATED RING PROTECTION AND RESTORATION TECHNIQUE - The disclosed network includes two rings, wherein a first ring transmits data in a clockwise direction, and the other ring transmits data in a counterclockwise direction. The traffic is removed from the ring by the destination node. During normal operations (i.e., all spans operational), data between nodes can flow on either ring. Thus, both rings are fully utilized during normal operations. The nodes periodically test the bit error rate of the links (or the error rate is constantly calculated) to detect a fault in one of the links. The detection of such a fault sends a broadcast signal to all nodes to reconfigure a routing table within the node so as to identify the optimum routing of source traffic to the destination node after the fault. | 06-04-2009 |
20090141656 | BANDWIDTH RESERVATION REUSE IN DYNAMICALLY ALLOCATED RING PROTECTION AND RESTORATION TECHNIQUE - The disclosed network includes two rings, wherein a first ring transmits data in a clockwise direction, and the other ring transmits data in a counterclockwise direction. The traffic is removed from the ring by the destination node. During normal operations (i.e., all spans operational), data between nodes can flow on either ring. Thus, both rings are fully utilized during normal operations. The nodes periodically test the bit error rate of the links (or the error rate is constantly calculated) to detect a fault in one of the links. The detection of such a fault sends a broadcast signal to all nodes to reconfigure a routing table within the node so as to identify the optimum routing of source traffic to the destination node after the fault. | 06-04-2009 |
20100124176 | AUTOMATIC NETWORK TOPOLOGY IDENTIFICATION BY NODES IN THE NETWORK - An automatic network topology identification technique is described herein. Each node in the network periodically or constantly transmits its unique address to its neighboring node. Once a node receives a different message from its neighbor, the node identifies a topology change in the network. In one embodiment, a current topology is associated with a session number. When a change in the topology is detected, the detecting node increments the session number and broadcasts the change in topology. The other nodes, detecting the changed session number, now know that there has been a change in the network. In response, the nodes in the network modify routing tables and other information stored at the node related to the topology. In one embodiment, the technique is used to reassign shortened addresses to each device on the network to support a dual-addressing mode of the network. The dual addressing mode substitutes reduced-length addresses (referred to as short addresses) for standard addresses (referred to as long addresses) for traffic whose source or destination is internal to a given virtual network topology. The required length of short addresses used for a given virtual topology is dependent on the number of devices reachable within the topology. | 05-20-2010 |
Prasad Prabhakar Jogalekar, Sunnyvale, CA US
Patent application number | Description | Published |
---|---|---|
20090059785 | Policy-based resource management - In one embodiment, a network device receives a request from a client in association with a connection, where the request indicates an amount of one or more resources that is requested to support the connection. The network device determines whether the amount of the resources is available. The network device may then allocate a level of the resources to the connection according to whether the amount of the resources is available. | 03-05-2009 |
Prasad Prabhakar Jogalekar, San Jose, CA US
Patent application number | Description | Published |
---|---|---|
20150134386 | COLLECTIVELY OPTIMIZING GROUP SCHEDULES TO MINIMIZE PROJECT COMPLETION TIME AND COST - A system and method for collectively optimizing group schedules to minimize completion time and project cost is disclosed. The method of some embodiments uses optimization techniques to collectively minimize the time and cost for the whole project, given the tasks, members and their attributes and dependencies. The system includes a project and task data store, a data validation engine, an analytics and correlation engine to resolve task prerequisites and dependencies, an optimizer to identify optimal task schedules according to a set of team members and associated project attributes, and an output generator to format a project calendar with all tasks and member assignments. | 05-14-2015 |