Codes for distributed storage from 3-regular graphs

Gao, Shuhong; Knoll, Fiona; Manganiello, Felice; Matthews, Gretchen L.

doi:10.1016/j.dam.2017.04.014

Search citation statements

Order By: Relevance

Paper Sections

Select...

Integrity Of Cage Graphs1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2023

Publication Types

Select...

Article1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

(1 citation statement)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Regarding cage graphs, there are some nonisomorphic instances for some given (r, g), such as 18 of them for (3, 9), 3 of them for (3,10), and 4 of them for (5,5), where all the first numbers ones the same integrity (24), while all the second numbers one the same integrity of 28. However, one instance, the third one, has an integrity of 19, whereas the other three have an integrity of 18 [34].…”

Section: Integrity Of Cage Graphsmentioning

confidence: 97%

Edge Data Center Organization and Optimization by Using Cage Graphs

Roig

Alcaraz

Gilly

et al. 2023

Network

View full text Add to dashboard Cite

Data center organization and optimization are increasingly receiving attention due to the ever-growing deployments of edge and fog computing facilities. The main aim is to achieve a topology that processes the traffic flows as fast as possible and that does not only depend on AI-based computing resources, but also on the network interconnection among physical hosts. In this paper, graph theory is introduced, due to its features related to network connectivity and stability, which leads to more resilient and sustainable deployments, where cage graphs may have an advantage over the rest. In this context, the Petersen graph cage is studied as a convenient candidate for small data centers due to its small number of nodes and small network diameter, thus providing an interesting solution for edge and fog data centers.

show abstract