Anycast routing in timeexpanded vehicular networks Abstract   Anycast is an important type of communication pattern to deliver a message to at least one best destination node within a set of multiple potential destinations. This approach is a challenging problem due to finding the best destination or a subset of potential destination sets, especially in multihop networks. In this paper, we consider this problem of determining the minimum cost anycast path in vehicular networks with three different scenarios, which are exactlyone, atleastone and Kanycast scenario. The dynamic topology of vehicular network makes the mathematical modeling difficult. To formulate the problem on these scenarios, mixedinteger linear programming models were presented by using auxiliary timeexpanded network. Finally, the models were analyzed and the metrics were evaluated in each scenario. The results indicate that the more delivery ratio in exactlyone scenario and lower cost, hop count and delay than other scenarios.

Analytical Modeling of Survivable Anycast Communication in Optical Networks Network resources are imperfect and vulnerable to failure from a wide variety of sources. Survivability is a wellresearched field that focuses on strategies to prevent or reduce the harm inflicted when network elements fail. Solutions tend to either provision resources, such as backup paths, proactively so that traffic can be switched to the alternative route after a failure, or quickly find new resources to provision after failure event occurs. Current survivability solutions guarantee protection against these failures, but there is no mathematical model to calculate the network blocking probability for survivability solutions of anycast communication. In this paper, we developed new analytical models to calculate networkwide blocking performance for anycast survivability approaches. Performance results show that our models are accurate and are verified by extensive simulation results.