1. 18 Feb, 2003 1 commit
    • Roger Dingledine's avatar
      · 1714ea2a
      Roger Dingledine authored
      Bugfixes and enhancements in sendmes and dns farm
  2. 14 Feb, 2003 1 commit
  3. 06 Feb, 2003 2 commits
  4. 26 Jan, 2003 1 commit
    • Roger Dingledine's avatar
      major overhaul: dns slave subsystem, topics · c35373a2
      Roger Dingledine authored
      on startup, it forks off a master dns handler, which forks off dns
      slaves (like the apache model). slaves as spawned as load increases,
      and then reused. excess slaves are not ever killed, currently.
      implemented topics. each topic has a receive window in each direction
      at each edge of the circuit, and sends sendme's at the data level, as
      per before. each circuit also has receive windows in each direction at
      each hop; an edge sends a circuit-level sendme as soon as enough data
      cells have arrived (regardless of whether the data cells were flushed
      to the exit conns). removed the 'connected' cell type, since it's now
      a topic command within data cells.
      at the edge of the circuit, there can be multiple connections associated
      with a single circuit. you find them via the linked list conn->next_topic.
      currently each new ap connection starts its own circuit, so we ought
      to see comparable performance to what we had before. but that's only
      because i haven't written the code to reattach to old circuits. please
      try to break it as-is, and then i'll make it reuse the same circuit and
      we'll try to break that.
  5. 31 Dec, 2002 1 commit
  6. 03 Dec, 2002 1 commit
  7. 27 Nov, 2002 1 commit
  8. 24 Nov, 2002 1 commit
  9. 23 Nov, 2002 2 commits
  10. 02 Oct, 2002 3 commits
  11. 01 Oct, 2002 1 commit
  12. 28 Sep, 2002 3 commits
  13. 26 Sep, 2002 2 commits
  14. 24 Sep, 2002 1 commit
    • Roger Dingledine's avatar
      laying the groundwork for dynamic router lists · 253f0f16
      Roger Dingledine authored
      revamped the router reading section
      reference counting for crypto pk env's (so we can dup them)
      we now read and write pem pk keys from string rather than from FILE*,
        in anticipation of fetching directories over a socket
        (so now on startup we slurp in the whole file, then parse it as a string)
      fixed a bug in the proxy side, where you could get some circuits
        wedged if they showed up while the connection was being made
  15. 23 Sep, 2002 1 commit
  16. 22 Sep, 2002 1 commit
    • Roger Dingledine's avatar
      onion proxy now speaks socks4a · 155c9b80
      Roger Dingledine authored
      httpap is obsolete; we support privoxy directly now!
      smtpap is obsolete; need to find a good socks4a-enabled smtp proxy/client
      I dub thee 0.0.1.
  17. 21 Sep, 2002 1 commit
  18. 19 Sep, 2002 1 commit
  19. 17 Sep, 2002 1 commit
  20. 10 Sep, 2002 1 commit
  21. 09 Sep, 2002 1 commit
    • Roger Dingledine's avatar
      port to actual BSD · 958ec8d4
      Roger Dingledine authored
      (hey nick, does this break the os x build?)
      you still need to add some stuff to the ./configure commandline...
      anybody know a better solution?
  22. 04 Sep, 2002 1 commit
  23. 03 Sep, 2002 1 commit
  24. 24 Aug, 2002 2 commits
  25. 22 Aug, 2002 1 commit
  26. 19 Jul, 2002 1 commit
  27. 18 Jul, 2002 2 commits
    • Roger Dingledine's avatar
      Implemented router twins · 21478985
      Roger Dingledine authored
      I modified new_route so we don't pick twins back-to-back in the path.
      I also had to patch my previous uses of connection_twin_get_by_addr_port()
      because they assumed that "addr" and "port" would be the same for a twin
      as for the original router.
    • Roger Dingledine's avatar
      Implemented congestion control · 267434bd
      Roger Dingledine authored
      Servers are allowed to send 100 cells initially, and can't send more until
      they receive a 'sendme' cell from that direction, indicating that they
      can send 10 more cells. As it currently stands, the exit node quickly
      runs out of window, and sends bursts of 10 whenever a sendme cell gets
      to him. This is much much much faster (and more flexible) than the old
      "give each circuit 1 kB/s and hope nothing overflows" approach.
      Also divided out the connection_watch_events into stop_reading,
      start_writing, etc. That way we can control them separately.
  28. 16 Jul, 2002 1 commit
    • Roger Dingledine's avatar
      Implemented link padding and receiver token buckets · 117cbeea
      Roger Dingledine authored
      Each socket reads at most 'bandwidth' bytes per second sustained, but
      can handle bursts of up to 10*bandwidth bytes.
      Cells are now sent out at evenly-spaced intervals, with padding sent
      out otherwise. Set Linkpadding=0 in the rc file to send cells as soon
      as they're available (and to never send padding cells).
      Added license/copyrights statements at the top of most files.
      router->min and router->max have been merged into a single 'bandwidth'
      value. We should make the routerinfo_t reflect this (want to do that,
      As the bandwidth increases, and we want to stop sleeping more and more
      frequently to send a single cell, cpu usage goes up. At 128kB/s we're
      pretty much calling poll with a timeout of 1ms or even 0ms. The current
      code takes a timeout of 0-9ms and makes it 10ms. prepare_for_poll()
      handles everything that should have happened in the past, so as long as
      our buffers don't get too full in that 10ms, we're ok.
      Speaking of too full, if you run three servers at 100kB/s with -l debug,
      it spends too much time printing debugging messages to be able to keep
      up with the cells. The outbuf ultimately fills up and it kills that
      connection. If you run with -l err, it works fine up through 500kB/s and
      probably beyond. Down the road we'll want to teach it to recognize when
      an outbuf is getting full, and back off.
  29. 11 Jul, 2002 2 commits
  30. 10 Jul, 2002 1 commit