التفاصيل البيبلوغرافية
| العنوان: |
Optimal operation of hierarchical peer-to-peer networks |
| Document Number: |
20090234917 |
| تاريخ النشر: |
September 17, 2009 |
| Appl. No: |
12/229970 |
| Application Filed: |
August 28, 2008 |
| مستخلص: |
A Network capable entity, having an estimator for estimating a superpeer number of required superpeers in a hierarchical peer-to-peer network, the number depending on an actual network situation, and for estimating an existing superpeer number of actually existing superpeers in the hierarchical peer-to-peer network, and a controller for promoting a different networking capable entity to become a superpeer in case the superpeer number is greater than the existing superpeer number. |
| Inventors: |
Despotovic, Zoran (Munich, DE); Kellerer, Wolfgang (Furstenfeldbruck, DE); Zoels, Stefan (Munich, DE); Hofstaetter, Quirin (Munich, DE) |
| Assignees: |
NTT DoCoMo, Inc. (Tokyo, JP) |
| Claim: |
1. Networking capable entity, comprising: an estimator for estimating a superpeer number of necessitated superpeers in a hierarchical peer-to-peer network, the superpeer number depending on a result of a comparison of an estimate for an actual system load factor and a desired system load factor, wherein the desired system load factor is set to a value smaller than 100%, and wherein the estimate for the actual system load depends on an estimate for an existing superpeer number of actually existing superpeers in the hierarchical peer-to-peer network; and a controller for promoting a different networking capable entity to become a superpeer in case the superpeer number is greater than the estimate for the existing superpeer number. |
| Claim: |
2. Networking capable entity according to claim 1, wherein the networking capable entity is part of a hierarchical peer-to-peer system with load balancing for balancing load that is generated in the hierarchical peer-to-peer system uniformly over participating superpeers. |
| Claim: |
3. Networking capable entity according to claim 1, wherein superpeers of the hierarchical peer-to-peer system are a arranged in a Chord network. |
| Claim: |
4. Networking capable entity according to claim 1, wherein the estimator is configured to estimate the existing number of superpeers based on a geometrically distribution parameter p of a length of an interval between an ID of the networking capable entity and an ID of a direct successor of the networking capable entity. |
| Claim: |
5. Networking capable entity according to claim 1, wherein the estimator is configured to use a system load factor as the actual network situation, wherein the system load factor denotes a ratio between an average peer cost and a maximum peer cost in a load balanced hierarchical peer-to-peer system. |
| Claim: |
6. Networking capable entity according to claim 1, wherein the estimator is adapted to estimate an average number of look-up messages generated by a superpeer, to estimate a mean number of maintenance messages generated by a superpeer and to estimate an average number of REPUPLISH messages per superpeer. |
| Claim: |
7. Networking capable entity according to claim 6, wherein the estimator is adapted to estimate the average number of generated look-up messages per superpeer based on the estimated existing superpeer number and an estimated look-up rate. |
| Claim: |
8. Networking capable entity according to claim 7, wherein the estimator is adapted to estimate the average number of generated look-up messages per superpeer according to [mathematical expression included] |
| Claim: |
9. Networking capable entity according to claim 6, wherein the estimator is adapted to estimate the average number of maintenance messages per superpeer based on the estimated existing superpeer number and an estimated group size referring to an average ratio of peers connected to a superpeer. |
| Claim: |
10. Networking capable entity according to claim 9, wherein the estimator is adapted to estimate the average number of maintenance messages according to [mathematical expression included] wherein Tstab denotes the time period of a Chord's STABILIZE algorithm, Tfix denotes the time period of the Chord's FIXFINGER algorithm and Tping denotes the time period of the Chord's PING-PONG algorithm. |
| Claim: |
11. Networking capable entity according to claim 6, wherein the estimator is adapted to estimate the average number of REPUPLISH messages per superpeer, based on an estimate of a number of shared objects in the hierarchical peer-to-peer network and the existing superpeer number. |
| Claim: |
12. Networking capable entity according to claim 11, wherein the estimator is adapted to estimate the number of REPUPLISH messages according to [mathematical expression included] |
| Claim: |
13. Networking capable entity according to claim 1, wherein the estimator is adapted to estimate a mean capacity per superpeer of the hierarchical peer-to-peer network and to estimate the actual network situation based on the estimated average number of generated look-up messages per superpeer, the estimated average number of maintenance messages per superpeer, the estimated average number of REPUPLISH messages per superpeer and the estimated mean capacity. |
| Claim: |
14. Networking capable entity according to claim 13, wherein the estimator is adapted to estimate the actual network situation according to [mathematical expression included] |
| Claim: |
15. Networking capable entity according to claim 1, wherein the controller is adapted to compare a system load factor depending on the actual network situation to a desired system load factor and to increase the superpeer number compared to the existing superpeer number in case the current system load factor is larger than the desired system load factor, and to decrease the superpeer number is compared to the existing superpeer number in case the current system load factor is lower than the desired system load factor. |
| Claim: |
16. Networking capable entity according to claim 1, wherein the estimator is adapted to estimate values for an average look-up rate, an average group size (M), an average number of shared items and an average capacity of superpeers based on values specific for the said networking capable entity. |
| Claim: |
17. Networking capable entity according to claim 1, wherein the estimator is adapted to estimate for an average look-up rate, an average group size, an average number of shared items and an average capacity of superpeers using related values of neighboring networking capable entities being superpeers additionally to own values for determining mean values for said values. |
| Claim: |
18. Network capable entity, comprising: an estimator for estimating a superpeer number of necessitated superpeers in a hierarchical peer-to-peer network, the superpeer number depending on a result of a comparison of an estimate for an actual system load factor and a desired system load factor, wherein the desired system load factor is set to a value smaller than 100%, and wherein the estimate for the actual system load depends on an estimate for an existing superpeer number of actually existing superpeers in the hierarchical peer-to-peer network; and a controller for terminating superpeer characteristics of the network capable entity, in case the superpeer number is smaller than the estimate for the existing superpeer number. |
| Claim: |
19. Method for operating a networking capable entity, the method comprising: estimating an existing superpeer number of actually existing superpeers in a hierarchical peer-to-peer network; estimating an actual system load factor based on the estimated existing superpeer number; comparing the estimate for the actual system load factor to a desired system load factor, wherein the desired system load factor is set to a value smaller than 100%, estimating a superpeer number of required superpeers in the hierarchical peer-to-peer network based on a result of the comparison; and promoting a different networking capable entity to become a superpeer in case the superpeer number is greater than the estimate for the existing superpeer number. |
| Claim: |
20. Method for operating a networking capable entity, the method comprising: estimating an existing superpeer number of actually existing superpeers in a hierarchical peer-to-peer network; estimating an actual system load factor based on the estimated existing superpeer number; comparing the estimate for the actual system load factor to a desired system load factor, wherein the desired system load factor is set to a value smaller than 100%, estimating a superpeer number of required superpeers in the hierarchical peer-to-peer network based on a result of the comparison; and terminating superpeer characteristics of the network capable entity, in case the superpeer number is smaller than the estimate for the existing superpeer number. |
| Claim: |
21. Computer-program for performing a method for operating a networking capable entity, the method comprising: estimating an existing superpeer number of actually existing superpeers in a hierarchical peer-to-peer network; estimating an actual system load factor based on the estimated existing superpeer number; comparing the estimate for the actual system load factor to a desired system load factor, wherein the desired system load factor is set to a value smaller than 100%; estimating a superpeer number of required superpeers in the hierarchical peer-to-peer network based on a result of the comparison; and promoting a different networking capable entity to become a superpeer in case the superpeer number is greater than the estimate for the existing superpeer number; when the computer-program runs on a computer and/or microcontroller. |
| Claim: |
22. Computer-program for performing a method for operating a networking capable entity, the method comprising: estimating an existing superpeer number of actually existing superpeers in a hierarchical peer-to-peer network; estimating an actual system load factor based on the estimated existing superpeer number; comparing the estimate for the actual system load factor to a desired system load factor, wherein the desired system load factor is set to a value smaller than 100%; estimating a superpeer number of required superpeers in the hierarchical peer-to-peer network based on a result of the comparison; and terminating superpeer characteristics of the network capable entity, in case the superpeer number is smaller than the estimate for the existing superpeer number; when the computer-program runs on a computer and/or microcontroller. |
| Current U.S. Class: |
709/204 |
| Current International Class: |
06; 06 |
| رقم الانضمام: |
edspap.20090234917 |
| قاعدة البيانات: |
USPTO Patent Applications |