Skip to main content
SpringerLink
Log in

Update Networks and Their Routing Strategies

  • Conference paper
  • First Online:
Graph-Theoretic Concepts in Computer Science (WG 2000)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1928))

Included in the following conference series:

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M.J. Dinneen and B. Khoussainov. Update Games and Update Networks. Proceedings of the Tenth Australasian Workshop on Combinatorial Algorithms, AWOCA’99. R. Raman and J. Simpson, Eds. Pages 7–18, August, 1999.

    Google Scholar 

  2. R. McNaughton. Infinite games played on finite graphs. Annals of Pure and Applied Logic 65 (1993), 149–184.

    Article  MATH  MathSciNet  Google Scholar 

  3. A. Nerode, J. Remmel and A. Yakhnis. McNaughton games and extracting strategies for concurrent programs. Annals of Pure and Applied Logic 78 (1996), no. 1-3, 203–242.

    Article  MATH  MathSciNet  Google Scholar 

  4. R.J. Büchi and L.H Landweber. Solving sequential conditions by finite-state strategies. Trans. Amer. Math. Soc. 138 (1969), 295–311.

    Article  MathSciNet  Google Scholar 

  5. T.J. Schäfer. Complexity of some two-person perfect-information games. J. Computer & System Sciences 16 (1978), 185–225.

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Auckland, Auckland, New Zealand

    Michael J. Dinneen & Bakhadyr Khoussainov

Authors
  1. Michael J. Dinneen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Bakhadyr Khoussainov
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer and Information Science, University of Konstanz, Box D 188, 78457, Konstanz, Germany

    Ulrik Brandes  & Dorothea Wagner  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dinneen, M.J., Khoussainov, B. (2000). Update Networks and Their Routing Strategies. In: Brandes, U., Wagner, D. (eds) Graph-Theoretic Concepts in Computer Science. WG 2000. Lecture Notes in Computer Science, vol 1928. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-40064-8_13

Download citation

  • DOI: https://doi.org/10.1007/3-540-40064-8_13

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41183-3

  • Online ISBN: 978-3-540-40064-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation