Patents by Inventor Mansoor Mohsin
Mansoor Mohsin 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).
-
Patent number: 10069941Abstract: Embodiments are directed to a cluster of nodes configured to run one or more services. A gateway on each node is configured to provide communication between the node and clients. The gateways manage filters designated by the clients, wherein the filters are named based upon a naming format used to name the services. The gateways receive configuration updates broadcast by a failover manager. The configuration updates comprise service endpoint changes for services running on the nodes. The gateways provide notifications to clients when a filter name matches at least a portion of a service name in a configuration update. The configuration updates identify a configuration version, and the gateways may provide notifications with endpoint information from more than one configuration update version. Notifications may be configured to be sent only when the endpoint for a primary replica of a service has changed.Type: GrantFiled: September 23, 2015Date of Patent: September 4, 2018Assignee: MICROSOFT TECHNOLOGY LICENSING, LLCInventors: Alex Wun, Vipul A. Modi, Lu Xun, Mansoor Mohsin
-
Publication number: 20160323138Abstract: Embodiments are directed to a cluster of nodes configured to run one or more services. A gateway on each node is configured to provide communication between the node and clients. The gateways manage filters designated by the clients, wherein the filters are named based upon a naming format used to name the services. The gateways receive configuration updates broadcast by a failover manager. The configuration updates comprise service endpoint changes for services running on the nodes. The gateways provide notifications to clients when a filter name matches at least a portion of a service name in a configuration update. The configuration updates identify a configuration version, and the gateways may provide notifications with endpoint information from more than one configuration update version. Notifications may be configured to be sent only when the endpoint for a primary replica of a service has changed.Type: ApplicationFiled: September 23, 2015Publication date: November 3, 2016Applicant: MICROSOFT TECHNOLOGY LICENSING, LLC.Inventors: Alex Wun, Vipul A. Modi, Lu Xun, Mansoor Mohsin
-
Patent number: 9385884Abstract: Obtaining tight knowledge about nodes in a federated ring structure. The tight knowledge includes information about neighbors of a given node. The method includes at a given node, sending a join request, requesting to join a federated ring in a distributed computing environment. The method further includes, at the given node, receiving a join reply. The join reply provides an initial view of at least a portion of a neighborhood of the given node. The neighborhood is a set of nodes logically proximate the given node. The method further includes, at the given node, sending a lock request to nodes in the neighborhood to request that the other nodes in the given node's neighborhood are locked so as to not have overlapping nodes joining the given node's neighborhood simultaneously.Type: GrantFiled: September 28, 2012Date of Patent: July 5, 2016Assignee: Microsoft Technology Licensing, LLCInventors: Lu Xun, Rishi Rakesh Sinha, Mansoor Mohsin
-
Publication number: 20140092773Abstract: Obtaining tight knowledge about nodes in a federated ring structure. The tight knowledge includes information about neighbors of a given node. The method includes at a given node, sending a join request, requesting to join a federated ring in a distributed computing environment. The method further includes, at the given node, receiving a join reply. The join reply provides an initial view of at least a portion of a neighborhood of the given node. The neighborhood is a set of nodes logically proximate the given node. The method further includes, at the given node, sending a lock request to nodes in the neighborhood to request that the other nodes in the given node's neighborhood are locked so as to not have overlapping nodes joining the given node's neighborhood simultaneously.Type: ApplicationFiled: September 28, 2012Publication date: April 3, 2014Applicant: MICROSOFT CORPORATIONInventors: Lu Xun, Rishi Rakesh Sinha, Mansoor Mohsin
-
Patent number: 8176200Abstract: The present invention extends to methods, systems, and computer program products for distributed aggregation on an overlay network. Embodiments of the invention utilize tiers of nodes that are cascaded in a layered system. Each tier reduces the size of data by orders of magnitude through pre-aggregation. Thus, high volume streams of messages can be reduced to lower volume streams at large scales, such as, for example, the Internet. No central coordination is used; thus there is no central point of failure or bottleneck. When a node fails, other nodes in the same tier as the failing node automatically take over the responsibilities of the failed node.Type: GrantFiled: April 21, 2009Date of Patent: May 8, 2012Assignee: Microsoft CorporationInventors: Gueorgui Chkodrov, Richard D. Hill, Michael J. Marucheck, Dave Dopson, Mansoor Mohsin
-
Patent number: 8073976Abstract: The present invention extends to methods, systems, and computer program products for synchronizing clocks in an asynchronous distributed system. Embodiments of the invention facilitate creation of a trustable and practical common time (time of day) reference across a set of peer nodes (observers), such as, for example, members within a common asynchronous (distributed) system. A class of pseudo synchronous system can be created via tracking and accumulating worst case relativistic time skews amongst pairs of nodes (observers), without reference to a common master. As such, cooperating nodes can essentially guarantee a lower bound on the time-of-day that one node will observe, given an observation on another node. Accordingly, embodiments of the invention can be applied to provide a consistent (essentially safe) view of the worst case (i.e., greatest variance in) current time across such an asynchronous system—without a common external time-of-day clock entity being used.Type: GrantFiled: March 25, 2009Date of Patent: December 6, 2011Assignee: Microsoft CorporationInventors: Michael J. Marucheck, Richard L. Hasha, Mansoor Mohsin
-
Publication number: 20100268808Abstract: The present invention extends to methods, systems, and computer program products for distributed aggregation on an overlay network. Embodiments of the invention utilize tiers of nodes that are cascaded in a layered system. Each tier reduces the size of data by orders of magnitude through pre-aggregation. Thus, high volume streams of messages can be reduced to lower volume streams at large scales, such as, for example, the Internet. No central coordination is used; thus there is no central point of failure or bottleneck. When a node fails, other nodes in the same tier as the failing node automatically take over the responsibilities of the failed node.Type: ApplicationFiled: April 21, 2009Publication date: October 21, 2010Applicant: Microsoft CorporationInventors: Gueorgui Chkodrov, Richard D. Hill, Michael J. Marucheck, Dave Dopson, Mansoor Mohsin
-
Publication number: 20090248900Abstract: The present invention extends to methods, systems, and computer program products for synchronizing clocks in an asynchronous distributed system. Embodiments of the invention facilitate creation of a trustable and practical common time (time of day) reference across a set of peer nodes (observers), such as, for example, members within a common asynchronous (distributed) system. A class of pseudo synchronous system can be created via tracking and accumulating worst case relativistic time skews amongst pairs of nodes (observers), without reference to a common master. As such, cooperating nodes can essentially guarantee a lower bound on the time-of-day that one node will observe, given an observation on another node. Accordingly, embodiments of the invention can be applied to provide a consistent (essentially safe) view of the worst case (i.e., greatest variance in) current time across such an asynchronous system—without a common external time-of-day clock entity being used.Type: ApplicationFiled: March 25, 2009Publication date: October 1, 2009Applicant: Microsoft CorporationInventors: Michael J. Marucheck, Richard L. Hasha, Mansoor Mohsin