Dynamic multiple-message broadcast

Dariusz R. Kowalski, Miguel A. Mosteiro, Tevin Rouse
2014 Proceedings of the 10th ACM international workshop on Foundations of mobile computing - FOMC '14  
Introduction Dynamic Multiple-Message Broadcast (MMB) [1]: problem: packets arrive at nodes continuously, to be delivered to all nodes metric: competitive throughput of deterministic distributed MMB algorithms analysis: in general Affectance model: Affectance subsumes many communication-interference models e.g. RN and SINR models conceptual idea: parameterize interference from transmitting nodes into links introduced [2,3,4] for link scheduling as link-to-link affectance [1] (non-dynamic MMB)
more » ... abbazian-Kowalski PODC 2011 [2] Halldórsson-Wattenhofer, ICALP 2009 [3] Kesselheim, PODC 2012 [4] Kesselheim-Vöcking, DISC 2010 M. A. Mosteiro Dynamic Multiple-Message Broadcast 2/13 Introduction Contributions: we introduce new model characteristics: (based on comm network, affectance function, and a chosen BFS tree) maximum average tree-layer affectance K maximum fast-paths affectance M we show how characteristics influence broadcast time complexity: if one uses a specific BFS tree (GBST [1]) that minimizes M(K + M) single broadcast can be done in time D + O(M(K + M) log 3 n) we extend this to dynamic packet arrival model and the MMB problem: new algorithm reaching throughput of Ω(1/(αK log n))
doi:10.1145/2634274.2634279 dblp:conf/dialm/KowalskiMR14 fatcat:nlacfg7boze63nufnspnq4bja4