Research Article
“Q-Feed”—An Effective Solution for the Free-Riding Problem in Unstructured P2P Networks
Table 4
Status of Q-table of node “A” before and after replication.
| Neighbours and nodes within 3-hops away | B | C | D | H | N | E | F | Q-values after a few operations | 682 | 122 | 441 | 336 | 466 | 324 | 175 |
| | Storage, | 75 | 45 | 60 | 63 | 65 | 69 | 47 | | = 40 | Parameters | Bandwidth, | 98 | 42 | 71 | 77 | 92 | 73 | 32 | = 64 | | Degree, | 3 | 2 | 3 | 1 | 2 | 3 | 2 | | = 3 |
| Node Status | up | Up | down | up | up | up | up |
| Reward ( = 0.4, = 0.2, = 0.4) | 1485 | — | 0 | — | 1292 | — | — | Updated Q-values | 843 | 122 | 353 | 336 | 631 | 324 | 175 |
|
|