Update Networks and Their Routing Strategies

Michael J. Dinneen, Bakhadyr Khoussainov. Update Networks and Their Routing Strategies. In Ulrik Brandes, Dorothea Wagner, editors, Graph-Theoretic Concepts in Computer Science, 26th International Workshop, WG 2000, Konstanz, Germany, June 15-17, 2000, Proceedings. Volume 1928 of Lecture Notes in Computer Science, pages 127-136, Springer, 2000. [doi]


We introduce the notion of update networks to model communication networks with infinite duration. In our formalization we use bipartite finite graphs and game-theoretic terminology as an underlying structure. For these networks we exhibit a simple routing procedure to update information throughout the nodes of the network. We also introduce an hierarchy for the class of all update networks and discuss the complexity of some natural problems.