I2P Address: [http://git.idk.i2p]

Skip to content
Snippets Groups Projects
  • jrandom's avatar
    b2f0d17e
    2005-04-24 jrandom · b2f0d17e
    jrandom authored and zzz's avatar zzz committed
        * Added a pool of PRNGs using a different synchronization technique,
          hopefully sufficient to work around IBM's PRNG bugs until we get our
          own Fortuna.
        * In the streaming lib, don't jack up the RTT on NACK, and have the window
          size bound the not-yet-ready messages to the peer, not the unacked
          message count (not sure yet whether this is worthwile).
        * Many additions to the messageHistory log.
        * Handle out of order tunnel fragment delivery (not an issue on the live
          net with TCP, but critical with UDP).
    and for udp stuff:
    * implemented tcp-esque rto code in the udp transport
    * make sure we don't ACK too many messages at once
    * transmit fragments in a simple (nonrandom) order so that we can more easily
      adjust timeouts/etc.
    * let the active outbound pool grow dynamically if there are outbound slots to
      spare
    * use a simple decaying bloom filter at the UDP level to drop duplicate resent
      packets.
    b2f0d17e
    History
    2005-04-24 jrandom
    jrandom authored and zzz's avatar zzz committed
        * Added a pool of PRNGs using a different synchronization technique,
          hopefully sufficient to work around IBM's PRNG bugs until we get our
          own Fortuna.
        * In the streaming lib, don't jack up the RTT on NACK, and have the window
          size bound the not-yet-ready messages to the peer, not the unacked
          message count (not sure yet whether this is worthwile).
        * Many additions to the messageHistory log.
        * Handle out of order tunnel fragment delivery (not an issue on the live
          net with TCP, but critical with UDP).
    and for udp stuff:
    * implemented tcp-esque rto code in the udp transport
    * make sure we don't ACK too many messages at once
    * transmit fragments in a simple (nonrandom) order so that we can more easily
      adjust timeouts/etc.
    * let the active outbound pool grow dynamically if there are outbound slots to
      spare
    * use a simple decaying bloom filter at the UDP level to drop duplicate resent
      packets.