New answers tagged

2

While sometimes used as synonyms, to me, gossiping protocols are certain flavor of broadcast algorithms, where the message is flooded in a non-structural (commonly, random) way and spreads to the network. In contrast, a non-gossiping broadcast algorithm may, for instance, deliver the message via a (predetermined) spanning tree, rather than let the message ...


0

I think that the question has no clear answer. Data can be transferred in a synchronous or asynchronous manner. Each has its own pros and cons. Synchronous communication is irrelevant for some systems, e.g., when there is no joint clock or where the distance causes too large clock skews. Both methods are capable of transferring large amounts of data. For ...


1

Your question is somewhat unclear. In asynchronous systems we normally assume that any message will eventually be delivered after some finite time. It if perfectly feasible to write an algorithm that sends infinitly many messages: While(true): Send a message to p; If received message form p do <...> This is valid and will indeed cause infinite ...


0

RTT is defined as the time it takes for a small packet to travel from client to server and back to client. It includes queueing delay, propagation delay and packet processing delay but doesn't include transmission delay. If we talk about TCP 3-way handshake or a request packet from client to server then the size of the packet involved isn't worth counting ...


Top 50 recent answers are included