Statistics
| Branch: | Revision:

streamers / streaming.c @ 70921454

History | View | Annotate | Download (16.3 KB)

1 8fed7779 CsabaKiraly
/*
2
 *  Copyright (c) 2010 Luca Abeni
3
 *  Copyright (c) 2010 Csaba Kiraly
4
 *
5
 *  This is free software; see gpl-3.0.txt
6
 */
7 1cd06c26 CsabaKiraly
#include <sys/time.h>
8 89e893e2 Luca
#include <stdlib.h>
9
#include <stdio.h>
10
#include <stdint.h>
11 30a6e902 Csaba Kiraly
#include <stdbool.h>
12 4c0ba13e Csaba Kiraly
#include <math.h>
13 e99600d8 Csaba Kiraly
#include <assert.h>
14 f14985ba Luca Abeni
#include <string.h>
15 84ff82ba CsabaKiraly
#include <inttypes.h>
16 89e893e2 Luca
17
#include <net_helper.h>
18
#include <chunk.h> 
19
#include <chunkbuffer.h> 
20
#include <trade_msg_la.h>
21
#include <trade_msg_ha.h>
22 0f35d029 Csaba Kiraly
#include <peerset.h>
23
#include <peer.h>
24 e98d8f50 Csaba Kiraly
#include <chunkidset.h>
25 ea084625 Csaba Kiraly
#include <limits.h>
26 6546a0c0 Alessandro Russo
#include <trade_sig_ha.h>
27 89e893e2 Luca
28
#include "streaming.h"
29
#include "output.h"
30
#include "input.h"
31 e64fc7e5 Luca
#include "dbg.h"
32 b44ae8d2 CsabaKiraly
#include "chunk_signaling.h"
33 abd2ef3b Csaba Kiraly
#include "chunklock.h"
34 fcb5c29b Csaba Kiraly
#include "topology.h"
35 4c0ba13e Csaba Kiraly
#include "measures.h"
36 0fec1310 Csaba Kiraly
#include "scheduling.h"
37 89e893e2 Luca
38 4367dafd Csaba Kiraly
#include "scheduler_la.h"
39
40 d88f86de Csaba Kiraly
static bool heuristics_distance_maxdeliver = false;
41 a204d648 Csaba Kiraly
static int bcast_after_receive_every = 0;
42 59b87dad Csaba Kiraly
static bool neigh_on_chunk_recv = false;
43 10fd812c Csaba Kiraly
44 e99600d8 Csaba Kiraly
struct chunk_attributes {
45 f5d9663e Csaba Kiraly
  uint64_t deadline;
46
  uint16_t deadline_increment;
47 e99600d8 Csaba Kiraly
  uint16_t hopcount;
48
} __attribute__((packed));
49
50 1cd06c26 CsabaKiraly
extern bool chunk_log;
51 bc1ddc15 MatteoSammarco
52 03dca3bf ArpadBakay
struct chunk_buffer *cb;
53 709f774c Luca
static struct input_desc *input;
54 8c1b2832 Csaba Kiraly
static int cb_size;
55 7ca3b176 Csaba Kiraly
static int transid=0;
56 89e893e2 Luca
57 dc87dca9 Csaba Kiraly
static int offer_per_tick = 1;        //N_p parameter of POLITO
58
59 742dfaec Csaba Kiraly
int _needs(struct chunkID_set *cset, int cb_size, int cid);
60
61 1cd06c26 CsabaKiraly
uint64_t gettimeofday_in_us(void)
62
{
63
  struct timeval what_time; //to store the epoch time
64
65
  gettimeofday(&what_time, NULL);
66
  return what_time.tv_sec * 1000000ULL + what_time.tv_usec;
67
}
68
69 d3a242ab Csaba Kiraly
void cb_print()
70
{
71 b45e7201 Csaba Kiraly
#ifdef DEBUG
72 d3a242ab Csaba Kiraly
  struct chunk *chunks;
73
  int num_chunks, i, id;
74
  chunks = cb_get_chunks(cb, &num_chunks);
75
76
  dprintf("\tchbuf :");
77
  i = 0;
78
  if(num_chunks) {
79
    id = chunks[0].id;
80
    dprintf(" %d-> ",id);
81
    while (i < num_chunks) {
82
      if (id == chunks[i].id) {
83
        dprintf("%d",id % 10);
84
        i++;
85 2314ccb7 Csaba Kiraly
      } else if (chunk_islocked(id)) {
86
        dprintf("*");
87 d3a242ab Csaba Kiraly
      } else {
88
        dprintf(".");
89
      }
90
      id++;
91
    }
92
  }
93
  dprintf("\n");
94 b45e7201 Csaba Kiraly
#endif
95 d3a242ab Csaba Kiraly
}
96
97 6920fdab Luca
void stream_init(int size, struct nodeID *myID)
98 89e893e2 Luca
{
99 8612d586 CsabaKiraly
  static char conf[32];
100 89e893e2 Luca
101 8c1b2832 Csaba Kiraly
  cb_size = size;
102
103
  sprintf(conf, "size=%d", cb_size);
104 89e893e2 Luca
  cb = cb_init(conf);
105 1b6a3ea7 Csaba Kiraly
  chunkDeliveryInit(myID);
106 513e75ef Alessandro Russo
  chunkSignalingInit(myID);
107 95faef91 CsabaKiraly
  init_measures();
108 7442ecb3 Luca
}
109
110 c9370421 CsabaKiraly
int source_init(const char *fname, struct nodeID *myID, bool loop, int *fds, int fds_size)
111 7442ecb3 Luca
{
112 f14985ba Luca Abeni
  int flags = 0;
113
114
  if (memcmp(fname, "udp:", 4) == 0) {
115
    fname += 4;
116
    flags = INPUT_UDP;
117
  }
118
  if (loop) {
119
    flags |= INPUT_LOOP;
120
  }
121 dceef344 Csaba Kiraly
122
  source = true;
123
124 f14985ba Luca Abeni
  input = input_open(fname, flags, fds, fds_size);
125 7442ecb3 Luca
  if (input == NULL) {
126
    return -1;
127
  }
128
129
  stream_init(1, myID);
130
  return 0;
131 89e893e2 Luca
}
132
133 e99600d8 Csaba Kiraly
void chunk_attributes_fill(struct chunk* c)
134
{
135
  struct chunk_attributes * ca;
136
137
  assert(!c->attributes && c->attributes_size == 0);
138
139
  c->attributes_size = sizeof(struct chunk_attributes);
140 74a5d4ae CsabaKiraly
  c->attributes = ca = malloc(c->attributes_size);
141 e99600d8 Csaba Kiraly
142 f5d9663e Csaba Kiraly
  ca->deadline = c->timestamp;
143
  ca->deadline_increment = 2;
144 e99600d8 Csaba Kiraly
  ca->hopcount = 0;
145
}
146
147 ccfc425d Csaba Kiraly
int chunk_get_hopcount(struct chunk* c) {
148
  struct chunk_attributes * ca;
149
150
  if (!c->attributes || c->attributes_size != sizeof(struct chunk_attributes)) {
151 84ff82ba CsabaKiraly
    fprintf(stderr,"Warning, chunk %d with strange attributes block. Size:%d expected:%lu\n", c->id, c->attributes ? c->attributes_size : 0, sizeof(struct chunk_attributes));
152 ccfc425d Csaba Kiraly
    return -1;
153
  }
154
155
  ca = (struct chunk_attributes *) c->attributes;
156
  return ca->hopcount;
157
}
158
159 74a5d4ae CsabaKiraly
void chunk_attributes_update_received(struct chunk* c)
160 e99600d8 Csaba Kiraly
{
161
  struct chunk_attributes * ca;
162
163
  if (!c->attributes || c->attributes_size != sizeof(struct chunk_attributes)) {
164 84ff82ba CsabaKiraly
    fprintf(stderr,"Warning, received chunk %d with strange attributes block. Size:%d expected:%lu\n", c->id, c->attributes ? c->attributes_size : 0, sizeof(struct chunk_attributes));
165 e99600d8 Csaba Kiraly
    return;
166
  }
167
168
  ca = (struct chunk_attributes *) c->attributes;
169
  ca->hopcount++;
170
  dprintf("Received chunk %d with hopcount %hu\n", c->id, ca->hopcount);
171
}
172
173 43dd1a10 Csaba Kiraly
void chunk_attributes_update_sending(const struct chunk* c)
174 f5d9663e Csaba Kiraly
{
175
  struct chunk_attributes * ca;
176
177
  if (!c->attributes || c->attributes_size != sizeof(struct chunk_attributes)) {
178 cf6aaf5b Csaba Kiraly
    fprintf(stderr,"Warning, chunk %d with strange attributes block\n", c->id);
179 f5d9663e Csaba Kiraly
    return;
180
  }
181
182
  ca = (struct chunk_attributes *) c->attributes;
183
  ca->deadline += ca->deadline_increment;
184
  dprintf("Sending chunk %d with deadline %lu\n", c->id, ca->deadline);
185
}
186
187 2b97cbf1 Csaba Kiraly
struct chunkID_set *cb_to_bmap(struct chunk_buffer *chbuf)
188
{
189
  struct chunk *chunks;
190 74a5d4ae CsabaKiraly
  int num_chunks, i;
191 b31bd3a2 CsabaKiraly
  struct chunkID_set *my_bmap = chunkID_set_init("type=bitmap");
192 2b97cbf1 Csaba Kiraly
  chunks = cb_get_chunks(chbuf, &num_chunks);
193
194 b5462b05 Csaba Kiraly
  for(i=num_chunks-1; i>=0; i--) {
195 2b97cbf1 Csaba Kiraly
    chunkID_set_add_chunk(my_bmap, chunks[i].id);
196
  }
197
  return my_bmap;
198
}
199
200 d447f71d Csaba Kiraly
// a simple implementation that request everything that we miss ... up to max deliver
201 8e750be6 Csaba Kiraly
struct chunkID_set *get_chunks_to_accept(struct nodeID *fromid, const struct chunkID_set *cset_off, int max_deliver, uint16_t trans_id){
202 2b97cbf1 Csaba Kiraly
  struct chunkID_set *cset_acc, *my_bmap;
203 d447f71d Csaba Kiraly
  int i, d, cset_off_size;
204 8dd1eccd Csaba Kiraly
  //double lossrate;
205 f9630d20 Csaba Kiraly
  struct peer *from = nodeid_to_peer(fromid, 0);
206 d447f71d Csaba Kiraly
207 0781f344 Csaba Kiraly
  cset_acc = chunkID_set_init("size=0");
208 e735a1b1 Csaba Kiraly
209
  //reduce load a little bit if there are losses on the path from this guy
210 8dd1eccd Csaba Kiraly
  //lossrate = get_lossrate_receive(from->id);
211
  //lossrate = finite(lossrate) ? lossrate : 0;        //start agressively, assuming 0 loss
212
  //if (rand()/((double)RAND_MAX + 1) >= 10 * lossrate ) {
213 e735a1b1 Csaba Kiraly
    my_bmap = cb_to_bmap(cb);
214
    cset_off_size = chunkID_set_size(cset_off);
215
    for (i = 0, d = 0; i < cset_off_size && d < max_deliver; i++) {
216
      int chunkid = chunkID_set_get_chunk(cset_off, i);
217 702769ac Csaba Kiraly
      //dprintf("\tdo I need c%d ? :",chunkid);
218 e735a1b1 Csaba Kiraly
      if (!chunk_islocked(chunkid) && _needs(my_bmap, cb_size, chunkid)) {
219
        chunkID_set_add_chunk(cset_acc, chunkid);
220
        chunk_lock(chunkid,from);
221 f9630d20 Csaba Kiraly
        dtprintf("accepting %d from %s", chunkid, node_addr(fromid));
222 cff93a07 Csaba Kiraly
#ifdef MONL
223 f9630d20 Csaba Kiraly
        dprintf(", loss:%f rtt:%f", get_lossrate(fromid), get_rtt(fromid));
224 cff93a07 Csaba Kiraly
#endif
225
        dprintf("\n");
226 e735a1b1 Csaba Kiraly
        d++;
227
      }
228 d447f71d Csaba Kiraly
    }
229 e735a1b1 Csaba Kiraly
    chunkID_set_free(my_bmap);
230 8dd1eccd Csaba Kiraly
  //} else {
231 f9630d20 Csaba Kiraly
  //    dtprintf("accepting -- from %s loss:%f rtt:%f\n", node_addr(fromid), lossrate, get_rtt(fromid));
232 8dd1eccd Csaba Kiraly
  //}
233 d447f71d Csaba Kiraly
234
  return cset_acc;
235
}
236
237 b0225995 Csaba Kiraly
void send_bmap(struct nodeID *toid)
238 22ebd96d Csaba Kiraly
{
239
  struct chunkID_set *my_bmap = cb_to_bmap(cb);
240 b0225995 Csaba Kiraly
   sendBufferMap(toid,NULL, my_bmap, input ? 0 : cb_size, 0);
241 c8c4c779 Csaba Kiraly
  chunkID_set_free(my_bmap);
242 a1a9e662 Csaba Kiraly
}
243
244 a204d648 Csaba Kiraly
void bcast_bmap()
245
{
246
  int i, n;
247
  struct peer *neighbours;
248
  struct peerset *pset;
249 ba99da01 Csaba Kiraly
  struct chunkID_set *my_bmap;
250 a204d648 Csaba Kiraly
251
  pset = get_peers();
252
  n = peerset_size(pset);
253
  neighbours = peerset_get_peers(pset);
254
255 ba99da01 Csaba Kiraly
  my_bmap = cb_to_bmap(cb);        //cache our bmap for faster processing
256 a204d648 Csaba Kiraly
  for (i = 0; i<n; i++) {
257 ba99da01 Csaba Kiraly
    sendBufferMap(neighbours[i].id,NULL, my_bmap, input ? 0 : cb_size, 0);
258 a204d648 Csaba Kiraly
  }
259 ba99da01 Csaba Kiraly
  chunkID_set_free(my_bmap);
260 a204d648 Csaba Kiraly
}
261
262 68330740 Csaba Kiraly
double get_average_lossrate_pset(struct peerset *pset)
263
{
264
  int i, n;
265
  struct peer *neighbours;
266
267
  n = peerset_size(pset);
268
  neighbours = peerset_get_peers(pset);
269
  {
270 74a5d4ae CsabaKiraly
    struct nodeID *nodeids[n];
271 68330740 Csaba Kiraly
    for (i = 0; i<n; i++) nodeids[i] = neighbours[i].id;
272 5fc04950 Csaba Kiraly
#ifdef MONL
273 68330740 Csaba Kiraly
    return get_average_lossrate(nodeids, n);
274 5fc04950 Csaba Kiraly
#else
275
    return 0;
276
#endif
277 68330740 Csaba Kiraly
  }
278
}
279
280 fa3d2720 Csaba Kiraly
void ack_chunk(struct chunk *c, struct nodeID *from)
281 5b95417d Csaba Kiraly
{
282
  //reduce load a little bit if there are losses on the path from this guy
283
  double average_lossrate = get_average_lossrate_pset(get_peers());
284
  average_lossrate = finite(average_lossrate) ? average_lossrate : 0;        //start agressively, assuming 0 loss
285
  if (rand()/((double)RAND_MAX + 1) < 1 * average_lossrate ) {
286
    return;
287
  }
288 fa3d2720 Csaba Kiraly
  send_bmap(from);        //send explicit ack
289 5b95417d Csaba Kiraly
}
290
291 74a5d4ae CsabaKiraly
void received_chunk(struct nodeID *from, const uint8_t *buff, int len)
292 89e893e2 Luca
{
293
  int res;
294 52b7c5ea Luca
  static struct chunk c;
295 30c9739a Csaba Kiraly
  struct peer *p;
296 a204d648 Csaba Kiraly
  static int bcast_cnt;
297 397f3860 Csaba Kiraly
  uint16_t transid;
298 89e893e2 Luca
299 a1c01ccf Csaba Kiraly
  res = parseChunkMsg(buff + 1, len - 1, &c, &transid);
300 89e893e2 Luca
  if (res > 0) {
301 e99600d8 Csaba Kiraly
    chunk_attributes_update_received(&c);
302 6ac1e106 Csaba Kiraly
    chunk_unlock(c.id);
303 13d85fc6 Csaba Kiraly
    dprintf("Received chunk %d from peer: %s\n", c.id, node_addr(from));
304 84ff82ba CsabaKiraly
    if(chunk_log){fprintf(stderr, "TEO: Received chunk %d from peer: %s at: %"PRIu64" hopcount: %i\n", c.id, node_addr(from), gettimeofday_in_us(), chunk_get_hopcount(&c));}
305 89e893e2 Luca
    output_deliver(&c);
306
    res = cb_add_chunk(cb, &c);
307 14e5c21e Csaba Kiraly
    reg_chunk_receive(c.id, c.timestamp, chunk_get_hopcount(&c), res==E_CB_OLD, res==E_CB_DUPLICATE);
308 fc0260a4 Csaba Kiraly
    cb_print();
309 89e893e2 Luca
    if (res < 0) {
310 13d85fc6 Csaba Kiraly
      dprintf("\tchunk too old, buffer full with newer chunks\n");
311 84ff82ba CsabaKiraly
      if(chunk_log){fprintf(stderr, "TEO: Received chunk: %d too old (buffer full with newer chunks) from peer: %s at: %"PRIu64"\n", c.id, node_addr(from), gettimeofday_in_us());}
312 89e893e2 Luca
      free(c.data);
313
      free(c.attributes);
314
    }
315 13d4c180 Csaba Kiraly
    p = nodeid_to_peer(from, neigh_on_chunk_recv);
316 30c9739a Csaba Kiraly
    if (p) {        //now we have it almost sure
317
      chunkID_set_add_chunk(p->bmap,c.id);        //don't send it back
318
    }
319 c3e8369f Csaba Kiraly
    ack_chunk(&c,from);        //send explicit ack
320 a204d648 Csaba Kiraly
    if (bcast_after_receive_every && bcast_cnt % bcast_after_receive_every == 0) {
321
       bcast_bmap();
322
    }
323 ae3c4aa9 Csaba Kiraly
  } else {
324
    fprintf(stderr,"\tError: can't decode chunk!\n");
325 89e893e2 Luca
  }
326
}
327
328 685225b2 CsabaKiraly
struct chunk *generated_chunk(suseconds_t *delta)
329 89e893e2 Luca
{
330 685225b2 CsabaKiraly
  struct chunk *c;
331
332
  c = malloc(sizeof(struct chunk));
333
  if (!c) {
334
    fprintf(stderr, "Memory allocation error!\n");
335
    return NULL;
336
  }
337 89e893e2 Luca
338 685225b2 CsabaKiraly
  *delta = input_get(input, c);
339 afdc8db4 Luca Abeni
  if (*delta < 0) {
340 4bb789ed Luca
    fprintf(stderr, "Error in input!\n");
341
    exit(-1);
342
  }
343 685225b2 CsabaKiraly
  if (c->data == NULL) {
344
    free(c);
345
    return NULL;
346 4bb789ed Luca
  }
347 685225b2 CsabaKiraly
  dprintf("Generated chunk %d of %d bytes\n",c->id, c->size);
348
  chunk_attributes_fill(c);
349
  return c;
350
}
351
352
int add_chunk(struct chunk *c)
353
{
354
  int res;
355
356
  res = cb_add_chunk(cb, c);
357 5fb5ecd4 Luca
  if (res < 0) {
358 685225b2 CsabaKiraly
    free(c->data);
359
    free(c->attributes);
360
    free(c);
361
    return 0;
362 89e893e2 Luca
  }
363 685225b2 CsabaKiraly
  free(c);
364 afdc8db4 Luca Abeni
  return 1;
365 89e893e2 Luca
}
366
367 4367dafd Csaba Kiraly
/**
368 d74bc79c Csaba Kiraly
 *example function to filter chunks based on whether a given peer needs them.
369
 *
370
 * Looks at buffermap information received about the given peer.
371 4367dafd Csaba Kiraly
 */
