Patents by Inventor Dan Teodosiu
Dan Teodosiu 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: 20050265367Abstract: Peer devices register with a resource locator service so that the peer devices can be uniquely identified in a networking environment. An addressing scheme addresses a peer resource in the networking environment based on the unique identifier of a peer device that is a master publisher of the resource. Based on the addressing scheme, the resource locator service can track the location of the master publisher of the resource as well as additional locations of peer devices that have cached the resource and made it available. In various embodiments, the resource locator service can service requests for peer resources by providing a list of locations where the resource is expected to be available or, in the case of non-compatible requester, provide access to the resource itself.Type: ApplicationFiled: July 22, 2005Publication date: December 1, 2005Applicant: Microsoft CorporationInventors: Dan Teodosiu, Nikolaj Bjorner, Markus Breunig
-
Publication number: 20050262167Abstract: The present invention is used to update objects over limited bandwidth networks. Objects are updated between two or more computing devices using remote differential compression (RDC) techniques such that required data transfers are minimized. In one aspect, efficient large object transfers are achieved by recursively applying the RDC algorithm to its own metadata; a single or multiple recursion step(s) may be used in this case to reduce the amount of metadata sent over the network by the RDC algorithm. Objects and/or signature and chunk length lists can be chunked by locating boundaries at dynamically determined locations. A mathematical function evaluates hash values associated within a horizon window relative to potential chunk boundary.Type: ApplicationFiled: May 13, 2004Publication date: November 24, 2005Applicant: Microsoft CorporationInventors: Dan Teodosiu, Nikolaj Bjorner, Yuri Gurevich, Patrick Bozeman
-
Publication number: 20050256974Abstract: The present invention is used to update objects over limited bandwidth networks. Objects are updated between two or more computing devices using remote differential compression (RDC) techniques such that required data transfers are minimized. In one aspect, efficient large object transfers are achieved by recursively applying the RDC algorithm to its own metadata; a single or multiple recursion step(s) may be used in this case to reduce the amount of metadata sent over the network by the RDC algorithm. Objects and/or signature and chunk length lists can be chunked by locating boundaries at dynamically determined locations. A mathematical function evaluates hash values associated within a horizon window relative to potential chunk boundary.Type: ApplicationFiled: May 13, 2004Publication date: November 17, 2005Applicant: Microsoft CorporationInventors: Dan Teodosiu, Nikolaj Bjorner, Yuri Gurevich, Patrick Bozeman
-
Publication number: 20050246487Abstract: In order to provide a more efficient persistent storage device, one or more long-term storage media are included along with a non-volatile memory. In one embodiment, one portion of the non-volatile memory is used as a write buffer and a read cache for writes and reads to the long-term storage media. Interfaces are provided for controlling the use of the non-volatile memory as a write buffer and a read cache. Additionally, a portion of the non-volatile memory is used to provide a direct mapping for specified sectors of the long-term storage media. Descriptive data regarding the persistent storage device is stored in another portion of the non-volatile memory.Type: ApplicationFiled: May 3, 2004Publication date: November 3, 2005Applicant: Microsoft CorporationInventors: Cenk Ergan, Clark Nicholson, Dan Teodosiu, Dean DeWhitt, Emily Hill, Hanumantha Kodavalla, Michael Zwilling, John Parchem, Michael Fortin, Nathan Obr, Rajeev Nagar, Surenda Verma, Therron Powell, William Westerinen, Mark Zbikowski, Patrick Stemen
-
Publication number: 20050235043Abstract: A method and system are related to updating objects over limited bandwidth networks. Objects are updated between two or more computing devices using remote differential compression (RDC) techniques such that required data transfers are minimized. In one aspect, efficient large object transfers are achieved by recursively applying the RDC algorithm to its own metadata; a single or multiple recursion step(s) may be used in this case to reduce the amount of metadata sent over the network by the RDC algorithm. Objects and/or signature and chunk length lists can be chunked by locating boundaries at dynamically determined locations. A mathematical function evaluates hash values associated within a horizon window relative to potential chunk boundary.Type: ApplicationFiled: April 15, 2004Publication date: October 20, 2005Applicant: Microsoft CorporationInventors: Dan Teodosiu, Nikolaj Bjorner, Yuri Gurevich, Patrick Bozeman
-
Publication number: 20050195838Abstract: Peer devices register with a resource locator service so that the peer devices can be uniquely identified in a networking environment. An addressing scheme addresses a peer resource in the networking environment based on the unique identifier of a peer device that is a master publisher of the resource. Based on the addressing scheme, the resource locator service can track the location of the master publisher of the resource as well as additional locations of peer devices that have cached the resource and made it available. In various embodiments, the resource locator service can service requests for peer resources by providing a list of locations where the resource is expected to be available or, in the case of non-compatible requester, provide access to the resource itself.Type: ApplicationFiled: February 25, 2005Publication date: September 8, 2005Applicant: Microsoft CorporationInventors: Dan Teodosiu, Nikolaj Bjorner, Markus Breunig
-
Publication number: 20050195839Abstract: Peer devices register with a resource locator service so that the peer devices can be uniquely identified in a networking environment. An addressing scheme addresses a peer resource in the networking environment based on the unique identifier of a peer device that is a master publisher of the resource. Based on the addressing scheme, the resource locator service can track the location of the master publisher of the resource as well as additional locations of peer devices that have cached the resource and made it available. In various embodiments, the resource locator service can service requests for peer resources by providing a list of locations where the resource is expected to be available or, in the case of non-compatible requester, provide access to the resource itself.Type: ApplicationFiled: February 25, 2005Publication date: September 8, 2005Applicant: Microsoft CorporationInventors: Dan Teodosiu, Nikolaj Bjorner, Markus Breunig
-
Publication number: 20050198388Abstract: Binary executables are distributed in a distributed manner by equipping a server with a bootstrap program. The server provides the bootstrap program to a client computer in response to the client's request for the binary executables. The bootstrap program is designed to enable the client computer to obtain the binary executables in one or more portions from one or more peer locations that have already downloaded the said binary executables. In one embodiment, the bootstrap program also monitors the performance associated with obtaining the portions of the binary executables, and reports the performance data to a resource naming service that tracks peer locations that cache the binary executables. In one embodiment, the binary executables also includes a component that registers the client computer as a peer location that caches the binary executables, and provides the binary executables to other client computers responsive to their requests. In various embodiments, content is distributed in like manner.Type: ApplicationFiled: April 21, 2005Publication date: September 8, 2005Applicant: Microsoft CorporationInventors: Dan Teodosiu, Xavier Boyen
-
Publication number: 20050198296Abstract: Binary executables are distributed in a distributed manner by equipping a server with a bootstrap program. The server provides the bootstrap program to a client computer in response to the client's request for the binary executables. The bootstrap program is designed to enable the client computer to obtain the binary executables in one or more portions from one or more peer locations that have already downloaded the said binary executables. In one embodiment, the bootstrap program also monitors the performance associated with obtaining the portions of the binary executables, and reports the performance data to a resource naming service that tracks peer locations that cache the binary executables. In one embodiment, the binary executables also includes a component that registers the client computer as a peer location that caches the binary executables, and provides the binary executables to other client computers responsive to their requests. In various embodiments, content is distributed in like manner.Type: ApplicationFiled: April 21, 2005Publication date: September 8, 2005Applicant: Microsoft CorporationInventors: Dan Teodosiu, Xavier Boyen
-
Publication number: 20050198109Abstract: A resource naming service (RNS) server receives peer resource requests from peer platforms through a networking environment. The RNS server, possibly in cooperation with other RNS servers and peer registrars generates a response to the request to enable the peer platforms to access the requested peer resources. In one embodiment, a response includes a list of locations of peer devices in the networking environment where a resource is expected to be available. A requesting device can then choose to access the resource from one or more of the listed peer locations.Type: ApplicationFiled: February 11, 2005Publication date: September 8, 2005Applicant: Microsoft CorporationInventors: Dan Teodosiu, Nikolaj Bjorner, Markus Breunig
-
Publication number: 20050147044Abstract: A resource naming service (RNS) server receives peer resource requests from peer platforms through a networking environment. The RNS server, possibly in cooperation with other RNS servers and peer registrars generates a response to the request to enable the peer platforms to access the requested peer resources. In one embodiment, a response includes a list of locations of peer devices in the networking environment where a resource is expected to be available. A requesting device can then choose to access the resource from one or more of the listed peer locations.Type: ApplicationFiled: February 14, 2005Publication date: July 7, 2005Applicant: Microsoft CorporationInventors: Dan Teodosiu, Nikolaj Bjorner, Markus Breunig
-
Publication number: 20050141532Abstract: Peer devices register with a resource locator service so that the peer devices can be uniquely identified in a networking environment. An addressing scheme addresses a peer resource in the networking environment based on the unique identifier of a peer device that is a master publisher of the resource. Based on the addressing scheme, the resource locator service can track the location of the master publisher of the resource as well as additional locations of peer devices that have cached the resource and made it available. In various embodiments, the resource locator service can service requests for peer resources by providing a list of locations where the resource is expected to be available or, in the case of non-compatible requester, provide access to the resource itself.Type: ApplicationFiled: February 25, 2005Publication date: June 30, 2005Applicant: Microsoft CorporationInventors: Dan Teodosiu, Nikolaj Bjorner, Markus Breunig
-
Publication number: 20050015413Abstract: A method and system for controlling which content gets precedence and is replicated. A replica set is comprised of a set of resources. Each resource is associated with resource data and resource meta-data. For files-based systems, resource data includes file contents and attributes, while resource meta-data includes additional attributes that are relevant for negotiating synchronization during replication. An extra field called a “fence value” is added to the meta-data associated with each resource. During synchronization, first fence values are compared. The resource with the highest fence value includes the content that is controlling and replicated. If fence values are equal (and greater than a particular value), the controlling resource is determined based on other meta-data.Type: ApplicationFiled: December 10, 2003Publication date: January 20, 2005Inventors: Dan Teodosiu, Nikolaj Bjorner
-
Publication number: 20040243646Abstract: An improved system and method for transparent storage reorganization is provided. A reorganization server may be used to consolidate storage from many servers to fewer servers or to distribute storage from a few servers to many servers. To do so, a legacy server name may be aliased to the network address of a reorganization server. The contents and permissions of each legacy share may then be copied to a unique share name on another server. A root may next be created on the reorganization server using the legacy server name, and a link that points to the legacy share copied on the other server may be created on that root. Any client may then request access to the relocated legacy share using the legacy share name.Type: ApplicationFiled: February 5, 2004Publication date: December 2, 2004Applicant: MICROSOFT CORPORATIONInventors: Dan Teodosiu, Brian K. Dewey, Andrew M. Herron
-
Publication number: 20040177100Abstract: A method and system for synchronizing objects among members of a replica set. Objects on members of the replica set are quickly synchronized via a join algorithm that takes advantage of version vectors. When an object is deleted, the object is tombstoned (i.e., marked as “dead”). Tombstones are also replicated between the connected members of the replica set. After a period of time (e.g., a timeout), the tombstones are deleted. A slow sync algorithm executes periodically to ensure that objects that were not deleted via replicated tombstones are eventually deleted. An époque algorithm provides that members that have been offline for a long period of time will update their objects before they participate in a join synchronization.Type: ApplicationFiled: February 13, 2004Publication date: September 9, 2004Applicant: MICROSOFT CORPORATIONInventors: Nikolaj S. Bjorner, Dan Teodosiu, Rostislav Yavorskiy
-
Publication number: 20040123104Abstract: Published resources are made available in an encrypted form, using corresponding resource keys, published through resource key files, with the publications effectively restricted to authorized peer systems only by encrypting the resource keys in a manner only the authorized peer systems are able to recover them. In one embodiment, the resource keys are encrypted using encryption public keys of the authorized peer systems or the groups to which the authorized peer system are members. In one embodiment, the encryption public keys of individual or groups of authorized peer systems are published for resource publishing peer systems through client and group key files respectively. Group encryption private keys are made available to the group members through published group key files. Further, advanced features including but not limited to resource key file inheritance, password protected publication, obfuscated publication, content signing, secured access via gateways, and secured resource search are supported.Type: ApplicationFiled: September 26, 2003Publication date: June 24, 2004Inventors: Xavier Boyen, Zhenyu Qian, Dan Teodosiu
-
Publication number: 20020143918Abstract: Internet Protocol (IP) address assignment information is collected from Address Allocation Tables (AATs) of a plurality of IP address assigning registrars. The information is processed and stored into one or more data structures. The information is accessed to determine a proximity measure for any two given IP addresses. In one embodiment, the proximity determination includes the determination of superblock memberships of the IP addresses, comparison of the assigning registrars, as well as the location countries of the IP addresses. In one embodiment, the proximity detection is applied to locating IP addresses of peer providers of a resource. In one embodiment, Autonomous System (AS) numbers and IP addresses for a plurality of peer providers for a plurality of resources are also collected and organized into one or more data structures; this organized information of the peer providers is also used in locating the closest peer providers of a resource in terms of network topology.Type: ApplicationFiled: July 18, 2001Publication date: October 3, 2002Inventors: L. Roger Soles, Xavier Boyen, Dan Teodosiu
-
Publication number: 20020107982Abstract: Peer devices register with a resource locator service so that the peer devices can be uniquely identified in a networking environment. An addressing scheme addresses a peer resource in the networking environment based on the unique identifier of a peer device that is a master publisher of the resource. Based on the addressing scheme, the resource locator service can track the location of the master publisher of the resource as well as additional locations of peer devices that have cached the resource and made it available. In various embodiments, the resource locator service can service requests for peer resources by providing a list of locations where the resource is expected to be available or, in the case of non-compatible requester, provide access to the resource itself.Type: ApplicationFiled: September 13, 2001Publication date: August 8, 2002Inventors: Dan Teodosiu, Nikolaj S. Bjorner, Markus M. Breunig
-
Publication number: 20020062375Abstract: A resource naming service (RNS) server receives peer resource requests from peer platforms through a networking environment. The RNS server, possibly in cooperation with other RNS servers and peer registrars generates a response to the request to enable the peer platforms to access the requested peer resources. In one embodiment, a response includes a list of locations of peer devices in the networking environment where a resource is expected to be available. A requesting device can then choose to access the resource from one or more of the listed peer locations.Type: ApplicationFiled: September 13, 2001Publication date: May 23, 2002Inventors: Dan Teodosiu, Nikolaj S. Bjorner, Markus M. Breunig
-
Publication number: 20020062336Abstract: A resource tracking service tracks locations of peer resources among peer devices in a networking environment. As a peer resource is cached and made available at multiple peer devices, the locator service also tracks state information for each copy of the resources and, in various embodiments, maintains coherency among the copies as the resource is modified and/or deleted.Type: ApplicationFiled: September 13, 2001Publication date: May 23, 2002Inventors: Dan Teodosiu, Nikolaj S. Bjorner, Markus M. Breunig