1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
|
/***************************************************************************
* Copyright (C) 2005 by Joris Guisson *
* joris.guisson@gmail.com *
* *
* This program is free software; you can redistribute it and/or modify *
* it under the terms of the GNU General Public License as published by *
* the Free Software Foundation; either version 2 of the License, or *
* (at your option) any later version. *
* *
* This program is distributed in the hope that it will be useful, *
* but WITHOUT ANY WARRANTY; without even the implied warranty of *
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the *
* GNU General Public License for more details. *
* *
* You should have received a copy of the GNU General Public License *
* along with this program; if not, write to the *
* Free Software Foundation, Inc., *
* 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. *
***************************************************************************/
#include <interfaces/functions.h>
#include "oldchokealgorithm.h"
#include "peer.h"
#include "packetwriter.h"
#include "peermanager.h"
using namespace kt;
namespace bt
{
int UploadRateCmp(Peer* pa,Peer* pb)
{
return CompareVal(pa->getUploadRate(),pb->getUploadRate());
}
int DownloadRateCmp(Peer* pa,Peer* pb)
{
return CompareVal(pa->getDownloadRate(),pb->getDownloadRate());
}
OldChokeAlgorithm::OldChokeAlgorithm(): ChokeAlgorithm()
{
opt_unchoke_index = 0;
opt_unchoke = 1;
}
OldChokeAlgorithm::~OldChokeAlgorithm()
{}
void OldChokeAlgorithm::doChoking(PeerManager& pman, bool have_all)
{
if (pman.getNumConnectedPeers() == 0)
return;
downloaders.clear();
interested.clear();
not_interested.clear();
// first alert everybody that we're interested or not
sendInterested(pman,have_all);
// get who is interested and not
updateInterested(pman);
// them sort them;
if (have_all)
{
interested.setCompareFunc(DownloadRateCmp);
interested.sort();
not_interested.setCompareFunc(DownloadRateCmp);
not_interested.sort();
}
else
{
interested.setCompareFunc(UploadRateCmp);
interested.sort();
not_interested.setCompareFunc(UploadRateCmp);
not_interested.sort();
}
// determine the downloaders
updateDownloaders();
// unchoke the not_interested peers
// which have a faster upload rate then the downloaders
sendUnchokes(have_all);
// optimisticly unchoke somebody
optimisticUnchoke(pman);
}
void OldChokeAlgorithm::updateInterested(PeerManager& pman)
{
for (Uint32 i = 0;i < pman.getNumConnectedPeers();i++)
{
Peer* p = pman.getPeer(i);
if (p->getID() == opt_unchoked_peer_id)
continue;
if (p->isInterested())
{
interested.append(p);
}
else
{
not_interested.append(p);
}
}
}
void OldChokeAlgorithm::updateDownloaders()
{
TQPtrList<Peer>::iterator itr = interested.begin();
int num = 0;
// send all downloaders an unchoke
for (;itr != interested.end();itr++)
{
Peer* p = *itr;
if (p->getID() == opt_unchoked_peer_id)
continue;
if (num < 4)
{
p->choke();
downloaders.append(p);
num++;
}
else
{
p->choke();
}
}
}
void OldChokeAlgorithm::sendInterested(PeerManager& pman,bool have_all)
{
for (Uint32 i = 0;i < pman.getNumConnectedPeers();i++)
{
Peer* p = pman.getPeer(i);
PacketWriter & pout = p->getPacketWriter();
// if we don't have the entire file, send an intereseted message,
// else we're not intereseted
if (have_all && p->areWeInterested())
pout.sendNotInterested();
else if (!have_all && !p->areWeInterested())
pout.sendInterested();
}
}
void OldChokeAlgorithm::sendUnchokes(bool have_all)
{
if (downloaders.count() == 0)
return;
TQPtrList<Peer>::iterator itr = not_interested.begin();
// fd = fastest_downloader
Peer* fd = downloaders.first();
// send all downloaders an unchoke
for (;itr != not_interested.end();itr++)
{
Peer* p = *itr;
if (p->getID() == opt_unchoked_peer_id)
continue;
if ((have_all && p->getDownloadRate() > fd->getDownloadRate()) ||
(!have_all && p->getUploadRate() > fd->getUploadRate()))
{
p->getPacketWriter().sendUnchoke();
}
else
{
p->getPacketWriter().sendChoke();
}
}
}
void OldChokeAlgorithm::optimisticUnchoke(PeerManager& pman)
{
if (pman.getNumConnectedPeers() == 0)
return;
// only switch optimistic unchoked peer every 30 seconds
// (update interval of choker is 10 seconds)
if (opt_unchoke != 3)
{
opt_unchoke++;
return;
}
// Get current time
TQTime now = TQTime::currentTime();
TQPtrList<Peer> peers; // list to store peers to select from
// recently connected peers == peers connected in the last 5 minutes
const int RECENTLY_CONNECT_THRESH = 5*60;
for (Uint32 i = 0;i < pman.getNumConnectedPeers();i++)
{
Peer* p = pman.getPeer(i);
if (p->getConnectTime().secsTo(now) < RECENTLY_CONNECT_THRESH)
{
// we favor recently connected peers 3 times over other peers
// so we add them 3 times to the list
peers.append(p);
peers.append(p);
peers.append(p);
}
else
{
// not recent, so just add one time
peers.append(p);
}
}
// draw a random one from the list and send it an unchoke
opt_unchoke_index = rand() % peers.count();
Peer* lucky_one = peers.at(opt_unchoke_index);
lucky_one->getPacketWriter().sendUnchoke();
opt_unchoked_peer_id = lucky_one->getID();
opt_unchoke = 1;
}
}
|
