Skip to content
Snippets Groups Projects
  • Felföldi Zsolt's avatar
    b2ddb1fc
    les: implement client connection logic (#16899) · b2ddb1fc
    Felföldi Zsolt authored
    This PR implements les.freeClientPool. It also adds a simulated clock
    in common/mclock, which enables time-sensitive tests to run quickly
    and still produce accurate results, and package common/prque which is
    a generalised variant of prque that enables removing elements other
    than the top one from the queue.
    
    les.freeClientPool implements a client database that limits the
    connection time of each client and manages accepting/rejecting
    incoming connections and even kicking out some connected clients. The
    pool calculates recent usage time for each known client (a value that
    increases linearly when the client is connected and decreases
    exponentially when not connected). Clients with lower recent usage are
    preferred, unknown nodes have the highest priority. Already connected
    nodes receive a small bias in their favor in order to avoid accepting
    and instantly kicking out clients.
    
    Note: the pool can use any string for client identification. Using
    signature keys for that purpose would not make sense when being known
    has a negative value for the client. Currently the LES protocol
    manager uses IP addresses (without port address) to identify clients.
    b2ddb1fc
    History
    les: implement client connection logic (#16899)
    Felföldi Zsolt authored
    This PR implements les.freeClientPool. It also adds a simulated clock
    in common/mclock, which enables time-sensitive tests to run quickly
    and still produce accurate results, and package common/prque which is
    a generalised variant of prque that enables removing elements other
    than the top one from the queue.
    
    les.freeClientPool implements a client database that limits the
    connection time of each client and manages accepting/rejecting
    incoming connections and even kicking out some connected clients. The
    pool calculates recent usage time for each known client (a value that
    increases linearly when the client is connected and decreases
    exponentially when not connected). Clients with lower recent usage are
    preferred, unknown nodes have the highest priority. Already connected
    nodes receive a small bias in their favor in order to avoid accepting
    and instantly kicking out clients.
    
    Note: the pool can use any string for client identification. Using
    signature keys for that purpose would not make sense when being known
    has a negative value for the client. Currently the LES protocol
    manager uses IP addresses (without port address) to identify clients.