Patents by Inventor Krishnan Srinivasan

Krishnan Srinivasan 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).

  • Queued sessions for communicating correlated messages over a network
    Publication number: 20060177069
    Abstract: Systems and methods in accordance with the present invention allow for messages to be delivered from one application to another over a network in discrete groupings or communication sessions. For example, a sending computer system sends a group of related messages to a queue at a recipient computer system. The recipient computer system identifies that the messages of the group are related, and initiates a session-oriented communication channel. The recipient computer passes the group of messages to an appropriate application, and opens a different, new session-oriented communication channel for a new group of messages that are not necessarily related to the first group of messages. In one implementation, an order identifier in each of the received messages instructs the recipient computer system on what order, if any, the messages in a group are to be processed by the specific application.
    Type: Application
    Filed: February 4, 2005
    Publication date: August 10, 2006
    Applicant: Microsoft Corporation
    Inventors: Craig Critchley, Richard Dievendorff, Krishnan Srinivasan, Richard Hill, Uday Hedge
  • Reliably transferring queued application messages
    Publication number: 20060168023
    Abstract: The present invention extends to methods, systems, and computer program products for reliably and securely transferring queued application messages. Application messages are (e.g.,. binary or text) encoded and then encapsulated in transfer messages, enqueue messages, and dequeue responses such that composable protocol elements used in application messages can be reused in the transfer messages, enqueue messages, and dequeue responses. Transfer message headers are encoded and then encapsulated along with encoded application messages such that composable protocol elements used in transfer headers and application messages can be reused in the store and forward messages. Application messages, transfer messages, enqueue messages, dequeue responses, and store and forward messages can all be configured in accordance with the same messaging protocol, such as, for example, Simple Object Access Protocol.
    Type: Application
    Filed: December 10, 2004
    Publication date: July 27, 2006
    Applicant: Microsoft Corporation
    Inventors: Krishnan Srinivasan, Craig Critchley, Uday Hegde, Alan Geller, David Driver, Richard Hill, Rodney Limprecht
  • Reliably transferring queued application messages
    Publication number: 20060168052
    Abstract: The present invention extends to methods, systems, and computer program products for reliably and securely transferring queued application messages. Application messages are (e.g., binary or text) encoded and then encapsulated in transfer messages, enqueue messages, and dequeue responses such that composable protocol elements used in application messages can be reused in the transfer messages, enqueue messages, and dequeue responses. Transfer message headers are encoded and then encapsulated along with encoded application messages such that composable protocol elements used in transfer headers and application messages can be reused in the store and forward messages. Application messages, transfer messages, enqueue messages, dequeue responses, and store and forward messages can all be configured in accordance with the same messaging protocol, such as, for example, Simple Object Access Protocol.
    Type: Application
    Filed: June 23, 2005
    Publication date: July 27, 2006
    Applicant: Microsoft Corporation
    Inventors: Krishnan Srinivasan, Craig Critchley, Uday Hegde, Alan Geller, David Driver, Richard Hill, Rodney Limprecht
  • Interface infrastructure for creating and interacting with web services
    Publication number: 20060150200
    Abstract: A web services namespace pertains to an infrastructure for enabling creation of a wide variety of applications. The infrastructure provides a foundation for building message-based applications of various scale and complexity. The infrastructure or framework provides APIs for basic messaging, secure messaging, reliable messaging and transacted messaging. In some embodiments, the associated APIs are factored into a hierarchy of namespaces in a manner that balances utility, usability, extensibility and versionability.
    Type: Application
    Filed: December 3, 2004
    Publication date: July 6, 2006
    Applicant: Microsoft Corporation
    Inventors: Shy Cohen, Geary Eppley, Douglas Purdy, James Johnson, Stephen Millet, Stephen Swartz, Vijay Gajjala, Aaron Stern, Alexander DeJarnatt, Alfred Lee, Anand Rjagopalan, Anastasios Kasiolas, Chaitanya Upadhyay, Christopher Kaler, Craig Critchley, David Levin, David Driver, David Wortendyke, Douglas Walter, Elliot Waingold, Erik Christensen, Erin Honeycutt, Eugene Shvets, Evgeny Osovetsky, Giovanni Della-Libera, Jesus Ruiz-Scougall, John Doty, Jonathan Wheeler, Kapil Gupta, Kenneth Wolf, Krishnan Srinivasan, Lance Olson, Matthew Tavis, Mauro Ottaviani, Max Feingold, Michael Coulson, Michael Marucheck, Michael Vernal, Michael Dice, Mohamed-Hany Ramadan, Mohammad Makarechian, Natasha Jethanandani, Richard Dievendorff, Richard Hill, Ryan Sturgell, Saurab Nog, Scott Seely, Serge Sverdlov, Siddhartha Puri, Sowmyanarayanan Srinivasan, Stefan Batres, Stefan Pharies, Tirunelveli Vishwanath, Tomasz Janczuk, Uday Hegde, Umesh Madan, Vaithialingam Balayogan, Vipul Modi, Yaniv Pessach, Yasser Shohoud
  • Reliably transferring queued application messages
    Publication number: 20060130069
    Abstract: The present invention extends to methods, systems, and computer program products for reliably and securely transferring queued application messages. Application messages are (e.g.,. binary or text) encoded and then encapsulated in transfer messages, enqueue messages, and dequeue responses such that composable protocol elements used in application messages can be reused in the transfer messages, enqueue messages, and dequeue responses. Transfer message headers are encoded and then encapsulated along with encoded application messages such that composable protocol elements used in transfer headers and application messages can be reused in the store and forward messages. Application messages, transfer messages, enqueue messages, dequeue responses, and store and forward messages can all be configured in accordance with the same messaging protocol, such as, for example, Simple Object Access Protocol.
    Type: Application
    Filed: June 23, 2005
    Publication date: June 15, 2006
    Applicant: Microsoft Corporation
    Inventors: Krishnan Srinivasan, Craig Critchley, Uday Hegde, Alan Geller, David Driver, Richard Hill, Rodney Limprecht
  • Programmable video encoding accelerator method and apparatus
    Publication number: 20040190625
    Abstract: A programmable video encoding accelerator having a substantially hardware-based transform coder that has at least a first video input and a second video input. In a preferred embodiment, the first video input is operably coupleable to an integral native difference computer and the second video input is operably coupleable to an external video feed that does not pass through the native difference computer.
    Type: Application
    Filed: March 13, 2003
    Publication date: September 30, 2004
    Applicant: Motorola, Inc.
    Inventors: Zhongli He, Chandrasekhar Lakshmanan, Kathy Moseler, Gopala Krishnan Srinivasan, Raghavan Subramaniyan
  • Concurrent design tradeoff analysis system and method
    Patent number: 5855009
    Abstract: Concurrent tradeoff analysis (10) first ascertains a set of constraints (16) and variables (18) for specifying a solution, and then defines characteristics for specifying the merit of the solution. Computations are made to determine the values for the variables (18) and characteristics, which represent a current solution state. The current solution state is checked (42) to ensure that there are no violations of the constraints (16). If a violation exists, one or more alternatives are generated (46) via a number of methods, and the alternatives are evaluated (48) along with the current solution state. One or more most promising alternative is chosen, and the process proceeds until values for all of the variables (18) and characteristics are computed.
    Type: Grant
    Filed: July 31, 1992
    Date of Patent: December 29, 1998
    Assignee: Texas Instruments Incorporated
    Inventors: Fred A. Garcia, Krishnan Srinivasan
  • Concurrent design tradeoff analysis system and method
    Patent number: 5842192
    Abstract: Concurrent tradeoff analysis (10) first ascertains a set of constraints (16) and variables (18) for specifying a solution, and then defines characteristics for specifying the merit of the solution. Computations are made to determine the values for the variables (18) and characteristics, which represent a current solution state. The current solution state is checked (42) to ensure that there are no violations of the constraints (16). If a violation exists, one or more alternatives are generated (46) via a number of methods, and the alternatives are evaluated (48) along with the current solution state. One or more most promising alternative is chosen, and the process proceeds until values for all of the variables (18) and characteristics are computed.
    Type: Grant
    Filed: September 22, 1995
    Date of Patent: November 24, 1998
    Assignee: Texas Instruments Incorporated
    Inventors: Fred A. Garcia, Krishnan Srinivasan