Broadcast Graphs with Nodes of Limited Memory

Gholami, Saber; Harutyunyan, Hovhannes A.

doi:10.1007/978-3-031-17658-6_3

Cited by 4 publications

(6 citation statements)

References 30 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…5(b) and (d), it is concluded that the Fully-adaptive model is the quickest model among all. This idea also has been proved before [11]. Broadcasting under this model is also affected less than two other models when changing |p|.…”

Section: A Experimentssupporting

confidence: 63%

“…They also developed upper bounds for complete graphs and hypercubes under nonadaptive models. The optimal broadcast time of hypercubes under the fully-adaptive model is established in [11]. Also, a general upper bound on arbitrary graphs as well as a tight lower bound for trees under the non-adaptive model were presented in [48].…”

Section: B Broadcasting With Universal Listsmentioning

confidence: 99%

“…2) Working for arbitrary graphs: the proposed framework takes an arbitrary graph as the input and finds a nearly optimal broadcast scheme for that particular graph, that is, the structure of the graph and its features are not utilized in any step of HUB-GA. This is a huge advantage since all upper bounds provided in the literature (such as [10], [11], [15], [46]- [48]) are tailored for a specific family of networks. 3) Working for any model under universal lists: our heuristic could minimize its objective function (either f 1 or f 2 ) under all three models: non-adaptive, adaptive, or fully adaptive.…”

Section: G Remarksmentioning

confidence: 99%

“…3) Working for any model under universal lists: our heuristic could minimize its objective function (either f 1 or f 2 ) under all three models: non-adaptive, adaptive, or fully adaptive. To the best of our knowledge, this novelty separates HUB-GA from several related works considering a specific model; either classical [4], [32], [33], [36]- [40], [94], [95], non-adaptive [10], [46]- [48], adaptive [10], [45], or fully-adaptive [11], [15].…”

Section: G Remarksmentioning

confidence: 99%

“…The problem of broadcasting with universal list has several applications and could be applied to different networks, such as software defined networks (SDNs) [11]. The SDN environment and its related algorithms have attracted both academia and industrial communities in recent years [12]- [14].…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations