2 This file is part of GNUnet.
3 Copyright (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., 51 Franklin Street, Fifth Floor,
18 Boston, MA 02110-1301, 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"
33 * Collect an instane number of statistics? May cause excessive IPC.
35 #define INSANE_STATISTICS GNUNET_NO
38 * List of GSF_PendingRequests this request plan
41 struct PendingRequestList;
44 * Transmission plan for a peer.
50 * M:N binding of plans to pending requests.
51 * Each pending request can be in a number of plans,
52 * and each plan can have a number of pending requests.
53 * Objects of this type indicate a mapping of a plan to
54 * a particular pending request.
56 * The corresponding head and tail of the "PE" MDLL
57 * are stored in a `struct GSF_RequestPlan`. (We need
58 * to be able to lookup all pending requests corresponding
59 * to a given plan entry.)
61 * Similarly head and tail of the "PR" MDLL are stored
62 * with the 'struct GSF_PendingRequest'. (We need
63 * to be able to lookup all plan entries corresponding
64 * to a given pending request.)
66 struct GSF_PendingRequestPlanBijection
70 * This is a doubly-linked list.
72 struct GSF_PendingRequestPlanBijection *next_PR;
75 * This is a doubly-linked list.
77 struct GSF_PendingRequestPlanBijection *prev_PR;
80 * This is a doubly-linked list.
82 struct GSF_PendingRequestPlanBijection *next_PE;
85 * This is a doubly-linked list.
87 struct GSF_PendingRequestPlanBijection *prev_PE;
90 * Associated request plan.
92 struct GSF_RequestPlan *rp;
95 * Associated pending request.
97 struct GSF_PendingRequest *pr;
103 * Information we keep per request per peer. This is a doubly-linked
104 * list (with head and tail in the 'struct GSF_PendingRequestData')
105 * with one entry in each heap of each 'struct PeerPlan'. Each
106 * entry tracks information relevant for this request and this peer.
108 struct GSF_RequestPlan
112 * This is a doubly-linked list.
114 struct GSF_RequestPlan *next;
117 * This is a doubly-linked list.
119 struct GSF_RequestPlan *prev;
122 * Heap node associated with this request and this peer.
124 struct GNUNET_CONTAINER_HeapNode *hn;
127 * The transmission plan for a peer that this request is associated with.
132 * Head of list of associated pending requests.
134 struct GSF_PendingRequestPlanBijection *pe_head;
137 * Tail of list of associated pending requests.
139 struct GSF_PendingRequestPlanBijection *pe_tail;
142 * Earliest time we'd be happy to (re)transmit this request.
144 struct GNUNET_TIME_Absolute earliest_transmission;
147 * When was the last time we transmitted this request to this peer? 0 for never.
149 struct GNUNET_TIME_Absolute last_transmission;
152 * Current priority for this request for this target.
157 * How often did we transmit this request to this peer?
159 unsigned int transmission_counter;
165 * Transmission plan for a peer.
170 * Heap with pending queries (struct GSF_RequestPlan), higher weights mean higher priority.
172 struct GNUNET_CONTAINER_Heap *priority_heap;
175 * Heap with pending queries (struct GSF_RequestPlan), by transmission time, lowest first.
177 struct GNUNET_CONTAINER_Heap *delay_heap;
180 * Map of queries to plan entries. All entries in the priority_heap or delay_heap
181 * should be in the plan map. Note that it IS possible for the plan map to have
182 * multiple entries for the same query.
184 struct GNUNET_CONTAINER_MultiHashMap *plan_map;
187 * Current transmission request handle.
189 struct GSF_PeerTransmitHandle *pth;
192 * Peer for which this is the plan.
194 struct GSF_ConnectedPeer *cp;
197 * Current task for executing the plan.
199 struct GNUNET_SCHEDULER_Task * task;
204 * Hash map from peer identities to PeerPlans.
206 static struct GNUNET_CONTAINER_MultiPeerMap *plans;
209 * Sum of all transmission counters (equals total delay for all plan entries).
211 static unsigned long long total_delay;
214 * Number of plan entries.
216 static unsigned long long plan_count;
220 * Return the query (key in the plan_map) for the given request plan.
221 * Note that this key may change as there can be multiple pending
222 * requests for the same key and we just return _one_ of them; this
223 * particular one might complete while another one might still be
224 * active, hence the lifetime of the returned hash code is NOT
225 * necessarily identical to that of the 'struct GSF_RequestPlan'
228 * @param rp a request plan
229 * @return the associated query
231 static const struct GNUNET_HashCode *
232 get_rp_key (struct GSF_RequestPlan *rp)
234 return &GSF_pending_request_get_data_ (rp->pe_head->pr)->query;
239 * Figure out when and how to transmit to the given peer.
241 * @param cls the `struct GSF_ConnectedPeer` for transmission
242 * @param tc scheduler context
245 schedule_peer_transmission (void *cls,
246 const struct GNUNET_SCHEDULER_TaskContext *tc);
250 * Insert the given request plan into the heap with the appropriate weight.
252 * @param pp associated peer's plan
253 * @param rp request to plan
256 plan (struct PeerPlan *pp, struct GSF_RequestPlan *rp)
258 #define N ((double)128.0)
260 * Running average delay we currently impose.
262 static double avg_delay;
264 struct GSF_PendingRequestData *prd;
265 struct GNUNET_TIME_Relative delay;
267 GNUNET_assert (rp->pp == pp);
268 GNUNET_STATISTICS_set (GSF_stats,
269 gettext_noop ("# average retransmission delay (ms)"),
270 total_delay * 1000LL / plan_count, GNUNET_NO);
271 prd = GSF_pending_request_get_data_ (rp->pe_head->pr);
273 if (rp->transmission_counter < 8)
275 GNUNET_TIME_relative_multiply (GNUNET_TIME_UNIT_SECONDS,
276 rp->transmission_counter);
277 else if (rp->transmission_counter < 32)
279 GNUNET_TIME_relative_multiply (GNUNET_TIME_UNIT_SECONDS,
281 (1LL << (rp->transmission_counter - 8)));
284 GNUNET_TIME_relative_multiply (GNUNET_TIME_UNIT_SECONDS,
287 GNUNET_CRYPTO_random_u32 (GNUNET_CRYPTO_QUALITY_WEAK,
288 delay.rel_value_us + 1);
289 /* Add 0.01 to avg_delay to avoid division-by-zero later */
290 avg_delay = (((avg_delay * (N - 1.0)) + delay.rel_value_us) / N) + 0.01;
293 * For the priority, we need to consider a few basic rules:
294 * 1) if we just started requesting (delay is small), we should
295 * virtually always have a priority of zero.
296 * 2) for requests with average latency, our priority should match
297 * the average priority observed on the network
298 * 3) even the longest-running requests should not be WAY out of
299 * the observed average (thus we bound by a factor of 2)
300 * 4) we add +1 to the observed average priority to avoid everyone
301 * staying put at zero (2 * 0 = 0...).
303 * Using the specific calculation below, we get:
305 * delay = 0 => priority = 0;
306 * delay = avg delay => priority = running-average-observed-priority;
307 * delay >> avg_delay => priority = 2 * running-average-observed-priority;
309 * which satisfies all of the rules above.
311 * Note: M_PI_4 = PI/4 = arctan(1)
314 round ((GSF_current_priorities +
315 1.0) * atan (delay.rel_value_us / avg_delay)) / M_PI_4;
316 /* Note: usage of 'round' and 'atan' requires -lm */
318 if (rp->transmission_counter != 0)
319 delay.rel_value_us += TTL_DECREMENT * 1000;
320 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
321 "Considering (re)transmission number %u in %s\n",
322 (unsigned int) rp->transmission_counter,
323 GNUNET_STRINGS_relative_time_to_string (delay,
325 rp->earliest_transmission = GNUNET_TIME_relative_to_absolute (delay);
326 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
327 "Earliest (re)transmission for `%s' in %us\n",
328 GNUNET_h2s (&prd->query), rp->transmission_counter);
329 GNUNET_assert (rp->hn == NULL);
330 if (0 == GNUNET_TIME_absolute_get_remaining (rp->earliest_transmission).rel_value_us)
331 rp->hn = GNUNET_CONTAINER_heap_insert (pp->priority_heap, rp, rp->priority);
334 GNUNET_CONTAINER_heap_insert (pp->delay_heap, rp,
335 rp->earliest_transmission.abs_value_us);
336 GNUNET_assert (GNUNET_YES ==
337 GNUNET_CONTAINER_multihashmap_contains_value (pp->plan_map,
340 if (NULL != pp->task)
341 GNUNET_SCHEDULER_cancel (pp->task);
342 pp->task = GNUNET_SCHEDULER_add_now (&schedule_peer_transmission, pp);
348 * Get the pending request with the highest TTL from the given plan.
350 * @param rp plan to investigate
351 * @return pending request with highest TTL
353 struct GSF_PendingRequest *
354 get_latest (const struct GSF_RequestPlan *rp)
356 struct GSF_PendingRequest *ret;
357 struct GSF_PendingRequestPlanBijection *bi;
358 const struct GSF_PendingRequestData *rprd;
359 const struct GSF_PendingRequestData *prd;
363 return NULL; /* should never happen */
365 rprd = GSF_pending_request_get_data_ (ret);
366 for (bi = bi->next_PE; NULL != bi; bi = bi->next_PE)
368 prd = GSF_pending_request_get_data_ (bi->pr);
369 if (prd->ttl.abs_value_us >
370 rprd->ttl.abs_value_us)
381 * Function called to get a message for transmission.
384 * @param buf_size number of bytes available in @a buf
385 * @param buf where to copy the message, NULL on error (peer disconnect)
386 * @return number of bytes copied to 'buf', can be 0 (without indicating an error)
389 transmit_message_callback (void *cls, size_t buf_size, void *buf)
391 struct PeerPlan *pp = cls;
392 struct GSF_RequestPlan *rp;
398 /* failed, try again... */
399 if (NULL != pp->task)
400 GNUNET_SCHEDULER_cancel (pp->task);
402 pp->task = GNUNET_SCHEDULER_add_now (&schedule_peer_transmission, pp);
403 GNUNET_STATISTICS_update (GSF_stats,
405 ("# transmission failed (core has no bandwidth)"),
409 rp = GNUNET_CONTAINER_heap_peek (pp->priority_heap);
412 if (NULL != pp->task)
413 GNUNET_SCHEDULER_cancel (pp->task);
414 pp->task = GNUNET_SCHEDULER_add_now (&schedule_peer_transmission, pp);
417 msize = GSF_pending_request_get_message_ (get_latest (rp), buf_size, buf);
418 if (msize > buf_size)
420 if (NULL != pp->task)
421 GNUNET_SCHEDULER_cancel (pp->task);
422 /* buffer to small (message changed), try again */
423 pp->task = GNUNET_SCHEDULER_add_now (&schedule_peer_transmission, pp);
426 /* remove from root, add again elsewhere... */
427 GNUNET_assert (rp == GNUNET_CONTAINER_heap_remove_root (pp->priority_heap));
429 rp->last_transmission = GNUNET_TIME_absolute_get ();
430 rp->transmission_counter++;
432 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
433 "Executing plan %p executed %u times, planning retransmission\n",
434 rp, rp->transmission_counter);
436 GNUNET_STATISTICS_update (GSF_stats,
438 ("# query messages sent to other peers"), 1,
445 * Figure out when and how to transmit to the given peer.
447 * @param cls the `struct PeerPlan`
448 * @param tc scheduler context
451 schedule_peer_transmission (void *cls,
452 const struct GNUNET_SCHEDULER_TaskContext *tc)
454 struct PeerPlan *pp = cls;
455 struct GSF_RequestPlan *rp;
457 struct GNUNET_TIME_Relative delay;
462 GSF_peer_transmit_cancel_ (pp->pth);
465 /* move ready requests to priority queue */
466 while ((NULL != (rp = GNUNET_CONTAINER_heap_peek (pp->delay_heap))) &&
467 (0 == GNUNET_TIME_absolute_get_remaining
468 (rp->earliest_transmission).rel_value_us))
470 GNUNET_assert (rp == GNUNET_CONTAINER_heap_remove_root (pp->delay_heap));
471 rp->hn = GNUNET_CONTAINER_heap_insert (pp->priority_heap, rp, rp->priority);
473 if (0 == GNUNET_CONTAINER_heap_get_size (pp->priority_heap))
475 /* priority heap (still) empty, check for delay... */
476 rp = GNUNET_CONTAINER_heap_peek (pp->delay_heap);
479 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG, "No active requests for plan %p.\n",
481 return; /* both queues empty */
483 delay = GNUNET_TIME_absolute_get_remaining (rp->earliest_transmission);
484 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
485 "Sleeping for %s before retrying requests on plan %p.\n",
486 GNUNET_STRINGS_relative_time_to_string (delay,
489 GNUNET_STATISTICS_set (GSF_stats, gettext_noop ("# delay heap timeout (ms)"),
490 delay.rel_value_us / 1000LL, GNUNET_NO);
493 GNUNET_SCHEDULER_add_delayed (delay, &schedule_peer_transmission, pp);
496 #if INSANE_STATISTICS
497 GNUNET_STATISTICS_update (GSF_stats, gettext_noop ("# query plans executed"),
500 /* process from priority heap */
501 rp = GNUNET_CONTAINER_heap_peek (pp->priority_heap);
502 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG, "Executing query plan %p\n", rp);
503 GNUNET_assert (NULL != rp);
504 msize = GSF_pending_request_get_message_ (get_latest (rp), 0, NULL);
506 GSF_peer_transmit_ (pp->cp, GNUNET_YES, rp->priority,
507 GNUNET_TIME_UNIT_FOREVER_REL, msize,
508 &transmit_message_callback, pp);
509 GNUNET_assert (NULL != pp->pth);
514 * Closure for merge_pr().
519 struct GSF_PendingRequest *pr;
527 * Iterator that checks if an equivalent request is already
528 * present for this peer.
531 * @param query the query
532 * @param element request plan stored at the node
533 * @return #GNUNET_YES if we should continue to iterate,
534 * #GNUNET_NO if not (merge success)
538 const struct GNUNET_HashCode *query,
541 struct MergeContext *mpr = cls;
542 struct GSF_RequestPlan *rp = element;
543 struct GSF_PendingRequestData *prd;
544 struct GSF_PendingRequestPlanBijection *bi;
545 struct GSF_PendingRequest *latest;
548 GSF_pending_request_is_compatible_ (mpr->pr,
551 /* merge new request with existing request plan */
552 bi = GNUNET_new (struct GSF_PendingRequestPlanBijection);
555 prd = GSF_pending_request_get_data_ (mpr->pr);
556 GNUNET_CONTAINER_MDLL_insert (PR,
560 GNUNET_CONTAINER_MDLL_insert (PE,
564 mpr->merged = GNUNET_YES;
565 #if INSANE_STATISTICS
566 GNUNET_STATISTICS_update (GSF_stats,
567 gettext_noop ("# requests merged"), 1,
570 latest = get_latest (rp);
571 if (GSF_pending_request_get_data_ (latest)->ttl.abs_value_us <
572 prd->ttl.abs_value_us)
574 #if INSANE_STATISTICS
575 GNUNET_STATISTICS_update (GSF_stats,
576 gettext_noop ("# requests refreshed"),
579 rp->transmission_counter = 0; /* reset */
586 * Create a new query plan entry.
588 * @param cp peer with the entry
589 * @param pr request with the entry
592 GSF_plan_add_ (struct GSF_ConnectedPeer *cp,
593 struct GSF_PendingRequest *pr)
595 const struct GNUNET_PeerIdentity *id;
597 struct GSF_PendingRequestData *prd;
598 struct GSF_RequestPlan *rp;
599 struct GSF_PendingRequestPlanBijection *bi;
600 struct MergeContext mpc;
602 GNUNET_assert (NULL != cp);
603 id = GSF_connected_peer_get_identity2_ (cp);
604 pp = GNUNET_CONTAINER_multipeermap_get (plans, id);
607 pp = GNUNET_new (struct PeerPlan);
608 pp->plan_map = GNUNET_CONTAINER_multihashmap_create (128, GNUNET_NO);
610 GNUNET_CONTAINER_heap_create (GNUNET_CONTAINER_HEAP_ORDER_MAX);
612 GNUNET_CONTAINER_heap_create (GNUNET_CONTAINER_HEAP_ORDER_MIN);
614 GNUNET_assert (GNUNET_OK ==
615 GNUNET_CONTAINER_multipeermap_put (plans,
618 GNUNET_CONTAINER_MULTIHASHMAPOPTION_UNIQUE_ONLY));
620 mpc.merged = GNUNET_NO;
622 prd = GSF_pending_request_get_data_ (pr);
623 GNUNET_CONTAINER_multihashmap_get_multiple (pp->plan_map,
627 if (GNUNET_NO != mpc.merged)
630 GNUNET_STATISTICS_update (GSF_stats,
631 gettext_noop ("# query plan entries"),
634 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
635 "Planning transmission of query `%s' to peer `%s'\n",
636 GNUNET_h2s (&prd->query),
638 rp = GNUNET_new (struct GSF_RequestPlan);
639 bi = GNUNET_new (struct GSF_PendingRequestPlanBijection);
642 GNUNET_CONTAINER_MDLL_insert (PR,
646 GNUNET_CONTAINER_MDLL_insert (PE,
651 GNUNET_assert (GNUNET_YES ==
652 GNUNET_CONTAINER_multihashmap_put (pp->plan_map,
655 GNUNET_CONTAINER_MULTIHASHMAPOPTION_MULTIPLE));
662 * Notify the plan about a peer being no longer available;
663 * destroy all entries associated with this peer.
665 * @param cp connected peer
668 GSF_plan_notify_peer_disconnect_ (const struct GSF_ConnectedPeer *cp)
670 const struct GNUNET_PeerIdentity *id;
672 struct GSF_RequestPlan *rp;
673 struct GSF_PendingRequestData *prd;
674 struct GSF_PendingRequestPlanBijection *bi;
676 id = GSF_connected_peer_get_identity2_ (cp);
677 pp = GNUNET_CONTAINER_multipeermap_get (plans, id);
679 return; /* nothing was ever planned for this peer */
680 GNUNET_assert (GNUNET_YES ==
681 GNUNET_CONTAINER_multipeermap_remove (plans, id,
685 GSF_peer_transmit_cancel_ (pp->pth);
688 if (NULL != pp->task)
690 GNUNET_SCHEDULER_cancel (pp->task);
693 while (NULL != (rp = GNUNET_CONTAINER_heap_remove_root (pp->priority_heap)))
695 GNUNET_break (GNUNET_YES ==
696 GNUNET_CONTAINER_multihashmap_remove (pp->plan_map,
697 get_rp_key (rp), rp));
698 while (NULL != (bi = rp->pe_head))
700 GNUNET_CONTAINER_MDLL_remove (PE, rp->pe_head, rp->pe_tail, bi);
701 prd = GSF_pending_request_get_data_ (bi->pr);
702 GNUNET_CONTAINER_MDLL_remove (PR, prd->pr_head, prd->pr_tail, bi);
708 GNUNET_CONTAINER_heap_destroy (pp->priority_heap);
709 while (NULL != (rp = GNUNET_CONTAINER_heap_remove_root (pp->delay_heap)))
711 GNUNET_break (GNUNET_YES ==
712 GNUNET_CONTAINER_multihashmap_remove (pp->plan_map,
713 get_rp_key (rp), rp));
714 while (NULL != (bi = rp->pe_head))
716 prd = GSF_pending_request_get_data_ (bi->pr);
717 GNUNET_CONTAINER_MDLL_remove (PE, rp->pe_head, rp->pe_tail, bi);
718 GNUNET_CONTAINER_MDLL_remove (PR, prd->pr_head, prd->pr_tail, bi);
724 GNUNET_STATISTICS_set (GSF_stats, gettext_noop ("# query plan entries"),
725 plan_count, GNUNET_NO);
726 GNUNET_CONTAINER_heap_destroy (pp->delay_heap);
727 GNUNET_CONTAINER_multihashmap_destroy (pp->plan_map);
733 * Get the last transmission attempt time for the request plan list
734 * referenced by @a pr_head, that was sent to @a sender
736 * @param pr_head request plan reference list to check.
737 * @param sender the peer that we've sent the request to.
738 * @param result the timestamp to fill, set to #GNUNET_TIME_UNIT_FOREVER_ABS if never transmitted
739 * @return #GNUNET_YES if @a result was changed, #GNUNET_NO otherwise.
742 GSF_request_plan_reference_get_last_transmission_ (struct GSF_PendingRequestPlanBijection *pr_head,
743 struct GSF_ConnectedPeer *sender,
744 struct GNUNET_TIME_Absolute *result)
746 struct GSF_PendingRequestPlanBijection *bi;
748 for (bi = pr_head; NULL != bi; bi = bi->next_PR)
750 if (bi->rp->pp->cp == sender)
752 if (0 == bi->rp->last_transmission.abs_value_us)
753 *result = GNUNET_TIME_UNIT_FOREVER_ABS;
755 *result = bi->rp->last_transmission;
764 * Notify the plan about a request being done; destroy all entries
765 * associated with this request.
767 * @param pr request that is done
770 GSF_plan_notify_request_done_ (struct GSF_PendingRequest *pr)
772 struct GSF_RequestPlan *rp;
773 struct GSF_PendingRequestData *prd;
774 struct GSF_PendingRequestPlanBijection *bi;
776 prd = GSF_pending_request_get_data_ (pr);
777 while (NULL != (bi = prd->pr_head))
780 GNUNET_CONTAINER_MDLL_remove (PR, prd->pr_head, prd->pr_tail, bi);
781 GNUNET_CONTAINER_MDLL_remove (PE, rp->pe_head, rp->pe_tail, bi);
782 if (NULL == rp->pe_head)
784 GNUNET_CONTAINER_heap_remove_node (rp->hn);
786 GNUNET_break (GNUNET_YES ==
787 GNUNET_CONTAINER_multihashmap_remove (rp->pp->plan_map,
788 &GSF_pending_request_get_data_
795 GNUNET_STATISTICS_set (GSF_stats, gettext_noop ("# query plan entries"),
796 plan_count, GNUNET_NO);
801 * Initialize plan subsystem.
806 plans = GNUNET_CONTAINER_multipeermap_create (256, GNUNET_YES);
811 * Shutdown plan subsystem.
816 GNUNET_assert (0 == GNUNET_CONTAINER_multipeermap_size (plans));
817 GNUNET_CONTAINER_multipeermap_destroy (plans);
822 /* end of gnunet-service-fs_pe.h */