Algorithm Design for Networked Information Technology Systems

Author:   Sumit Ghosh ,  C.V. Ramamoorthy
Publisher:   Springer-Verlag New York Inc.
Edition:   2004 ed.
ISBN:  

9780387955445


Pages:   403
Publication Date:   18 November 2003
Format:   Hardback
Availability:   In Print   Availability explained
This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us.

Our Price $287.76 Quantity:  
Add to Cart

Share |

Algorithm Design for Networked Information Technology Systems


Add your own review!

Overview

This book presents a scientific theory of Networked information technology (NIT) systems and logically develops the fundamental principles to help synthesize control and coordination algorithms for these systems. The algorithms described are asynchronous, distributed decision-making (ADDM) algorithms, and their characteristics include correct operation, robustness, reliability, scalability, stability, survivability, and performance. The book explains through case studies the conception, development, experimental testing, validation, and rigorous performance analysis of practical ADDM algorithms for real-world systems from a number of diverse disciplines. Practitioners, professionals, and advanced students will find the book an authoritative resource for the design and analysis of NIT systems algorithms. Topics and features:Develops a logical and practical approach to synthesizing ADDM algorithms for NIT systems Utilizes a scientific method to address the design & testing of NIT systems Incorporates case studies to clearly convey principles and real-world applications Provides a full context for engineers who design, build, deploy, maintain, and refine network-centric systems spanning many human activities Offers background on core principles underlying the nature of network-centric systems

Full Product Details

Author:   Sumit Ghosh ,  C.V. Ramamoorthy
Publisher:   Springer-Verlag New York Inc.
Imprint:   Springer-Verlag New York Inc.
Edition:   2004 ed.
Dimensions:   Width: 15.50cm , Height: 2.50cm , Length: 23.50cm
Weight:   0.871kg
ISBN:  

9780387955445


ISBN 10:   0387955445
Pages:   403
Publication Date:   18 November 2003
Audience:   Professional and scholarly ,  Adult education ,  College/higher education ,  Professional & Vocational ,  Further / Higher Education
Format:   Hardback
Publisher's Status:   Active
Availability:   In Print   Availability explained
This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us.

Table of Contents

The Nature, Fundamental Characteristics, and Philosophical Implications of ADDM Algorithms.- Case Studies: Synthesis of ADDM Algorithms for Real-World Systems.- Debugging Network-Centric Systems.- Proofs of Correctness of ADDM Algorithms.- A Mathematical Framework for Synthesizing ADDM Algorithms.- Performance Analysis of ADDM Algorithms.- Stability of ADDM Algorithms.- The Need and Art of Interdisciplinary Thinking.- The Future of ADDM Algorithms.

Reviews

Author Information

Tab Content 6

Author Website:  

Customer Reviews

Recent Reviews

No review item found!

Add your own review!

Countries Available

All regions
Latest Reading Guide

MRG2025CC

 

Shopping Cart
Your cart is empty
Shopping cart
Mailing List