实现p2p消息广播网络的最新技术水平是什么? [英] What is the state of art on implementing a p2p message-broadcast network?

问题描述

我知道快速Google会产生大量结果，关于该主题的文献非常丰富，这就是问题所在.在所有可能的解决方案中，我不确定哪一种是最适合我的特定需求的最新选择.

I'm aware a quick Google wields tons of results and the literature on this topic is very rich, and that is exactly the problem. Among the universe of possible solutions I'm not sure which specifically is the best, up-to-date choice for my specific needs.

我正在尝试通过Internet实现p2p网络，其唯一的功能是将消息广播到在线节点.为了连接到网络，您必须能够指向现有IP.当您这样做时，您会发现一些对等端并与他们保持活动连接.然后，您可以将消息发送到其他每个节点.没有直接的通信，发送的每条消息都会被其他人接收.我希望该网络尽可能高效，并在UDP之上工作.

I'm trying to implement a p2p network over the internet with the only and one feature of broadcasting messages to online nodes. In order to connect to the network, you must be able to point to existing IPs. When you do, you discover some peers and keep an active connection with them. You then can send messages to every other node. There is no direct communication, every message sent is received by everyone else. I want this network to be as performant as possible, and work on top of UDP.

在此指定形状上解决该问题的一些先进算法的名称是什么?

What are the names of some state of art algorithms to solve this problem on the shape here specified?

推荐答案

通过Internet在覆盖网络中广播单个消息是一件相当简单的事情.您加入网络，建立邻居的随机或结构化路由表，向邻居发送消息，他们对邻居执行相同的操作，减去一些修剪以避免转发循环.

A broadcast of a single message in an overlay network over the internet is a fairly simple affair. You join the network, build a randomized or structured routing table of neighbors, flood neighbors with the message, they do the same with their neighbors, minus some pruning to avoid forwarding loops.

复杂性源于其他约束条件和要求，这些约束条件和要求因网络而异.例如.匿名设置中的信任问题，延迟优化，优化许多消息的高带宽流(p2p辅助实时视频广播)等.

Complexity arises from additional constraints and requirements which vary from network to network. E.g. trust problems in anonymous settings, latency optimizations, optimizing high-bandwidth streams of many messages (p2p-assisted live video broadcasting), etc.

这篇关于实现p2p消息广播网络的最新技术水平是什么?的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！