BSc: Distributed And Network Programming
Revision as of 11:34, 3 February 2022 by R.sirgalina (talk | contribs)
Distributed and Network Programming
- Course name: Distributed and Network Programming
- Course number: XYZ
- Knowledge area: xxx
Course characteristics
Key concepts of the class
- Network programming concepts: Layered architecture, TCP and UDP sockets, multithreaded servers
- Distributed systems concepts: system architecture, inter-process communication, remote procedure calls, peer-to-peer systems, coordination, replication, and fault tolerance.
What is the purpose of this course?
Distributed and networked systems have become an integral part of our life, we use various applications such as chatting, online transactions, or cloud storage apps. All these popular applications are supported by an infrastructure (of servers) that is organized based on some concepts of distributed systems. The purpose of this course is to provide the students with the necessary concepts, models, and real-world problem-solving techniques of network programming and distributed systems.
Course Objectives Based on Bloom’s Taxonomy
What should a student remember at the end of the course?
By the end of the course, the students should be able to recognize and define
- Concepts of network programming
- Different distributed system architectures
- Various synchronization and coordination techniques
- Different consistency models and replication methods
- Approaches to achieve fault tolerance and security in distributed systems
What should a student be able to understand at the end of the course?
By the end of the course, the students should be able to describe and explain (with examples)
- Difference between different transport protocols, when and why one is preferred over another
- Difference between different distributed system architectures (centralized, decentralized, and hybrid)
- How a mutual exclusion is achieved between concurrent servers (centralized, distributed, token-ring, and decentralized)
- How a new leader is elected in peer-to-peer systems (bully, ring)
- How to achieve a consistent replicas across distributed systems (consistency models and protocols, content replication and placement)
- Some methods to achieve the fault tolerance in distributed systems
What should a student be able to apply at the end of the course?
By the end of the course, the students should be able to apply
- Building a custom application protocols on top of the existing transport protocols
- Writing multithreaded server and client apps with sockets
- Using RPC for inter-process communication: command execution, file transfer
- Building peer-to-peer systems with distributed protocol such as Chord
- Building fault-tolerant systems with failure detection and leader election
Course evaluation
| Component | Points |
|---|---|
| Laboratory assignments | 55% |
| Final exam | 35% |
| Attendance | 10% |
Important: In order to successfully finish the course, the student is required to score at least 50% in final exam.
Grades range
| A. Excellent | 90-100 |
| B. Good | 75-89 |
| C. Satisfactory | 60-74 |
| D. Poor | 0-59 |
Resources and reference material
- Textbook: Maarten Van Steen, and Andrew S. Tanenbaum. Distributed systems (3rd Edition) Leiden, The Netherlands: Maarten van Steen, 2017. Available online: https://www.distributed-systems.net/
- Reference: George F. Coulouris, Jean Dollimore, and Tim Kindberg. Distributed systems: concepts and design (5th Edition) Addision Wesley, 2012. Available online: https://www.cdk5.net/wp/
- Reference: Sukumar Ghosh. Distributed systems: an algorithmic approach (2nd Edition) Chapman&Hall /CRC, Author’s own course material, Spring 2015. Available online: http://homepage.divms.uiowa.edu/~ghosh/16615.html
Course Sections
The course is organized in 8 weeks, with every weeks 4 academics hours of lectures and 4 academic hours of tutorials/labs. The main sections of the course and approximate hour distribution between them is as follows:
| Section | Section Title | Teaching Hours |
|---|---|---|
| 1 | Introduction to subject, computer networks basics, transport layer protocols, and socket programming | 12 |
| 2 | Multithreaded socket programming, remote procedure calls, and distributed system architecture | 24 |
| 3 | Coordination, consistency, and replication in distributed systems | 24 |
| 4 | Fault tolerance and security in distributed systems | 30 |
Section 1: Introduction to subject, computer networks basics, transport layer protocols, and socket programming
Topics covered in this section
- General introduction to the course
- Computer networks basic
- Socket programming
- UDP socket programming
- TCP socket programming
What forms of evaluation were used to test students’ performance in this section?
| Yes/No | |
|---|---|
| Development of individual parts of software product code | 1 |
| Homework and group projects | 1 |
| Midterm evaluation | 0 |
| Testing (written or computer based) | 1 |
| Reports | 0 |
| Essays | 0 |
| Oral polls | 1 |
| Discussions | 1 |
Typical questions for ongoing performance evaluation within this section
- What are the distributed systems?
- Give an example of distributed systems.
- What are the advantages of layered architecture?
- What are the roles of transport protocols?
- How the TCP and UDP differ from each other? When one is preferred over the other?
- What is socket programming?
- How socket programming is different for UDP and TCP?
Typical questions for seminar classes (labs) within this section
- Write a simple UDP/TCP client-server echo program
- Write a simple chatting program using UDP/TCP sockets
- Given the simple echo server program, apply socket timeouts and catch timeout exceptions
- Write a UDP-based reliable file transfer protocol
- Write a program that parallelly executes the CPU-bound tasks using multiple processes
Test questions for final assessment in this section
- Describe an advantage of layered architecture?
- Describe the differences between TCP and UDP protocols?
- Provide examples when using UDP can be more reasonable than TCP?
- Describe how UDP and TCP socket programming differ from each other?
Section 2: Multithreaded socket programming, RPCs, and distributed system architecture
Topics covered in this section
- Multithreading and multithreaded socket programming
- Remote procedure calls (RPCs)
- Distributed system architectures
What forms of evaluation were used to test students’ performance in this section?
| Yes/No | |
|---|---|
| Development of individual parts of software product code | 1 |
| Homework and group projects | 1 |
| Midterm evaluation | 0 |
| Testing (written or computer based) | 1 |
| Reports | 0 |
| Essays | 0 |
| Oral polls | 1 |
| Discussions | 1 |
Typical questions for ongoing performance evaluation within this section
- How the threads differ from processes?
- What are the I/O and CPU-bound tasks?
- For what kind of tasks, using threads is preferred than using processes?
- What is a remote procedure call?
- What are some well-known distributed system architectures?
- Discuss the structured and unstructured decentralized architectures.
Typical questions for seminar classes (labs) within this section
- You have a list of large numbers, and you need to find if they are prime or not. Would you use multithreading, multiprocessing, or sequential programming in order to complete the task asap? Prove it in practice.
- You need to send multiple requests to a server and receive responses. Assume there is a few msecs of delay before you receive the response from the server. Would you use multithreading, multiprocessing, or sequential programming in order to complete the task asap? Prove it in practice. (Order of the requests/responses doesn't matter)
- Discuss two ways of creating the threads using threading module in Python: 1) passing the worker function as a target, 2) subclassing the Thread class
- Given the function implemented locally, make it available to be called through RPC from remote process? Use xmlRPC.
Test questions for final assessment in this section
- Discuss the differences between the threads and processes.
- What is the Race condition?
- Discuss the ways to protect the shared data from the race condition
- You're given the worker function that just sleeps for a second and quits, implement the same behavior in a subclass of the Thread.
- Discuss the RPC and its advantages over using the low-level socket programming?
- Discuss the decentralized architecture: structured and unstructured p2p systems.
Section 3: Coordination, consistency, and replication in distributed systems
Topics covered in this section
- Clock synchronization algorithms (NTP, Berkeley)
- Logical clock (Lamport clocks)
- Mutual exclusion algorithms: permission-based, token-based
- Election algorithms: Bully, Ring
- Consistency models
- Replica management
- Consistency protocols
What forms of evaluation were used to test students’ performance in this section?
| Yes/No | |
|---|---|
| Development of individual parts of software product code | 1 |
| Homework and group projects | 1 |
| Midterm evaluation | 0 |
| Testing (written or computer based) | 1 |
| Reports | 0 |
| Essays | 0 |
| Oral polls | 1 |
| Discussions | 1 |
Typical questions for ongoing performance evaluation within this section
- How NTP protocol works?
- How Berkeley protocol works?
- Discuss the mutual exclusion algorithms.
- Discuss the permanent and server-initiated replicas and their difference
- Explain the Primary-backup protocol.
Typical questions for seminar classes (labs) within this section
- Given three machines with drifting clocks, adjust their clocks using Berkeley algorithm.
- Explain how Bully algorithm for election works
- Explain how Ring algorithm for election works
- Explain the centralized (permission-based) method of mutual exclusion
Test questions for final assessment in this section
- Discuss NTP and Berkeley protocols for synchronization and explain their key difference
- Discuss permission-based and token-based solution for mutual exclusion.
- Discuss content replication: permanent, server-initiated, and client-initiated replicas.
- Explain the Primary-backup protocol, its advantages and disadvantages.
Section 4: Fault tolerance and security in distributed systems
Topics covered in this section
- Intro to fault tolerance: Failure models, Failure masking by redundancy
- Process resilience: process groups, process replication, consensus in faulty systems, failure detection
- Reliable group communication: atomic multicast,
- Distributed commit
- Recovery: checkpointing
- Intro to security: threats, design issues, cryptography
- Secure channels: authentication, message integrity and confidentiality, secure group communication
- Access control: general issues, firewalls, secure mobile code, denial of service
- Secure naming
- Security management: Key management, secure group management, authorization management
What forms of evaluation were used to test students’ performance in this section?
| Yes/No | |
|---|---|
| Development of individual parts of software product code | 1 |
| Homework and group projects | 1 |
| Midterm evaluation | 0 |
| Testing (written or computer based) | 1 |
| Reports | 0 |
| Essays | 0 |
| Oral polls | 1 |
| Discussions | 1 |
Typical questions for ongoing performance evaluation within this section
- Discuss the failure models
- Discuss different failure masking techniques by redundancy
- What is k-fault tolerant group?
- What is general model of failure detection?
- Explain basic reliable multicasting
- Explain what is authentication
- Explain what are message confidentiality and integrity
Typical questions for seminar classes (labs) within this section
- Same as above
Test questions for final assessment in this section
- Same as above