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][Hide abstract] ABSTRACT: As societies shift to “greener” means of transportation using electricity-driven vehicles one critical challenge we face is the creation of a robust and resilient infrastructure of recharging stations. A particular issue here is the optimal location of service stations. In this work, we consider the placement of battery replacing service station in a city network for which the normal traffic flow is known. For such known traffic flow, the service stations are placed such that the expected performance is maximized without changing the traffic flow. This is done for different scenarios in which roads, road junctions and service stations can fail with a given probability. To account for such failure probabilities, the previously developed facility interception model is extended. Results show that service station failures have a minimal impact on the performance following robust placement while road and road junction failures have larger impacts which are not mitigated easily by robust placement.
Resilient Control Systems (ISRCS), 2011 4th International Symposium on; 09/2011
[Show abstract][Hide abstract] ABSTRACT: Although regular graphs have a long history, some of their properties such as diameter, symmetry, extensibility and resilience
do not seem to have received enough attention in the context of network design. The purpose of this paper is to present some
interesting theoretical results concerning regular graphs pertinent to optimal network design.
Distributed Computing and Internet Technology, 6th International Conference, ICDCIT 2010, Bhubaneswar, India, February 15-17, 2010. Proceedings; 01/2010
Note: This list is based on the publications in our database and might not be exhaustive.
Data provided are for informational purposes only. Although carefully collected, accuracy cannot be guaranteed. The impact factor represents a rough estimation of the journal's impact factor and does not reflect the actual current impact factor. Publisher conditions are provided by RoMEO. Differing provisions from the publisher's actual policy or licence agreement may be applicable.