372 7b86e7d9 Csaba Kiraly
int needs(struct peer *n, int cid){
373
  struct peer * p = n;
374 1b7da906 Csaba Kiraly
375 3cd33bb0 Csaba Kiraly
  //dprintf("\t%s needs c%d ? :",node_addr(p->id),c->id);
376 d74bc79c Csaba Kiraly
  if (! p->bmap) {
377 3cd33bb0 Csaba Kiraly
    //dprintf("no bmap\n");
378 d74bc79c Csaba Kiraly
    return 1;        // if we have no bmap information, we assume it needs the chunk (aggressive behaviour!)
379
  }
380 b44ae8d2 CsabaKiraly
  return _needs(p->bmap, p->cb_size, cid);
381 742dfaec Csaba Kiraly
}
382 d74bc79c Csaba Kiraly
383 742dfaec Csaba Kiraly
int _needs(struct chunkID_set *cset, int cb_size, int cid){
384 7c2ac59e CsabaKiraly
  if (cb_size == 0) { //if it declared it does not needs chunks
385
    return 0;
386
  }
387
388 742dfaec Csaba Kiraly
  if (chunkID_set_check(cset,cid) < 0) { //it might need the chunk
389 d74bc79c Csaba Kiraly
    int missing, min;
390
    //@TODO: add some bmap_timestamp based logic
391
392 742dfaec Csaba Kiraly
    if (chunkID_set_size(cset) == 0) {
393 3cd33bb0 Csaba Kiraly
      //dprintf("bmap empty\n");
394 d74bc79c Csaba Kiraly
      return 1;        // if the bmap seems empty, it needs the chunk
395
    }
396 742dfaec Csaba Kiraly
    missing = cb_size - chunkID_set_size(cset);
397 d74bc79c Csaba Kiraly
    missing = missing < 0 ? 0 : missing;
398 eb42de41 Csaba Kiraly
    min = chunkID_set_get_earliest(cset);
399 3cd33bb0 Csaba Kiraly
      //dprintf("%s ... cid(%d) >= min(%d) - missing(%d) ?\n",(cid >= min - missing)?"YES":"NO",cid, min, missing);
400 742dfaec Csaba Kiraly
    return (cid >= min - missing);
401 d74bc79c Csaba Kiraly
  }
402
403 3cd33bb0 Csaba Kiraly
  //dprintf("has it\n");
404 d74bc79c Csaba Kiraly
  return 0;
405 4367dafd Csaba Kiraly
}
406 d74bc79c Csaba Kiraly
407 7b86e7d9 Csaba Kiraly
double peerWeightReceivedfrom(struct peer **n){
408
  struct peer * p = *n;
409 1b7da906 Csaba Kiraly
  return timerisset(&p->bmap_timestamp) ? 1 : 0.1;
410 4367dafd Csaba Kiraly
}
411 eb4ecf1c Csaba Kiraly
412 8bb39b0b Csaba Kiraly
double peerWeightUniform(struct peer **n){
413 eb4ecf1c Csaba Kiraly
  return 1;
414
}
415
416 7b86e7d9 Csaba Kiraly
double peerWeightRtt(struct peer **n){
417 d4a680a0 Csaba Kiraly
#ifdef MONL
418 7b86e7d9 Csaba Kiraly
  double rtt = get_rtt(*n->id);
419 1b7da906 Csaba Kiraly
  //dprintf("RTT to %s: %f\n", node_addr(p->id), rtt);
420 3ffbcf2d Csaba Kiraly
  return finite(rtt) ? 1 / (rtt + 0.005) : 1 / 1;
421 d4a680a0 Csaba Kiraly
#else
422
  return 1;
423 5fc04950 Csaba Kiraly
#endif
424 d4a680a0 Csaba Kiraly
}
425 4c0ba13e Csaba Kiraly
426 ea084625 Csaba Kiraly
//ordering function for ELp peer selection, chunk ID based
427
//can't be used as weight
428 1b7da906 Csaba Kiraly
double peerScoreELpID(struct nodeID **n){
429 ea084625 Csaba Kiraly
  struct chunkID_set *bmap;
430
  int latest;
431 1b7da906 Csaba Kiraly
  struct peer * p = nodeid_to_peer(*n, 0);
432
  if (!p) return 0;
433 ea084625 Csaba Kiraly
434 1b7da906 Csaba Kiraly
  bmap = p->bmap;
435 ea084625 Csaba Kiraly
  if (!bmap) return 0;
436
  latest = chunkID_set_get_latest(bmap);
437
  if (latest == INT_MIN) return 0;
438
439
  return -latest;
440
}
441
442 97ab5c93 Csaba Kiraly
double chunkScoreChunkID(int *cid){
443
  return (double) *cid;
444
}
445
446 74a5d4ae CsabaKiraly
double getChunkTimestamp(int *cid){
447 43dd1a10 Csaba Kiraly
  const struct chunk *c = cb_get_chunk(cb, *cid);
448 1b7da906 Csaba Kiraly
  if (!c) return 0;
449
450
  return (double) c->timestamp;
451 4367dafd Csaba Kiraly
}
452
453 8e750be6 Csaba Kiraly
void send_accepted_chunks(struct nodeID *toid, struct chunkID_set *cset_acc, int max_deliver, uint16_t trans_id){
454 8e85b948 Alessandro Russo
  int i, d, cset_acc_size, res;
455 b13977c0 Csaba Kiraly
  struct peer *to = nodeid_to_peer(toid, 0);
456 d447f71d Csaba Kiraly
457
  cset_acc_size = chunkID_set_size(cset_acc);
458 e2c563e7 Csaba Kiraly
  reg_offer_accept(cset_acc_size > 0 ? 1 : 0);        //this only works if accepts are sent back even if 0 is accepted
459 d447f71d Csaba Kiraly
  for (i = 0, d=0; i < cset_acc_size && d < max_deliver; i++) {
460 43dd1a10 Csaba Kiraly
    const struct chunk *c;
461 d447f71d Csaba Kiraly
    int chunkid = chunkID_set_get_chunk(cset_acc, i);
462
    c = cb_get_chunk(cb, chunkid);
463 f8286367 Csaba Kiraly
    if (c && (!to || needs(to, chunkid)) ) {// we should have the chunk, and he should not have it. Although the "accept" should have been an answer to our "offer", we do some verification
464 f5d9663e Csaba Kiraly
      chunk_attributes_update_sending(c);
465 033319c7 Csaba Kiraly
      res = sendChunk(toid, c, trans_id);
466 d447f71d Csaba Kiraly
      if (res >= 0) {
467 f8286367 Csaba Kiraly
        if(to) chunkID_set_add_chunk(to->bmap, c->id); //don't send twice ... assuming that it will actually arrive
468 d447f71d Csaba Kiraly
        d++;
469 f740dafb Csaba Kiraly
        reg_chunk_send(c->id);
470 0adbb1ef Csaba Kiraly
        if(chunk_log){fprintf(stderr, "TEO: Sending chunk %d to peer: %s at: %"PRIu64" Result: %d\n", c->id, node_addr(toid), gettimeofday_in_us(), res);}
471 96b8d0a8 Csaba Kiraly
      } else {
472
        fprintf(stderr,"ERROR sending chunk %d\n",c->id);
473 d447f71d Csaba Kiraly
      }
474
    }
475
  }
476
}
477
478 dc87dca9 Csaba Kiraly
int offer_peer_count()
479
{
480
  return offer_per_tick;
481
}
482
483 74a5d4ae CsabaKiraly
int offer_max_deliver(struct nodeID *n)
484 960017bf Csaba Kiraly
{
485 10fd812c Csaba Kiraly
486
  if (!heuristics_distance_maxdeliver) return 1;
487
488 5fc04950 Csaba Kiraly
#ifdef MONL
489 1b7da906 Csaba Kiraly
  switch (get_hopcount(n)) {
490 960017bf Csaba Kiraly
    case 0: return 5;
491
    case 1: return 2;
492
    default: return 1;
493
  }
494 5fc04950 Csaba Kiraly
#else
495
  return 1;
496
#endif
497 960017bf Csaba Kiraly
}
498
499 fcb5c29b Csaba Kiraly
void send_offer()
500 43355360 Csaba Kiraly
{
501
  struct chunk *buff;
502 74a5d4ae CsabaKiraly
  int size, res, i, n;
503 43355360 Csaba Kiraly
  struct peer *neighbours;
504 fcb5c29b Csaba Kiraly
  struct peerset *pset;
505 43355360 Csaba Kiraly
506 fcb5c29b Csaba Kiraly
  pset = get_peers();
507 43355360 Csaba Kiraly
  n = peerset_size(pset);
508
  neighbours = peerset_get_peers(pset);
509
  dprintf("Send Offer: %d neighbours\n", n);
510
  if (n == 0) return;
511
  buff = cb_get_chunks(cb, &size);
512
  if (size == 0) return;
513
514
  {
515 dc87dca9 Csaba Kiraly
    size_t selectedpeers_len = offer_peer_count();
516 1b7da906 Csaba Kiraly
    int chunkids[size];
517 8bb39b0b Csaba Kiraly
    struct peer *nodeids[n];
518
    struct peer *selectedpeers[selectedpeers_len];
519 43355360 Csaba Kiraly
520 abbef5a5 Csaba Kiraly
    //reduce load a little bit if there are losses on the path from this guy
521 68330740 Csaba Kiraly
    double average_lossrate = get_average_lossrate_pset(pset);
522 abbef5a5 Csaba Kiraly
    average_lossrate = finite(average_lossrate) ? average_lossrate : 0;        //start agressively, assuming 0 loss
523 f76dc385 Csaba Kiraly
    if (rand()/((double)RAND_MAX + 1) < 10 * average_lossrate ) {
524 abbef5a5 Csaba Kiraly
      return;
525
    }
526
527 ffcc70ad CsabaKiraly
    for (i = 0;i < size; i++) chunkids[size - 1 - i] = (buff+i)->id;
528 8bb39b0b Csaba Kiraly
    for (i = 0; i<n; i++) nodeids[i] = (neighbours+i);
529 851fa962 Csaba Kiraly
    selectPeersForChunks(SCHED_WEIGHTING, nodeids, n, chunkids, size, selectedpeers, &selectedpeers_len, SCHED_NEEDS, SCHED_PEER);
530 43355360 Csaba Kiraly
531
    for (i=0; i<selectedpeers_len ; i++){
532 8bb39b0b Csaba Kiraly
      int max_deliver = offer_max_deliver(selectedpeers[i]->id);
533 43355360 Csaba Kiraly
      struct chunkID_set *my_bmap = cb_to_bmap(cb);
534 8bb39b0b Csaba Kiraly
      dprintf("\t sending offer(%d) to %s, cb_size: %d\n", transid, node_addr(selectedpeers[i]->id), selectedpeers[i]->cb_size);
535
      res = offerChunks(selectedpeers[i]->id, my_bmap, max_deliver, transid++);
536 ddedf85f Csaba Kiraly
      chunkID_set_free(my_bmap);
537 43355360 Csaba Kiraly
    }
538
  }
539
}
540
541 4367dafd Csaba Kiraly
542 fcb5c29b Csaba Kiraly
void send_chunk()
543 89e893e2 Luca
{
544
  struct chunk *buff;
545 74a5d4ae CsabaKiraly
  int size, res, i, n;
546 924226c0 Luca Abeni
  struct peer *neighbours;
547 fcb5c29b Csaba Kiraly
  struct peerset *pset;
548 1cd06c26 CsabaKiraly
549 fcb5c29b Csaba Kiraly
  pset = get_peers();
550 0f35d029 Csaba Kiraly
  n = peerset_size(pset);
551
  neighbours = peerset_get_peers(pset);
552 e64fc7e5 Luca
  dprintf("Send Chunk: %d neighbours\n", n);
553 89e893e2 Luca
  if (n == 0) return;
554
  buff = cb_get_chunks(cb, &size);
555 e64fc7e5 Luca
  dprintf("\t %d chunks in buffer...\n", size);
556 89e893e2 Luca
  if (size == 0) return;
557
558
  /************ STUPID DUMB SCHEDULING ****************/
559 4367dafd Csaba Kiraly
  //target = n * (rand() / (RAND_MAX + 1.0)); /*0..n-1*/
560
  //c = size * (rand() / (RAND_MAX + 1.0)); /*0..size-1*/
561 89e893e2 Luca
  /************ /STUPID DUMB SCHEDULING ****************/
562
563 4367dafd Csaba Kiraly
  /************ USE SCHEDULER ****************/
564 924226c0 Luca Abeni
  {
565
    size_t selectedpairs_len = 1;
566 1b7da906 Csaba Kiraly
    int chunkids[size];
567 7b86e7d9 Csaba Kiraly
    struct peer *nodeids[n];
568 924226c0 Luca Abeni
    struct PeerChunk selectedpairs[1];
569
  
570 1b7da906 Csaba Kiraly
    for (i = 0;i < size; i++) chunkids[i] = (buff+i)->id;
571 7b86e7d9 Csaba Kiraly
    for (i = 0; i<n; i++) nodeids[i] = (neighbours+i);
572 0fec1310 Csaba Kiraly
    SCHED_TYPE(SCHED_WEIGHTING, nodeids, n, chunkids, size, selectedpairs, &selectedpairs_len, SCHED_NEEDS, SCHED_PEER, SCHED_CHUNK);
573 4367dafd Csaba Kiraly
  /************ /USE SCHEDULER ****************/
574
575 924226c0 Luca Abeni
    for (i=0; i<selectedpairs_len ; i++){
576 7b86e7d9 Csaba Kiraly
      struct peer *p = selectedpairs[i].peer;
577 74a5d4ae CsabaKiraly
      struct chunk *c = cb_get_chunk(cb, selectedpairs[i].chunk);
578 924226c0 Luca Abeni
      dprintf("\t sending chunk[%d] to ", c->id);
579
      dprintf("%s\n", node_addr(p->id));
580
581 b0225995 Csaba Kiraly
      send_bmap(p->id);
582 bc1ddc15 MatteoSammarco
583 f5d9663e Csaba Kiraly
      chunk_attributes_update_sending(c);
584 033319c7 Csaba Kiraly
      res = sendChunk(p->id, c, 0);        //we do not use transactions in pure push
585 84ff82ba CsabaKiraly
      if(chunk_log){fprintf(stderr, "TEO: Sending chunk %d to peer: %s at: %"PRIu64" Result: %d Size: %d bytes\n", c->id, node_addr(p->id), gettimeofday_in_us(), res, c->size);}
586 13d85fc6 Csaba Kiraly
      dprintf("\tResult: %d\n", res);
587 924226c0 Luca Abeni
      if (res>=0) {
588
        chunkID_set_add_chunk(p->bmap,c->id); //don't send twice ... assuming that it will actually arrive
589 f740dafb Csaba Kiraly
        reg_chunk_send(c->id);
590 96b8d0a8 Csaba Kiraly
      } else {
591
        fprintf(stderr,"ERROR sending chunk %d\n",c->id);
592 924226c0 Luca Abeni
      }
593 0f35d029 Csaba Kiraly
    }
594 4367dafd Csaba Kiraly
  }
595 89e893e2 Luca
}