10 releases
0.2.12 | Feb 24, 2024 |
---|---|
0.2.11 | Feb 18, 2024 |
0.2.4 | Jan 19, 2024 |
0.1.0 |
|
#1183 in Network programming
337 downloads per month
165KB
3K
SLoC
Motivation
- Project motivation is to simplify application code development in the area of network communication. With focus on performance and ergonomics.
How does it simplify?
-
Traditionally, network api provide methods that exposes access to very low level
byte arrays
of data where as an application layer prefers to work withstruct
s which carry information about application state. -
Rust's std::net module is not an exception and it leaves developer with the responsibility to interpret the
byte array
by performing a number of steps to extract a single frame of bytes from that array, convert it into a desired data structure, while keeping track of remaining bytes and managing a lot of other details. The implementation details here have direct impact on application performance and reliability. -
Even once those details have been addressed, the developer has to solve for many additional tasks such as:
- How to handle partial reads?
- Can i split read and write between different threads?
- If i do split reads into a separate thread, can i use a single thread to manage all reads?
- ... etc, etc
-
This library addresses above challenges, while providing a highly performant network code without imposing limitations on how application wishes to use the api.
Please tell me more
-
At a very high level The main concept is based on the the following two
struct
uresClt
- this is a network client and can initiate a connectionSvc
- this is a network service which listens to a port and creates aClt
for each established connection- Both
Clt
andSvc
then provide andsend
andrecv
methods with a signature that roughly looks like this:Clt::send(msg: &T)
vsClt::recv() -> T
- whereT
is a generic type that you specify when instantiating aClt
andSvc
-
There are three implementations of this library. Follow individual links for more details
- nonblocking - this implementation is most complete at the moment and its
send()
/recv()
methods take atimeout
argument. This allows the application developer to setio
wait limits. The internal implementation relies onspin
locks and waits to providebest
latency performance as it does not letOS
to park the running thread, which incurs significant latency penalty. This implementation is recommended for cases withlow latency
performance requirement. - blocking - this implementation is simplest to use as all method calls work sequentially by blocking until the operation completes. The ease of use comes at the cost of performance and scalability. This implementation is recommended for your typical network loads.
- async - this implementation is based on Rust's
async
/await
tokio
framework, however, at the moment of this writing Rust's async api is still going through stabilization and is not yet available onstable
toolchain.
- nonblocking - this implementation is most complete at the moment and its
Dependencies
~1.5MB
~26K SLoC