Patents by Inventor Thomas Karagiannis
Thomas Karagiannis 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).
-
Publication number: 20150342903Abstract: Compositions comprising hydroxytyrosol-containing formulations and treatment regiments comprising hydroxytyrosol and/or oleuropein and chemotherapeutic agents are disclosed. Compositions and/or regiments may optionally include the administration of vitamins, minerals, and anti-oxidants. Methods for using these compositions and treatment regimens for treating subjects for diseases, such as a malignancy, and for inducing or enhancing angiogenesis, treating or preventing oxidative stress, for treating or preventing high glucose-induced dysfunction, treating or preventing chemotherapy-induced dysfunction, and for improving cell viability are provided. Various methods for use of the hydroxytyrosol compositions for inhibition of lysine specific demethylase 1 (LSD1) in various cancers are also provided.Type: ApplicationFiled: August 11, 2015Publication date: December 3, 2015Inventors: Darlene E. McCord, Thomas Karagiannis
-
Publication number: 20150288609Abstract: A deadline-aware network protocol is described. In an example, data transfer at a transport layer entity of a packet-based communication network is controlled by receiving a request for network resources for a data flow from a network element and allocating network resources to the data flow. The data flow comprises a number of data packets associated with an application, and the request comprises a factor relating to a time deadline associated with the application. The network resources allocated depend on the factor relating to the time deadline. In examples, the network resource can be a bandwidth or data rate allocated to the data flow, and the factor can be a data rate sufficient to complete the data flow within the time deadline. In examples, the network resources are allocated greedily, such that requests are fully satisfied whenever possible, and the network resources are fully utilized.Type: ApplicationFiled: June 22, 2015Publication date: October 8, 2015Inventors: Hitesh Ballani, Thomas Karagiannis, Antony Rowstron, Christopher Wilson
-
Patent number: 9144555Abstract: Compositions comprising hydroxytyrosol-containing formulations and treatment regiments comprising hydroxytyrosol and/or oleuropein and chemotherapeutic agents are disclosed. Compositions and/or regiments may optionally include the administration of vitamins, minerals, and anti-oxidants. Methods for using these compositions and treatment regimens for treating subjects for diseases, such as a malignancy, and for inducing or enhancing angiogenesis, treating or preventing oxidative stress, for treating or preventing high glucose-induced dysfunction, treating or preventing chemotherapy-induced dysfunction, and for improving cell viability are provided. Various methods for use of the hydroxytyrosol compositions for inhibition of lysine specific demethylase 1 (LSD1) in various cancers are also provided.Type: GrantFiled: November 27, 2013Date of Patent: September 29, 2015Inventors: Darlene E. McCord, Thomas Karagiannis
-
Patent number: 9077670Abstract: A deadline-aware network protocol is described. In an example, data transfer at a transport layer entity of a packet-based communication network is controlled by receiving a request for network resources for a data flow from a network element and allocating network resources to the data flow. The data flow comprises a number of data packets associated with an application, and the request comprises a factor relating to a time deadline associated with the application. The network resources allocated depend on the factor relating to the time deadline. In examples, the network resource can be a bandwidth or data rate allocated to the data flow, and the factor can be a data rate sufficient to complete the data flow within the time deadline. In examples, the network resources are allocated greedily, such that requests are fully satisfied whenever possible, and the network resources are fully utilized.Type: GrantFiled: December 15, 2010Date of Patent: July 7, 2015Assignee: Microsoft CorporationInventors: Hitesh Ballani, Thomas Karagiannis, Antony Rowstron, Christopher Wilson
-
Publication number: 20150081948Abstract: Controlling data storage input/output requests is described, for example, to apply a policy to an end-to-end flow of data input/output requests between at least one computing entity and at least one store. In various examples a plurality of queues are configured at one or more stages of the end-to-end flow and controlled to adhere to a policy. In examples, each stage has a control interface enabling it to receive and execute control instructions from a controller which may be centralized or distributed. For example, the control instructions comprise queuing rules and/or queue configurations. In various examples queues and queuing rules are dynamically created and revised according to feedback about any of: flow behavior, changes in policy, changes in infrastructure or other factors. In examples, high level identifiers of the flow endpoints are resolved, on a per stage basis, to low level identifiers suitable for use by the stage.Type: ApplicationFiled: September 13, 2013Publication date: March 19, 2015Applicant: Microsoft CorporationInventors: Eno Thereska, Hitesh Ballani, Gregory O'Shea, Thomas Karagiannis, Antony Ian Taylor Rowstron, Thomas M Talpey, Richard John Black
-
Patent number: 8886731Abstract: A decentralized relaying algorithm for mobile devices is described. In an embodiment, a mobile device acts as a relay within a network of mobile devices and on contact with a source device downloads messages from the source according to a locally stored relaying probability for each channel of information within the network. These messages are subsequently downloaded to another device which is the end user of the message. Where the relay does not download the message from the source as a result of the decision made based on the relaying probability, a virtual message is downloaded which comprises metadata only and not the payload of the message. The relay updates the stored relaying probabilities for each channel based on locally observable information which includes feedback received from mobile devices to which the relay has downloaded messages. The feedback identifies unique paths for the payload of messages through the network.Type: GrantFiled: June 1, 2011Date of Patent: November 11, 2014Assignee: Microsoft CorporationInventors: Dinan Gunawardena, Thomas Karagiannis, Alexandre Proutiere, Milan Vojnovic
-
Publication number: 20140330937Abstract: Methods of classifying a storage traffic stream in a shared storage network are described. In an embodiment, an identifier for the entity generating the stream is generated, where this entity may, for example, indicate a virtual machine, program, session, physical machine, user or process. The identifier is then shared with at least one processing layer along a path of the storage traffic stream between the generating entity and the storage device which stores the file to which the traffic stream relates. In various embodiments, the identifier may then be used by any processing layers which receive it, to selectively handle traffic streams based on the generating entity. The identifier may be shared when the traffic stream is created or subsequently and in various embodiments, the identifier is shared in a second exchange of messages, following the creation of the traffic stream and prior to any other traffic.Type: ApplicationFiled: May 3, 2013Publication date: November 6, 2014Inventors: Gregory O'Shea, Thomas M. Talpey, David Matthew Kruse, Eno Thereska, Hitesh Ballani, Thomas Karagiannis, Antony Ian Taylor Rowstron, Richard John Black
-
Patent number: 8819236Abstract: Resource optimization for online services is described. In one example, objects (such as mailboxes or other data associated with an online service) are assigned to network elements (such as servers) by inferring a relationship graph from log data relating to usage of the online service. The graph has a node for each object, and connections between each pair of objects having data items in common. Each connection has a weight relating to the number of common data items. The graph is partitioned into a set of clusters, such that each cluster has nodes joined by connections with a high weight relative to the weight of connections between nodes in different clusters. The objects are then distributed to the network elements such that objects corresponding to nodes in the same cluster are located on the same network element.Type: GrantFiled: December 16, 2010Date of Patent: August 26, 2014Assignee: Microsoft CorporationInventors: Christos Gkantsidis, Thomas Karagiannis, Dushyanth Narayanan, Antony Rowstron
-
Publication number: 20140157274Abstract: Methods of offering network performance guarantees in multi-tenant datacenters are described. In an embodiment, a request for resources received at a datacenter from a tenant comprises a number of virtual machines and a performance requirement, such as a bandwidth requirement, specified by the tenant. A network manager within the datacenter maps the request onto the datacenter topology and allocates virtual machines within the datacenter based on the available slots for virtual machines within the topology and such that the performance requirement is satisfied. Following allocation, stored residual capacity values for elements within the topology are updated according to the new allocation and this updated stored data is used in mapping subsequent requests onto the datacenter. The allocated virtual machines form part of a virtual network within the datacenter which is allocated in response to the request and two virtual network abstractions are described: virtual clusters and virtual oversubscribed clusters.Type: ApplicationFiled: February 10, 2014Publication date: June 5, 2014Applicant: Microsoft CorporationInventors: Hitesh Ballani, Paolo Costa, Thomas Karagiannis, Antony Rowstron
-
Publication number: 20140155339Abstract: Compositions comprising hydroxytyrosol-containing formulations and treatment regiments comprising hydroxytyrosol and/or oleuropein and chemotherapeutic agents are disclosed. Compositions and/or regiments may optionally include the administration of vitamins, minerals, and anti-oxidants. Methods for using these compositions and treatment regimens for treating subjects for diseases, such as a malignancy, and for inducing or enhancing angiogenesis, treating or preventing oxidative stress, for treating or preventing high glucose-induced dysfunction, treating or preventing chemotherapy-induced dysfunction, and for improving cell viability are provided. Various methods for use of the hydroxytyrosol compositions for inhibition of lysine specific demethylase 1 (LSD1) in various cancers are also provided.Type: ApplicationFiled: November 27, 2013Publication date: June 5, 2014Inventors: Darlene E. McCord, Thomas Karagiannis
-
Patent number: 8671407Abstract: Methods of offering network performance guarantees in multi-tenant datacenters are described. In an embodiment, a request for resources received at a datacenter from a tenant comprises a number of virtual machines and a performance requirement, such as a bandwidth requirement, specified by the tenant. A network manager within the datacenter maps the request onto the datacenter topology and allocates virtual machines within the datacenter based on the available slots for virtual machines within the topology and such that the performance requirement is satisfied. Following allocation, stored residual capacity values for elements within the topology are updated according to the new allocation and this updated stored data is used in mapping subsequent requests onto the datacenter. The allocated virtual machines form part of a virtual network within the datacenter which is allocated in response to the request and two virtual network abstractions are described: virtual clusters and virtual oversubscribed clusters.Type: GrantFiled: July 6, 2011Date of Patent: March 11, 2014Assignee: Microsoft CorporationInventors: Hitesh Ballani, Paolo Costa, Thomas Karagiannis, Antony Rowstron
-
Publication number: 20130219068Abstract: Methods of predicting datacenter performance to improve provisioning are described. In an embodiment, a resource manager element receives a request from a tenant which describes an application that the tenant wants executed by a multi-resource, multi-tenant datacenter. The request that has been received is mapped to a set of different candidate resource combinations within the datacenter, where each candidate resource combination can be used to execute the application in a manner which satisfies a high level constraint specified within the request. This mapping may, for example, be performed using a combination of benchmarking and an analytical model. In some examples, each resource combination may comprise a number of virtual machines and a bandwidth between those machines. Data relating to at least a subset (and in some examples, two or more) of the candidate resource combinations is then presented to the tenant.Type: ApplicationFiled: February 21, 2012Publication date: August 22, 2013Applicant: MICROSOFT CORPORATIONInventors: Hitesh Ballani, Thomas Karagiannis, Antony Rowstron, Paolo Costa, Virajith Jalaparti
-
Publication number: 20130014101Abstract: Methods of offering network performance guarantees in multi-tenant datacenters are described. In an embodiment, a request for resources received at a datacenter from a tenant comprises a number of virtual machines and a performance requirement, such as a bandwidth requirement, specified by the tenant. A network manager within the datacenter maps the request onto the datacenter topology and allocates virtual machines within the datacenter based on the available slots for virtual machines within the topology and such that the performance requirement is satisfied. Following allocation, stored residual capacity values for elements within the topology are updated according to the new allocation and this updated stored data is used in mapping subsequent requests onto the datacenter. The allocated virtual machines form part of a virtual network within the datacenter which is allocated in response to the request and two virtual network abstractions are described: virtual clusters and virtual oversubscribed clusters.Type: ApplicationFiled: July 6, 2011Publication date: January 10, 2013Applicant: Microsoft CorporationInventors: Hitesh Ballani, Paolo Costa, Thomas Karagiannis, Antony Rowstron
-
Patent number: 8351331Abstract: A resource allocation framework for wireless/wired networks is described. In an embodiment, methods of end host based traffic management are described which operate separately from the underlying access control protocol within the network (e.g. wireless MAC protocol or TCP). The rate limits for each flow are set based on per-flow weights, which may be user specified, and based on an estimate of the utilization of the shared resource and the rate limits are adjusted periodically so that the resource is not underutilized or saturated. Some embodiments compute a virtual capacity of the resource which is adjusted to optimize the value of the utilization and then the virtual capacity is shared between flows according to the per-flow weights. Methods for estimating the utilization of a wireless network and the capacity of a broadband access link are also described.Type: GrantFiled: June 22, 2010Date of Patent: January 8, 2013Assignee: Microsoft CorporationInventors: Thomas Karagiannis, Christos Gkantsidis, Peter Bernard Key, Richard Harper, Abigail Sellen, Timothy Regan, Richard M. Banks, Ilias Raftopoulos, Dharmaiah Manjunath, Bozidar Radunovic
-
Publication number: 20120309358Abstract: A decentralized relaying algorithm for mobile devices is described. In an embodiment, a mobile device acts as a relay within a network of mobile devices and on contact with a source device downloads messages from the source according to a locally stored relaying probability for each channel of information within the network. These messages are subsequently downloaded to another device which is the end user of the message. Where the relay does not download the message from the source as a result of the decision made based on the relaying probability, a virtual message is downloaded which comprises metadata only and not the payload of the message. The relay updates the stored relaying probabilities for each channel based on locally observable information which includes feedback received from mobile devices to which the relay has downloaded messages. The feedback identifies unique paths for the payload of messages through the network.Type: ApplicationFiled: June 1, 2011Publication date: December 6, 2012Applicant: Microsoft CorporationInventors: Dinan Gunawardena, Thomas Karagiannis, Alexandre Proutiere, Milan Vojnovic
-
Publication number: 20120158858Abstract: Resource optimization for online services is described. In one example, objects (such as mailboxes or other data associated with an online service) are assigned to network elements (such as servers) by inferring a relationship graph from log data relating to usage of the online service. The graph has a node for each object, and connections between each pair of objects having data items in common. Each connection has a weight relating to the number of common data items. The graph is partitioned into a set of clusters, such that each cluster has nodes joined by connections with a high weight relative to the weight of connections between nodes in different clusters. The objects are then distributed to the network elements such that objects corresponding to nodes in the same cluster are located on the same network element.Type: ApplicationFiled: December 16, 2010Publication date: June 21, 2012Applicant: Microsoft CorporationInventors: Christos Gkantsidis, Thomas Karagiannis, Dushyanth Narayanan, Antony Rowstron
-
Publication number: 20120155265Abstract: A deadline-aware network protocol is described. In an example, data transfer at a transport layer entity of a packet-based communication network is controlled by receiving a request for network resources for a data flow from a network element and allocating network resources to the data flow. The data flow comprises a number of data packets associated with an application, and the request comprises a factor relating to a time deadline associated with the application. The network resources allocated depend on the factor relating to the time deadline. In examples, the network resource can be a bandwidth or data rate allocated to the data flow, and the factor can be a data rate sufficient to complete the data flow within the time deadline. In examples, the network resources are allocated greedily, such that requests are fully satisfied whenever possible, and the network resources are fully utilized.Type: ApplicationFiled: December 15, 2010Publication date: June 21, 2012Applicant: Microsoft CorporationInventors: Hitesh Ballani, Thomas Karagiannis, Antony Rowstron, Christopher Wilson
-
Patent number: 8189489Abstract: A service for facilitating a determination of path quality between a first endpoint node and a second endpoint node in a network of nodes is provided. Path quality information is aggregated from across network internet service providers (ISPs), giving authorized endpoints access to path quality information for specified path segments of a path to another endpoint. Path quality information includes one or more metrics that measure available bandwidth, loss rate and/or latency.Type: GrantFiled: September 26, 2007Date of Patent: May 29, 2012Assignee: Microsoft CorporationInventors: Ming Zhang, Peter Bernard Key, Sandeep Kishan Singhal, Guobin Shen, Ayalvadi Jagannathan Ganesh, Thomas Karagiannis
-
Publication number: 20110310735Abstract: A resource allocation framework for wireless/wired networks is described. In an embodiment, methods of end host based traffic management are described which operate separately from the underlying access control protocol within the network (e.g. wireless MAC protocol or TCP). The rate limits for each flow are set based on per-flow weights, which may be user specified, and based on an estimate of the utilization of the shared resource and the rate limits are adjusted periodically so that the resource is not underutilized or saturated. Some embodiments compute a virtual capacity of the resource which is adjusted to optimize the value of the utilization and then the virtual capacity is shared between flows according to the per-flow weights. Methods for estimating the utilization of a wireless network and the capacity of a broadband access link are also described.Type: ApplicationFiled: June 22, 2010Publication date: December 22, 2011Applicant: Microsoft CorporationInventors: Thomas Karagiannis, Christos Gkantsidis, Peter Bernard Key, Richard Harper, Abigail Sellen, Timothy Regan, Richard M. Banks, Ilias Raftopoulos, Dharmaiah Manjunath, Bozidar Radunovic
-
Patent number: 8081581Abstract: Sampling rules for information dissemination are described which may be applied in a system containing a number of nodes arranged into groups. A target address is selected using one of two methods: selection of an address from the entire address space of the system and selection of an address from a part of the address space which corresponds to set of groups of nodes. The set of groups of nodes is updated when information is successfully disseminated to a node at a target address selected using the first of the two methods. Rules to determine which of the two methods are used for any particular selection operation are also described.Type: GrantFiled: January 30, 2008Date of Patent: December 20, 2011Assignee: Microsoft CorporationInventors: Milan Vojnovic, Varun Gupta, Thomas Karagiannis, Christos Gkantsidis