2 This file is part of GNUnet.
3 (C) 2011 Christian Grothoff (and other contributing authors)
5 GNUnet is free software; you can redistribute it and/or modify
6 it under the terms of the GNU General Public License as published
7 by the Free Software Foundation; either version 3, or (at your
8 option) any later version.
10 GNUnet is distributed in the hope that it will be useful, but
11 WITHOUT ANY WARRANTY; without even the implied warranty of
12 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
13 General Public License for more details.
15 You should have received a copy of the GNU General Public License
16 along with GNUnet; see the file COPYING. If not, write to the
17 Free Software Foundation, Inc., 59 Temple Place - Suite 330,
18 Boston, MA 02111-1307, USA.
22 * @file fs/gnunet-service-fs_pe.c
23 * @brief API to manage query plan
24 * @author Christian Grothoff
27 #include "gnunet-service-fs.h"
28 #include "gnunet-service-fs_cp.h"
29 #include "gnunet-service-fs_pe.h"
30 #include "gnunet-service-fs_pr.h"
34 * List of GSF_PendingRequests this request plan
37 struct PendingRequestList;
40 * Transmission plan for a peer.
46 * DLL of request plans a particular pending request is
49 struct GSF_RequestPlanReference
53 * This is a doubly-linked list.
55 struct GSF_RequestPlanReference *next;
58 * This is a doubly-linked list.
60 struct GSF_RequestPlanReference *prev;
63 * Associated request plan.
65 struct GSF_RequestPlan *rp;
68 * Corresponding PendingRequestList.
70 struct PendingRequestList *prl;
75 * List of GSF_PendingRequests this request plan
78 struct PendingRequestList
82 * This is a doubly-linked list.
84 struct PendingRequestList *next;
87 * This is a doubly-linked list.
89 struct PendingRequestList *prev;
92 * Associated pending request.
94 struct GSF_PendingRequest *pr;
97 * Corresponding GSF_RequestPlanReference.
99 struct GSF_RequestPlanReference *rpr;
105 * Information we keep per request per peer. This is a doubly-linked
106 * list (with head and tail in the 'struct GSF_PendingRequestData')
107 * with one entry in each heap of each 'struct PeerPlan'. Each
108 * entry tracks information relevant for this request and this peer.
110 struct GSF_RequestPlan
114 * This is a doubly-linked list.
116 struct GSF_RequestPlan *next;
119 * This is a doubly-linked list.
121 struct GSF_RequestPlan *prev;
124 * Heap node associated with this request and this peer.
126 struct GNUNET_CONTAINER_HeapNode *hn;
129 * The transmission plan for a peer that this request is associated with.
134 * Head of list of associated pending requests.
136 struct PendingRequestList *prl_head;
139 * Tail of list of associated pending requests.
141 struct PendingRequestList *prl_tail;
144 * Earliest time we'd be happy to (re)transmit this request.
146 struct GNUNET_TIME_Absolute earliest_transmission;
149 * When was the last time we transmitted this request to this peer? 0 for never.
151 struct GNUNET_TIME_Absolute last_transmission;
154 * Current priority for this request for this target.
159 * How often did we transmit this request to this peer?
161 unsigned int transmission_counter;
167 * Transmission plan for a peer.
172 * Heap with pending queries (struct GSF_RequestPlan), higher weights mean higher priority.
174 struct GNUNET_CONTAINER_Heap *priority_heap;
177 * Heap with pending queries (struct GSF_RequestPlan), by transmission time, lowest first.
179 struct GNUNET_CONTAINER_Heap *delay_heap;
182 * Map of queries to plan entries. All entries in the priority_heap or delay_heap
183 * should be in the plan map. Note that it IS possible for the plan map to have
184 * multiple entries for the same query.
186 struct GNUNET_CONTAINER_MultiHashMap *plan_map;
189 * Current transmission request handle.
191 struct GSF_PeerTransmitHandle *pth;
194 * Peer for which this is the plan.
196 struct GSF_ConnectedPeer *cp;
199 * Current task for executing the plan.
201 GNUNET_SCHEDULER_TaskIdentifier task;
206 * Hash map from peer identities to PeerPlans.
208 static struct GNUNET_CONTAINER_MultiHashMap *plans;
211 * Sum of all transmission counters (equals total delay for all plan entries).
213 static unsigned long long total_delay;
216 * Number of plan entries.
218 static unsigned long long plan_count;
222 * Return the query (key in the plan_map) for the given request plan.
224 * @param rp a request plan
225 * @return the associated query
227 static const GNUNET_HashCode *
228 get_rp_key (struct GSF_RequestPlan *rp)
230 return &GSF_pending_request_get_data_ (rp->prl_head->pr)->query;
235 * Figure out when and how to transmit to the given peer.
237 * @param cls the 'struct GSF_ConnectedPeer' for transmission
238 * @param tc scheduler context
241 schedule_peer_transmission (void *cls,
242 const struct GNUNET_SCHEDULER_TaskContext *tc);
246 * Insert the given request plan into the heap with the appropriate weight.
248 * @param pp associated peer's plan
249 * @param rp request to plan
252 plan (struct PeerPlan *pp, struct GSF_RequestPlan *rp)
254 #define N ((double)128.0)
256 * Running average delay we currently impose.
258 static double avg_delay;
260 struct GSF_PendingRequestData *prd;
261 struct GNUNET_TIME_Relative delay;
263 GNUNET_assert (rp->pp == pp);
264 GNUNET_STATISTICS_set (GSF_stats,
265 gettext_noop ("# average retransmission delay (ms)"),
266 total_delay * 1000LL / plan_count, GNUNET_NO);
267 prd = GSF_pending_request_get_data_ (rp->prl_head->pr);
269 if (rp->transmission_counter < 8)
271 GNUNET_TIME_relative_multiply (GNUNET_TIME_UNIT_SECONDS,
272 rp->transmission_counter);
273 else if (rp->transmission_counter < 32)
275 GNUNET_TIME_relative_multiply (GNUNET_TIME_UNIT_SECONDS,
277 (1LL << (rp->transmission_counter - 8)));
280 GNUNET_TIME_relative_multiply (GNUNET_TIME_UNIT_SECONDS,
283 GNUNET_CRYPTO_random_u32 (GNUNET_CRYPTO_QUALITY_WEAK,
284 delay.rel_value + 1);
285 /* Add 0.01 to avg_delay to avoid division-by-zero later */
286 avg_delay = (((avg_delay * (N - 1.0)) + delay.rel_value) / N) + 0.01;
289 * For the priority, we need to consider a few basic rules:
290 * 1) if we just started requesting (delay is small), we should
291 * virtually always have a priority of zero.
292 * 2) for requests with average latency, our priority should match
293 * the average priority observed on the network
294 * 3) even the longest-running requests should not be WAY out of
295 * the observed average (thus we bound by a factor of 2)
296 * 4) we add +1 to the observed average priority to avoid everyone
297 * staying put at zero (2 * 0 = 0...).
299 * Using the specific calculation below, we get:
301 * delay = 0 => priority = 0;
302 * delay = avg delay => priority = running-average-observed-priority;
303 * delay >> avg_delay => priority = 2 * running-average-observed-priority;
305 * which satisfies all of the rules above.
307 * Note: M_PI_4 = PI/4 = arctan(1)
310 round ((GSF_current_priorities +
311 1.0) * atan (delay.rel_value / avg_delay)) / M_PI_4;
312 /* Note: usage of 'round' and 'atan' requires -lm */
314 if (rp->transmission_counter != 0)
315 delay.rel_value += TTL_DECREMENT;
316 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
317 "Considering (re)transmission number %u in %llu ms\n",
318 (unsigned int) rp->transmission_counter,
319 (unsigned long long) delay.rel_value);
320 rp->earliest_transmission = GNUNET_TIME_relative_to_absolute (delay);
322 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
323 "Earliest (re)transmission for `%s' in %us\n",
324 GNUNET_h2s (&prd->query), rp->transmission_counter);
327 GNUNET_assert (rp->hn == NULL);
328 if (GNUNET_TIME_absolute_get_remaining (rp->earliest_transmission).rel_value
330 rp->hn = GNUNET_CONTAINER_heap_insert (pp->priority_heap, rp, rp->priority);
333 GNUNET_CONTAINER_heap_insert (pp->delay_heap, rp,
334 rp->earliest_transmission.abs_value);
335 GNUNET_assert (GNUNET_YES ==
336 GNUNET_CONTAINER_multihashmap_contains_value (pp->plan_map,
339 if (GNUNET_SCHEDULER_NO_TASK != pp->task)
340 GNUNET_SCHEDULER_cancel (pp->task);
341 pp->task = GNUNET_SCHEDULER_add_now (&schedule_peer_transmission, pp);
347 * Get the pending request with the highest TTL from the given plan.
349 * @param rp plan to investigate
350 * @return pending request with highest TTL
352 struct GSF_PendingRequest *
353 get_latest (const struct GSF_RequestPlan *rp)
355 struct GSF_PendingRequest *ret;
356 struct PendingRequestList *prl;
363 if (GSF_pending_request_get_data_ (prl->pr)->ttl.abs_value >
364 GSF_pending_request_get_data_ (ret)->ttl.abs_value)
373 * Function called to get a message for transmission.
376 * @param buf_size number of bytes available in buf
377 * @param buf where to copy the message, NULL on error (peer disconnect)
378 * @return number of bytes copied to 'buf', can be 0 (without indicating an error)
381 transmit_message_callback (void *cls, size_t buf_size, void *buf)
383 struct PeerPlan *pp = cls;
384 struct GSF_RequestPlan *rp;
390 /* failed, try again... */
391 pp->task = GNUNET_SCHEDULER_add_now (&schedule_peer_transmission, pp);
392 GNUNET_STATISTICS_update (GSF_stats,
394 ("# transmission failed (core has no bandwidth)"),
398 rp = GNUNET_CONTAINER_heap_peek (pp->priority_heap);
401 pp->task = GNUNET_SCHEDULER_add_now (&schedule_peer_transmission, pp);
404 msize = GSF_pending_request_get_message_ (get_latest (rp), buf_size, buf);
405 if (msize > buf_size)
407 /* buffer to small (message changed), try again */
408 pp->task = GNUNET_SCHEDULER_add_now (&schedule_peer_transmission, pp);
411 /* remove from root, add again elsewhere... */
412 GNUNET_assert (rp == GNUNET_CONTAINER_heap_remove_root (pp->priority_heap));
414 rp->last_transmission = GNUNET_TIME_absolute_get ();
415 rp->transmission_counter++;
418 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
419 "Executing plan %p executed %u times, planning retransmission\n",
420 rp, rp->transmission_counter);
423 GNUNET_STATISTICS_update (GSF_stats,
425 ("# query messages sent to other peers"), 1,
432 * Figure out when and how to transmit to the given peer.
434 * @param cls the 'struct PeerPlan'
435 * @param tc scheduler context
438 schedule_peer_transmission (void *cls,
439 const struct GNUNET_SCHEDULER_TaskContext *tc)
441 struct PeerPlan *pp = cls;
442 struct GSF_RequestPlan *rp;
444 struct GNUNET_TIME_Relative delay;
446 pp->task = GNUNET_SCHEDULER_NO_TASK;
449 GSF_peer_transmit_cancel_ (pp->pth);
452 /* move ready requests to priority queue */
453 while ((NULL != (rp = GNUNET_CONTAINER_heap_peek (pp->delay_heap))) &&
454 (GNUNET_TIME_absolute_get_remaining
455 (rp->earliest_transmission).rel_value == 0))
457 GNUNET_assert (rp == GNUNET_CONTAINER_heap_remove_root (pp->delay_heap));
458 rp->hn = GNUNET_CONTAINER_heap_insert (pp->priority_heap, rp, rp->priority);
460 if (0 == GNUNET_CONTAINER_heap_get_size (pp->priority_heap))
462 /* priority heap (still) empty, check for delay... */
463 rp = GNUNET_CONTAINER_heap_peek (pp->delay_heap);
467 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG, "No active requests for plan %p.\n",
470 return; /* both queues empty */
472 delay = GNUNET_TIME_absolute_get_remaining (rp->earliest_transmission);
474 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
475 "Sleeping for %llu ms before retrying requests on plan %p.\n",
476 (unsigned long long) delay.rel_value, pp);
478 GNUNET_STATISTICS_set (GSF_stats, gettext_noop ("# delay heap timeout"),
479 delay.rel_value, GNUNET_NO);
482 GNUNET_SCHEDULER_add_delayed (delay, &schedule_peer_transmission, pp);
485 GNUNET_STATISTICS_update (GSF_stats, gettext_noop ("# query plans executed"),
487 /* process from priority heap */
488 rp = GNUNET_CONTAINER_heap_peek (pp->priority_heap);
490 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG, "Executing query plan %p\n", rp);
492 GNUNET_assert (NULL != rp);
493 msize = GSF_pending_request_get_message_ (get_latest (rp), 0, NULL);
495 GSF_peer_transmit_ (pp->cp, GNUNET_YES, rp->priority,
496 GNUNET_TIME_UNIT_FOREVER_REL, msize,
497 &transmit_message_callback, pp);
498 GNUNET_assert (NULL != pp->pth);
503 * Closure for 'merge_pr'.
508 struct GSF_PendingRequest *pr;
516 * Iterator that checks if an equivalent request is already
517 * present for this peer.
520 * @param query the query
521 * @param element request plan stored at the node
522 * @return GNUNET_YES if we should continue to iterate,
523 * GNUNET_NO if not (merge success)
526 merge_pr (void *cls, const GNUNET_HashCode * query, void *element)
528 struct MergeContext *mpr = cls;
529 struct GSF_RequestPlan *rp = element;
530 struct GSF_PendingRequestData *prd;
531 struct GSF_RequestPlanReference *rpr;
532 struct PendingRequestList *prl;
533 struct GSF_PendingRequest *latest;
536 GSF_pending_request_is_compatible_ (mpr->pr, rp->prl_head->pr))
538 /* merge new request with existing request plan */
539 rpr = GNUNET_malloc (sizeof (struct GSF_RequestPlanReference));
540 prl = GNUNET_malloc (sizeof (struct PendingRequestList));
545 prd = GSF_pending_request_get_data_ (mpr->pr);
546 GNUNET_CONTAINER_DLL_insert (prd->rpr_head, prd->rpr_tail, rpr);
547 GNUNET_CONTAINER_DLL_insert (rp->prl_head, rp->prl_tail, prl);
548 mpr->merged = GNUNET_YES;
549 GNUNET_STATISTICS_update (GSF_stats, gettext_noop ("# requests merged"), 1,
551 latest = get_latest (rp);
552 if (GSF_pending_request_get_data_ (latest)->ttl.abs_value <
555 GNUNET_STATISTICS_update (GSF_stats, gettext_noop ("# requests refreshed"),
557 rp->transmission_counter = 0; /* reset */
564 * Create a new query plan entry.
566 * @param cp peer with the entry
567 * @param pr request with the entry
570 GSF_plan_add_ (struct GSF_ConnectedPeer *cp, struct GSF_PendingRequest *pr)
572 struct GNUNET_PeerIdentity id;
574 struct GSF_PendingRequestData *prd;
575 struct GSF_RequestPlan *rp;
576 struct GSF_RequestPlanReference *rpr;
577 struct PendingRequestList *prl;
578 struct MergeContext mpc;
580 GNUNET_assert (NULL != cp);
581 GSF_connected_peer_get_identity_ (cp, &id);
582 pp = GNUNET_CONTAINER_multihashmap_get (plans, &id.hashPubKey);
585 pp = GNUNET_malloc (sizeof (struct PeerPlan));
586 pp->plan_map = GNUNET_CONTAINER_multihashmap_create (128);
588 GNUNET_CONTAINER_heap_create (GNUNET_CONTAINER_HEAP_ORDER_MAX);
590 GNUNET_CONTAINER_heap_create (GNUNET_CONTAINER_HEAP_ORDER_MIN);
592 GNUNET_CONTAINER_multihashmap_put (plans, &id.hashPubKey, pp,
593 GNUNET_CONTAINER_MULTIHASHMAPOPTION_UNIQUE_ONLY);
595 mpc.merged = GNUNET_NO;
597 GNUNET_CONTAINER_multihashmap_get_multiple (pp->plan_map,
598 &GSF_pending_request_get_data_
599 (pr)->query, &merge_pr, &mpc);
600 if (mpc.merged != GNUNET_NO)
602 GNUNET_CONTAINER_multihashmap_get_multiple (pp->plan_map,
603 &GSF_pending_request_get_data_
604 (pr)->query, &merge_pr, &mpc);
605 if (mpc.merged != GNUNET_NO)
608 GNUNET_STATISTICS_update (GSF_stats, gettext_noop ("# query plan entries"), 1,
610 prd = GSF_pending_request_get_data_ (pr);
612 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
613 "Planning transmission of query `%s' to peer `%s'\n",
614 GNUNET_h2s (&prd->query), GNUNET_i2s (&id));
616 rp = GNUNET_malloc (sizeof (struct GSF_RequestPlan));
617 rpr = GNUNET_malloc (sizeof (struct GSF_RequestPlanReference));
618 prl = GNUNET_malloc (sizeof (struct PendingRequestList));
623 GNUNET_CONTAINER_DLL_insert (prd->rpr_head, prd->rpr_tail, rpr);
624 GNUNET_CONTAINER_DLL_insert (rp->prl_head, rp->prl_tail, prl);
626 GNUNET_assert (GNUNET_YES ==
627 GNUNET_CONTAINER_multihashmap_put (pp->plan_map,
629 GNUNET_CONTAINER_MULTIHASHMAPOPTION_MULTIPLE));
635 * Notify the plan about a peer being no longer available;
636 * destroy all entries associated with this peer.
638 * @param cp connected peer
641 GSF_plan_notify_peer_disconnect_ (const struct GSF_ConnectedPeer *cp)
643 struct GNUNET_PeerIdentity id;
645 struct GSF_RequestPlan *rp;
646 struct GSF_PendingRequestData *prd;
647 struct PendingRequestList *prl;
649 GSF_connected_peer_get_identity_ (cp, &id);
650 pp = GNUNET_CONTAINER_multihashmap_get (plans, &id.hashPubKey);
652 return; /* nothing was ever planned for this peer */
653 GNUNET_assert (GNUNET_YES ==
654 GNUNET_CONTAINER_multihashmap_remove (plans, &id.hashPubKey,
657 GSF_peer_transmit_cancel_ (pp->pth);
658 if (GNUNET_SCHEDULER_NO_TASK != pp->task)
660 GNUNET_SCHEDULER_cancel (pp->task);
661 pp->task = GNUNET_SCHEDULER_NO_TASK;
663 while (NULL != (rp = GNUNET_CONTAINER_heap_remove_root (pp->priority_heap)))
665 GNUNET_break (GNUNET_YES ==
666 GNUNET_CONTAINER_multihashmap_remove (pp->plan_map,
667 get_rp_key (rp), rp));
668 while (NULL != (prl = rp->prl_head))
670 GNUNET_CONTAINER_DLL_remove (rp->prl_head, rp->prl_tail, prl);
671 prd = GSF_pending_request_get_data_ (prl->pr);
672 GNUNET_CONTAINER_DLL_remove (prd->rpr_head, prd->rpr_tail, prl->rpr);
673 GNUNET_free (prl->rpr);
678 GNUNET_CONTAINER_heap_destroy (pp->priority_heap);
679 while (NULL != (rp = GNUNET_CONTAINER_heap_remove_root (pp->delay_heap)))
681 GNUNET_break (GNUNET_YES ==
682 GNUNET_CONTAINER_multihashmap_remove (pp->plan_map,
683 get_rp_key (rp), rp));
684 while (NULL != (prl = rp->prl_head))
686 GNUNET_CONTAINER_DLL_remove (rp->prl_head, rp->prl_tail, prl);
687 prd = GSF_pending_request_get_data_ (prl->pr);
688 GNUNET_CONTAINER_DLL_remove (prd->rpr_head, prd->rpr_tail, prl->rpr);
689 GNUNET_free (prl->rpr);
694 GNUNET_STATISTICS_set (GSF_stats, gettext_noop ("# query plan entries"),
695 plan_count, GNUNET_NO);
697 GNUNET_CONTAINER_heap_destroy (pp->delay_heap);
698 GNUNET_CONTAINER_multihashmap_destroy (pp->plan_map);
703 * Get the last transmission attempt time for the request plan list
704 * referenced by 'rpr_head', that was sent to 'sender'
706 * @param rpr_head request plan reference list to check.
707 * @param sender the peer that we've sent the request to.
708 * @param result the timestamp to fill.
709 * @return GNUNET_YES if 'result' was changed, GNUNET_NO otherwise.
712 GSF_request_plan_reference_get_last_transmission_ (
713 struct GSF_RequestPlanReference *rpr_head, struct GSF_ConnectedPeer *sender,
714 struct GNUNET_TIME_Absolute *result)
716 struct GSF_RequestPlanReference *rpr;
717 for (rpr = rpr_head; rpr; rpr = rpr->next)
719 if (rpr->rp->pp->cp == sender)
721 *result = rpr->rp->last_transmission;
729 * Notify the plan about a request being done; destroy all entries
730 * associated with this request.
732 * @param pr request that is done
735 GSF_plan_notify_request_done_ (struct GSF_PendingRequest *pr)
737 struct GSF_RequestPlan *rp;
738 struct GSF_PendingRequestData *prd;
739 struct GSF_RequestPlanReference *rpr;
741 prd = GSF_pending_request_get_data_ (pr);
742 while (NULL != (rpr = prd->rpr_head))
744 GNUNET_CONTAINER_DLL_remove (prd->rpr_head, prd->rpr_tail, rpr);
746 GNUNET_CONTAINER_DLL_remove (rp->prl_head, rp->prl_tail, rpr->prl);
747 if (NULL == rp->prl_head)
749 GNUNET_CONTAINER_heap_remove_node (rp->hn);
751 GNUNET_break (GNUNET_YES ==
752 GNUNET_CONTAINER_multihashmap_remove (rp->pp->plan_map,
753 &GSF_pending_request_get_data_
754 (rpr->prl->pr)->query,
758 GNUNET_free (rpr->prl);
761 GNUNET_STATISTICS_set (GSF_stats, gettext_noop ("# query plan entries"),
762 plan_count, GNUNET_NO);
767 * Initialize plan subsystem.
772 plans = GNUNET_CONTAINER_multihashmap_create (256);
777 * Shutdown plan subsystem.
782 GNUNET_assert (0 == GNUNET_CONTAINER_multihashmap_size (plans));
783 GNUNET_CONTAINER_multihashmap_destroy (plans);
788 /* end of gnunet-service-fs_pe.h */