We offer a fast gossiping algorithm in Square mesh in this paper. We adopt H* model and assume that apacket can only travel across one edge in each timestep.
Imagining the situation: twenty office-workers stay the whole day together but they cannot gossip at work. They work a day, a week, a month, and suddenly, their productivity and work spirit lowers, they begin to fall ...Imagining the situation: twenty office-workers stay the whole day together but they cannot gossip at work. They work a day, a week, a month, and suddenly, their productivity and work spirit lowers, they begin to fall ill and refuse to work. The reason is obvious—they miss gossiping. People like to discuss other people’s lives;moreover, they cannot live without it. Moreover, if a person reveals his or her thoughts and ideas about something personal, he/she feels better, and it stimulates such a person to work better. On the contrary, when people keep too many secrets in memory and do not share them with anyone, they can fall into depression. It is doubtful whether any business owner wants to have depressive workers. In order to analyze the problem, one should consider that gossiping is a necessary type of communication at work, can benefit the working place in many effective ways, form the good atmosphere at work. Encouraging of positive gossiping can also bring efficient results into the working process.展开更多
针对轮询和gossip 2种数据同步存在的应用局限性问题,结合快速UDP网络连接(quick UDP internet connections,QUIC)传输协议和gossip算法的特性,提出一种基于QUIC的无线自组网数据同步算法。介绍QUIC-gossip算法的核心原理、数据传输策...针对轮询和gossip 2种数据同步存在的应用局限性问题,结合快速UDP网络连接(quick UDP internet connections,QUIC)传输协议和gossip算法的特性,提出一种基于QUIC的无线自组网数据同步算法。介绍QUIC-gossip算法的核心原理、数据传输策略和动态拓扑适应性,并通过实验和性能评估进行验证。结果表明:该算法能够降低同步数据的延迟,具有鲁棒性较强、数据传输较快和适应性较强的特点,为解决无线自组网中的数据同步问题提供了一种新方法。展开更多
Gossiping is a popular technique for probabilistic reliable multicast （or broadcast）. However, it is often difficult to understand the behavior of gossiping algorithms in an analytic fashion. Indeed, existing analys...Gossiping is a popular technique for probabilistic reliable multicast （or broadcast）. However, it is often difficult to understand the behavior of gossiping algorithms in an analytic fashion. Indeed, existing analyses of gossip algorithms are either based on simulation or based on ideas borrowed from epidemic models while inheriting some features that do not seem to be appropriate for the setting of gossiping. On one hand, in epidemic spreading, an infected node typically intends to spread the infection an unbounded number of times （or rounds）; whereas in gossiping, an infected node （i.e., a node having received the message in question） may prefer to gossip the message a bounded number of times. On the other hand, the often assumed homogeneity in epidemic spreading models （especially that every node has equal contact to everyone else in the population） has been silently inherited in the gossiping literature, meaning that an expensive mcnlbership protocol is often needed for maintaining nodes＇ views. Motivated by these observations, the authors present a characterization of a popular class of fault-tolerant gossip schemes （known as ＂push-based gossiping＂） based on a novel probabilistic model, while taking the afore-mentioned factors into consideration.展开更多
文摘We offer a fast gossiping algorithm in Square mesh in this paper. We adopt H* model and assume that apacket can only travel across one edge in each timestep.
文摘Imagining the situation: twenty office-workers stay the whole day together but they cannot gossip at work. They work a day, a week, a month, and suddenly, their productivity and work spirit lowers, they begin to fall ill and refuse to work. The reason is obvious—they miss gossiping. People like to discuss other people’s lives;moreover, they cannot live without it. Moreover, if a person reveals his or her thoughts and ideas about something personal, he/she feels better, and it stimulates such a person to work better. On the contrary, when people keep too many secrets in memory and do not share them with anyone, they can fall into depression. It is doubtful whether any business owner wants to have depressive workers. In order to analyze the problem, one should consider that gossiping is a necessary type of communication at work, can benefit the working place in many effective ways, form the good atmosphere at work. Encouraging of positive gossiping can also bring efficient results into the working process.
文摘针对轮询和gossip 2种数据同步存在的应用局限性问题,结合快速UDP网络连接(quick UDP internet connections,QUIC)传输协议和gossip算法的特性,提出一种基于QUIC的无线自组网数据同步算法。介绍QUIC-gossip算法的核心原理、数据传输策略和动态拓扑适应性,并通过实验和性能评估进行验证。结果表明:该算法能够降低同步数据的延迟,具有鲁棒性较强、数据传输较快和适应性较强的特点,为解决无线自组网中的数据同步问题提供了一种新方法。
基金supported in part by the US National Science Foundation
文摘Gossiping is a popular technique for probabilistic reliable multicast （or broadcast）. However, it is often difficult to understand the behavior of gossiping algorithms in an analytic fashion. Indeed, existing analyses of gossip algorithms are either based on simulation or based on ideas borrowed from epidemic models while inheriting some features that do not seem to be appropriate for the setting of gossiping. On one hand, in epidemic spreading, an infected node typically intends to spread the infection an unbounded number of times （or rounds）; whereas in gossiping, an infected node （i.e., a node having received the message in question） may prefer to gossip the message a bounded number of times. On the other hand, the often assumed homogeneity in epidemic spreading models （especially that every node has equal contact to everyone else in the population） has been silently inherited in the gossiping literature, meaning that an expensive mcnlbership protocol is often needed for maintaining nodes＇ views. Motivated by these observations, the authors present a characterization of a popular class of fault-tolerant gossip schemes （known as ＂push-based gossiping＂） based on a novel probabilistic model, while taking the afore-mentioned factors into consideration.
