Chandan Rama Reddy

8521902, Aug 27, 2013

Dec 2, 2010

12/959245

Richard T. Russo - Redmond WA, US
Aaron Matthew Tyler - Redmond WA, US
Chandan Rama Reddy - Redmond WA, US
Manoj Krishna Ghosh - Redmond WA, US
Alaa H. Abdelhalim - Bellevue WA, US
Roger D. Seielstad - Redmond WA, US
Peter A. Gurevich - Woodinville WA, US

Microsoft Corporation - Redmond WA

G06F 15/16

709234

Described herein are various principles for operating a connectionless content unit transfer protocol to transmit content of a content unit to multiple clients using a shared buffer. A server may transfer content of one or more content units to each of multiple clients upon request from the client using individual buffers. For each content unit being transferred, the server may maintain a count of the aggregate size of buffers for transferring content of that content unit. If the server determines that the aggregate size of the buffers transmitting a particular content unit is larger than the content unit itself, the server may establish a shared buffer for transferring that content unit to clients. A server using a shared buffer in this manner may transfer content of the content unit to clients using the shared buffer until all requesting clients have received the content unit.

20120143993, Jun 7, 2012

Dec 2, 2010

12/959233

Richard T. Russo - Redmond WA, US
Aaron Matthew Tyler - Redmond WA, US
Chandan Rama Reddy - Redmond WA, US
Manoj Krishna Ghosh - Redmond WA, US
Alaa H. Abdelhalim - Bellevue WA, US
Roger D. Seielstad - Redmond WA, US
Peter A. Gurevich - Woodinville WA, US

Microsoft Corporation - Redmond WA

G06F 15/16

709219

Described herein are various principles for operating transfer protocols using adaptive flow control techniques. In accordance with some of these principles, a client may adaptively negotiate with a server regarding a window size to use when communicating datagrams using a connectionless content unit transfer protocol like the Trivial File Transfer Protocol (TFTP). In some implementations, a client may inform a server whether to increase or decrease a window size. In these implementations, the client may increase the window size upon determining that a previous window size has led to successful transfer of content without any loss of datagrams and the client may decrease the window size upon detecting a loss of a datagram. Because of the limited resources available in some environments in which these techniques may be used, in some implementations a window size may be increased by small amounts but may be decreased drastically upon detecting a loss.

20190286812, Sep 19, 2019

Mar 14, 2018

15/920832

- Redmond WA, US
Ashok CHANDRASEKARAN - Redmond WA, US
Chetan S. SHANKAR - Bothell WA, US
Chandan R. REDDY - Redmond WA, US
Chuang WANG - Issaquah WA, US
Kahren TEVOSYAN - Kirkland WA, US
Mark Eugene RUSSINOVICH - Hunts Point WA, US
Vyom P. MUNSHI - Bothell WA, US
Pavel ZAKHAROV - Sammamish WA, US
Abhishek Pratap Singh CHAUHAN - London, GB

G06F 21/46
H04L 29/06

Various methods and systems are provided for autonomous orchestration of secrets renewal and distribution. A secrets management service (“SMS”) can be utilized to store, renew and distribute secrets in a distributed computing environment. The secrets are initially deployed, after which, SMS can automatically renew the secrets according to a specified rollover policy, and polling agents can fetch updates from SMS. In various embodiments, SMS can autonomously rollover client certificates for authentication of users who access a security critical service, autonomously rollover storage account keys, track delivery of updated secrets to secrets recipients, deliver secrets using a secure blob, and/or facilitate autonomous rollover using secrets staging. In some embodiments, a service is pinned to the path where the service's secrets are stored. In this manner, secrets can be automatically renewed without any manual orchestration and/or the need to redeploy services.

20190288839, Sep 19, 2019

Mar 14, 2018

15/920827

- Redmond WA, US
Ashok CHANDRASEKARAN - Redmond WA, US
Chandan R. REDDY - Redmond WA, US
Chuang WANG - Issaquah WA, US
Kahren TEVOSYAN - Kirkland WA, US
Mark Eugene RUSSINOVICH - Hunts Point WA, US
Srinivas S. NIDADAVOLU - Redmond WA, US
Vyom P. MUNSHI - Redmond WA, US

H04L 9/08
H04L 29/06
H04L 9/32

Various methods and systems are provided for autonomous orchestration of secrets renewal and distribution across scope boundaries. A cross-scope secrets management service (“SMS”) can be utilized to store, renew and distribute secrets across boundaries in a distributed computing environment such as regional boundaries. In some embodiments, locally scoped secrets management services subscribe to receive updates from the cross-scope secrets management service. As secrets are renewed, they are automatically propagated to a subscribing local scope and distributed by the local secrets management service. In various embodiments, SMS can autonomously rollover storage account keys, track delivery of updated secrets to secrets recipients, deliver secrets using a secure blob, and/or facilitate autonomous rollover using secrets staging. In some embodiments, a service is pinned to the path where the service's secrets are stored. In this manner, secrets can be automatically renewed without any manual orchestration and/or the need to redeploy services.

20190288995, Sep 19, 2019

Mar 14, 2018

15/920821

- Redmond WA, US
Kahren TEVOSYAN - Kirkland WA, US
Chandan R. REDDY - Redmond WA, US
Ashok CHANDRASEKARAN - Redmond WA, US

H04L 29/06

Various methods and systems are provided for autonomous management for a managed service identity. A first token request, for a secret, is generated at a managed service. The secret supports authenticating the managed service for performing operations in a distributed computing environment. The first token request includes an identity identifier of the managed service. The first token request is communicated to a credentials manager which is associated with a secrets management service (“SMS”) that can be utilized to store, renew and distribute secrets in the distributed computing environment. Based on communicating the first token request to credentials manager, the token is received, via the credentials manager, from the secret token service. The token is received based in part on the credentials manager generating a second token request for the token and communicating the second token request and a secret associated with the managed service to the secret token service.

20150249702, Sep 3, 2015

May 18, 2015

14/715348

- Redmond WA, US
Aaron Matthew Tyler - Kirkland WA, US
Chandan Rama Reddy - Redmond WA, US
Manoj Krishna Ghosh - Kirkland WA, US
Alaa H. Abdelhalim - Seattle WA, US
Roger D. Seielstad - Redmond WA, US
Peter A. Gurevich - Woodinville WA, US

H04L 29/08
H04L 12/807
H04L 29/06

Described herein are various principles for operating transfer protocols using adaptive flow control techniques. In accordance with some of these principles, a client may adaptively negotiate with a server regarding a window size to use when communicating datagrams using a connectionless content unit transfer protocol like the Trivial File Transfer Protocol (TFTP). In some implementations, a client may inform a server whether to increase or decrease a window size. In these implementations, the client may increase the window size upon determining that a previous window size has led to successful transfer of content without any loss of datagrams and the client may decrease the window size upon detecting a loss of a datagram. Because of the limited resources available in some environments in which these techniques may be used, in some implementations a window size may be increased by small amounts but may be decreased drastically upon detecting a loss.