| Commit message (Expand) | Author | Age |
|---|
| * | bugfix: make onion proxies actually obey their requested bandwidth•••svn:r229
| Roger Dingledine | 2003-04-08 |
| * | Add magic to end of C files to make emacs happy; split test invocation into s...•••svn:r224
| Nick Mathewson | 2003-04-07 |
| * | Fix op handshake for longer keys•••svn:r200
| Nick Mathewson | 2003-03-19 |
| * | cleanup and a variety of bugfixes•••svn:r132
| Roger Dingledine | 2002-10-02 |
| * | cleanup•••prkey is only fetched when it's needed
tor nodes who aren't dirservers now fetch directories and autoconnect
to new nodes listed in the directory
default role is a non-dirserver node
svn:r120
| Roger Dingledine | 2002-09-28 |
| * | OP was hanging on first try if connect finishes too quickly•••svn:r105
| Roger Dingledine | 2002-09-20 |
| * | fixed the killer bug with onion proxies•••svn:r95
| Roger Dingledine | 2002-09-04 |
| * | resolve warnings•••svn:r89
| Roger Dingledine | 2002-09-03 |
| * | cleanup: start enforcing hton and ntoh on stuff sent over the network•••this is a checkpoint before i fix the fact that port is always kept in
network order -- which makes no sense, because network order is different
on different machines, which is the whole point.
svn:r81
| Roger Dingledine | 2002-08-24 |
| * | Changed crypto calls to go through common/crypto.[hc] instead of calling Open...•••svn:r76
| Matej Pjafjar | 2002-08-22 |
| * | Implemented congestion control•••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
| Roger Dingledine | 2002-07-18 |
| * | Implemented link padding and receiver token buckets•••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
| Roger Dingledine | 2002-07-16 |
| * | general cleanup•••svn:r29
| Roger Dingledine | 2002-07-05 |
| * | made 'app' connection be 'exit' connection•••general cleanup, particularly in buffers.c
svn:r17
| Roger Dingledine | 2002-06-30 |
| * | Initial revision•••svn:r2
| Roger Dingledine | 2002-06-26 |