Microsoft Technology Licensing, LLC

Krishnan Srinivasan

Richard Douglas Hill

Craig Andrew Critchley

Uday Sooryakant Hegde

David Owen Driver

Gueorgui Chkodrov

Tihomir Tsvetkov Tarnavski

Pramod Gurunath

Mitchell G Morris

Alan Geller

Rodney Thomas Limprecht

Richard Dievendorff

Raghunath Ramakrishnan

Anand Bheemarajaiah

Sumeet Priyadarshee Dash

Sandeep Prabhu

Manas Garg

Uday S Hedge

Christopher G Kaler

Erik B Christensen

Kenneth David Wolf

Stephen James Millet

David Wortendyke

Giovanni Moises Della-Libera

James Ernest Johnson

Tirunelveli R Vishwanath

Lance Olson

Geoffrey M Kizer

Umesh Madan

Stefan R Batres

Michael James Coulson

Stefan Harrington Pharies

John David Doty

Alexander Dadiomov

Michael Marucheck

Vijay Gajjala

Elliot Lee Waingold

Matthew Thomas Tavis

Geary L Eppley

Tomasz Janczuk

Michael Steven Vernal

David Edwin Levin

Stephen T Swartz

Shy Cohen

Max A Feingold

Douglas M Purdy

Natasha Harish Jethanandani

Aaron Stern

Siddhartha Puri

Saurab Nog

Douglas A Walter

Anastasios Kasiolas

Jesus Ruiz-Scougall

Kapil Gupta

Ryan Thomas Sturgell

Vipul A Modi

Sowmyanarayanan K Srinivasan

Scott Christopher Seely

Mohammad Makarechian

Jonathan T Wheeler

Alexander Martin DeJarnatt

Evgeny Osovetsky

Michael Thomas Dice

Chaitanya Dutt Upadhyay

Brandon Barry Haynes

Erin Honeycutt

Jose Aguilar Saborit

Mauro Ottaviani

Yaniv Pessach

Eugene Shvets

Yasser Shohoud

Alfred M Lee, Iv

Vaithialingam B Balayogan

Serge Sverdlov

Mohamed-Hany Essam Ramadan

Anand Rjagopalan

Milan Potocnik

Mohammad Shafiei Khadem

Kevin Bocksrocker

A hypergraph workload manager in a server is configured for failure tolerant and explainable state machine driven hypergraph execution. The hypergraph executor comprises a query optimizer, a hypergraph enlister, a pipeline analyzer, and a state machine generator. The query optimizer translates a user query into a query operator graph. The hypergraph enlister enlists the query operator graph into a hypergraph containing a set of query operator graphs representative of already submitted user queries. The enlistment is configured to join query operator graphs where it makes sense to optimize query executions. Updates to the hypergraph based on the enlistment results in a set of disconnected graphs. The pipeline analyzer performs an analysis of all operators of all queries in the hypergraph to find an optimal sequencing of execution. The state machine generator is configured to generate a hierarchical state machine for all operators of a disconnected graph of the hypergraph.

Failure tolerant and explainable state machine driven hypergraph execution

Systems and methods are provided that introduce an approach for executing a multi-query workload that leverages live execution feedback from nodes to detect resourcing issues and anomalies, and deploy real-time corrective measures for the multi-query workload. Leveraging live execution feedback from the nodes as the queries are executing make it possible to detect various resourcing issues and anomalies, and enable the system to perform corrective actions 'live' or in “real-time” during an execution of a query, and more specifically during execution of the tasks within a query.

Dynamic workload management optimizations using real-time execution feedback

A scalable data feed system is disclosed. The data feed system may be offered as a cloud service that can serve many enterprises or tenants that require data to be pulled from information sources such as FTP, POP3, databases, line of business systems, a topic subscription, or an RSS feed, and pushed the data to information sinks, such as SMTP, email, FTP, mobile phones, and other devices and services. A pull agent pumps data from pull sources and pushes the data out to push agent counterparts. The push agent transforms and sends the data in messages to push sink, such as FTP, SMTP, or a mobile device. Both the pull agent and the push agent services are implemented as replicated services over a structured overlay network for high availability that can serve multiple requests to pump out data from multiple pull sources and push the data to multiple information sinks.

