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