The Euclidean definition of the functions div and mod
ACM Transactions on Programming Languages and Systems (TOPLAS)
Fast gossiping for the hypercube
SIAM Journal on Computing
SIAM Journal on Computing
An Introduction to Perpetual Gossiping
ISAAC '93 Proceedings of the 4th International Symposium on Algorithms and Computation
Time Bound for Broadcasting in Bounded Degree Graphs
WG '89 Proceedings of the 15th International Workshop on Graph-Theoretic Concepts in Computer Science
Dissemination of Information in Communication Networks: Broadcasting, Gossiping, Leader Election, and Fault-Tolerance (Texts in Theoretical Computer Science. An EATCS Series)
A hybrid approach to modeling end-to-end delay in P2P networks
Proceedings of the 2010 ACM workshop on Advanced video streaming techniques for peer-to-peer networks and social networking
An intelligent agent-based distributed architecture for Smart-Grid integrated network management
LCN '10 Proceedings of the 2010 IEEE 35th Conference on Local Computer Networks
Modeling the routing of an autonomous system with C-BGP
IEEE Network: The Magazine of Global Internetworking
| Hi-index | 0.00 |
Hypercube gossiping facilitates highly efficient data dissemination for a wide range of applications whereat live streaming, not limited to multimedia, marks the periodic exchange of data. Uses of periodic hypercube gossiping range from the estimation of system state vectors, such as object tracking or real-time business intelligence to audio communication. In such real-time applications, the ability to bound latency is of vital importance. Traversal time denotes the multi-hop latency between sending a data packet from a source node of the overlay network and receiving it at the destination node. It depends on the abstract communication complexity of the network topology, the physical properties of the underlay network, and last but not least, the timing mode employed in the algorithmic implementation of the high-level gossiping communication scheme. In this paper, we analyze the magnitude of worst-case latency for periodic gossiping in F1 mode on a binary hypercube overlay network. We show that, due to wait delay caused by data sojourning at intermediate overlay nodes, it is highly dependent on the timing or synchronization of the communication. We present four basic timing modes and derive worst case wait latency and traversal time bounds and compare these analytic measures to results from a simulation with a life-like network delay distribution derived from large-scale latency measurements.