Distributed systems : (Record no. 88649)

000 -LEADER
fixed length control field 15853nam a22004577a 4500
003 - CONTROL NUMBER IDENTIFIER
control field CITU
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20240917113011.0
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 240917b |||||o|||| 00| 0 eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9781119825937
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9781119825951
Qualifying information electronic book
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 1119825954
Qualifying information electronic book
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9781119825944
Qualifying information electronic book
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 1119825946
Qualifying information electronic book
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9781119825968
Qualifying information electronic book
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 1119825962
Qualifying information electronic book
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
Cancelled/invalid ISBN 1119825938
035 ## - SYSTEM CONTROL NUMBER
System control number (OCoLC)1353921023
Canceled/invalid control number (OCoLC)1369857014
041 ## - LANGUAGE CODE
Language code of text/sound track or separate title eng
042 ## - AUTHENTICATION CODE
Authentication code pcc
050 04 - LIBRARY OF CONGRESS CALL NUMBER
Classification number QA76.9.D5
Item number G486 2023
082 00 - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 004/.36
Edition number 23/eng/20221207
100 1# - MAIN ENTRY--PERSONAL NAME
Preferred name for the person Ghosh, Ratan K.,
Authority record control number https://id.loc.gov/authorities/names/n2006217254
Relator term author.
245 10 - TITLE STATEMENT
Title Distributed systems :
Remainder of title theory and applications /
Statement of responsibility, etc Ratan K. Ghosh, Hiranmay Ghosh.
264 #1 - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT)
Place of publication, distribution, etc Hoboken, New Jersey :
Name of publisher, distributor, etc John Wiley & Sons, Inc. ;
Place of publication, distribution, etc Piscataway, NJ :
Name of publisher, distributor, etc IEEE Press,
Date of publication, distribution, etc [2023]
300 ## - PHYSICAL DESCRIPTION
Extent 1 online resource (xxvii, 532 pages) :
Other physical details illustrations (some color)
336 ## - CONTENT TYPE
Content type term text
Content type code txt
Source rdacontent.
337 ## - MEDIA TYPE
Media type term computer
Media type code c
Source rdamedia.
338 ## - CARRIER TYPE
Carrier type term online resource
Carrier type code cr
Source rdacarrier.
340 ## - PHYSICAL MEDIUM
Source rdacc
Authority record control number or standard number http://rdaregistry.info/termList/RDAColourContent/1003.
504 ## - BIBLIOGRAPHY, ETC. NOTE
Bibliography, etc Includes bibliographical references and index.
505 0# - CONTENTS
Formatted contents note Table of Contents<br/><br/>About the Authors xv<br/><br/>Preface xvii<br/><br/>Acknowledgments xxi<br/><br/>Acronyms xxiii<br/><br/>1 Introduction 1<br/><br/>1.1 Advantages of Distributed Systems 1<br/><br/>1.2 Defining Distributed Systems 3<br/><br/>1.3 Challenges of a Distributed System 5<br/><br/>1.4 Goals of Distributed System 6<br/><br/>1.4.1 Single System View 7<br/><br/>1.4.2 Hiding Distributions 7<br/><br/>1.4.3 Degrees and Distribution of Hiding 9<br/><br/>1.4.4 Interoperability 10<br/><br/>1.4.5 Dynamic Reconfiguration 10<br/><br/>1.5 Architectural Organization 11<br/><br/>1.6 Organization of the Book 12<br/><br/>Bibliography 13<br/><br/>2 The Internet 15<br/><br/>2.1 Origin and Organization 15<br/><br/>2.1.1 ISPs and the Topology of the Internet 17<br/><br/>2.2 Addressing the Nodes 17<br/><br/>2.3 Network Connection Protocol 20<br/><br/>2.3.1 IP Protocol 22<br/><br/>2.3.2 Transmission Control Protocol 22<br/><br/>2.3.3 User Datagram Protocol 22<br/><br/>2.4 Dynamic Host Control Protocol 23<br/><br/>2.5 Domain Name Service 24<br/><br/>2.5.1 Reverse DNS Lookup 27<br/><br/>2.5.2 Client Server Architecture 30<br/><br/>2.6 Content Distribution Network 32<br/><br/>2.7 Conclusion 34<br/><br/>Exercises 34<br/><br/>Bibliography 35<br/><br/>3 Process to Process Communication 37<br/><br/>3.1 Communication Types and Interfaces 38<br/><br/>3.1.1 Sequential Type 38<br/><br/>3.1.2 Declarative Type 39<br/><br/>3.1.3 Shared States 40<br/><br/>3.1.4 Message Passing 41<br/><br/>3.1.5 Communication Interfaces 41<br/><br/>3.2 Socket Programming 42<br/><br/>3.2.1 Socket Data Structures 43<br/><br/>3.2.2 Socket Calls 44<br/><br/>3.3 Remote Procedure Call 48<br/><br/>3.3.1 Xml RPC 52<br/><br/>3.4 Remote Method Invocation 55<br/><br/>3.5 Conclusion 59<br/><br/>Exercises 59<br/><br/>Additional Web Resources 61<br/><br/>Bibliography 61<br/><br/>4 Microservices, Containerization, and MPI 63<br/><br/>4.1 Microservice Architecture 64<br/><br/>4.2 REST Requests and APIs 66<br/><br/>4.2.1 Weather Data Using REST API 67<br/><br/>4.3 Cross Platform Applications 68<br/><br/>4.4 Message Passing Interface 78<br/><br/>4.4.1 Process Communication Models 78<br/><br/>4.4.2 Programming with MPI 81<br/><br/>4.5 Conclusion 87<br/><br/>Exercises 88<br/><br/>Additional Internet Resources 89<br/><br/>Bibliography 89<br/><br/>5 Clock Synchronization and Event Ordering 91<br/><br/>5.1 The Notion of Clock Time 92<br/><br/>5.2 External Clock Based Mechanisms 93<br/><br/>5.2.1 Cristian’s Algorithm 93<br/><br/>5.2.2 Berkeley Clock Protocol 94<br/><br/>5.2.3 Network Time Protocol 95<br/><br/>5.2.3.1 Symmetric Mode of Operation 96<br/><br/>5.3 Events and Temporal Ordering 97<br/><br/>5.3.1 Causal Dependency 99<br/><br/>5.4 Logical Clock 99<br/><br/>5.5 Causal Ordering of Messages 106<br/><br/>5.6 Multicast Message Ordering 107<br/><br/>5.6.1 Implementing FIFO Multicast 110<br/><br/>5.6.2 Implementing Causal Ordering 112<br/><br/>5.6.3 Implementing Total Ordering 113<br/><br/>5.6.4 Reliable Multicast 114<br/><br/>5.7 Interval Events 115<br/><br/>5.7.1 Conceptual Neighborhood 116<br/><br/>5.7.2 Spatial Events 118<br/><br/>5.8 Conclusion 120<br/><br/>Exercises 121<br/><br/>Bibliography 123<br/><br/>6 Global States and Termination Detection 127<br/><br/>6.1 Cuts and Global States 127<br/><br/>6.1.1 Global States 132<br/><br/>6.1.2 Recording of Global States 134<br/><br/>6.1.3 Problem in Recording Global State 138<br/><br/>6.2 Liveness and Safety 140<br/><br/>6.3 Termination Detection 143<br/><br/>6.3.1 Snapshot Based Termination Detection 144<br/><br/>6.3.2 Ring Method 145<br/><br/>6.3.3 Tree Method 148<br/><br/>6.3.4 Weight Throwing Method 151<br/><br/>6.4 Conclusion 153<br/><br/>Exercises 154<br/><br/>Bibliography 156<br/><br/>7 Leader Election 157<br/><br/>7.1 Impossibility Result 158<br/><br/>7.2 Bully Algorithm 159<br/><br/>7.3 Ring-Based Algorithms 160<br/><br/>7.3.1 Circulate IDs All the Way 161<br/><br/>7.3.2 As Far as an ID Can Go 162<br/><br/>7.4 Hirschberg and Sinclair Algorithm 163<br/><br/>7.5 Distributed Spanning Tree Algorithm 167<br/><br/>7.5.1 Single Initiator Spanning Tree 167<br/><br/>7.5.2 Multiple Initiators Spanning Tree 170<br/><br/>7.5.3 Minimum Spanning Tree 176<br/><br/>7.6 Leader Election in Trees 176<br/><br/>7.6.1 Overview of the Algorithm 176<br/><br/>7.6.2 Activation Stage 177<br/><br/>7.6.3 Saturation Stage 178<br/><br/>7.6.4 Resolution Stage 179<br/><br/>7.6.5 Two Nodes Enter SATURATED State 180<br/><br/>7.7 Leased Leader Election 182<br/><br/>7.8 Conclusion 184<br/><br/>Exercises 185<br/><br/>Bibliography 187<br/><br/>8 Mutual Exclusion 189<br/><br/>8.1 System Model 190<br/><br/>8.2 Coordinator-Based Solution 192<br/><br/>8.3 Assertion-Based Solutions 192<br/><br/>8.3.1 Lamport’s Algorithm 192<br/><br/>8.3.2 Improvement to Lamport’s Algorithm 195<br/><br/>8.3.3 Quorum-Based Algorithms 196<br/><br/>8.4 Token-Based Solutions 203<br/><br/>8.4.1 Suzuki and Kasami’s Algorithm 203<br/><br/>8.4.2 Singhal’s Heuristically Aided Algorithm 206<br/><br/>8.4.3 Raymond’s Tree-Based Algorithm 212<br/><br/>8.5 Conclusion 214<br/><br/>Exercises 215<br/><br/>Bibliography 216<br/><br/>9 Agreements and Consensus 219<br/><br/>9.1 System Model 220<br/><br/>9.1.1 Failures in Distributed System 221<br/><br/>9.1.2 Problem Definition 222<br/><br/>9.1.3 Agreement Problem and Its Equivalence 223<br/><br/>9.2 Byzantine General Problem (BGP) 225<br/><br/>9.2.1 BGP Solution Using Oral Messages 228<br/><br/>9.2.2 Phase King Algorithm 232<br/><br/>9.3 Commit Protocols 233<br/><br/>9.3.1 Two-Phase Commit Protocol 234<br/><br/>9.3.2 Three-Phase Commit 238<br/><br/>9.4 Consensus 239<br/><br/>9.4.1 Consensus in Synchronous Systems 239<br/><br/>9.4.2 Consensus in Asynchronous Systems 241<br/><br/>9.4.3 Paxos Algorithm 242<br/><br/>9.4.4 Raft Algorithm 244<br/><br/>9.4.5 Leader Election 246<br/><br/>9.5 Conclusion 248<br/><br/>Exercises 249<br/><br/>Bibliography 250<br/><br/>10 Gossip Protocols 253<br/><br/>10.1 Direct Mail 254<br/><br/>10.2 Generic Gossip Protocol 255<br/><br/>10.3 Anti-entropy 256<br/><br/>10.3.1 Push-Based Anti-Entropy 257<br/><br/>10.3.2 Pull-Based Anti-Entropy 258<br/><br/>10.3.3 Hybrid Anti-Entropy 260<br/><br/>10.3.4 Control and Propagation in Anti-Entropy 260<br/><br/>10.4 Rumor-mongering Gossip 261<br/><br/>10.4.1 Analysis of Rumor Mongering 262<br/><br/>10.4.2 Fault-Tolerance 265<br/><br/>10.5 Implementation Issues 265<br/><br/>10.5.1 Network-Related Issues 266<br/><br/>10.6 Applications of Gossip 267<br/><br/>10.6.1 Peer Sampling 267<br/><br/>10.6.2 Failure Detectors 270<br/><br/>10.6.3 Distributed Social Networking 271<br/><br/>10.7 Gossip in IoT Communication 273<br/><br/>10.7.1 Context-Aware Gossip 273<br/><br/>10.7.2 Flow-Aware Gossip 274<br/><br/>10.7.2.1 Fire Fly Gossip 274<br/><br/>10.7.2.2 Trickle 275<br/><br/>10.8 Conclusion 278<br/><br/>Exercises 279<br/><br/>Bibliography 280<br/><br/>11 Message Diffusion Using Publish and Subscribe 283<br/><br/>11.1 Publish and Subscribe Paradigm 284<br/><br/>11.1.1 Broker Network 285<br/><br/>11.2 Filters and Notifications 287<br/><br/>11.2.1 Subscription and Advertisement 288<br/><br/>11.2.2 Covering Relation 288<br/><br/>11.2.3 Merging Filters 290<br/><br/>11.2.4 Algorithms 291<br/><br/>11.3 Notification Service 294<br/><br/>11.3.1 Siena 294<br/><br/>11.3.2 Rebeca 295<br/><br/>11.3.3 Routing of Notification 296<br/><br/>11.4 MQTT 297<br/><br/>11.5 Advanced Message Queuing Protocol 299<br/><br/>11.6 Effects of Technology on Performance 301<br/><br/>11.7 Conclusions 303<br/><br/>Exercises 304<br/><br/>Bibliography 305<br/><br/>12 Peer-to-Peer Systems 309<br/><br/>12.1 The Origin and the Definition of P2P 310<br/><br/>12.2 P2P Models 311<br/><br/>12.2.1 Routing in P2P Network 312<br/><br/>12.3 Chord Overlay 313<br/><br/>12.4 Pastry 321<br/><br/>12.5 Can 325<br/><br/>12.6 Kademlia 327<br/><br/>12.7 Conclusion 331<br/><br/>Exercises 332<br/><br/>Bibliography 333<br/><br/>13 Distributed Shared Memory 337<br/><br/>13.1 Multicore and S-DSM 338<br/><br/>13.1.1 Coherency by Delegation to a Central Server 339<br/><br/>13.2 Manycore Systems and S-DSM 340<br/><br/>13.3 Programming Abstractions 341<br/><br/>13.3.1 MapReduce 341<br/><br/>13.3.2 OpenMP 343<br/><br/>13.3.3 Merging Publish and Subscribe with DSM 345<br/><br/>13.4 Memory Consistency Models 347<br/><br/>13.4.1 Sequential Consistency 349<br/><br/>13.4.2 Linearizability or Atomic Consistency 351<br/><br/>13.4.3 Relaxed Consistency Models 352<br/><br/>13.4.3.1 Release Consistency 356<br/><br/>13.4.4 Comparison of Memory Models 357<br/><br/>13.5 DSM Access Algorithms 358<br/><br/>13.5.1 Central Sever Algorithm 359<br/><br/>13.5.2 Migration Algorithm 360<br/><br/>13.5.3 Read Replication Algorithm 361<br/><br/>13.5.4 Full Replication Algorithm 362<br/><br/>13.6 Conclusion 364<br/><br/>Exercises 364<br/><br/>Bibliography 367<br/><br/>14 Distributed Data Management 371<br/><br/>14.1 Distributed Storage Systems 372<br/><br/>14.1.1 Raid 372<br/><br/>14.1.2 Storage Area Networks 372<br/><br/>14.1.3 Cloud Storage 373<br/><br/>14.2 Distributed File Systems 375<br/><br/>14.3 Distributed Index 376<br/><br/>14.4 NoSQL Databases 377<br/><br/>14.4.1 Key-Value and Document Databases 378<br/><br/>14.4.1.1 MapReduce Algorithm 380<br/><br/>14.4.2 Wide Column Databases 381<br/><br/>14.4.3 Graph Databases 382<br/><br/>14.4.3.1 Pregel Algorithm 384<br/><br/>14.5 Distributed Data Analytics 386<br/><br/>14.5.1 Distributed Clustering Algorithms 388<br/><br/>14.5.1.1 Distributed K-Means Clustering Algorithm 388<br/><br/>14.5.2 Stream Clustering 391<br/><br/>14.5.2.1 BIRCH Algorithm 392<br/><br/>14.6 Conclusion 393<br/><br/>Exercises 394<br/><br/>Bibliography 395<br/><br/>15 Distributed Knowledge Management 399<br/><br/>15.1 Distributed Knowledge 400<br/><br/>15.2 Distributed Knowledge Representation 401<br/><br/>15.2.1 Resource Description Framework (RDF) 401<br/><br/>15.2.2 Web Ontology Language (OWL) 406<br/><br/>15.3 Linked Data 407<br/><br/>15.3.1 Friend of a Friend 407<br/><br/>15.3.2 DBpedia 408<br/><br/>15.4 Querying Distributed Knowledge 409<br/><br/>15.4.1 SPARQL Query Language 410<br/><br/>15.4.2 SPARQL Query Semantics 411<br/><br/>15.4.3 SPARQL Query Processing 413<br/><br/>15.4.4 Distributed SPARQL Query Processing 414<br/><br/>15.4.5 Federated and Peer-to-Peer SPARQL Query Processing 416<br/><br/>15.5 Data Integration in Distributed Sensor Networks 421<br/><br/>15.5.1 Semantic Data Integration 422<br/><br/>15.5.2 Data Integration in Constrained Systems 424<br/><br/>15.6 Conclusion 427<br/><br/>Exercises 428<br/><br/>Bibliography 429<br/><br/>16 Distributed Intelligence 433<br/><br/>16.1 Agents and Multi-Agent Systems 434<br/><br/>16.1.1 Agent Embodiment 436<br/><br/>16.1.2 Mobile Agents 436<br/><br/>16.1.3 Multi-Agent Systems 437<br/><br/>16.2 Communication in Agent-Based Systems 438<br/><br/>16.2.1 Agent Communication Protocols 439<br/><br/>16.2.2 Interaction Protocols 440<br/><br/>16.2.2.1 Request Interaction Protocol 441<br/><br/>16.3 Agent Middleware 441<br/><br/>16.3.1 FIPA Reference Model 442<br/><br/>16.3.2 FIPA Compliant Middleware 443<br/><br/>16.3.2.1 JADE: Java Agent Development Environment 443<br/><br/>16.3.2.2 MobileC 443<br/><br/>16.3.3 Agent Migration 444<br/><br/>16.4 Agent Coordination 445<br/><br/>16.4.1 Planning 447<br/><br/>16.4.1.1 Distributed Planning Paradigms 447<br/><br/>16.4.1.2 Distributed Plan Representation and Execution 448<br/><br/>16.4.2 Task Allocation 450<br/><br/>16.4.2.1 Contract-Net Protocol 450<br/><br/>16.4.2.2 Allocation of Multiple Tasks 452<br/><br/>16.4.3 Coordinating Through the Environment 453<br/><br/>16.4.3.1 Construct-Ant-Solution 455<br/><br/>16.4.3.2 Update-Pheromone 456<br/><br/>16.4.4 Coordination Without Communication 456<br/><br/>16.5 Conclusion 456<br/><br/>Exercises 457<br/><br/>Bibliography 459<br/><br/>17 Distributed Ledger 461<br/><br/>17.1 Cryptographic Techniques 462<br/><br/>17.2 Distributed Ledger Systems 464<br/><br/>17.2.1 Properties of Distributed Ledger Systems 465<br/><br/>17.2.2 A Framework for Distributed Ledger Systems 466<br/><br/>17.3 Blockchain 467<br/><br/>17.3.1 Distributed Consensus in Blockchain 468<br/><br/>17.3.2 Forking 470<br/><br/>17.3.3 Distributed Asset Tracking 471<br/><br/>17.3.4 Byzantine Fault Tolerance and Proof of Work 472<br/><br/>17.4 Other Techniques for Distributed Consensus 473<br/><br/>17.4.1 Alternative Proofs 473<br/><br/>17.4.2 Non-linear Data Structures 474<br/><br/>17.4.2.1 Tangle 474<br/><br/>17.4.2.2 Hashgraph 476<br/><br/>17.5 Scripts and Smart Contracts 480<br/><br/>17.6 Distributed Ledgers for Cyber-Physical Systems 483<br/><br/>17.6.1 Layered Architecture 484<br/><br/>17.6.2 Smart Contract in Cyber-Physical Systems 486<br/><br/>17.7 Conclusion 486<br/><br/>Exercises 487<br/><br/>Bibliography 488<br/><br/>18 Case Study 491<br/><br/>18.1 Collaborative E-Learning Systems 492<br/><br/>18.2 P2P E-Learning System 493<br/><br/>18.2.1 Web Conferencing Versus P2P-IPS 495<br/><br/>18.3 P2P Shared Whiteboard 497<br/><br/>18.3.1 Repainting Shared Whiteboard 497<br/><br/>18.3.2 Consistency of Board View at Peers 498<br/><br/>18.4 P2P Live Streaming 500<br/><br/>18.4.1 Peer Joining 500<br/><br/>18.4.2 Peer Leaving 503<br/><br/>18.4.3 Handling “Ask Doubt” 504<br/><br/>18.5 P2P-IPS for Stored Contents 504<br/><br/>18.5.1 De Bruijn Graphs for DHT Implementation 505<br/><br/>18.5.2 Node Information Structure 507<br/><br/>18.5.2.1 Join Example 510<br/><br/>18.5.3 Leaving of Peers 510<br/><br/>18.6 Searching, Sharing, and Indexing 511<br/><br/>18.6.1 Pre-processing of Files 511<br/><br/>18.6.2 File Indexing 512<br/><br/>18.6.3 File Lookup and Download 512<br/><br/>18.7 Annotations and Discussion Forum 513<br/><br/>18.7.1 Annotation Format 513<br/><br/>18.7.2 Storing Annotations 514<br/><br/>18.7.3 Audio and Video Annotation 514<br/><br/>18.7.4 PDF Annotation 514<br/><br/>18.7.5 Posts, Comments, and Announcements 514<br/><br/>18.7.6 Synchronization of Posts and Comments 515<br/><br/>18.7.6.1 Epidemic Dissemination 516<br/><br/>18.7.6.2 Reconciliation 516<br/><br/>18.8 Simulation Results 516<br/><br/>18.8.1 Live Streaming and Shared Whiteboard 517<br/><br/>18.8.2 De Bruijn Overlay 518<br/><br/>18.9 Conclusion 520<br/><br/>Bibliography 521<br/><br/>Index 525
520 ## - SUMMARY, ETC.
Summary, etc "This book is organized around three aspects of distributed systems: networks middleware tools, and applications. The authors introduce the network issues and high level connection tools in the initial chapters of the book. The abstractions and the implementations of several middleware for distributed computing are described over following chapters of the book, which constitute the bulk of core foundational topics. Going further, the authors discuss P2P, coordinated architectures, and advanced middleware for building large modern distributed applications spread over six chapters. Very large distributed systems rely on Intelligent and autonomous behavior of its components. In this context, the authors present distributed knowledge management and distributed multi-agent systems in the final chapters of the book."--
Assigning source Provided by publisher.
545 0# - BIOGRAPHICAL OR HISTORICAL DATA
Biographical or historical note About the Author<br/><br/>Ratan K. Ghosh, PhD, is formerly a Professor of the Department of CSE at IIT Kanpur. At present, he is affiliated to BITS-Mesra as an Adjunct Professor and to Kaziranga University-Jorhat as a Distinguished Visiting Professor, Mentor and Advisor. He is a Life Member of ACM. He authored the Springer Research Monograph titled Wireless Networking and Mobile Data Management (April 2017).<br/><br/>Hiranmay Ghosh, PhD, is a former Adviser and Principal Scientist of TCS Research. He received his PhD degree from IIT-Delhi and his B.Tech. degree from Calcutta University. He is a Senior Member of IEEE, Life Member of IUPRAI, and a Member of ACM. He authored the Wiley title Computational Models for Cognitive Vision (2020) and co-authored of the CRC Press title Multimedia Ontology: Representation and Applications (2015).
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Electronic data processing
General subdivision Distributed processing.
Authority record control number https://id.loc.gov/authorities/subjects/sh85042293.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Computer networks.
Authority record control number https://id.loc.gov/authorities/subjects/sh85029513.
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Ghosh, Hiranmay,
Authority record control number https://id.loc.gov/authorities/names/no2020014553
Relator term author.
776 08 - ADDITIONAL PHYSICAL FORM ENTRY
Display text Print version:
Main entry heading Ghosh, Ratan K.
Title Distributed systems
Place, publisher, and date of publication Hoboken, New Jersey : Wiley, [2023]
International Standard Book Number 9781119825937
Record control number (DLC) 2022055650.
856 40 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier https://onlinelibrary.wiley.com/doi/book/10.1002/9781119825968
Link text Full text available at Wiley Online Library Click here to view
942 ## - ADDED ENTRY ELEMENTS
Source of classification or shelving scheme
Item type EBOOK
Holdings
Withdrawn status Lost status Source of classification or shelving scheme Damaged status Not for loan Permanent Location Current Location Date acquired Source of acquisition Full call number Date last seen Price effective from Item type
          COLLEGE LIBRARY COLLEGE LIBRARY 2024-09-17 Megatexts Phil. Inc. 004.36 G3462 2023 2024-09-17 2024-09-17 EBOOK