Tanenbaum, Andrew S., <br/><br/>
Distributed systems :   principles and paradigms /  
Andrew S. Tanenbaum, Maarten Van Steen. 
 - 2nd ed. 
 - New Delhi :  Pearson Prentice Hall,  2009 
 - 704 p.  ill. ;  25 cm. 
<br/><br/> includes index 
<br/><br/>CONTENTS<br/>1 INTRODUCTION 1 <br/>1.1 DEFINITION OF A DISTRIBUTED SYSTEM 2 <br/>1.2 GOALS 3 <br/>1.2.1 Making Resources Accessible 3 <br/>1.2.2 Distribution Transparency 4 <br/>1.2.3 Openness 7 <br/>1.2.4 Scalability 9 <br/>1.2.5 Pitfalls 16 <br/>1.3 TYPES OF DISTRIBUTED SYSTEMS 17 <br/>1.3.1 Distributed Computing Systems 17 <br/>1.3.2 Distributed Information Systems 20 <br/>1.3.3 Distributed Pervasive Systems 24 <br/>1.4 SUMMARY 30 <br/>2 ARCHITECTURES 33 <br/>2.1 ARCHITECTURAL STYLES 34 <br/>2.2 SYSTEM ARCHITECTURES 36 <br/>2.2.1 Centralized Architectures 36 <br/>2.2.2 Decentralized Architectures 43 <br/>2.2.3 Hybrid Architectures 52 <br/>2.3 ARCHITECTURES VERSUS MIDDLEWARE 54 <br/>2.3.1 Interceptors 55 <br/>2.3.2 General Approaches to Adaptive Software 57 <br/>2.3.3 Discussion 58 <br/>vii <br/>viii CONTENTS <br/>2.4 SELF-MANAGEMENT IN DISTRIBUTED SYSTEMS 59 <br/>2.4.1 The Feedback Control Model 60 <br/>2.4.2 Example: Systems Monitoring with Astrolabe 62 <br/>2.4.3 Example: Differentiating Replication Strategies in Globule 63 <br/>2.4.4 Example: Automatic Component Repair Management in Jade 65 <br/>2.5 SUMMARY 66 <br/>3 PROCESSES 69 <br/>3.1 THREADS 70 <br/>3.1.1 Introduction to Threads 70 <br/>3.1.2 Threads in Distributed Systems 75 <br/>3.2 VIRTUALIZATION 79 <br/>3.2.1 The Role of Virtualization in Distributed Systems 79 <br/>3.2.2 Architectures of Virtual Machines 80 <br/>3.3 CLIENTS 82 <br/>3.3.1 Networked User Interfaces 82 <br/>3.3.2 Client-Side Software for Distribution Transparency 87 <br/>3.4 SERVERS 88 <br/>3.4.1 General Design Issues <br/>3.4.2 Server Clusters 92 <br/>3.4.3 Managing Server Clusters 98 <br/>3.5 CODE MIGRATION 103 <br/>3.5.1 Approaches to Code Migration 103 <br/>3.5.2 Migration and Local Resources 107 <br/>3.5.3 Migration in Heterogeneous Systems 110 <br/>3.6 SUMMARY 112 <br/>4 COMMUNICATION 115 <br/>4.1FUNDAMENTALS116<br/>4.1.1 Layered Protocols 116 <br/>4.1.2 Types of Communication 124 <br/>4.2 REMOTE PROCEDURE CALL 125 <br/>4.2.1 Basic RPC Operation 126 <br/>4.2.2 Parameter Passing 130 <br/>CONTENTS ix <br/>4.2.3 Asynchronous RPC 134 <br/>4.2.4 Example: DCE RPC 135 <br/>4.3 MESSAGE-ORIENTED COMMUNICATION 140 <br/>4.3.1 Message-Oriented Transient Communication 141 <br/>4.3.2 Message-Oriented Persistent Communication 145 <br/>4.3.3 Example: IBM's WebSphere Message-Queuing System 152 <br/>4.4 STREAM-ORIENTED COMMUNICATION 157 <br/>4.4.1 Support for Continuous Media 158 <br/>4.4.2 Streams and Quality of Service 160 <br/>4.4.3 Stream Synchronization 163 <br/>4.5 MULTICAST COMMUNICATION 166 <br/>4.5.1 Application-Level Multicasting 166 <br/>4.5.2 Gossip-Based Data Dissemination 170 <br/>4.6 SUMMARY 175 <br/>5 NAMING 179 <br/>5.1 NAMES, IDENTIFIERS, AND ADDRESSES 180 <br/>5.2 FLAT NAMING 182 <br/>5.2.1 Simple Solutions 183 <br/>5.2.2 Home-Based Approaches 186 <br/>5.2.3 Distributed Hash Tables 188 <br/>5.2.4 Hierarchical Approaches 191 <br/>5.3 STRUCTURED NAMING 195 <br/>5.3.1 Name Spaces 195 <br/>5.3.2 Name Resolution 198 <br/>5.3.3 The Implementation of a Name Space 202 <br/>5.3.4 Example: The Domain Name System 209 <br/>5.4 ATTRIBUTE-BASED NAMING 217 <br/>5.4.1 Directory Services 217 <br/>5.4.2 Hierarchical Implementations: LDAP 218 <br/>5.4.3 Decentralized Implementations 222 <br/>5.5 SUMMARY <br/>6 SYNCHRONIZATION 231 <br/>6.1 CLOCK SYNCHRONIZATION 232 <br/>6.1.1 Physical Clocks 233 <br/>6.1.2 Global Positioning System 236 <br/>6.1.3 Clock Synchronization Algorithms 238 <br/>6.2 LOGICAL CLOCKS 244 <br/>6.2.1 Lamport's Logical Clocks 244 <br/>6.2.2 Vector Clocks 248 <br/>6.3 MUTUAL EXCLUSION 252 <br/>6.3.1 Overview 252 <br/>6.3.2 A Centralized Algorithm 253 <br/>6.3.3 A Decentralized Algorithm 254 <br/>6.3.4 A Distributed Algorithm 255 <br/>6.3.5 A Token Ring Algorithm 258 <br/>6.3.6 A Comparison of the Four Algorithms 259 <br/>6.4 GLOBAL POSITIONING OF NODES 260 <br/>6.5 ELECTION ALGORITHMS 263 <br/>6.5.1 Traditional Election Algorithms 264 <br/>6.5.2 Elections in Wireless Environments 267 <br/>6.5.3 Elections in Large-Scale Systems 269 <br/>6.6 SUMMARY 270 <br/>7 CONSISTENCY AND REPLICATION 273 <br/>7.1INTRODUCTION274<br/>7.1.1 Reasons for Replication 275 <br/>7.1.2 Replication as Scaling Technique <br/>7.2 DATA-CENTRIC CONSISTENCY MODELS 276 <br/>7.2.1 Continuous Consistency 277 <br/>7.2.2 Consistent Ordering of Operations 281 <br/>7.3 CLIENT-CENTRIC CONSISTENCY MODELS 288 <br/>7.3.1 Eventual Consistency 289 <br/>7.3.2 Monotonic Reads 291 <br/>7.3.3 Monotonic Writes 292 <br/>7.3.4 Read Your Writes 294 <br/>7.3.5 Writes Follow Reads 295 <br/>7.4 REPLICA MANAGEMENT 296 <br/>7.4.1 Replica-Server Placement 296 <br/>7.4.2 Content Replication and Placement 298 <br/>7.4.3 Content Distribution 302 <br/>7.5 CONSISTENCY PROTOCOLS 306 <br/>7.5.1 Continuous Consistency 306 <br/>7.5.2 Primary-Based Protocols 308 <br/>7.5.3 Replicated-Write Protocols 311 <br/>7.5.4 Cache-Coherence Protocols 313 <br/>7.5.5 Implementing Client-Centric Consistency 315 <br/>7.6 SUMMARY 317 <br/>8 FAULT TOLERANCE 321 <br/>8.1 INTRODUCTION TO FAULT TOLERANCE 322 <br/>8.1.1 Basic Concepts 322 <br/>8.1.2 Failure Models 324 <br/>8.1.3 Failure Masking by Redundancy 326 <br/>8.2 PROCESS RESILIENCE 328 <br/>8.2.1 Design Issues 328 <br/>8.2.2 Failure Masking and Replication 330 <br/>8.2.3 Agreement in Faulty Systems 331 <br/>8.2.4 Failure Detection 335 <br/>8.3 RELIABLE CLIENT-SERVER COMMUNICATION 336 <br/>8.3.1 Point-to-Point Communication 337 <br/>8.3.2 RPC Semantics in the Presence of Failures 337 <br/>8.4 RELIABLE GROUP COMMUNICATION 343 <br/>8.4.1 Basic Reliable-Multicasting Schemes 343 <br/>8.4.2 Scalability in Reliable Multicasting 345 <br/>8.4.3 Atomic Multicast 348 <br/>8.5 DISTRIBUTED COMMIT 355 <br/>8.5.1 Two-Phase Commit 355 <br/>8.5.2 Three-Phase Commit 360 <br/>8.6 RECOVERY 363 <br/>8.6.1 Introduction 363 <br/>8.6.2 Checkpointing 366 <br/>8.6.3 Message Logging 369 <br/>8.6.4 Recovery-Oriented Computing 372 <br/>8.7 SUMMARY 373 <br/>9 SECURITY 377 <br/>9.1 INTRODUCTION TO SECURITY 378 <br/>9.1.1 Security Threats, Policies, and Mechanisms 378 <br/>9.1.2 Design Issues 384 <br/>9.1.3 Cryptography 389 <br/>9.2 SECURE CHANNELS 396 <br/>9.2.1 Authentication 397 <br/>9.2.2 Message Integrity and Confidentiality 405 <br/>9.2.3 Secure Group Communication 408 <br/>9.2.4 Example: Kerberos 411 <br/>9.3 ACCESS CONTROL 413 <br/>9.3.1 General Issues in Access Control 414 <br/>9.3.2 Firewalls 418 <br/>9.3.3 Secure Mobile Code 420 <br/>9.3.4 Denial of Service 427 <br/>9.4 SECURITY MANAGEMENT 428 <br/>9.4.1 Key Management 428 <br/>9.4.2 Secure Group Management 433 <br/>9.4.3 Authorization Management 434 <br/>9.5 SUMMARY 439 <br/>10 DISTRIBUTED OBJECT-BASED SYSTEMS 443 <br/>10.1 ARCHITECTURE 443 <br/>10.1.1 Distributed Objects 444 <br/>10.1.2 Example: Enterprise Java Beans 446 <br/>10.1.3 Example: Globe Distributed Shared Objects 448 <br/>10.2 PROCESSES 451 <br/>10.2.1 Object Servers 451 <br/>10.2.2 Example: The Ice Runtime System 454 <br/>10.3 COMMUNICATION 456 <br/>10.3.1 Binding a Client to an Object 456 <br/>10.3.2 Static versus Dynamic Remote Method Invocations 458 <br/>10.3.3 Parameter Passing 460 <br/>10.3.4 Example: Java RMI 461 <br/>10.3.5 Object-Based Messaging 464 <br/>10.4 NAMING 466 <br/>10.4.1 CORBA Object References 467 <br/>10.4.2 Globe Object References 469 <br/>10.5 SYNCHRONIZATION 470 <br/>10.6 CONSISTENCY AND REPLICATION 462 <br/>10.6.1 Entry Consistency 472 <br/>10.6.2 Replicated Invocations 475 <br/>10.7 FAULT TOLERANCE 477 <br/>10.7.1 Example: Fault-Tolerant CORBA 471 <br/>10.7.2 Example: Fault-Tolerant Java 480 <br/>10.8 SECURITY 481 <br/>10.8.1 Example: Globe 481 <br/>10.8.2 Security for Remote Objects 486 <br/>10.9 SUMMARY 487 <br/>11 DISTRIBUTED FILE SYSTEMS <br/>11.1 ARCHITECTURE 491 <br/>11.1.1 Client-Server Architectures 491 <br/>11.1.2 Cluster-Based Distributed File Systems 496 <br/>11.1.3 Symmetric Architectures 499 <br/>11.2 PROCESSES 501 <br/>11.3 COMMUNICATION 502 <br/>11.3.1 RPCs in NFS <br/>11.3.2 The RPC2 Subsystem <br/>11.3.3 File-Oriented Communication in Plan 9 <br/>11.4 NAMING 506 <br/>11.4.1 Naming in NFS 506 <br/>11.4.2 Constructing a Global Name Space 512 <br/>11.5 SYNCHRONIZATION 513 <br/>11.5.1 Semantics of File Sharing 513 <br/>11.5.2 File Locking 516 <br/>11.5.3 Sharing Files in Coda 518 <br/>11.6 CONSISTENCY AND REPLICATION 519 <br/>11.6.1 Client-Side Caching 520 <br/>11.6.2 Server-Side Replication 524 <br/>11.6.3 Replication in Peer-to-Peer File Systems 526 <br/>11.6.4 File Replication in Grid Systems 528 <br/>11.7 FAULT TOLERANCE 529 <br/>11.7.1 Handling Byzantine Failures 529 <br/>11.7.2 High Availability in Peer-to-Peer Systems 531 <br/>11.8 SECURITY 532 <br/>11.8.1 Security in NFS 533 <br/>11.8.2 Decentralized Authentication 536 <br/>11.8.3 Secure Peer-to-Peer File-Sharing Systems 539 <br/>11.9 SUMMARY 541 <br/>12 DISTRIBUTED WEB-BASED SYSTEMS 545 <br/>12.1 ARCHITECTURE 546 <br/>12.1.1 Traditional Web-Based Systems 546 <br/>12.1.2 Web Services 551 <br/>12.2 PROCESSES 554 <br/>12.2.1 Clients 554 <br/>12.2.2 The Apache Web Server 556 <br/>12.2.3 Web Server Clusters 558 <br/>12.3 COMMUNICATION 560 <br/>12.3.1 Hypertext Transfer Protocol 560 <br/>12.3.2 Simple Object Access Protocol 566 <br/>12.4 NAMING 567 <br/>12.5 SYNCHRONIZATION 569 <br/>12.6 CONSISTENCY AND REPLICATION 570 <br/>12.6.1 Web Proxy Caching 571 <br/>12.6.2 Replication for Web Hosting Systems 573 <br/>12.6.3 Replication of Web Applications 579 <br/>12.7	FAULT TOLERANCE 582 <br/>12.8	SECURITY 584 <br/>12.9	SUMMARY 585 <br/>13	DISTRIBUTED COORDINATION-BASED 589 SYSTEMS <br/>13.1	INTRODUCTION TO COORDINATION MODELS 589 <br/>13.2	ARCHITECTURES 591 <br/>13.2.1 Overall Approach 592 <br/>13.2.2 Traditional Architectures 593 <br/>13.2.3 Peer-to-Peer Architectures 596 <br/>13.2.4 Mobility and Coordination 599 <br/>13.3	PROCESSES 601 <br/>13.4	COMMUNICATION 601 <br/>13.4.1 Content-Based Routing 601 <br/>13.4.2 Supporting Composite Subscriptions 603 <br/>13.5	NAMING 604 <br/>13.5.1 Describing Composite Events 604 <br/>13.5.2 Matching Events and Subscriptions 606 <br/>13.6	SYNCHRONIZATION 607 <br/>13.7	CONSISTENCY AND REPLICATION 607 <br/>13.7.1 Static Approaches 608 <br/>13.7.2 Dynamic Replication 611 <br/>13.8	FAULT TOLERANCE 613 <br/>13.8.1 Reliable Publish-Subscribe Communication 613 <br/>13.8.2 Fault Tolerance in Shared Dataspaces 616 <br/>13.9	SECURITY 617 <br/>13.9.1 Confidentiality 618 <br/>13.9.2 Secure Shared Dataspaces 620 <br/>13.10 SUMMARY 621 <br/>14	SUGGESTIONS FOR FURTHER READING 623 AND BIBLIOGRAPHY <br/>14.1 SUGGESTIONS FOR FURTHER READING 623 <br/>14.1.1 Introduction and General Works 623 <br/>14.1.2 Architecture 624 <br/>14.1.3 Processes 625 <br/>14.1.4 Communication 626 <br/>14.1.5 Naming 626 <br/>14.1.6 Synchronization 627 <br/>14.1.7 Consistency and Replication 628 <br/>14.1.8 Fault Tolerance 629 <br/>14.1.9 Security 630 <br/>14.1.10 Distributed Object-Based Systems 631 <br/>14.1.11 Distributed File Systems 632 <br/>14.1.12 Distributed Web-Based Systems 632 <br/>14.1.13 Distributed Coordination-Based Systems 633<br/>14.2 ALPHABETICAL BIBLIOGRAPHY 634<br/> 
<br/><br/><label>ISBN: </label>9788131718292 
<br/><br/><label>Subjects--Topical Terms: </label><br/>Electronic data processing--Distributed processing.<br/>Distributed operating systems (Computers)
<br/><br/><label>Dewey Class. No.: </label>005.4/476  / T1641