Optimal Broadcast Strategy in Homogeneous Point-to-Point Networks

Robledo, Franco; Rodrı́guez-Bocca, Pablo; Romero, Pablo

doi:10.1007/978-3-030-64583-0_40

Cited by 3 publications

(4 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…This observation was formally demonstrated in Robledo et al. (2020). In distributed systems, the MBT has many applications for the Internet of Things (IoT), Wireless Sensor Networks (WSNs) and Industry 4.0 (Shang et al., 2010; Hocaoğlu and Genç, 2019; Ivanova, 2019).…”

Section: Introductionsupporting

confidence: 54%

“…The main reason for this difference is that the mesh technique demanded more bandwidth, which in turn resulted in more network congestion and packet loss. This observation was formally demonstrated in Robledo et al (2020). In distributed systems, the MBT has many applications for the Internet of Things (IoT), Wireless Sensor Networks (WSNs) and Industry 4.0 (Shang et al, 2010;Hocaoglu and Genç, 2019;Ivanova, 2019).…”

Section: Introductionmentioning

confidence: 91%

See 1 more Smart Citation

A matheuristic approach for the minimum broadcast time problem using a biased random‐key genetic algorithm

Lima

Aquino

Nogueira

et al. 2022

Int Trans Operational Res

View full text Add to dashboard Cite

The Minimum Broadcast Time (MBT) is a well‐known data dissemination problem whose goal is to find a broadcast scheme that minimizes the number of steps needed to execute the broadcast operation. The problem has many applications in distributed systems and, in particular, the Industry 4.0 domain. Because Industry 4.0 applications rely primarily on the use of large‐scale machine to machine communications, they need data dissemination techniques that combine high reliability with low communication latency. This work proposes a Biased Random‐Key Genetic Algorithm and a matheuristic for the MBT. We carry out experiments with our algorithms on instances commonly used in the literature (hypercube, shuffle exchange, cube‐connected cycles, de Bruijn, Harary graphs), and also on massive synthetic instances (up to 1000 vertices), allowing to cover many possibilities of real industry topologies. Our proposal is also compared with state‐of‐the‐art exact methods and heuristics. Experimental results show that our algorithm is able to outperform the best‐known heuristics for the MBT, and also that it is a very good alternative for large instances that cannot be solved by current exact methods.

show abstract

Section: Introductionsupporting

confidence: 54%

Section: Introductionmentioning

confidence: 91%

A matheuristic approach for the minimum broadcast time problem using a biased random‐key genetic algorithm

Lima

Aquino

Nogueira

et al. 2022

Int Trans Operational Res

View full text Add to dashboard Cite

show abstract

“…The process ends when all members are informed. Robledo et al proved that the one-to-one communication is faster than a setup in which a sender may update all its neighbours simultaneously [18].…”

Section: A Classical Broadcastingmentioning

confidence: 99%

HUB-GA: A heuristic for universal lists broadcasting using genetic algorithm

Gholami

Harutyunyan

2023

J. Commun. Netw.

View full text Add to dashboard Cite

show abstract

“…A principal razão para essa diferenc ¸a é que a técnica de mesh exigia mais largura de banda, o que, por sua vez, resultava em mais congestionamento na rede e perda de pacotes. Esta observac ¸ão foi formalmente demonstrada por [Robledo et al 2020].…”

Section: Introduc ¸ãOunclassified

Um modelo de programação matemática para o problema Weighted Minimum Broadcast Time

S.¹,

Ochi²,

Nogueira³

et al. 2022

Anais Do III Workshop Brasileiro De Cidades Inteligentes (WBCI 2022)

View full text Add to dashboard Cite

Para uma cidade ser classificada como "inteligente", ela precisa ter sensores espalhados por ela. A disseminação de dados em uma rede de sensores é um dos desafios que deve ser superado. Em particular, um problema de broadcasting é o WEIGHED MINIMUM BROADCAST TIME (WMBT). O WMBT é um problema de disseminação de dados cujo objetivo é encontrar um esquema de disseminação que minimize o número de passos necessários para executar a operação de disseminação. Será apresentado uma aplicação do WMBT para o processo de atualização de firmware de dispositivos em uma rede Bluetooth. Será apresentado um modelo matemático para o WMBT. Esta proposta comparou com adaptações de heurísticas do estado-da-arte. Os resultados experimentais mostram que o modelo pode ser aplicado para resolver o WMBT.

show abstract

Optimal Broadcast Strategy in Homogeneous Point-to-Point Networks

Cited by 3 publications

References 11 publications

A matheuristic approach for the minimum broadcast time problem using a biased random‐key genetic algorithm

A matheuristic approach for the minimum broadcast time problem using a biased random‐key genetic algorithm

HUB-GA: A heuristic for universal lists broadcasting using genetic algorithm

Um modelo de programação matemática para o problema Weighted Minimum Broadcast Time

Contact Info

Product

Resources

About