-
Notifications
You must be signed in to change notification settings - Fork 3
Latency Module #1
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
base: master
Are you sure you want to change the base?
Conversation
|
Hey Rizvi! Looks pretty good. Do you have the counterpart for the receiving end as well? Did you run this and compared the number of responses (I suspect that a bigger payload leads to a lower fraction of responding hosts, but I think with this we are still below that limit). In another version of this (at https://github.com/Woutifier/verfploeter) I've also included an HMAC in the packet payload to detect any tampering. Maybe interesting to also bring that into version. |
|
It's also possible to optimize (reduce) the number of bytes used for the latency, as we don't really need to know how many nanoseconds passed since the unix epoch, but rather the number of milliseconds (or microseconds) since the echo request was sent which was most likely within the past hour or so. Maybe not necessary for this version, but something to keep in mind. |
|
Hi Wouter, Sorry for the late reply, somehow I missed it. I actually did not find any significant difference in the number of replies. I will check it and will let you know the exact number. |
|
Hello @Woutifier, |
|
Nice sounds good! |
|
let me know when you want me to merge this! |
This will add 16 bytes additional payload to find the latency. The idea is to attach the current timestamp and destination IP with the payload. We can use the payload timestamp and packet capture timestamp to find the latency. The destination is useful to match the actual target IP and evaluate any address translation.