Skip to main content
SpringerLink
Log in

Introduction

  • Chapter
Book cover Distributed Graph Algorithms for Computer Networks

Part of the book series: Computer Communications and Networks ((CCN))

  • 2118 Accesses

Abstract

A distributed system consists of a set of computational nodes connected by a communication network that cooperate to accomplish common tasks. In this chapter, we will review the benefits of using a distributed system, the architecture of a distributed system, and the challenges facing the designers.

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 49.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 64.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 99.99
Price excludes VAT (USA)
  • Durable hardcover 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

References

  1. Akyildiz IF, Wang X, Wang W (2005) Wireless mesh networks: a survey. Comput Netw 47(4):445–487

    Article  MATH  Google Scholar 

  2. Cokuslu D, Hameurlain A, Erciyes K (2010) Grid resource discovery based on centralized and hierarchical architectures. Int J Infonomics 3(1):227–233

    Google Scholar 

  3. Foster I, Kesselman C (2004) The grid: blueprint for a new computing infrastructure. Morgan Kaufmann, San Mateo

    Google Scholar 

  4. Garey MR, Johnson DS (1978) Computers and intractability: a guide to the theory of NP-completeness. Freeman, San Francisco

    Google Scholar 

  5. Guha S, Khuller S (1998) Approximation algorithms for connected dominating sets. Algorithmica 20(4):374–387

    Article  MathSciNet  MATH  Google Scholar 

  6. History of EGI. Homepage. http://www.egi.eu/about/EGI.eu/history_of_EGI.html

  7. Mell P, Grance T (2011) The NIST definition of cloud computing. National Institute of Standards and Technology, US Dept. of Commerce, Special Publication, 800–145

    Google Scholar 

  8. Payli RP, Erciyes K, Dagdeviren O (2011) Cluster-based load balancing algorithms for grids. Int J Comput Netw Commun 3(5):253–269

    Article  Google Scholar 

  9. US National Grid Homepage. http://www.fgdc.gov/usng

Download references

Author information

Authors and Affiliations

  1. Computer Engineering Department, Izmir University, Uckuyular, Izmir, Turkey

    K. Erciyes

Authors
  1. K. Erciyes
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag London

About this chapter

Cite this chapter

Erciyes, K. (2013). Introduction. In: Distributed Graph Algorithms for Computer Networks. Computer Communications and Networks. Springer, London. https://doi.org/10.1007/978-1-4471-5173-9_1

Download citation

  • DOI: https://doi.org/10.1007/978-1-4471-5173-9_1

  • Publisher Name: Springer, London

  • Print ISBN: 978-1-4471-5172-2

  • Online ISBN: 978-1-4471-5173-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation