Source: https://patents.google.com/patent/US8688803B2/en
Timestamp: 2019-04-18 11:52:19
Document Index: 190705988

Matched Legal Cases: ['arts 1', 'arts 1', 'Application No. 0326960', 'Application No. 0326960', 'Application No. 2003', 'Application No. 2003']

US8688803B2 - Method for efficient content distribution using a peer-to-peer networking infrastructure - Google Patents
Method for efficient content distribution using a peer-to-peer networking infrastructure Download PDF
US8688803B2
US8688803B2 US10/810,917 US81091704A US8688803B2 US 8688803 B2 US8688803 B2 US 8688803B2 US 81091704 A US81091704 A US 81091704A US 8688803 B2 US8688803 B2 US 8688803B2
US10/810,917
US20050216559A1 (en
2004-03-26 Application filed by Microsoft Corp filed Critical Microsoft Corp
2004-03-26 Priority to US10/810,917 priority Critical patent/US8688803B2/en
2004-03-26 Assigned to MICROSOFT CORPORATION reassignment MICROSOFT CORPORATION ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: MANION, TODD R., RAO, RAVI T., SHAPPELL, MICHAEL
2005-09-29 Publication of US20050216559A1 publication Critical patent/US20050216559A1/en
2014-04-01 Publication of US8688803B2 publication Critical patent/US8688803B2/en
Disclosed is a method for efficiently distributing content by leveraging the use of a peer-to-peer network infrastructure. In a network of peers, a handful peers can receive content from centralized servers. These peers can then flood this content out to more clients who in turn can send the content along to others. Ultimately, a request for content can be fulfilled by locating the closest peer and obtaining the content from that peer. In one embodiment the method can be used to distribute content by creating content distribution groups of one or more client computing devices and redirecting requests for content from the server to the content distribution group. A further contemplated embodiment efficiently streams time sensitive data through the use of a spanning tree architecture of peer-to-peer clients. In yet another embodiment the present invention provides for more efficient use of bandwidth for shared residential broadband connections.
The present invention relates generally to the distribution of content in a computer network and, more particularly, to methods for efficiently distributing content using a peer-to-peer networking infrastructure.
Traditionally, the task of distributing content over a network to a client computing device has been one that is highly server-intensive. In the typical model, the clients will connect to a server to receive content directly from the server on an individual basis. In the case of a large enterprise installation, for instance, this model implies that every client is required to connect to the server to receive data from it making it very difficult for the server to handle such large amounts of simultaneous requests for data.
A server-only content distribution model can also present problems with respect to bandwidth availability. With the advent of affordable and easily maintainable home networking equipment it is becoming more common for several computers in a household, or residential area, to share a single broadband or dial-up connection. A household having five computers, for example, may need to download software (e.g., patches, product upgrades, etc.) from a central server (e.g., windowsupdate.com) to each computer. Since there is a single point of receipt from outside the home network, if all five computers, or even less than all five, are requesting the same content at overlapping times the computers will be splitting the available bandwidth of the connection while receiving the same content.
Not only does a server-based content distribution solution have drawbacks in the enterprise and home settings but also in the internet setting as well. For example, the interconnected nature of the Internet has, among other things, accelerated the spread of computer viruses and worms. Unfortunately, virus cleansing and repair remains a reactionary process whereby the necessary virus definition files are distributed upon identification of the virus “in the wild.” Time is therefore of the essence in distributing the virus definition files to stanch the spread of the virus. When a new virus is first identified, the virus definition distribution servers can become overloaded with requests or could even be made unavailable (e.g., through a denial of service attack or some similar nefarious method) as part of the scheme to propagate the spread of the virus. A solution where the virus definitions are obtained only from a centralized server on the internet fails to safeguard against this eventuality and additionally fails to provide a method whereby the virus definitions can be distributed to the maximum number of computers in the most efficient fashion.
One potential solution to the problems described above is to use a series of redundant content distribution servers that may serve to distribute the load of demand over a number of servers. Such a solution however has several drawbacks. First, server hardware and software, and in particular the type of server hardware and software needed for intensive data delivery tasks, is typically expensive and requires experienced administration resources. Additionally, such a solution only scales in a linear fashion. For example, suppose 1,000 clients are currently receiving their content from a single server. Adding one more content distributing server reduces the average number of clients to a server to 500. Adding a third reduces this number to approximately 333, and so on. Thus a significant number of servers must be added to reduce the number of clients receiving content from a particular server to desired or manageable levels. Finally, a further drawback to this solution is that the content to be distributed and the distribution ability will always remain solely on the servers and hence only available in a limited fashion.
In view of the foregoing, the present invention provides a method for efficiently distributing content by leveraging the use of a peer-to-peer network infrastructure. Peer-to-peer networking provides an infrastructure that enables computing devices to communicate and share information securely with one another without the need of a server or other third party to facilitate the communication. A peer-to-peer networking infrastructure can be effectively employed to improve the efficiency of content distribution and the corresponding scalability. In a network of peers, a handful of the peers can receive content from centralized servers. These peers can then flood this content out to a few more peers who in turn can send the content along to others. Ultimately, this method produces a result whereby a request for content can be fulfilled by locating the closest peer and obtaining the content from that peer.
In one embodiment the above method can be used to distribute content over the Internet or within an enterprise installation by creating content distribution groups of one or more computing devices that are also peers in one or more peer-to-peer networks. Content requests on the server can then be redirected to a content distribution group for distribution to peers to reduce load on the centralized content distribution server.
A further contemplated embodiment efficiently streams time sensitive content through the use of a spanning tree architecture of peer-to-peer clients. On-line meeting materials or webcast concerts or similar time sensitive content can be distributed in a highly efficient manner by geometrically increasing the amount of content distributing computing devices over time.
In yet another embodiment the present invention provides for more efficient use of bandwidth in home networks or shared residential broadband or dial-up connections. In a peer-to-peer content distribution scenario one client computing device can download content over the connection while the other computing devices can simply obtain the content from the peer that downloaded it, thereby eliminating the need for bandwidth to be used by multiple client computing devices in downloading the same content.
FIG. 3 is a schematic diagram showing an exemplary peer-to-peer networking infrastructure architecture;
FIG. 4 is a schematic diagram illustrating the process of a peer node joining a peer-to-peer group;
FIG. 5 is a flowchart illustrating the process of a peer node joining a peer-to-peer group;
FIG. 6 is a schematic diagram showing an exemplary peer-to-peer group;
FIG. 7 is a flowchart illustrating the process of content distribution leveraging a peer-to-peer networking infrastructure;
FIG. 8 is a schematic diagram showing an implementation of content distribution leveraging a peer-to-peer networking infrastructure for a residential network;
FIG. 9 is a schematic diagram showing an implementation of content distribution leveraging a peer-to-peer networking infrastructure for the Internet; and
FIG. 10 is a schematic diagram showing an implementation of content distribution leveraging a peer-to-peer networking infrastructure for an enterprise installation.
Referring to FIG. 1, the present invention relates to communications between network nodes on connected networks. Each of the network nodes resides in a device that may have one of many different computer architectures. For descriptive purposes, FIG. 1 shows a schematic diagram of an exemplary architecture usable for these devices. The architecture portrayed is only one example of a suitable environment and is not intended to suggest any limitation as to the scope of use or functionality of the invention. Neither should the computing devices be interpreted as having any dependency or requirement relating to any one or combination of components illustrated in FIG. 1. The invention is operational with numerous other general-purpose or special-purpose computing or communications environments or configurations. Examples of well known computing systems, environments, and configurations suitable for use with the invention include, but are not limited to, mobile telephones, pocket computers, personal computers, servers, multiprocessor systems, microprocessor-based systems, minicomputers, mainframe computers, and distributed computing environments that include any of the above systems or devices.
II. Server-Based Content Distribution
The present invention is directed to methods for efficiently distributing content over computer networks. Referring to FIG. 2, an exemplary communications network architecture is illustrated. Accompanying a computing device 100 on a local area network (LAN) 120 is a server 200 and a router 202. The router 202 allows the devices on the LAN 120 to communicate over an internetwork 204 to remote computing devices 206. The Internet is one example of an internetwork. In the present example, the server 200 can be a network server which the computing device 100 may access for content distribution over the LAN 120 and the remote computing device can be a remote content distribution server which the computing device may access for content distribution over the Internet 204 or similar wide area network (WAN).
Traditionally, the task of distributing content over a network 120 to a client computing device 100 has been one that is highly server-intensive. In the typical model, the clients 100 will connect to a server 200, 206 to receive content directly from the server 200, 206 on an individual basis. In the case of a large enterprise installation, for instance, this model implies that every client 100 is required to connect to the internal network server 200 to receive content (e.g., data) from it making it very difficult for the server to handle large amounts of simultaneous requests for content. In the case of a home network or similar shared residential broadband or dial-up connectivity scenario, this model implies that every computer 100 sharing the connection 208 is required to connect to the external content server 206 to receive data from it, thereby splitting the available bandwidth of the connection 208 when requests are made by the computing devices 100 at overlapping times. External content servers 206 exposed on the Internet can become overloaded when there is a spike in requests for time sensitive content regardless of whether the requests are originating from inside an enterprise installation or residential gateway. In addition, the server based content distribution model may fail to provide content availability contingency scenarios for periods of server unavailability. Attempts to address the limitations of server-based content distribution have focused on additional server redundancy, however such solutions do not scale well under severe demand and are generally not cost effective.
The present invention leverages the use of a peer-to-peer network infrastructure for efficient content distribution. In the description that follows the invention is described as being implemented over a peer-to-peer network infrastructure such as the Windows® Peer-to-Peer Networking Infrastructure by Microsoft of Redmond, Wash. As will be appreciated by one of ordinary skill in the art, the network infrastructure should be understood to include any network infrastructure possessing the necessary communications and security protocols.
Turning to FIG. 3, an exemplary peer-to-peer architecture is illustrated. The peer-to-peer infrastructure resides primarily between the operating system (OS) 300 and socket 302 layers and the application layer 318. Of particular importance are the discovery 308, graphing 306, and grouping 312 components. At the bottom most layer of the architecture is the core OS 300. The OS is, in one embodiment, the Windows operating system by Microsoft of Redmond, Wash. As will be appreciated by one of ordinary skill in the art, the OS should be understood to also include similar operating systems. Residing between the peer-to-peer architecture and the OS is the network communications socket layer 302. The socket layer 302 allows the peer-to-peer architecture to leverage the operating system's interface with lower level network communication protocols. The discovery protocol 308 is a peer name resolution protocol (PNRP) that enables the resolution of a peer name to an IP address in a completely serverless fashion. Thus, with the discovery protocol 308, it is possible for a computing device to locate a peer on a network without the need for a separate server to maintain peer network location information. The graphing component 306 allows for the organization of a given set of network nodes so that data can be efficiently disseminated amongst them. Specifically, graphing 306 addresses data dissemination in a network that is not fully connected and provides for one-to-many dissemination of the data. The grouping component 312 associates a security model with one or more graphs created by the graphing component 306. With the grouping 312 module, a peer is able to create a group, own a group, and define members (users or machines) that are allowed to join the group.
In one embodiment of the graphing component 306 employed by the present invention, interfaces and methods can be implemented through an application programming interface (API). Such an embodiment is particularly well suited for the Microsoft Windows XP operating system in which the APIs may be as follows:
In one embodiment of the grouping component 312 employed by the present invention, interfaces and methods can be implemented through an API. Such an embodiment is particularly well suited for the Microsoft Windows XP operating system in which the APIs may be as follows:
FIGS. 4 and 5 illustrate the peer-to-peer group creation and joining process. Beginning with step 500, the group creator 100 requests that a peer identity for the application be created by the identity manager 310. Next, in step 502, the group creator 100 requests that a group 404 be created. In step 504 a group joiner 100 requests that a peer identity be created by the identity manager 310. Next, in step 506, using the discovery protocol 308 the group joiner 100 locates a group 404 to join. In step 508 the group joiner 100 opens the group 404 that the joiner wishes to join and in step 510 the group joiner 100 sends its identity 400 credentials to the group creator 100. Upon receipt of the group joiner's identity credentials 400 by the group creator 100, in step 512, the group creator 100 requests that an invitation 402 be created to send to the group joiner 100. Next, in step 514, the group creator 100 sends the invitation 402 to the group joiner 100. Upon receipt of the invitation 402 in step 516, the group joiner 100 accepts the invitation 402 and joins the group 404 in step 518. The preceding steps can be repeated resulting in the formation of a peer-to-peer group such as the one illustrated in FIG. 6.
IV. Content Distribution Leveraging a Peer-To-Peer Network Infrastructure
With reference to FIG. 6, an exemplary peer-to-peer group is illustrated. In the group, each peer-to-peer node 100 is reachable via a path on the graph of the group. Each peer node 100 in the group has an instance of the replicated store 314. The replicated store 314 is associated with a graph or a group and maintains metadata as to the current state of each node. When a node 100 connects to a group it first synchronizes the replicated store database 314. The nodes 100 maintain this database automatically.
The replicated store 314 houses metadata about the peer-to-peer group in the form of records 600 residing in the store 314. Each record can contain a record ID field, a record type field, and an attribute field. In the case of the present invention, the metadata in the store reflects what content has been distributed to nodes 100 of the group. For each piece of content that has been distributed to a node 100 in the group, a record 600 corresponding to that piece of content exists in the replicated store 314. This record 600 possesses a location attribute that enables a node 100 in the group to ascertain if the desired content is available from within the peer group and, if so, from which nodes 100 in the group.
Turning to FIG. 7, the method of peer-to-peer content distribution leveraging a peer-to-peer networking infrastructure is illustrated. Beginning with step 700, a content distribution server publishes content for distribution. Continuing with step 702, a client computing device makes a request to the content distribution server for the published content. In step 704, the content distribution server sends the content to the client computing device and, in step 706, the client computing device receives the desired content. Next, in step 708, the client computing device updates the instance of the replicated store located on the client computing device to reflect the content that was obtained in step 706. In step 710, the update to the replicated store is propagated through the peer-to-peer group to the instances of the replicated store on the nodes of the group. Next, in step 712, a node desiring a piece of content can consult the replicated store to determine if the content is obtainable via the peer-to-peer group. Finally, in step 714, a node which has located the content it desires can receive that content from the peer node in the group having the desired content.
The above described method can be applied to a variety of content distribution scenarios. One such scenario is illustrated in FIG. 8. FIG. 8 depicts a residential network connected to the Internet 204 via a shared broadband or dial-up connection 208. In a connectivity scheme such as this one, all of the computing devices in the residential network share the bandwidth of the connection 208. In this scenario, leveraging the peer-to-peer networking infrastructure in distributing content would result in a savings of bandwidth of the shared connection 208. Under a server-based content distribution scheme, a home network having five computers desiring content (e.g., applications, patches, product upgrades, virus definitions, etc.) from a central server would require that each computer individually obtain the content. This necessitates five separate requests for content from the central server 206, each request drawing on bandwidth of the connection 208. As illustrated in FIG. 8, the home network can form a peer-to-peer group 404 of computing devices and one client computing device can download the desired content from the external content server 206 via the Internet 204 and connection 208. The other peer computing devices can then simply obtain the content from the node that downloaded it from the external content server 206. The scenario can also be extended for use with applications such as distributed web caches wherein clients can download a web content from another client close to it who may have downloaded that web content recently. Since the speed of the local network connections will typically far rival that of the broadband or dial-up connection, this results in a better overall experience for the user.
An additional scenario in which the leveraging of the peer-to-peer network infrastructure results in a more efficient distribution of content is illustrated in FIG. 9. Suppose, for example, the external content server 206 of FIG. 9 is a virus definition server for a large antivirus company. As will be appreciated by one of ordinary skill in the art, the virus definition development life-cycle is typically characterized as a very short “ship cycle.” As soon as a new antivirus definition file is available, it is shipped and/or made available for download to the antivirus subscribers. The frequency of such updates to antivirus programs is quite high. Under a server-based content distribution scenario, these updates would be hosted on the external content server 206. The spikes in downloading of these updates, when posted, could potentially cause scaling issues. By leveraging the peer-to-peer networking infrastructure in distributing content, such as virus updates, load on the external content server 206 can be reduced. As illustrated in FIG. 9, a content distribution group 404 can be created and managed by the external content server 206 and requests for content from computing devices 100 can be redirected from the server 206 to the content distribution group 404. Thus, only a handful of customers would need to connect up to the main anti-virus server 206 and the virus patch would automatically be propagated through the content distribution group. In this scenario, the patch itself would likely be signed by the company to ensure that no customer in the distribution group 404 could spoof the patch as coming from the company.
Yet another scenario in which the leveraging of the peer-to-peer network infrastructure can result in a more efficient distribution of content is illustrated in FIG. 10. In a large network such as an enterprise installation, the speed of dissemination of content can be improved when only one or two computing devices 100 download desired content and then, in turn, deliver the content to other computing devices 100. In addition, the computing devices 100 which receive the content from those computing devices 100 that downloaded the content from the content server 206 can advertise the presence of the content such that the load on individual computing devices gets spread out over time. This scenario lends itself well to large enterprise installations where it is not unusual for there to be a need for all computing devices in remote branch offices to download software from a remote server located across a slow wide area network (WAN) link. In much the same respect as the peer-to-peer content distribution solution for a residential network in FIG. 8, the speed of the local network connections will typically be superior to that of the WAN connection and thus result in a more efficient distribution of content. Additionally, in much the same way that the peer-to-peer content distribution solution of FIG. 9 increases the speed at which content can be disseminated over a large area such as the Internet, the peer-to-peer content distribution scenario of FIG. 10 can be particularly useful in situations where the dissemination of the content is time-sensitive, such as a presentation file for an on-line company meeting or a streaming audio file for an on-line concert performance.
1. A method for distributing, from a first computing device to a second computing device over a peer-to-peer network, a software product update from a content server, the method comprising:
obtaining the software product update, by the first computing device, from the content server via a broadband connection, the first computing device being a client of the content server and a peer in the peer-to-peer network;
communicating, by the first computing device, to one or more peers in the peer-to-peer network that the software product update is available to be obtained from the first computing device;
locating, by the second computing device, a closest peer closest to the second computing device, that comprises the software product update, where more than one peer has obtained the software product update;
determining, by the second computing device, that the first computing device is the closest peer to the second computing device that comprises the software product update; and
obtaining the software product update, by the second computing device, from the first computing device via the peer-to-peer network, the first computing device connected to the second computing device via a home network, the content server external to the home network.
2. The method of claim 1, the first computing device and the second computing device connected via a local area connection.
3. The method of claim 1, the first computing device and the second computing device connected via a wide area connection.
4. The method of claim 3, the obtaining the software product update by the first computing device comprising:
requesting the software product update; and
receiving the software product update at least partially utilizing the wide area connection.
5. The method of claim 1, the peer-to-peer network associated with a spanning tree architecture.
6. The method of claim 1, the home network comprising a home broadband connection.
7. The method of claim 1, the obtaining the software product update by the first computing device comprising:
requesting the software product update
utilizing the broadband connection.
8. The method of claim 1, the home network comprising a dial-up connection.
9. The method of claim 8, the obtaining the software product update by the first computing device comprising:
receiving the software product update at least partially utilizing the dial-up connection.
10. The method of claim 1, the communicating to one or more peers in the peer-to-peer network comprising:
updating a local data store with informational data about the software product update; and
propagating the informational data to one or more local data stores residing on one or more peers in the peer-to-peer network.
11. The method of claim 1, the determining comprising:
identifying, by the second computing device, in a local data store of a peer in the peer to peer network, a record corresponding to the software product update; and
determining, from the record, at least one computing device in the peer-to-peer network that possesses the software product update, the at least one computing device comprising the first computing device.
12. The method of claim 1, the obtaining the software product update by the second computing device comprising:
sending the software product update, by the first computing device, to the second computing device; and
accepting the software product update, by the second computing device, from the first computing device.
13. The method of claim 1, the obtaining of the software product update, by the first computing device, and the obtaining the software product update, by the second computing device, from the first computing device occurring as a real-time stream of the software product update.
14. The method of claim 1, the software product update comprising a patch for a product.
15. The method of claim 1, the software product update comprising an upgrade for an application.
16. The method of claim 1, the software product update downloaded from the content server at least partially via a Wide Area Network.
17. The method of claim 1, the software product update signed by a source of a product that the software product update is configured to update.
18. A tangible computer-readable storage device comprising instructions that when executed perform a method for distributing, from a first computing device to a second computing device over a peer-to-peer network, a software product update from a content server, the method comprising:
19. The tangible computer-readable storage device of claim 18, the peer-to-peer network associated with a spanning tree architecture.
20. The tangible computer-readable storage device of claim 18, the method comprising identifying, by the second computing device, in a local data store of a peer in the peer to peer network, a record corresponding to the software product update.
21. The tangible computer-readable storage device of claim 20, the method comprising determining, from the record, at least one computing device in the peer-to-peer network that possesses the software product update.
22. The tangible computer-readable storage device of claim 18, the software product update comprising an upgrade for an application.
23. A device for distributing, from a first computing device to a second computing device over a peer-to-peer network, a software product update from a content server, the device comprising:
one or more computer processing devices; and
memory comprising instructions that when executed at least in part via at least some of the one or more computer processing devices perform a method, comprising:
24. The device of claim 23, the peer-to-peer network associated with a spanning tree architecture.
25. The device of claim 23, the method comprising identifying, by the second computing device, in a local data store of a peer in the peer to peer network, a record corresponding to the software product update.
26. The device of claim 25, the method comprising determining, from the record, at least one computing device in the peer-to-peer network that possesses the software product update.
27. The device of claim 23, the software product update comprising a patch for an application.
28. A method for distributing, from a first computing device to a second computing device over a peer-to-peer network, a software product update from a content server, the method comprising:
communicating, by the first computing device, to one or more peers in the peer-to-peer network that the software product update is available to be obtained from the first computing device; and
providing the software product update, by the first computing device, to the second computing device via the peer-to-peer network, based at least in part upon a determination of a closest peer closest to the second computing device that comprises the software product update, where more than one peer has obtained the software product update, where the first computing device is determined to be the closest peer to the second computing device that comprises the software product update, where the first computing device is connected to the second computing device via a home network, and where the content server is external to the home network.
29. The method of claim 28, the software product update comprising at least one of a patch for a product and an upgrade for an application.
30. The method of claim 28, the first computing device comprising a first instance of a replicated store.
31. The method of claim 30, the replicated store comprising metadata.
32. The method of claim 31, the metadata associated with the software product update.
33. A tangible computer-readable storage device comprising instructions that when executed perform a method for receiving, by a second computing device from a first computing device over a peer-to-peer network, a software product update from a content server, the method comprising:
obtaining the software product update, by the second computing device, from the first computing device via the peer-to-peer network, where the software product update is obtained by the first computing device from the content server via a broadband connection, the first computing device being a client of the content server and a peer in the peer-to-peer network, where one or more peers in the peer-to-peer network are communicated to by the first computing device that the software product update is available to be obtained from the first computing device, where the first computing device is connected to the second computing device via a home network, and where the content server is external to the home network.
34. The tangible computer-readable storage device of claim 33, the software product update comprising a patch for a product.
35. The tangible computer-readable storage device of claim 33, the software product update comprising an upgrade for an application.
36. The tangible computer-readable storage device of claim 33, the peer-to-peer network associated with a spanning tree architecture.
37. The tangible computer-readable storage device of claim 33, the software product update signed by a source of a product that the software product update is configured to update.
38. A system for distributing, from a first computing device to a second computing device over a peer-to-peer network, a software product update from a content server, the system comprising:
the content server;
a first network component comprising at least some of the peer-to-peer network;
a second network component comprising at least some of a broadband connection between the content server and the first computing device;
obtain the software product update from the content server via the broadband connection, the first computing device being a client of the content server and a peer in the peer-to-peer network; and
communicate to one or more peers in the peer-to-peer network that the software product update is available to be obtained from the first computing device; and
the second computing device configured to:
locate a closest peer closest to the second computing device, that comprises the software product update, where more than one peer has obtained the software product update;
determine that the first computing device is the closest peer to the second computing device that comprises the software product update; and
obtain the software product update from the first computing device via the peer-to-peer network, the first computing device connected to the second computing device via a home network, the content server external to the home network.
39. The system of claim 38, the first computing device comprising a first instance of a replicated store, the second computing device comprising a second instance of the replicated store.
40. The system of claim 39, the first instance comprising at least a first indication that the first computing device comprises a first piece of content.
41. The system of claim 40, the second instance comprising at least a second indication that the second computing device comprises a second piece of content.
42. The system of claim 39, at least one of:
the first instance updated to comprise an indication comprised in the second instance; and
the second instance updated to comprise an indication comprised in the first instance.
US10/810,917 2004-03-26 2004-03-26 Method for efficient content distribution using a peer-to-peer networking infrastructure Active 2030-03-20 US8688803B2 (en)
US10/810,917 US8688803B2 (en) 2004-03-26 2004-03-26 Method for efficient content distribution using a peer-to-peer networking infrastructure
US14/231,693 US20140298314A1 (en) 2004-03-26 2014-03-31 Method for efficient content distribution using a peer-to-peer networking infrastructure
US14/231,693 Continuation US20140298314A1 (en) 2004-03-26 2014-03-31 Method for efficient content distribution using a peer-to-peer networking infrastructure
US20050216559A1 US20050216559A1 (en) 2005-09-29
US8688803B2 true US8688803B2 (en) 2014-04-01
ID=34991441
US10/810,917 Active 2030-03-20 US8688803B2 (en) 2004-03-26 2004-03-26 Method for efficient content distribution using a peer-to-peer networking infrastructure
US14/231,693 Abandoned US20140298314A1 (en) 2004-03-26 2014-03-31 Method for efficient content distribution using a peer-to-peer networking infrastructure
US (2) US8688803B2 (en)
CN101068155B (en) * 2006-09-20 2010-06-09 腾讯科技（深圳）有限公司 Coordinate connection stream media direct broadcasting system and collection server thereof
EP2080110A4 (en) * 2006-10-05 2014-01-15 Nat Ict Australia Ltd Decentralised multi-user online environment
US9973418B2 (en) * 2013-11-12 2018-05-15 Software Ag Techniques for change propagation across broker territories
US9509664B2 (en) 2014-06-16 2016-11-29 Verizon Deutschland Gmbh Data exchange in the internet of things
US9454358B1 (en) * 2015-03-06 2016-09-27 Omnitracs, Llc Distributed over the air programming
US5731421A (en) 1992-03-05 1998-03-24 Ciba Specialty Chemicals Corporation Monoazo dyes having a fiber-reactive 2-vinylsulfonyl-5-sufoaniline diazo component and a fiber-reactive halotriazinyl-substituted coupling component of the benzene or naphthalene series
JP2000151715A (en) 1998-11-05 2000-05-30 Toyo Commun Equip Co Ltd Network control method
JP2002281086A (en) 2001-03-19 2002-09-27 Kddi Corp Traffic monitoring method and its system
US7516187B2 (en) * 2002-07-03 2009-04-07 Lg Electronics Inc. Remote control system for home appliance network and method for operating the same
US20130007098A1 (en) * 2011-06-29 2013-01-03 Averbuch Aaron Hyman Application framework in a home network ecosystem
2004-03-26 US US10/810,917 patent/US8688803B2/en active Active
2014-03-31 US US14/231,693 patent/US20140298314A1/en not_active Abandoned
US20110289495A1 (en) * 2004-12-15 2011-11-24 Apple Inc. Software update management
"A Desktop Design for Synchronous Collaboration" Bogdan Dorohoneceanu and Ivan Marsic, in Proceedings of the Graphics Interface '99 (GI'99), Kingston, Ontario, Canada, Jun. 1999, 9 pgs.
"A Generic System for Web-Based Group Interaction", Karein Schmidt, Peter Manhart and Johannes Bumiller, Jan. 6-9, 1998, Proceedings of the Thirty-First Hawaii International Conference on System Sciences, vol. 1, 10 pgs.
"A GPS-based Peer-to-Peer Hierarchical Link State Routing for Mobile Ad Hoc Networks", Mario Joa-Ng and I-Tai Lu, IEEE 51st Vehicular Technology Conference Proceedings, vol. 3, 2000, pp. 1752-1756.
"A Measurement Study of Peer-to-Peer File Sharing Systems", Stefan Saroju, P. Krishna Gummadi and Steven D. Gribble, Appeared in Proceedings of the Multimedia Computing and Networking (MMCN), San Jose, Jan. 2002, 15 pgs.
"A Peer-to-peer Zone-Based Two-Level Link State Routing for Mobile Ad Hoc Networks", NARIO Joa-Ng and I-Tai Lu, IEEE Journal on Selectged Areas in Communications, vol. 17, No. 8, 2000, pp. 1415-1425, 14 pgs.
"A Scalable Content-Addressable Network", Sylvia Ratnasamy, Paul Francis, Mark Handley, Richard Karp and Scott Shenker, SIGCOMM '01, Aug. 27-31, 2001, San Diego, California, ACM, pp. 161-172.
"A Unified Peer-to-Peer Database Framework for Scalable Service and Resource Discovery", Wolfgang Hoschek, Published in Proceeding GRID '02 Proceedings of the Third International Workshop on Grid Computing, 2002, 14 pgs.
"A Web Based Multi-display Presentation System", Frank Zhao and Qiong Liu, MM '04 ACM, Oct. 10-16, 2004, New York, New York, 2 pgs.
"About Presentation Broadcasting", Jul. 1, 2005, reprinted from the Internet at: http://office.microsoft.com/en-us/assistance/HP052411931033.aspx, 1 pg.
"An Efficient Peer-to-Peer File Sharing Exploiting Hierarchy and Asymmetry", Gisik Kwon and Kyung D. Ryu, Proceedings of the 2003 Symposium on Applications and the Internet, 2003, 9 pgs.
"AOL vs. Microsoft vs. All of Us", Cathryn Baskin, PC World, vol. 17, No. 10, ProQuest Computing, Oct. 1999, p. 19.
"At what cost pervasive? A social computing view of mobile computing systems", 2000, D. C. Dryer, IBM Systems Journal, vol. 38, No. 4, 1999, Pervasive Computing, 28 pgs.
"BOOTP Vendor Information Extensions", Network Working Group, Jan. 1993, reprinted from the Internet at: http://www.faws.org/rfc/rfc1395.txt, 8 pgs.
"Chatopus for Palm OS, Using IM Bots for Jabber", Tony Cheung, Chatopus, Chatopus-Palm OS Instant Messaging Client for XMPP/Jabber, Oct. 20, 2002, reprinted from the Internet at: http://www.chatopus.com/articles/bots.html, 5 pgs.
"Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications", ION Stoica, Robert Morris, David Karger, M. Frans Kaashoek and Hari Balakrishnan, MIT Technical Report, SIGCOMM '01, Aug. 27-31, 2001 San Diego, California, 12 pgs.
"Collaborative Interfaces for the Web", Saul Greenberg, in Human Factors and Web Development, Chapter 18, LEA Press, 1997, pgs. 241-253.
"Computer Networks", Andrew S. Tanenbaum, Third Edition, Prentice Hall PTR, 1996, pp. 437-449.
"Connecting and Extending Peer-to-Peer Networks", Lion Share White Paper, Oct. 2004, 35 pgs.
"DataStructures and Algorithms", Sections 8.3, J. Morrie, Online Publication 1998, Reprinted from the Internet at: http://www.eecs.wsu.edu/~cook/aa/lectures/applets/h/hash-tables.html, 4 pgs.
"DataStructures and Algorithms", Sections 8.3, J. Morrie, Online Publication 1998, Reprinted from the Internet at: http://www.eecs.wsu.edu/˜cook/aa/lectures/applets/h/hash—tables.html, 4 pgs.
"Design Explorations-What ti Means to Design", IBM Research, Social Computing Group, reprinted from the Internet at: http://www.research.ibm.com/SocialComputing/SCGdesign.html, on Apr. 19, 2005, 4 pgs.
"Design Explorations—What ti Means to Design", IBM Research, Social Computing Group, reprinted from the Internet at: http://www.research.ibm.com/SocialComputing/SCGdesign.html, on Apr. 19, 2005, 4 pgs.
"Designing User Interfaces for Collaborative Web-Based Open Hypermedia", Niels Olof Bouvin, 2000, in Proceedings of the Eleventh ACM Conference on Hypertext and Hypermedia, 3 pgs.
"Discovering Semantic Web Services in Dynamic Environments", 2005, Tommy Gagnes, Thomas Piagemann and Ellen Munthe-Kaas, Norwegian Defence Research Establishment (FFI), University of Oslo, Department of Informatics, Oslo, Norway, Discovering Semantic Web Services in Dynamic Environments, published as a short paper at the IEEE European Conference on Web Services (ECOWS), 4 pgs.
"Distributed Peer-to-Peer Name Resolution", Christian Huitema, Presentation Slides from the O'Reilly Peer-to-Peer and Web Services Conference, Nov. 5, 2001, reprinted from the Internet at: http://www.slideshare.net/networkingcentral/distributed-peertopeer-name-resolution, 19 pgs.
"Dynamic Group Support in LANMAR Routing Ad Hoc Networks", Xiaoyan Hong, Nam Nguyen, Shaorong Liu and Ying Teng, IEEE, 2002, 5 pgs.
"Early Measurements of a Cluster-based Architecture for P2P Systems", Balachander Krishnamurthy, Jia Wang and Yinglian Xie, ACM SIGCOMM Internet Measurement Workshop 2001, 5 pgs.
"Extending a Collaborative Architecture to Support Emotional Awareness", Octavio Garcia, Jesus Favela, Guillermo Licea and Robert Machorro, EBAA '99, Workshop on Emotion-Based Agent Architectures, May 1999, 7 pgs.
"Freenet: A Distributed Anonymous Information Storage and Retrieval System", Ian Clarke, Oskar Sandbert, Brandon Wiley and Theodore W. Hong,H. Federrath (Ed.), 2001, reprinted from the Internet at: http://snap.stanford.edu/class/cs224w-readings/clarke00freenet.pdf, 21 pgs.
"How the Old Napster Worked", Jeff Tyson, Apr. 20, 2013, reprinted from the Internet at: http://computer.howstuffworks.com/napster.htm, 3 pgs.
"Hutchworld: Lessons Learned A Collaborative Project: Fred Hutchsinson Cancer Research Center & Microsoft Research", Lili Cheng, Linda Stone, Shelly Farnham Ann Marie Clark and Melora Zaner, in Proceedings of Second International Conference on Virtual Worlds (VW 2000), Paris, France, Jul. 2000, pp. 1-12.
"IBM Lotus Instant Messaging and Web Conferencing", Mar. 30, 2004, Reprinted from the Internet at: http://www-01.ibm.com/common/ssi/cgi-bin/ssialias? subtype=ca&infotype=an&appname=iSource&supplier=897&letternum=ENUS204-049, 3 pgs.
"IBM Workplace Collaboration Services Overview Guide", Jan. 2005, reprinted from the Internet at: ftp://ftp.lotus.com/lotusweb/IBM-Workplace-Collaboration-Services-g224733301-118.pdf, 2 pgs.
"IBM Workplace Collaboration Services Overview Guide", Jan. 2005, reprinted from the Internet at: ftp://ftp.lotus.com/lotusweb/IBM—Workplace—Collaboration—Services—g224733301—118.pdf, 2 pgs.
"Internet Routing Instability", Craig Labovitz, G. Robert Malan and Farnam Jahanian, Appears in the Proceedings of the ACM SIGCOMM 1997, 12 pgs.
"JXTA Overview", Jan Newmarch, Oct. 7, 2002, reprinted from the Internet at: http://jan.newmarch.name/distjava/jxta/jxta.html, 14 pgs.
"Managing the Virtual Commons: Cooperation and Conflict in Computer Communities", Peter Kollock and Marc Smith, in Computer-Mediated Communication:Linguistic, Social and Cross-Cultural Perspectives, 1996, 23 pgs.
"Meteor-S Web Service Discovery Infrastructure", A Component of the METEOR-SW System on Semantic Web Services and Processes: METEOR-S Web Service Discovery Infrastructure (MWSDI), dated Dec. 14, 2005, reprinted from the Internet at: http://lsdis.cs.uga.edu/projimeteor/mwsdi.html, 2 pgs.
"Microsoft Computer Dictionary", Fifth Edition, Microsoft Press, 2002, pp. 31, 238-239, 424 and 467.
"Microsoft Computer Dictionary", Fifth Edition, Microsoft Press, 2002, two coverpages and pp. 31, 238-239, 424 and 467 (total 7 pgs.).
"Microsoft Overhauls Longhorn Drivers for Usability, Connectivity", eWeek.com Enterprise News & Reviews, dated Dec. 14, 2005, reprinted from the Internet at: http://www.eweek.com/article2/0,1759,1654462,00.asp, 3 pgs.
"Microsoft, Groove Networks to Combine Forces to Create Anytime, Anywhere Collaboration", Microsoft PresspassInformation for Journalists, Mar. 10, 2005, reprinted from the Internet at: http://www.microsoft.com/prespass/features/2005/mar05/03-10GrooveQA.asp, 5 pgs.
"News: Sun Incorporating JXTA into Products", java.net the Source for Java Technology Collaboration, Jan. 30, 2004, reprinted from the Internet at: http://today.java.net/pub/n/SunJXTA, 1 pg.
"On Reliable and Scalable Peer-to-Peer Web Document Sharing", Li Xiao, Xiaodong Zhang and Zhichen Xu, Proceedings of 2002 International Parallel and Distributed Processing Symposium (IPDPS '02), IEEE, 8 pgs.
"P2P Search that Scales", L ADAMIC, pre=presentation description for talk on Nov. 7 2001, printed from the Internet at: http://conferences.oreillynetcomics/p2pweb2001/view/e-sess/1702, 1 pg.
"P2P Search that Scales", L ADAMIC, pre=presentation description for talk on Nov. 7 2001, printed from the Internet at: http://conferences.oreillynetcomics/p2pweb2001/view/e—sess/1702, 1 pg.
"Pastry: Scalable, decentralized object location and routing for large-scale peer-to-peer systems", Antony Rowstrom and Peter Druschel, Appears in Proc. of the 18th IFIP/ACM International Conference on Distributed Systems Platforms, Heidelberg, Germany, Nov. 2001, 22 pgs.
"Peer-to-Peer Architectures and the Magi Open Source Infrastructure", G. Bolcer, Endeavors Technology, Inc. Dec. 6, 2000, reprinted from the Internet at: http://65.54.113.26/Publication/35458495/peer-to-peer-architectures-and-the-magi-open-source-infrastructure, 2 pgs.
"Peer-To-Peer for Collaborative Applications", Gianpaolo Cugola and Gian Pietro Picco, in Proceedings of the 22nd International Conference on Distributed Computing Systems Workshops (ICDCS '02), Vienna, Austria, Jul. 2-5, 2002, 6 pgs.
"Presence and Awareness Service", Ramiro Liscano, Jun. 11, 2003, reprinted from the Internet at: http://www.site.uottawa.ca/fiw03/pres/Liscano.pdf, 89 pgs.
"Products: Groove Virtual Office FAQ", Groove Networks, reprinted from the Internet at: http://www.groove.net/index.cfm?pagename=VO—FAQ, May 31, 2005, 5 pgs.
"Products: Groove Virtual Office", Groove Networks, reprinted from the Internet at: http://www.groove.net/index.cfm/pagename/VirtualOffice, May 31, 2005, 2 pgs.
"Products: Why Groove", Groove Networks, reprinted from the Internet at: http://www.groove.net/index/cfm?pagename=Products—Overview, May 31, 2005, 2 pg.
"Project JCTA: An Open, Innovative Collaboration", Sun Microsystems, Inc., Apr. 25, 2001, reprinted from the Internet at: http://www.utdallas.edu/~ilyen/course/grid/papers/jxta/jxta-collaboration.pdf,7 pgs.
"Project JCTA: An Open, Innovative Collaboration", Sun Microsystems, Inc., Apr. 25, 2001, reprinted from the Internet at: http://www.utdallas.edu/˜ilyen/course/grid/papers/jxta/jxta-collaboration.pdf,7 pgs.
"Project JXTA: Technical Shell Overview", Apr. 25, 2011, Sun Microsystems, Inc., reprinted from the Internet at: http://www.jxta.org/project/www/docs/TechShellOverview.pdf, 12 pgs.
"Project JXTA: Technical Specification Version 1.0", Sun Microsystems, Inc., Apr. 25, 2001, reprinted from the Internet at: http://www.cs.unibo.it/babaoglu/courses/cas00-01/papers/P2P/JXTA-Spec.pdf, 26. pgs.
"Project JXTA: Virtual Network", Bernard Traversat and Mohamed Abdelaziz, Mike Duigou, Jean-Christophe Hugly, Eric Pouyoul and Bill Yeager, Sun Microsystems, Inc. Oct. 28, 2002, 10 pgs.
"Publications related to Pastry", Dec. 24, 2001, reprinted from the Internet at: http://research.microsoft.com/en-us/umlpeople/antr/pastry/pubs.htm, 2 pgs.
"QuickTime Broadcaster", Jul. 1, 2005, reprinted from the Internet at: http://www.apple.com/quicktime/extending/resources.html, 1 pg.
"Secure routing for structured peer-to-peer overlay networks", Miguel Castro, Peter Druschel, Ayalyadi, Ganesh, Antony Rowstron and Dan S. Wallach, Uneix.OSDI '02 Paper (OSDI '02 Tech Program Index), the Proceedings, Fifth Symposium on Operating Systems Design and Implementation (OSDI 2002), 33 pgs.
"SIP: Session Initiation Protocol", M Handley, H Schulzrinne, E. Schooler and J. Rosenberg, Mar., 1999, Network Working Group, Request for Comments 2543, reprinted from the Internet at: http://tools,jeff.org/hjtml/rfc3542, 153 pgs.
"SlidesNow!", Jul. 1, 2005, reprinted from the Internet at: http://www.slidesnow.com/about.shtml, 2 pgs.
"Supporting Multi-User, Multi-Applet Workspaces in CBE", Jang Ho Lee, Atul Prakash, Trent Jaeger and Gwobaw Wu, in Proceedings of the ACM 1996 Conference on Computer Supported Cooperative Work, Cambridge, MA, 1996, 10 pgs.
"Supporting Sociability in a Shared Browser", Shelly Farnham, Melora Zaner and Lili Cheng, in Proceedings of Interact Conference (Tokyo, Japan, Jul. 2001), 8 pgs.
"Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and Routing", Ben Y. Zhao, John Kubiatowicz and Anthony D. Joseph, Report No. UCB/CSD-01-1141, Computer Science Division (EECS), University of California, Berkeley, California, 2001, 28 pgs.
"The Cost of Application-level Broadcast in a Fully Decentralized Peer-to-Peer Network", Marius Portmann and Aruna Seneviratne, 2002, Proceedings of the Seventh International Symposium on Computer and Communications, 6 pgs.
"The Cost of Peer Discovery and Searching in the Gnutella Peer-to-Peer File Sharing Protocol", Marius Portmann, Pipat Sookavatana, Sebastien Ardon and Aruna Seneviratne, Proceedings Ninth IEEE International Conference on Networks, 2001, pp. 263-268.
"The Economies of Online Cooperation: Gifts and Public Goods in Cyberspace", Peter Kollock, in Communities in BCyberspace, (Smith et al. ids.) Routledge, London, UK, 1999, pp. 1-16.
"The Social Life of Small Graphical Chat Spaces", Marc A. Smith, Shelly D. Farnham and Steven M. Drucker, in Proceedings of the SIGCHI Conference on Human Factors in Computing Systems, The Hague, Netherlands, Mar. 2000, reprinted from the Internet at: http://research.microsoft.com/scg/papers/vchatchi2000.pdf, 8 pgs.
"Topology-aware routing in structured peer-to-peer overlay networks", Miguel Castro, Peter Druschel, Y. Charlie Hu and Antony Rowstron, Sep., 2002, Technical Report MSR-TR-2002-82, Microsoft Research, Microsoft Corporation, reprinted from the Internet at: http://www.research.microsoft.com, 19 pgs.
"Using a Room Metaphor to East Transitions in Groupware", Saul Greenberg and Mark Roseman, Jan. 2003, University of Calgary, Department of Computer Science, Research Report 98.611.02, 33 pgs.
"Using Network-level Support to Improve Cache Routing", Ulana Legedza and John Guttag, Computer Networks and ISDN Systems: The International Journal of Computer and Telecommunications Networking, vol. 30, No. 22-23, 1998, 8 pgs.
"Virtual Social Clubs: Meeting Places for the Internet Community", 1999, IEEE International Conference on Multimedia Computing and Systems, 4 pgs.
"Workspace Awareness in Real-Time Distributed Groupware", Carl Gutwin, The University of Calgary, department of Computer Science PhD. Thesis, Dec. 1997, reprinted from the Internet at: http://hci.usask.ca/publications/1997/gutwin-phd.pdf, 292 pgs.
Advanced Peer-to-Peer Network Platform for Various Services-SIONet (Semantic Information Oriented Network), Hiroshi Sunaga, Michiharu Takemoto and Tetsuya Iwata, Proceedings fo the Second International Conference on Peer-to-Peer Computing, IEEE, 2002, 2 pgs.
Advanced Peer-to-Peer Network Platform for Various Services—SIONet (Semantic Information Oriented Network), Hiroshi Sunaga, Michiharu Takemoto and Tetsuya Iwata, Proceedings fo the Second International Conference on Peer-to-Peer Computing, IEEE, 2002, 2 pgs.
Advisory Action cited in U.S. Appl. No. 10/351,905 dated Oct. 31, 2007, 3 pgs.
Algorithms in C, Third Edition, Parts 1-4, Fundamentals, Data Structures, Sorting, Searching, Robert Sedgewick, 1998, Chapter 14, Hashing, pp. 573-608.
Algorithms in C, Third Edition, Parts 1-4, Fundamentals, Data Structures, Sorting, Searching, Robert Sedgewick, 1998, part of Chapter 16, External Searching, pp. 662-692.
Amendment after Final cited in U.S. Appl. No. 10/351,905 dated Oct. 23, 2007, 34 pgs.
Amendment after NOA cited in U.S. Appl. No. 10/351,905 dated Jun. 22, 2009, 24 pgs.
Appeal Brief cited in U.S. Appl. No. 10/309,865 dated Feb. 25, 2008, 69 pgs.
Appeal Brief cited in U.S. Appl. No. 10/351,905 dated Dec. 17, 2008, 70 pgs.
Bit Torrent; "What is BitTorrent?" Copyright 2001-2005 BitTorrent, Inc.
Dabek, F., et al.,Building Peer-to-Peer Systems With Chord, a Distributed Lookup Serivce, at MIT Laboratory for Computer Science, 6 pages, at http://pdos.lcs.mit.edu/chord.
EP Communication cited in EP Application No. 0326960.9 dated Jun. 11, 2010, 4 pgs.
EP Notice of Allowance cited in EP Application No. 0326960.9 dated May 24, 2012, 8 pgs.
Final Office Action cited in U.S. Appl. No. 10/309,865 dated Nov. 15, 2007, 17 pgs.
Final Office Action cited in U.S. Appl. No. 10/351,905 dated Jul. 31, 2008, 12 pgs.
Final Office Action cited in U.S. Appl. No. 10/351,905 dated Oct. 31, 2007, 9 pgs.
Groove Networks, Customers: Case Studies; www.nps.navy.mil.
Japanese Final Office Action cited in Japanese Application No. 2003-403827 dated Oct. 26, 2010 , 2 pgs.
Japanese Office Action cited in Japanese Application No. 2003-403827 dated Jan. 22, 2010, 6 pgs.
MeetingMaker-Meeting Maker printout, Reprinted from the Internet at: http://www.meetingmaker.com/products/meetingmaker/default.cfm on Jul. 1, 2005, 2 pgs.
MeetingMaker-WebEvent Publish printout, 2005, Reprinted from the Internet at: http://www.meetingmaker.com/ products/webevent-publish/default.cfm, 2 pgs.
MeetingMaker-WebEvent Publish printout, 2005, Reprinted from the Internet at: http://www.meetingmaker.com/ products/webevent—publish/default.cfm, 2 pgs.
Non-Final Office Action cited in U.S. Appl. No. 10/309,865 dated Feb. 23, 2007, 18 pgs.
Non-Final Office Action cited in U.S. Appl. No. 10/309,865 dated Mar. 3, 2006, 30 pgs.
Non-Final Office Action cited in U.S. Appl. No. 10/351,905 dated Jan. 17, 2008, 10 pgs.
Non-Final Office Action cited in U.S. Appl. No. 10/351,905 dated Mar. 9, 2007, 8 pgs.
Non-Final Office Action cited in U.S. Appl. No. 10/351,905 dated Oct. 3, 2006, 8 pgs.
Notice of Allowance cited in U.S. Appl. No. 10/309,865 dated May 22, 2008, 16 pgs.
Notice of Allowance cited in U.S. Appl. No. 10/351,905 dated May. 20, 2009, 10 pgs.
Notice of Allowance cited in U.S. Appl. No. 10/810,917 dated Jul. 8, 2008, 13 pgs.
Peer-to-Peer, Harnessing the Power of Disruptive Technologies, Lawrence Lessig, Mar. 2001, Chapter 8, Gnutella, pp. 94-122.
Project JXTA: A Technology Overview, Li Gong, Sun Microsystems, Inc. Apr. 25, 2001, reprinted from the Internet at: http://docs.google.com/viewer?a=v&q=cache:xFFkjw8G7wIJ:ftp:jano.ucauca/edu.co/cursos/Memorias/CITA2002/JITT-Docuentos/Ubicua2/Fuentes/Papers/TechOverview.pdf, 12 pgs.
Rely Non-Final Office Action cited in U.S. Appl. No. 10/351,905 dated Apr. 17, 2008, 56 pgs.
Reply Non-Final Office Action cited in U.S. Appl. No. 10/309,865 dated Jul. 13, 2007, 37 pgs.
Reply Non-Final Office Action cited in U.S. Appl. No. 10/309,865 dated Jun. 2, 2006, 41 pgs.
Reply Non-Final Office Action cited in U.S. Appl. No. 10/351,905 dated Jan. 3, 2007, 25 pgs.
Reply Non-Final Office Action cited in U.S. Appl. No. 10/351,905 dated Jun. 11, 2007, 27 pgs.
The Gnutella Protocol Specification, v0.4(1), 2004, Reprinted from the Internet at: http://alumni.cs.ucr.edu/~csyiezti/courses/cs260-2/gnutelle/GnutellaProtoco104.pdf, 10 pgs.
The Gnutella Protocol Specification, v0.4(1), 2004, Reprinted from the Internet at: http://alumni.cs.ucr.edu/˜csyiezti/courses/cs260-2/gnutelle/GnutellaProtoco104.pdf, 10 pgs.
U.S. Appl. No. 10/810,381, filed Mar. 26, 2004, Manion, Todd R., et al.
Web Services Dynamic Discovery (WS-Discovery), John Beatty, Gopal Kakivaya, Devon Kemp, Thomas Kuehnet, Brad Lovering, Bryan Roe, Christopher St. John, Jeffrey Schlimmer, Guillaume, Simonnet, Doug Walter, Jack Weast, Yevgeniy Yarmosh, and Prasad Yendluri, Microsoft Corporation, Apr. 2005, reprinted from the Internet at: http://msdn.microsfot.com/en-uslibrary/bb706924(d=printer).aspx, 42 pgs.
US20050216559A1 (en) 2005-09-29
US20140298314A1 (en) 2014-10-02
Menascé et al. 2002 Probabilistic scalable P2P resource location services
WEE et al. 2002 Bestpeer: A self-configurable peer-to-peer system
Gedik et al. 2003 Peercq: A decentralized and self-configuring peer-to-peer information monitoring system
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:MANION, TODD R.;RAO, RAVI T.;SHAPPELL, MICHAEL;REEL/FRAME:015157/0148