最少呼叫下最少谣传时间的一个上界

An Upper Bound For Least Gossip Time With Least Calls

谣传是将信息按一定的约束条件传递,最终使网络的每个结点都得到网络所有信息的信息传递方式. 呼叫次数和谣传时间是谣传网络的两个重要指标,本文给出一个在最少呼叫条件下最少谣传时间的上界.

Gossiping is a message propagating process over a network whereby each node knows a unique item of information and needs to communicate it to every one else. In this paper, an upper bound for the least gossip time with least calls is presented.