Microsoft Technology Licensing, LLC

Manu Srivastava

Kartik Paramasivam

Muralidhar Krishnaprasad

Venkata Raja Gopal Ravipati

Bin Li

Murali Krishnaprasad

Sankar Sundaram

Sung Hwa Jin

Briton Zurcher

Ruppert Rolf Koch

Jayteerth Narasingrao Katti

Pramod Gurunath

Stuart John Langley

Elvin Morales

SeongJoon Kwak

A method for utilizing elastic resource pooling techniques to dynamically rebalance throughput includes determining, for each of multiple tenants leasing computing resources of a shared resource pool, a desired claim to resources in the shared resource pool. The desired claim is based on a number of resource access requests received in association with each of the multiple tenants. The method further includes determining, for each of the multiple tenants, a guaranteed claim and a maximum potential claim on the shared resource pool; and allocating a surplus resource pool among the multiple tenants based on the determined maximum potential claim and the desired claim for each one of the multiple tenants, the surplus resource pool representing a remainder of the shared resource pool after the guaranteed claim for each of the tenants is satisfied via an initial resource allocation from the shared resource pool.

Elastic resource pooling for dynamic throughput rebalancing

A messaging service is described that facilitates the efficient receipt of messages by a client from across a large number of messaging entities hosted by different messaging hosts within a distributed messaging system. A gateway in the distributed messaging system forwards a request for an available message or set of related messages from the client to each of the messaging hosts. Each messaging host provides a response to a request if a messaging entity hosted thereby includes at least one available message or set of related messages. The messaging host manages the order in which responses from different messaging entities are provided to ensure fairness. The gateway forwards a selected one of the responses to the consumer, while caching the other responses to service future requests from the consumer.

Efficiently receiving messages across a large number of messaging entities

Aspects of the subject matter described herein relate migrating message for a messaging service. In aspects, a determination is made that messages need to be migrated based on a threshold being crossed. In response, an agent is instructed to migrate data associated with the messages to another location. The agent uses various factors to determine one or more queues to migrate. While a queue is being migrated, during a first portion of the migration, messages may be added to and removed from the queue as senders send new messages and receivers consume messages. During a second portion of the migration, the queue is frozen to disallow the queue to be used for receiving new messages and delivering queued messages. The migration may be orchestrated to attempt to achieve certain goals.

High density hosting for messaging service

Network and storage calls are reduced by batching messages. Messages are collected from a client and sent to the gateway or backend application in one round trip. Alternatively, the messages are collected for different entities, and the batched messages are durably stored. Related messages, which may have the same sessionID, are grouped into a logical unit or session. This session may be locked to a single message consumer. A session may be associated with an application processing state as an atomic unit of work while other operations are performed on the messages in the session. Acknowledgements are accumulated by a broker on a message server, but the messages are not immediately deleted. Instead, multiple messages in a selected range are periodically truncated from a message store in a single operation. Expired messages for active sessions are proactive cleaned up to prevent sessions from reaching a quota or limit.

Message queue behavior optimizations

Techniques are provided for scheduled and non-scheduled delivery of messages. A message directed to at least one consumer is received at a message entity. The message is determined to include a scheduled delivery time. The received message is stored in a scheduled sub-queue of the message entity. Activation metadata is retrieved and stored for any messages stored in the scheduled sub-queue that include a scheduled delivery time within a predetermined upcoming time period. If when the message is received, the scheduled delivery time of the message is within a current activation window, the activation metadata for the message may be extracted and stored immediately. The stored activation metadata is analyzed to determine a batch of messages in the scheduled sub-queue ready for delivery. The determined batch of messages is stored in an active sub-queue of the message entity, to be ready for delivery at the request of a consumer.

Scheduled messages in a scalable messaging system

Growing community of inventors

Redmond, WA, United States of America

Manu Srivastava