有没有什么算法可以找到互联网上两个对等点之间的可用带宽？
我正在尝试开发一个程序来显示两个对等点之间的可用带宽。稍后该模块将集成到我的应用程序中，该应用程序使用 P2P 架构促进各种用户交互（聊天、桌面共享等）。
我在某个地方读到了云杉算法来查找两个对等点之间当前的可用带宽，但我不确定它是否可以使用。
是否有任何已经开发的算法可以实现这一目标？请记住架构是 P2P。
当我开始研究它时，这似乎是一个更容易的问题，但现在我意识到它比看起来要困难得多，......所以我需要经验丰富且热情的网络程序员的帮助......
提前致谢......
I am trying to develop a program which displays the available bandwidth between two peers. Later this module will be integrated in my application which facilitates various user interactions (chatting, desktop sharing etc) using P2P architecture.
Somewhere I read about Spruce algorithm to find the current available bandwidth between two peers, but I am not sure whether that can be used or not.
Is there any already developed algorithm to achieve this ? Plz remember the architecture is P2P.
this seemed an easier problem when I started working on it, but now I realize it is alot tougher than it looks,.... So I need the help of experienced and enthusiastic network programmers......
thanks in advance..
如果你对这篇内容有疑问，欢迎到本站社区发帖提问 参与讨论，获取更多帮助，或者扫码二维码加入 Web 技术交流群。
绑定邮箱获取回复消息
由于您还没有绑定你的真实邮箱，如果其他用户或者作者回复了您的评论，将不能在第一时间通知您！
发布评论
评论（2）
我能想到一个。
发送文件并计时。这是您的大约可用带宽。需要更好的近似值吗？发送更大的文件。
I can think of one.
Send a file and time it. There's your approximate available bandwidth. Need a better approximation? Send a bigger file.
我在 Stackoverflow 上发现这个帖子与您的问题有些相似。
计算可用带宽
希望您能在那里找到答案。
I found this thread on Stackoverflow that is somewhat similar to your question.
Calculating available bandwidth
Hopefully, you'll find an answer there.