1. 14 Feb, 2003 1 commit
  2. 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.
      
      
      svn:r152
      c35373a2
  3. 31 Dec, 2002 1 commit
  4. 27 Nov, 2002 1 commit
  5. 24 Nov, 2002 1 commit
  6. 23 Nov, 2002 2 commits
  7. 13 Oct, 2002 1 commit
  8. 02 Oct, 2002 2 commits
  9. 01 Oct, 2002 1 commit
  10. 28 Sep, 2002 2 commits
  11. 26 Sep, 2002 2 commits
  12. 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
      
      
      svn:r110
      253f0f16
  13. 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.
      
      
      svn:r107
      155c9b80
  14. 21 Sep, 2002 1 commit
  15. 04 Sep, 2002 1 commit
  16. 03 Sep, 2002 2 commits
  17. 24 Aug, 2002 1 commit
  18. 23 Aug, 2002 1 commit
  19. 22 Aug, 2002 1 commit
  20. 22 Jul, 2002 1 commit
  21. 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.
      
      
      svn:r56
      21478985
    • 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.
      
      
      svn:r54
      267434bd
  22. 16 Jul, 2002 3 commits
    • Roger Dingledine's avatar
      new link padding scheme · ccdef66b
      Roger Dingledine authored
      we're now much more robust when bandwidth varies: instead of forcing a
      fixed bandwidth on the link, we instead use what the link will give us,
      up to our bandwidth.
      
      
      svn:r53
      ccdef66b
    • Roger Dingledine's avatar
      new config files, some bugfixes · c951c6f1
      Roger Dingledine authored
      
      svn:r51
      c951c6f1
    • 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,
      Mat?)
      
      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.
      
      
      svn:r50
      117cbeea
  23. 12 Jul, 2002 2 commits
  24. 10 Jul, 2002 1 commit
  25. 08 Jul, 2002 1 commit
    • Roger Dingledine's avatar
      put in the support for 'router twins' · 0a3da3ae
      Roger Dingledine authored
      basically, a twin is a router which is different except it shares
      the same keypair. so in cases where we want to find a "next router"
      and all we really care is that it can decrypt the next onion layer,
      then a twin is just as good.
      
      we still need to decide how to mark twins in the routerinfo_t and in
      the routers config file.
      
      
      svn:r30
      0a3da3ae
  26. 05 Jul, 2002 1 commit
  27. 03 Jul, 2002 1 commit
  28. 02 Jul, 2002 1 commit
    • Roger Dingledine's avatar
      Integrated onion proxy into or/ · d9829255
      Roger Dingledine authored
      The 'or' process can now be told (by the global_role variable) what
      roles this server should play -- connect to all ORs, listen for ORs,
      listen for OPs, listen for APs, or any combination.
      
      * everything in /src/op/ is now obsolete.
      * connection_ap.c now handles all interactions with application proxies
      * "port" is now or_port, op_port, ap_port. But routers are still always
        referenced (say, in conn_get_by_addr_port()) by addr / or_port. We
        should make routers.c actually read these new ports (currently I've
        kludged it so op_port = or_port+10, ap_port=or_port+20)
      * circuits currently know if they're at the beginning of the path because
        circ->cpath is set. They use this instead for crypts (both ways),
        if it's set.
      * I still obey the "send a 0 back to the AP when you're ready" protocol,
        but I think we should phase it out. I can simply not read from the AP
        socket until I'm ready.
      
      I need to do a lot of cleanup work here, but the code appears to work, so
      now's a good time for a checkin.
      
      
      svn:r22
      d9829255
  29. 30 Jun, 2002 1 commit
  30. 26 Jun, 2002 1 commit