Theoretical Notes on Regular Graphs as Applied to Optimal Network Design

Patil, Sanket; Srinivasa, Srinath

doi:10.1007/978-3-642-11659-9_26

Cited by 1 publication

(1 citation statement)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In that light, this work has lead to at least three future directions: (1) identifying structural signatures from the optimal networks that emerge, which can be used by autonomous agents to snap or quickly (re)construct networks in the face of perturbations (2) developing efficient deterministic techniques to construct topologies that are equivalent to the optimal circular skip lists (3) developing theoretical results that can provide guarantees about CSLs in the phase of perturbations [23].…”

Section: Future Directionsmentioning

confidence: 99%

Classes of optimal network topologies under multiple efficiency and robustness constraints

Patil

Srinivasa

Venkatasubramanian

2009

2009 IEEE International Conference on Systems, Man and Cybernetics

Self Cite

View full text Add to dashboard Cite

We address the problem of designing optimal network topologies under arbitrary optimality requirements. Using three critical system parameters, efficiency, robustness and cost, we evolve optimal topologies under different environmental conditions. Two prominent classes of topologies emerge as optimal: (1) Star-like topologies, with high efficiency, high resilience to random failures and low cost, and (2) "Circular Skip Lists" (CSL), with high robustness to random failures as well as targeted attacks, and high efficiency at moderate cost. We analyze CSLs to observe that they show several structural motifs that are optimal with respect to a variety of metrics.

show abstract

Section: Future Directionsmentioning

confidence: 99%