1

I am working on an academic research about networks. I have proposed my model a a graph that nodes are users with commodity hardware connected to each other via internet as graph links. I know this is a weighted graph. My question is:
How can I score links based on different features such as throughput or distance between users?
I have read several papers. One of them had a figure that shows the relationship between throughput and distance with packet loss:
enter image description here
I can't understand why packet loss increases when throughput increases. Isn't throughput a positive aspect?

Edit: Is there any mathematics equation for the relationship?

Improve this question

1 Answer 1

Reset to default
2

How can I score links based on different features such as throughput or distance between users?

A common gauge is the bandwidth-distance product - since high bandwidth and long distance are somewhat equally hard to achieve and often traded off against each other, their product is a fairly good measure for the grade of achievement.

I can't understand why packet loss increases when throughput increases. Isn't throughput a positive aspect?

The graph shows the relation of packet loss to distance for some throughput scenarios. It does not show a direct relation of packet loss to throughput.

Improve this answer
2
  • Thanks for your response. As for certain distance, if we increase throughput, packet loss rate will increase. Doesn't it mean a direct relation?
    – Ali Majed HA
    Commented Aug 13, 2019 at 5:07
  • No. It all depends on the situation at hand. For wired networks, packet loss on non-congested links is zero (< 10^-12), even for dozens of km.
    – Zac67 ♦
    Commented Aug 13, 2019 at 5:14

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Not the answer you're looking for? Browse other questions tagged or ask your own question.