108-mtbf-based-stability.txt 3.5 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384
  1. Filename: 108-mtbf-based-stability.txt
  2. Title: Base "Stable" Flag on Mean Time Between Failures
  3. Version: $Revision$
  4. Last-Modified: $Date$
  5. Author: Nick Mathewson
  6. Created: 10-Mar-2007
  7. Status: Open
  8. Overview:
  9. This document proposes that we change how directory authorities set the
  10. stability flag from inspection of a router's declared Uptime to the
  11. authorities' perceived mean time between failure for the router.
  12. Motivation:
  13. Clients prefer nodes that the authorities call Stable. This flag is (as
  14. of 0.2.0.0-alpha-dev) set entirely based on the node's declared value for
  15. uptime. This creates an opportunity for malicious nodes to declare
  16. falsely high uptimes in order to get more traffic.
  17. Spec changes:
  18. Replace the current rule for setting the Stable flag with:
  19. "Stable" -- A router is 'Stable' if it is active and its observed Stability
  20. for the past month is at or above the median Stability for active routers.
  21. Routers are never called stable if they are running a version of Tor
  22. known to drop circuits stupidly. (0.1.1.10-alpha through 0.1.1.16-rc
  23. are stupid this way.)
  24. Stability shall be defined as the mean length of the runs observed by a
  25. given directory authority. A run begins when an authority decides
  26. that the server is Running, and ends when the authority decides that
  27. the server is not Running. In-progress runs are counted when
  28. measuring Stability.
  29. Issues:
  30. How do you define a clipped MTBF? If the current month begins with one
  31. day at the end of a one-year uptime, and then has 29 days of uptime, do we
  32. average one day and 29 days? Or do we average one year and 29 days? Or
  33. take 29 days on its own and discard the year?
  34. Surely somebody has done this kinds of thing before.
  35. Alternative:
  36. "A router's Stability shall be defined as the sum of $\alpha ^ d$ for every
  37. $d$ such that the router was not observed to be unavailable $d$ days ago."
  38. This allows a simpler implementation: every day, we multiply
  39. yesterday's Stability by alpha, and if the router was observed to be
  40. available every time we looked today, we add 1.
  41. Instead of "day", we could pick an arbitrary time unit. We should
  42. pick alpha to be high enough that long-term stability counts, but low
  43. enough that the distant past is eventually forgotten. Something
  44. between .8 and .95 seems right.
  45. (By requiring that routers be up for an entire day to get their
  46. stability increased, instead of counting fractions of a day, we
  47. capture the notion that stability is more like "probability of being
  48. staying up for the next hour" than it is like "probability of being
  49. up at some randomly chosen time over the next hour." The former
  50. notion of stability is far more relevant for long-lived circuits.)
  51. Limitations:
  52. Authorities can have false positives and false negatives when trying to
  53. tell whether a router is up or down. So long as these aren't terribly
  54. wrong, and so long as they aren't significantly biased, we should be able
  55. to use them to estimate stability pretty well.
  56. Probing approaches like the above could miss short incidents of
  57. downtime. If we use the router's declared uptime, we could detect
  58. these: but doing so would penalize routers who reported their uptime
  59. accurately.
  60. Implementation:
  61. For now, the easiest way to store this information at authorities
  62. would probably be in some kind of periodically flushed flat file.
  63. Later, we could move to Berkeley db or something if we really had to.