Scalable data feed system

The present invention extends to methods, systems, and computer program products for configuring assurances within distributed messaging systems. A defined set of message log and cursor components are configurably activatable and deactivatable to compose a variety of different capture assurances, transfer assurances, and delivery assurances within a distributed messaging system. A composition of a capture assurance, a transfer assurance, and a delivery assurance can provide an end-to-end assurance for a messaging system. End-to-end assurances can include one of best effort, at-most-once, at-least-once, and exactly once and can include one of: durable or non-durable. Using a defined set of activatable and deactivatable message log and cursor components facilities more efficient transitions between desired assurances. In some embodiments, a composition of a capture assurance, a transfer assurance, and a delivery assurance provides durable exactly-once message delivery.

Distributed messaging system with configurable assurances

The present invention extends to methods, systems, and computer program products for durable exactly once message delivery at scale. A message capture system uses a synchronous capture channel and transactions to provide durable exactly once message capture. Messages are sent from the message capture system to a message delivery system over a network using an at least once transfer protocol. The message delivery system implements a durable at most once messaging behavior, the combination of which results in durable exactly once transfer of messages from the message capture system to the message delivery system. The message delivery system uses a synchronous delivery channel and transactions to provide durable exactly once message delivery. Cursors maintaining message consumer state are collocated with message consumers, freeing up message log resources to process increased volumes of messages, such as, for example, in a queued or pub/sub environment.

Durable exactly once message delivery at scale

The present invention extends to methods, systems, and computer program products for maintaining message state at a cursor. A message consumer requests messages from a cursor. The cursor can maintain state information for the message consumers separately from a message log that stores messages. Any of a variety of message delivery assurances can be used when delivering a message to a message consumer.

Message state maintenance at a cursor

The present invention extends to methods, systems, and computer program products for maintaining message state at a message log. Messages are accumulated at a message log in accordance with a message retention policy. Any of a variety of message capture assurances can be used when capturing a message from a message producer within a message log. A message becomes visible to message consumers after the outcome of writing the message is known (either failure or success). Messages are requested using (e.g., monotonically increasing) sequence numbers. Messages are also dropped from the message log in accordance with the message retention policy.

Message state maintenance at a message log

The present invention extends to methods, systems, and computer program products for failed message error recovery using application specific error queues. An application message, a reference to a receive queue that corresponds to a receiving application, and a reference to an application specific error queue specific to a sending application are received from the sending application. The application message is enqueued in a transmission queue. Transfer of the application message to the receive queue is attempted. It is detected that the application message was not delivered to the receiving application due to an error. The application message is moved from the transmission queue to the application specific error queue. The application message and appropriate error information is returned from the application specific error queue to the sending application.

Failed message error recovery using application specific error queues

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. Since encapsulated elements are encoded, the encapsulated elements do not interfere with configuration of wrapping messages.

Reliably transferring queued application messages

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. Since encapsulated elements are encoded, the encapsulated elements do not interfere with configuration of wrapping messages.

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.

Interface infrastructure for creating and interacting with web services

Allowing queue messages to be pulled by one or more applications. A method may be practiced, for example, in a computing environment including applications configured to receive messages from queues. The method includes correlating applications to queues by correlating queue names to application locations. A queue is monitored to discover new messages in the queue. The method further includes receiving a notification that a new message has been added to the queue. An indication is provided to an activation service to allow the activation service to activate an application correlated to the queue and to allow the application to pull the new message from the queue.

Monitoring message queues and starting processing applications

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.

Queued sessions for communicating correlated messages over a network

Growing community of inventors

Kirkland, WA, United States of America

Krishnan Srinivasan