1. 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,
      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
  2. 02 Jul, 2002 1 commit
  3. 30 Jun, 2002 1 commit
  4. 26 Jun, 2002 1 commit