简体繁体 English

Bittorrent Tracker更新？

[英]Bittorrent Tracker Update?

原文 2012-08-19 16:53:15 3 1 bittorrent/ tracker

In a bittorrent client the first response from the tracker will contain a list of peers. 在bittorrent客户端中，跟踪器的第一个响应将包含对等方列表。 When the tracker is contacted for an update after the first response, will any of the peers sent in the second response be the same as in the first response? 在第一个响应后联系跟踪器进行更新时，第二个响应中发送的任何对等方是否与第一个响应中的对等方相同？

The reason I ask is that I don't want to waste time checking whether any of the peers in the new list are the same as the new list. 我问的原因是，我不想浪费时间检查新列表中的任何同位体是否与新列表相同。

Thanks in advance 提前致谢

1 个解决方案

Trackers generally should send a randomly selected subset of all peers they know for that swarm. 跟踪者通常应向该群发送他们知道的所有对等点的随机选择的子集。 Actual implementations differ, eg they might move a window over a long list of peers for efficiency reasons or they might inject fake peers to provide plausible deniability. 实际的实现方式有所不同，例如，出于效率考虑，它们可能会在较长的对等方列表上移动窗口，或者可能会注入伪造的对等方以提供合理的可否认性。

If the swarm size is low enough to fit into the numwant limit then they'll return the entire swarm. 如果群的大小足够小以适合numwant限制，那么他们将返回整个群。

But even if you get the entire swarm the set of returned peers still may differ simply due to new arrivals/departures. 但是，即使您获得了全部蜂拥，返回的同伴的集合也可能仅由于新到达/离开而有所不同。

And you also want to contact the tracker to keep yourself in their list, as you entry will expire eventually. 而且，您还想与跟踪器联系以将自己保留在他们的列表中，因为您的输入将最终失效。

Long story short: There may be anywhere between 0 and 100% overlap between the returned sets. 长话短说：返回的集合之间可能有0到100％的重叠部分。

Simply store your stuff in hash/set data structures and you'll be fine. 只需将您的东西存储在哈希/集合数据结构中，您就可以了。