Distributed Computing

CHAPTER 1: BASIC DISTRIBUTED SYSTEM CONCEPTS ; 1.1 INTRODUCTION ; 1.1.1 WHAT IS A DISTRIBUTED SYSTEM? ; 1.1.2 ARCHITECTURES FOR DISTRIBUTED SYSTEMS ; 1.2 DISTRIBUTED COMPUTING MODELS ; 1.2.1 WORKSTATION MODEL ; 1.2.2 WORKSTATION-SERVER MODEL ; 1.2.3 PROCESSOR-POOL MODEL ; 1.2.4 COMPARISON OF THE DISTRIBUTED COMPUTING MODELS ; 1.2.5 ADVANTAGES OF DISTRIBUTED SYSTEMS ; 1.2.6 DISADVANTAGES OF DISTRIBUTED SYSTEMS ; 1.3 SOFTWARE CONCEPTS ; 1.3.1 NETWORK OPERATING SYSTEM ; 1.3.2 DISTRIBUTED OPERATING SYSTEM ; 1.3.3 MULTIPROCESSOR TIME-SHARING SYSTEM ; 1.3.4 COMPARISON OF DIFFERENT OPERATING SYSTEMS ; 1.4.1 TRANSPARENCY ; 1.4.2 FLEXIBILITY ; 1.4.3 RELIABILITY ; 1.4.4 PERFORMANCE ; 1.4.5 SCALABILITY ; 1.4.6 SECURITY ; 1.4.7 FAULT TOLERANCE ; 1.5 CLIENT-SERVER MODEL ; 1.5.1 BASIC CONCEPTS ; 1.5.2 CLIENT-SERVER ADDRESSING ; 1.5.3 CLIENT-SERVER IMPLEMENTATION ; 1.5.4 CLIENT-SERVER ARCHITECTURE ; 1.6 CASE STUDIES ; 1.6.1 WORLD WIDE WEB 1.0 1.6.2 WORLD WIDE WEB 2.0 ; 1.6.3 WORLD WIDE WEB 3.0 ; CHAPTER 2: NETWORK COMMUNICATION ; 2.1 LAN AND WAN TECHNOLOGIES ; 2.1.1 INTRODUCTION TO LAN AND WAN 46 ; 2.1.2 CLASSIFICATION OF NETWORKS ; 2.2 PROTOCOLS FOR NETWORK SYSTEMS ; 2.2.1 THE ISO/OSI REFERENCE MODEL ; 2.2.2 INTERNET PROTOCOLS ; 2.3 ASYNCHRONOUS TRANSFER MODE ; 2.3.1 INTRODUCTION TO ATM ; 2.3.2 ATM PROTOCOL REFERENCE MODEL ; 2.4 PROTOCOLS FOR DISTRIBUTED SYSTEMS ; 2.4.1 FAST LOCAL INTERNET PROTOCOL (FLIP) ; 2.4.2 VERSATILE MESSAGE TRANSFER PROTOCOL ; CHAPTER 3: INTERPROCESS COMMUNICATION ; 3.1 MESSAGE PASSING ; 3.1.1 INTRODUCTION TO MESSAGE PASSING ; 3.1.2 ADVANTAGES AND FEATURES OF MESSAGE-PASSING SYSTEMS ; 3.1.3 IPC MESSAGE FORMAT ; 3.1.4 IPC SYNCHRONIZATION ; 3.1.5 MESSAGE BUFFERING STRATEGIES ; 3.1.6 MULTIDATAGRAM MESSAGING ; 3.1.7 PROCESS ADDRESSING TECHNIQUES ; 3.1.8 FAILURE HANDLING MECHANISM ; 3.2 CASE STUDY: IPC IN MACH ; 3.3 GROUP COMMUNICATION ; 3.3.1 TYPESOF GROUP COMMUNICATION ; 3.3.2 GROUP MANAGEMENT ; 3.3.3 GROUP ADDRESSING AND MESSAGE DELIVERY ; 3.3.4 RELIABILITY MECHANISM ; 3.3.5 MESSAGE ORDERING ; 3.4 CASE STUDY: CBCAST PROTOCOL IN ISIS ; 3.5 API FOR INTERNET PROTOCOL ; 3.5.1 SYNCHRONOUS AND ASYNCHRONOUS COMMUNICATIONS ; 3.5.2 SOCKETS, UDP AND TCP ; 3.5.3 JAVA API FOR UDP AND TCP PROTOCOLS ; CHAPTER 4: REMOTE COMMUNICATION ; 4.1 INTRODUCTION TO REMOTE COMMUNICATION ; 4.1.1 MIDDLEWARE ; 4.2 REMOTE PROCEDURAL CALL BASICS ; 4.2.1 BASIC RPC OPERATION ; 4.2.2 STUB GENERATION IN RPC ; 4.3 RPC IMPLEMENTATION ; 4.3.1 RPC MESSAGES ; 4.3.2 PARAMETER PASSING SEMANTICS ; 4.3.3 SERVER MANAGEMENT ; 4.4 RPC COMMUNICATION ; 4.4.1 RPC CALL SEMANTICS ; 4.4.2 RPC COMMUNICATION PROTOCOLS ; 4.4.3 CLIENT-SERVER BINDING ; 4.5 OTHER RPC ISSUES ; 4.5.1 EXCEPTION HANDLING AND SECURITY ; 4.5.2 RPC IN HETEROGENEOUS ENVIRONMENT ; 4.5.3 FAILURE HANDLING ; 4.5.4 RPC OPTIMIZATION ; 4.5.5 COMPLICATED AND SPECIAL RPCS ; 4.6 CASE STUDY: SUN RPC ; 4.7 REMOTE METHOD INVOCATION BASICS ; 4.7.1 DISTRIBUTED OBJECT CONCEPTS ; 4.8 RMI IMPLEMENTATION ; 4.8.1 DESIGN ISSUES IN RMI ; 4.8.2 RMI EXECUTION ; 4.8.3 TYPES OF OBJECTS ; 4.8.4 BINDING A CLIENT TO AN OBJECT ; 4.8.5 RMI PARAMETER PASSING ; 4.9 CASE STUDY: JAVA RMI ; CHAPTER 5: SYNCHRONIZATION ; 5.1 INTRODUCTION ; 5.2 CLOCK SYNCHRONIZATION ; 5.2.1 PHYSICAL CLOCKS ; 5.2.3 USE OF SYNCHRONIZED CLOCKS ; 5.3 LOGICAL CLOCKS ; 5.3.1 EVENT ORDERING ; 5.3.2 IMPLEMENTATION OF LOGICAL CLOCKS ; 5.3.3 LAMPORT'S TIMESTAMPS ; 5.3.4 VECTOR TIMESTAMPS ; 5.4 GLOBAL STATE ; 5.5 MUTUAL EXCLUSION ; 5.5.1 CENTRALIZED ALGORITHM 5.5.2 DISTRIBUTED ALGORITHM 5.5.3 TOKEN RING ALGORITHM ; 5.5.4 COMPARISON OF VARIOUS ALGORITHMS ; 5.6 ELECTION ALGORITHMS ; 5.6.1 THE BULLY ELECTION ALGORITHM ; 5.6.2 THE RING ELECTION ALGORITHM ; 5.6.3 ELECTION IN A WIRELESS NETWORK ; 5.7 DEADLOCKS IN DISTRIBUTED SYSTEMS ; 5.7.1 BASIC CONCEPTS ; 5.7.2 DEADLOCK MODELLING ; 5.7.3 HANDLING DEADLOCKS IN DISTRIBUTED SYSTEMS ; 5.7.4 DISTRIBUTED DEADLOCK PREVENTION ; 5.7.5 DISTRIBUTED DEADLOCK DETECTION 5.7.6 DISTRIBUTED DEADLOCK RECOVERY ; 5.7.7 ISSUES IN RECOVERY FROM DEADLOCK ; 5.8 CASE STUDY: DEADLOCKS IN MESSAGE COMMUNICATION ; CHAPTER 6: SIMULATION BASICS FOR FORMAL MODEL SPECIFICATIONS ; 6.1 INTRODUCTION ; 6.1.1 BASIC MODEL OF A MESSAGE PASSING SYSTEM ; 6.1.1 ASYNCHRONOUS SYSTEMS ; 6.1.2 SYNCHRONOUS SYSTEMS ; 6.2 BASICS OF FORMAL MODEL SPECIFICATIONS ; 6.2.1 A GENERIC PROBLEM SPECIFICATION ; 6.3 COMMUNICATIONS SYSTEM ; 6.3.1 ASYNCHRONOUS POINT-TO-POINT MESSAGE PASSING SYSTEM ; 6.3.2 ASYNCHRONOUS BROADCAST ; 6.4 PROCESSES ; 6.5 ADMISSIBILITY CONDITIONS ; 6.6 SIMULATIONS ; CHAPTER 7: DISTRIBUTED SYSTEM MANAGEMENT ; 7.1 INTRODUCTION ; 7.2 RESOURCE MANAGEMENT ; 7.2.1 DESIRABLE FEATURES OF A GLOBAL SCHEDULING ALGORITHM ; 7.3 TASK ASSIGNMENT APPROACH ; 7.3.1 GRAPH THEORETIC DETERMINISTIC ALGORITHM ; 7.3.2 CENTRALIZED HEURISTIC ALGORITHM ; 7.3.3 HIERARCHICAL ALGORITHM ; 7.4 LOAD-BALANCING APPROACH ; 7.4.1 TAXONOMY OF LOAD-BALANCING ALGORITHMS ; 7.4.2 ISSUES IN DESIGNING LOAD-BALANCING ALGORITHMS ; 7.5 LOAD-SHARING APPROACH ; 7.5.1 ISSUES IN DESIGNING LOAD-SHARING ALGORITHMS ; 7.6 PROCESS MANAGEMENT IN A DISTRIBUTED ENVIRONMENT ; 7.6.1 FUNCTIONS OF DISTRIBUTED PROCESS MANAGEMENT ; 7.6.2 DESIRABLE FEATURES OF A PROCESS MIGRATION MECHANISM ; 7.7 PROCESS MIGRATION ; 7.7.1 FREEZING THE PROCESS ON SOURCE NODE ; 7.7.2 ADDRESS SPACE TRANSPORT MECHANISMS ; 7.7.3 MESSAGE FORWARDING MECHANISM ; 7.7.4 PROCESS MIGRATION IN HETEROGENEOUS SYSTEMS ; 7.7.5 ADVANTAGES OF PROCESS MIGRATION ; 7.8 THREADS ; 7.8.1 PROCESS VS. THREADS ; 7.8.2 THREAD MODELS ; 7.8.3 DESIGN ISSUES IN THREADS ; 7.8.4 IMPLEMENTING A THREAD PACKAGE ; 7.8.5 THREADS AND REMOTE EXECUTION ; 7.9 FAULT TOLERANCE ; 7.9.1 COMPONENT FAULTS ; 7.9.2 SYSTEM FAILURES ; 7.9.3 USE OF REDUNDANCY ; CHAPTER 8: DISTRIBUTED SHARED MEMORY ; 8.1 INTRODUCTION ; 8.2 BASIC CONCEPTS OF DSM ; 8.2.1 DSM ARCHITECTURE ; 8.2.2 MESSAGE PASSING VS. SHARED MEMORY ; 8.2.3 TYPES OF DSMS ; 8.2.4 ADVANTAGES OF DSM ; 8.3 HARDWARE DSM ; 8.3.1 ON-CHIP MEMORY DSM ; 8.3.2 BUS-BASED MULTIPROCESSOR ; 8.3.3 RING-BASED MULTIPROCESSOR ; 8.3.4 SWITCHED MULTIPROCESSOR ; 8.4 DESIGN ISSUES IN DSM SYSTEMS ; 8.4.1 GRANULARITY ; 8.4.2 STRUCTURE ; 8.4.3 CONSISTENCY MODELS ; 8.4.4 COHERENCE PROTOCOLS ; 8.5 ISSUES IN IMPLEMENTING DSM SYSTEMS ; 8.5.1 THRASHING ; 8.5.2 RESPONSIBILITY FOR DSM MANAGEMENT ; 8.5.3 REPLICATION VERSUS MIGRATION STRATEGIES ; 8.5.4 REPLACEMENT STRATEGY ; 8.6 HETEROGENEOUS AND OTHER DSM SYSTEMS ; 8.6.1 DATA COMPATIBILITY AND CONVERSION ; 8.6.2 BLOCK SIZE SELECTION ; 8.7 CASE STUDIES ; 8.7.1 MUNIN ; 8.7.2 LINDA ; 8.7.3 TEAMSTER ; 8.7.4 JUMP ; CHAPTER 9: DISTRIBUTED FILE SYSTEM ; 9.1 INTRODUCTION TO DFS ; 9.1.1 FUNCTIONS OF DFS ; 9.1.2 COMPONENTS OF DFS ; 9.1.3 DESIRABLE FEATURES OF A GOOD DFS ; 9.2 FILE MODELS ; 9.2.1 STRUCTURED AND UNSTRUCTURED FILES ; 9.2.2 MUTABLE AND IMMUTABLE FILES ; 9.3 DISTRIBUTED FILE SYSTEM DESIGN ; 9.3.1 FILE SERVICE INTERFACE ; 9.3.2 DIRECTORY SERVICE INTERFACE ; 9.3.3 NAMING TRANSPARENCY ; 9.4 SEMANTICS OF FILE SHARING ; 9.4.1 UNIX FILE SEMANTICS ; 9.4.2 SESSION SEMANTICS ; 9.4.3 IMMUTABLE SHARED-FILE SEMANTICS ; 9.4.4 TRANSACTION-LIKE SEMANTICS ; 9.5.1 DFS SYSTEM STRUCTURE ; 9.6 FILE CACHING IN DFS ; 9.6.1 CACHE LOCATION ; 9.7 REPLICATION IN DFS ; 9.7.1 UNIT OF REPLICATION ; 9.7.2 REPLICA CREATION ; 9.7.3 UPDATE PROTOCOLS ; 9.8 CASE STUDIES ; 9.8.1 SUN NETWORK FILE SYSTEM ; 9.8.2 GOOGLE FILE SYSTEM ; CHAPTER 10: NAMING ; 10.1 INTRODUCTION ; 10.2 DESIRABLE FEATURES OF A GOOD NAMING SYSTEM ; 10.3 BASIC CONCEPTS ; 10.3.1 NAME ; 10.3.2 NAMESPACE AND CONTEXTS ; 10.3.3 NAME SERVER ; 10.3.4 NAME AGENT ; 10.3.5 NAME RESOLUTION ; 10.4 SYSTEM-ORIENTED NAMES ; 10.4.1 FEATURES OF SYSTEM-ORIENTED NAMES ; 10.4.2 TYPES OF SYSTEM-ORIENTED NAMES ; 10.4.3 APPROACHES TO GENERATE SYSTEM-ORIENTED NAMES ; 10.5 OBJECT-LOCATING MECHANISMS ; 10.5.1 BROADCAST ; 10.5.2 EXPANDING RING BROADCAS ; 10.5.3 ENCODING OBJECT LOCATION IN UID ; 10.5.4 ENCODING CREATOR NODE ID IN UID ; 10.5.5 USING FORWARD LOCATION POINTERS ; 10.5.6 USING HINT CACHE AND BROADCASTING ; 10.6 ISSUES IN DESIGNING HUMAN-ORIENTED NAMES ; 10.6.1 SCHEME FOR GLOBAL OBJECT NAMING ; 10.6.2 SCHEMES FOR PARTITIONING A NAMESPACE INTO CONTEXTS ; 10.6.3 SCHEMES FOR IMPLEMENTING CONTEXT BINDINGS ; 10.6.4 SCHEMES FOR NAME RESOLUTION ; 10.7 NAME CACHES ; 10.7.1 CHARACTERISTICS OF NAME SERVICE ACTIVITIES ; 10.7.2 ISSUES IN NAME CACHE DESIGN ; 10.8 NAMING AND SECURITY ; 10.9 CASE STUDY: DOMAIN NAME SERVICE ; CHAPTER 11: SECURITY IN DISTRIBUTED SYSTEMS 434 ; 11.1 INTRODUCTION ; 11.1.1 POTENTIAL THREATS AND ATTACKS ON COMPUTER SYSTEMS ; 11.1.2 CONFINEMENT PROBLEMS ; 11.1.3 DESIGN ISSUES IN BUILDING SECURE DISTRIBUTED SYSTEMS ; 11.2 CRYPTOGRAPHY ; 11.2.1 SYMMETRIC CRYPTOSYSTEM ALGORITHM: DES ; 11.2.2 ASYMMETRIC CRYPTOSYSTEM ; 11.3 SECURE CHANNELS ; 11.3.1 AUTHENTICATION ; 11.3.2 MESSAGE INTEGRITY AND CONFIDENTIALITY ; 11.3.3 SECURE GROUP COMMUNICATIONS ; 11.4 ACCESS CONTROL ; 11.4.1 GENERAL ISSUES ; 11.4.2 FIREWALLS ; 11.4.3 SECURE MOBILE CODE ; 11.5 SECURITY MANAGEMENT ; 11.5.1 KEY MANAGEMENT ; 11.5.2 ISSUES IN KEY DISTRIBUTION ; 11.5.3 SECURE GROUP MANAGEMENT ; 11.5.4 AUTHORIZATION MANAGEMENT ; 11.6 CASE STUDIES ; 11.6.1 KERBEROS ; 11.6.2 E-PAYMENT ; CHAPTER 12: REAL-TIME DISTRIBUTED OPERATING SYSTEMS ; 12.1 INTRODUCTION ; 12.1.1 TYPES OF STIMULI ; 12.1.2 CLASSIFICATION OF REAL-TIME SYSTEMS ; 12.2 DESIGN ISSUES IN REAL-TIME DISTRIBUTED SYSTEMS ; 12.2.1 CLOCK SYNCHRONIZATION ; 12.2.2 EVENT-TRIGGERED AND TIME-TRIGGERED SYSTEMS ; 12.2.3 FAULT TOLERANCE ; 12.2.4 PREDICTABILITY ; 12.2.5 LANGUAGE SUPPORT ; 12.3 REAL-TIME COMMUNICATION ; 12.3.1 REAL-TIME COMMUNICATION IN LAN ; 12.3.2 REAL-TIME COMMUNICATION IN WAN ; 12.4 REAL-TIME SCHEDULING ; 12.4.1 ALGORITHMS FOR REAL-TIME SCHEDULING ; 12.4.2 DYNAMIC SCHEDULING ; 12.4.3 STATIC SCHEDULING ; 12.5 CASE STUDY: REAL-TIME COMMUNICATION IN MARS ; CHAPTER 13: DISTRIBUTED DATABASE MANAGEMENT SYSTEM ; 13.1 INTRODUCTION ; 13.1.1 DISTRIBUTED DATABASE (DDB) ; 13.1.2 DISTRIBUTED DATABASE MANAGEMENT SYSTEM (DDBMS) ; 13.1.3 DISTRIBUTED PROCESSING ; 13.1.4 PARALLEL DBMS ; 13.1.5 ADVANTAGES OF DDBMS ; 13.1.6 DISADVANTAGES OF DDBMS ; 13.1.7 FUNCTIONS OF DDBMS ; 13.1.8 TYPES OF DISTRIBUTED DATABASES ; 13.2 DISTRIBUTED DBMS ARCHITECTURES ; 13.2.1 CLIENT-SERVER SYSTEMS ; 13.2.2 COLLABORATING SERVER SYSTEMS ; 13.2.3 MIDDLEWARE SYSTEMS ; 13.3 DATA STORAGE IN A DISTRIBUTED DBMS ; 13.3.1 DATA ALLOCATION ; 13.3.3 REPLICATION ; 13.4 DISTRIBUTED CATALOG MANAGEMENT ; 13.4.1 NAMING OBJECTS ; 13.4.2 CATALOG STRUCTURE ; 13.4.3 DISTRIBUTED DATA INDEPENDENCE ; 13.5 DISTRIBUTED QUERY PROCESSING ; 13.5.1 NON-JOIN QUERIES IN A DDBMS ; 13.5.2 JOINS IN A DDBMS ; 13.5.3 COST-BASED QUERY OPTIMIZATION ; 13.5.4 UPDATING DISTRIBUTED DATA ; 13.6 DISTRIBUTED TRANSACTIONS ; 13.7 DISTRIBUTED CONCURRENCY CONTROL ; 13.7.1 OBJECTIVES ; 13.7.2 DISTRIBUTED SERIALIZABILITY ; 13.7.3 LOCKING PROTOCOLS ; 13.7.4 TIMESTAMP PROTOCOLS ; 13.7.5 DISTRIBUTED DEADLOCK MANAGEMENT ; 13.8 DISTRIBUTED DATABASE RECOVERY ; 13.8.1 FAILURES IN DISTRIBUTED ENVIRONMENT ; 13.8.2 HOW FAILURES AFFECT RECOVERY ; 13.8.3 TWO-PHASE COMMIT (2PC) ; 13.8.4 THREE-PHASE COMMIT (3PC) ; 13.8.5 NETWORK PARTITIONING ; 13.9 MOBILE DATABASES ; 13.9.1 MOBILE DATABASE MANAGEMENT SYSTEMS ; 13.10 CASE STUDY: DISTRIBUTION AND REPLICATION IN ORACLE ; 13.10.1 ORACLE'S DISTRIBUTED FUNCTIONALITY ; 13.10.2 ORACLE'S REPLICATION FUNCTIONALITY ; CHAPTER 14: EMERGING TRENDS IN DISTRIBUTED COMPUTING ; 14.1 INTRODUCTION TO EMERGING TRENDS ; 14.2 GRID COMPUTING ; 14.2.1 INTRODUCTION TO GRID COMPUTING ; 14.2.2 HOW GRID COMPUTING WORKS ; 14.2.3 GRID MIDDLEWARE 14.2.4 GRID ARCHITECTURE 14.2.5 TYPES OF GRIDS ; 14.2.6 GRID COMPUTING APPLICATIONS ; 14.2.7 SIMULATORS ; 14.3 SOA ; 14.3.1 BASIC SOA DEFINITIONS ; 14.3.2 OVERVIEW OF SOA ; 14.3.3 SOA AND WEB SERVICES 14.3.4 SERVICE-ORIENTED GRID ; 14.3.5 SOA DESIGN AND DEVELOPMENT ; 14.3.6 ADVANTAGES AND THE FUTURE OF SOA ; 14.4 CLOUD COMPUTING ; 14.4.1 WHAT IS CLOUD COMPUTING? ; 14.4.3 FEATURES OF CLOUD COMPUTING ; 14.4.4 CLOUD COMPUTING ARCHITECTURE ; 14.4.5 CLOUD COMPUTING LANDSCAPE ; 14.5 THE FUTURE OF EMERGING TRENDS ; APPENDIX: CASE STUDY: CHORUS ; APPENDIX: CASE STUDY: CORBA ; APPENDIX: CASE STUDY: MACH ; WEB REFERENCES ; INDEX