Advanced Distributed Algorithms and Data Structures. Christian Scheideler Institut für Informatik Universität Paderborn
|
|
|
- Tobias Peters
- 6 years ago
- Views:
Transcription
1 Advanced Distributed Algorithms and Data Structures Christian Scheideler Institut für Informatik Universität Paderborn
2 Advanced Distributed Algorithms and Data Structures Lecture: Thu 2-4 pm, F2.211 Tutorial: Thu am, F2.211 (starts 3 rd week) Website: /advanced-distributed-algorithms-and-data-structures/ Modules and Grading: MuA Modules III.2.1, III.2.2 and III %: oral exam, 50%: software project both parts must be passed to pass the course Prerequisites: basic knowledge in algorithms and data structures recommended: distributed algorithms and data structures course WS 2016 Chapter 1 2
3 Advanced Distributed Algorithms and Data Structures Homework assignments: Weekly assignments each Thursday on the website (starting with next week) Theoretical and implementations Slides and assignments: course website Book recommendations: no book available (lecture is based on newest results) WS 2016 Chapter 1 3
4 Embedding into CS Curriculum Bachelor I Data Structures and Algorithms Bachelor II Distributed Algorithms and Data Structures Master Advanced Distributed Algorithms and Data Structures WS 2016 Chapter 1 4
5 Embedding into CS Curriculum Master Advanced Distributed Algorithms and Data Structures Project Group: Design of a Trusted Communication Module WS 2016 Chapter 1 5
6 Advanced Distributed Algorithms and Data Structures Goals: 1. Introduction to advanced concepts in distributed algorithms and data structures. 2. Introduction to important design methods. 3. Introduction to important analytical methods. WS 2016 Chapter 1 6
7 Introduction Sequential Algorithms and Data Structures Distributed Algorithms and Data Structures WS 2016 Chapter 1 7
8 Introduction What are the basic problems for distributed algorithms and data structures? WS 2016 Chapter 1 8
9 Introduction Definition 1.1: A data structure is a certain way to organize data in a computer so that operations like, for example, search, insert, and delete are simple and effective to realize. Simple examples: Lists Arrays WS 2016 Chapter 1 9
10 Introduction Basic view: Operation 1 Data Structure Operation 2 Operation 3 WS 2016 Chapter 1 10
11 Introduction Classical case: computer with one processor Operations Data structure Storage WS 2016 Chapter 1 11
12 Introduction Computer with several processors/cores: Data structure Storage WS 2016 Chapter 1 12
13 Introduction Computer with several processors/cores: Cache Cache Cache Cache Data structure Overlaps: access conflicts (correctness) performance problems (efficiency) WS 2016 Chapter 1 13
14 Multiple computers: Introduction Data structure Problem: distribution of DS among computers WS 2016 Chapter 1 14
15 Multiple computers: Introduction Da ta str uct ure Problem: distribution of DS among computers WS 2016 Chapter 1 15
16 Introduction Multiple computers: Da ta str uct ure Basic problems: How to interconnect the computers? How to coordinate the management of the DS among the computers? WS 2016 Chapter 1 16
17 Introduction How to represent the connections between the computers? A Communication network (Internet, ad-hoc network, ) B A knows (IP address, MAC address, of) resp. has access autorization for B : network can send message from A to B High-level view: A knows B overlay edge (A,B) from A to B ( A B ) Set of all overlay edges forms directed graph known as overlay network. WS 2016 Chapter 1 17
18 Introduction Problem: find suitable overlay network for the computers / processes B A A and B know each other Best topology depends on problem and context. WS 2016 Chapter 1 18
19 Introduction Distributed Algorithms and Data Structures Advanced Distributed Algorithms and Data Structures Extensive study of overlay networks Assumption: processes form a clique Still many problems left: link management, access control, synchronization, communication primitives, transactions, and various applications. WS 2016 Chapter 1 19
20 Introduction Distributed Algorithms and Data Structures Advanced Distributed Algorithms and Data Structures Extensive study of overlay networks Assumption: processes form a clique Focus: strategies that are scalable, robust and secure. WS 2016 Chapter 1 20
21 Introduction Da ta str uct ure Focus: strategies that are scalable, robust and secure (because participants might be faulty or adversarial, or might get attacked from outside!) WS 2016 Chapter 1 21
22 Introduction Da ta str uct ure Central properties a system should satisfy: Robustness: availability Security: integrity and confidentiality WS 2016 Chapter 1 22
23 Introduction Four Commandments: 1. You shall not sleep 2. You shall not fail 3. You shall not lie 4. You shall not leak!
24 Introduction Four Commandments: 1. You shall not sleep 2. You shall not fail 3. You shall not lie 4. You shall not leak availability integrity confidentiality Measures against violations: Quite challenging
25 Introduction Examples of violations: 1. You shall not sleep asynchronicity 2. You shall not fail message loss, process/link failures, Denial-of-Service attacks 3. You shall not lie corrupted information/messages/protocols 4. You shall not leak outsider (e.g., man-in-the-middle) or insider (e.g., through viruses) attacks
26 Introduction Measures to be robust to asynchronicity: Decoupling of time and flow Time decoupling: interacting processes do not need to be available at the same time (usually needs mediator) Flow decoupling: the execution of an action within a process should not depend on the availability of another process (no remote calls asking for immediate return values) SS 2016 VADS - Kapitel 3 26
27 Introduction Measures against message loss and failures: Reactive approaches: recovery from any illegal state (such systems known as selfhealing / self-stabilizing) Proactive approaches: maintain availability even in faulty states (requires redundancy) Measures against Denial-of-Service attacks: Standard approach: enforce confidentiality to make targeted DoS attacks hard WS 2016 Chapter 1 27
28 Introduction Measures against corrupted messages and information: Algorithmic approach: use redundancy Cryptographic approach: integrity measures (encode messages and information so that correctness can be checked) Measures against corrupted protocols: Hard and expensive ( Byzantine general models) WS 2016 Chapter 1 28
29 Introduction Measures against leaking: Algorithmic approach: secret sharing Cryptographic approach: use encryption In the real world, leaking is hard to avoid. Main problem: exposure! WS 2016 Chapter 1 29
30 Introduction SPAM: Anyone can send you an and disseminate your address. DoS attacks: Anyone who has your IP address can send you a message and freely disseminate your IP address. Viruses: Once a virus is in your system, it has access to all information in it.
31 Introduction Owner consent and control: Clearly defined responsibilities Complete control over own info & resources Least exposure: Not more knowledge than necessary Complete control over information flow Self-recovery: Recovery from every possible state (as long as underlying layer is still in a legal state) Decoupling: No synchronization necessary for primitives Bachelor course: overlays
32 Introduction Owner consent and control: Clearly defined responsibilities Complete control over own info & resources Least exposure: Not more knowledge than necessary Complete control over information flow Problem: current systems cannot enforce these rules (because they are too open, too complex)
33 Introduction Owner consent and control: Clearly defined responsibilities Complete control over own info & resources Least exposure: Not more knowledge than necessary Complete control over information flow Not even suitable models and primitives available to rigorously study guidelines in the algorithms community. So viruses, trojans, and DoS attacks are usually ignored. In this lecture: new approach
34 Introduction New approach: Trusted Communication Model (TCM) AL TCL Internet AL (Application Layer): large storage capacity and computational power, but potentially insecure TCL (Trusted Communication Layer): low storage capacity and computational power but can securely manage ports and keys and can securely execute basic primitives WS 2016 Chapter 1 34
35 Introduction New approach: Trusted Communication Model (TCM) AL TCL Internet AL: can be invaded TCL: cannot be invaded or inspected Goal of TCL: support AL in ensuring availability, integrity, and confidentiality WS 2016 Chapter 1 35
36 Introduction ISO OSI-Model: Application Layer (HTTP) Presentation Layer (SMTP) Session Layer (NCP) AL TCL Transport Layer (TCP/UDP) Network Layer (IP) Data Link Layer (Ethernet) Physical Layer (MAC) WS 2016 Chapter 1 36
37 Advanced distributed algorithms and data structures Contents: 1. Introduction 2. Graph theory 3. Probability theory 4. Link primitives 5. TCM model and programming environment 6. Congestion control 7. Clock synchronization 8. Logical Clocks 9. Dynamic Overlay Networks 10. Broadcasting and Anycasting 11. Distributed Commit 12. Applications WS 2016 Chapter 1 37
38 Graph Theory Introduction to fundamental topologies Basic graph parameters (degree, diameter, expansion, ) WS 2016 Chapter 1 38
39 Advanced distributed algorithms and data structures Contents: 1. Introduction 2. Graph theory 3. Probability theory 4. Link primitives 5. TCM model and programming environment 6. Congestion control 7. Clock synchronization 8. Logical Clocks 9. Dynamic Overlay Networks 10. Broadcasting and Anycasting 11. Distributed Commit 12. Applications WS 2016 Chapter 1 39
40 Probability Theory Random variable Expectation Variance Markov inequality Chernoff bounds WS 2016 Chapter 1 40
41 Advanced distributed algorithms and data structures Contents: 1. Introduction 2. Graph theory 3. Probability theory 4. Link primitives 5. TCM model and programming environment 6. Congestion control 7. Clock synchronization 8. Logical Clocks 9. Dynamic Overlay Networks 10. Broadcasting and Anycasting 11. Distributed Commit 12. Applications WS 2016 Chapter 1 41
42 Link Primitives Safe forms of Introduction Fusion u v w u v w u v u v Delegation Reversal u v w u v w u v u v WS 2016 Chapter 1 42
43 Advanced distributed algorithms and data structures Contents: 1. Introduction 2. Graph theory 3. Probability theory 4. Link primitives 5. TCM model and programming environment 6. Congestion control 7. Clock synchronization 8. Logical Clocks 9. Dynamic Overlay Networks 10. Broadcasting and Anycasting 11. Distributed Commit 12. Applications WS 2016 Chapter 1 43
44 TCM Model and Programming Environment Processes can interconnect (using link primitives) and execute actions. Types of actions: Triggered by a local/remote call: name ( parameters ) commands Triggered by a local state: name : predicate commands All messages are remote action calls. Example: minimum(x,y) if x<y then m:=x else m:=y print(m) no return command! Action minimum is executed whenever a request to call minimum(x,y) is processed. WS 2016 Chapter 1 44
45 TCM Model and Programming Environment Processes can interconnect (using link primitives) and execute actions. Types of actions: Triggered by a local/remote call: name ( parameters ) commands Triggered by a local state: name : predicate commands All messages are remote action calls. Example: timeout: true print( I am still alive! ) true ensures that action timeout is periodically executed by the given peer (length of period handled by access control). WS 2016 Chapter 1 45
46 Advanced distributed algorithms and data structures Contents: 1. Introduction 2. Graph theory 3. Probability theory 4. Link primitives 5. TCM model and programming environment 6. Congestion control 7. Clock synchronization 8. Logical Clocks 9. Dynamic Overlay Networks 10. Broadcasting and Anycasting 11. Distributed Commit 12. Applications WS 2016 Chapter 1 46
47 Congestion Control Problem: nodes need to periodically contact their neighbors (synchronization, failure detection, ) without overwhelming them WS 2016 Chapter 1 47
48 Advanced distributed algorithms and data structures Contents: 1. Introduction 2. Graph theory 3. Probability theory 4. Link primitives 5. TCM model and programming environment 6. Congestion control 7. Clock synchronization 8. Logical Clocks 9. Dynamic Overlay Networks 10. Broadcasting and Anycasting 11. Distributed Commit 12. Applications WS 2016 Chapter 1 48
49 Clock Synchronization The physical clocks of the processes should show the same time. WS 2016 Chapter 1 49
50 Advanced distributed algorithms and data structures Contents: 1. Introduction 2. Graph theory 3. Probability theory 4. Link primitives 5. TCM model and programming environment 6. Congestion control 7. Clock synchronization 8. Logical Clocks 9. Dynamic Overlay Networks 10. Broadcasting and Anycasting 11. Distributed Commit 12. Applications WS 2016 Chapter 1 50
51 Logical Clocks Each request obtains a logical time stamp when processed so that requests can be topologically sorted. Process 4 Process 3 Process 2 Process : request processing Logical time Important for transactions, snapshots, WS 2016 Chapter 1 51
52 Advanced distributed algorithms and data structures Contents: 1. Introduction 2. Graph theory 3. Probability theory 4. Link primitives 5. TCM model and programming environment 6. Congestion control 7. Clock synchronization 8. Logical Clocks 9. Dynamic Overlay Networks 10. Broadcasting and Anycasting 11. Distributed Commit 12. Applications WS 2016 Chapter 1 52
53 Dynamic Overlay Networks Self-stabilizing clique and 2-clique (diameter 2) Other topologies: see Bachelor lecture WS 2016 Chapter 1 53
54 Advanced distributed algorithms and data structures Contents: 1. Introduction 2. Graph theory 3. Probability theory 4. Link primitives 5. TCM model and programming environment 6. Congestion control 7. Clock synchronization 8. Logical Clocks 9. Dynamic Overlay Networks 10. Broadcasting and Anycasting 11. Distributed Commit 12. Applications WS 2016 Chapter 1 54
55 Broadcasting and Anycasting Broadcasting: send a message to all nodes Anycasting: send a message to a random node WS 2016 Chapter 1 55
56 Advanced distributed algorithms and data structures Contents: 1. Introduction 2. Graph theory 3. Probability theory 4. Link primitives 5. TCM model and programming environment 6. Congestion control 7. Clock synchronization 8. Logical Clocks 9. Dynamic Overlay Networks 10. Broadcasting and Anycasting 11. Distributed Commit 12. Applications WS 2016 Chapter 1 56
57 Distributed Commit commit commit WS 2016 Chapter 1 57
58 Advanced distributed algorithms and data structures Contents: 1. Introduction 2. Graph theory 3. Probability theory 4. Link primitives 5. TCM model and programming environment 6. Congestion control 7. Clock synchronization 8. Logical Clocks 9. Dynamic Overlay Networks 10. Broadcasting and Anycasting 11. Distributed Commit 12. Applications WS 2016 Chapter 1 58
59 Applications Authenticated information system Crypto currencies Publish / subscribe systems (may still change) WS 2016 Chapter 1 59
60 Questions? WS 2016 Chapter 1 60
Advanced Distributed Algorithms and Data Structures
Advanced Distributed Algorithms and Data Structures Chapter 5: TCM Model and Programming Environment Christian Scheideler Institut für Informatik Universität Paderborn Overview TCM model Pseudo-code and
CSE 5306 Distributed Systems. Course Introduction
CSE 5306 Distributed Systems Course Introduction 1 Instructor and TA Dr. Donggang Liu @ CSE Web: http://ranger.uta.edu/~dliu Email: dliu@uta.edu Phone: 817-2720741 Office: ERB 555 Office hours: Tus/Ths
CS System Security Mid-Semester Review
CS 356 - System Security Mid-Semester Review Fall 2013 Mid-Term Exam Thursday, 9:30-10:45 you may bring one 8-1/2 x 11 sheet of paper with any notes you would like no cellphones, calculators This is to
DISTRIBUTED SYSTEMS Principles and Paradigms Second Edition ANDREW S. TANENBAUM MAARTEN VAN STEEN. Chapter 1. Introduction
DISTRIBUTED SYSTEMS Principles and Paradigms Second Edition ANDREW S. TANENBAUM MAARTEN VAN STEEN Chapter 1 Introduction Modified by: Dr. Ramzi Saifan Definition of a Distributed System (1) A distributed
ENEE 457: Computer Systems Security 8/27/18. Lecture 1 Introduction to Computer Systems Security
ENEE 457: Computer Systems Security 8/27/18 Lecture 1 Introduction to Computer Systems Security Charalampos (Babis) Papamanthou Department of Electrical and Computer Engineering University of Maryland,
Middleware and Distributed Systems. System Models. Dr. Martin v. Löwis
Middleware and Distributed Systems System Models Dr. Martin v. Löwis System Models (Coulouris et al.) Architectural models of distributed systems placement of parts and relationships between them e.g.
IT443 Network Security Administration Spring Gabriel Ghinita University of Massachusetts at Boston
IT443 Network Security Administration Spring 2018 Gabriel Ghinita University of Massachusetts at Boston Contact Information Instructor: Dr. Gabriel Ghinita Email: Gabriel.Ghinita@umb.edu (preferred contact)
Computer Networks. General Course Information. Addressing and Routing. Computer Networks 9/8/2009. Basic Building Blocks for Computer Networks
Outline: Computer Networks Introduction General course information. Some basic concepts for computer s. Network programming. General Course Information Course Web page http://www.cs.rochester.edu/~kshen/csc257-fall2009
MORGANSTATEUNIVERSITY DEPARTMENT OF ELECTRICAL AND COMPUTER ENGINEERING. EEGR410 Introduction to Networks. Credits: 3 COURSE SYLLABUS
Instructor: Office: Telephone No. Email Address: Office Hours: References MORGANSTATEUNIVERSITY DEPARTMENT OF ELECTRICAL AND COMPUTER ENGINEERING EEGR410 Introduction to Networks Credits: 3 COURSE SYLLABUS
15-744: Computer Networking. L-1 Intro to Computer Networks
15-744: Computer Networking L-1 Intro to Computer Networks Outline Administrivia Layering 2 Who s Who? Professor: Srinivasan Seshan http://www.cs.cmu.edu/~srini srini@cmu.edu Office hours: Friday 4:00-5:00
Cryptography and Network Security. Prof. D. Mukhopadhyay. Department of Computer Science and Engineering. Indian Institute of Technology, Kharagpur
Cryptography and Network Security Prof. D. Mukhopadhyay Department of Computer Science and Engineering Indian Institute of Technology, Kharagpur Module No. # 01 Lecture No. # 38 A Tutorial on Network Protocols
Research Statement. Yehuda Lindell. Dept. of Computer Science Bar-Ilan University, Israel.
Research Statement Yehuda Lindell Dept. of Computer Science Bar-Ilan University, Israel. lindell@cs.biu.ac.il www.cs.biu.ac.il/ lindell July 11, 2005 The main focus of my research is the theoretical foundations
Introduction Distributed Systems
Introduction Distributed Systems Today Welcome Distributed systems definition, goals and challenges What is a distributed system? Very broad definition Collection of components, located at networked computers,
Cryptography and Network Security Chapter 14
Cryptography and Network Security Chapter 14 Fifth Edition by William Stallings Lecture slides by Lawrie Brown Chapter 14 Key Management and Distribution No Singhalese, whether man or woman, would venture
Network Security: Broadcast and Multicast. Tuomas Aura T Network security Aalto University, Nov-Dec 2010
Network Security: Broadcast and Multicast Tuomas Aura T-110.5240 Network security Aalto University, Nov-Dec 2010 Outline 1. Broadcast and multicast 2. Receiver access control (i.e. data confidentiality)
Scalable overlay Networks
overlay Networks Dr. Samu Varjonen 1 Contents Course overview Lectures Assignments/Exercises 2 Course Overview Overlay networks and peer-to-peer technologies have become key components for building large
Network security session 9-2 Router Security. Network II
Network security session 9-2 Router Security Network II Router security First line of defense of the network Compromise of a router can lead to many issues: Denial of network services Degrading of network
Spring 2010: CS419 Computer Security
Spring 2010: CS419 Computer Security Vinod Ganapathy Lecture 7 Topic: Key exchange protocols Material: Class handout (lecture7_handout.pdf) Chapter 2 in Anderson's book. Today s agenda Key exchange basics
Dr Markus Hagenbuchner CSCI319 SIM. Distributed Systems Chapter 4 - Communication
Dr Markus Hagenbuchner markus@uow.edu.au CSCI319 SIM Distributed Systems Chapter 4 - Communication CSCI319 Chapter 4 Page: 1 Communication Lecture notes based on the textbook by Tannenbaum Study objectives:
Security & Privacy. Web Architecture and Information Management [./] Spring 2009 INFO (CCN 42509) Contents. Erik Wilde, UC Berkeley School of
![Security & Privacy. Web Architecture and Information Management [./] Spring 2009 INFO (CCN 42509) Contents. Erik Wilde, UC Berkeley School of](/thumbs/80/82185476.jpg "Security & Privacy. Web Architecture and Information Management [./] Spring 2009 INFO (CCN 42509) Contents. Erik Wilde, UC Berkeley School of")
Contents Security & Privacy Contents Web Architecture and Information Management [./] Spring 2009 INFO 190-02 (CCN 42509) Erik Wilde, UC Berkeley School of Information Abstract 1 Security Concepts Identification
CSCD 330 Network Programming Spring Lecture 1 - Course Details
CSCD 330 Network Programming Spring 2018 Lecture 1 - Course Details Contact Information Instructor: Carol Taylor 319A CEB Phone: 509-359-6065 E-mail: ctaylor@ewu.edu Course: CSCD330, CEB 107 Lecture, M,
MORGANSTATEUNIVERSITY DEPARTMENT OF ELECTRICAL AND COMPUTER ENGINEERING. EEGR510 Communications Networks Credits: 3 COURSE SYLLABUS
MORGANSTATEUNIVERSITY DEPARTMENT OF ELECTRICAL AND COMPUTER ENGINEERING EEGR510 Communications Networks Credits: 3 COURSE SYLLABUS Instructor: Dr. Farzad Moazzami Office: SEB 334 Telephone No. 443-885-4204
Module 1. Introduction. Version 2, CSE IIT, Kharagpur
Module 1 Introduction Version 2, CSE IIT, Kharagpur Introduction In this module we shall highlight some of the basic aspects of computer networks in two lessons. In lesson 1.1 we shall start with the historical
Outline : Computer Networking. Objectives. Who s Who? Administrivia. Layering. L-1 Intro to Computer Networks
Outline 15-744: Computer Networking Administrivia Layering L-1 Intro to Computer Networks 2 Who s Who? Professor: Srinivasan Seshan http://www.cs.cmu.edu/~srini srini@cmu.edu Office hours: Friday 4:00-5:00
Security and Privacy in Computer Systems. Lecture 7 The Kerberos authentication system. Security policy, security models, trust Access control models
CS 645 Security and Privacy in Computer Systems Lecture 7 The Kerberos authentication system Last Week Security policy, security models, trust Access control models The Bell-La Padula (BLP) model The Biba
Computer Information Systems (CIS) CIS 105 Current Operating Systems/Security CIS 101 Introduction to Computers
Computer Information Systems (CIS) CIS 101 Introduction to Computers This course provides an overview of the computing field and its typical applications. Key terminology and components of computer hardware,
CSCE 813 Internet Security Final Exam Preview
CSCE 813 Internet Security Final Exam Preview Professor Lisa Luo Fall 2017 Coverage All contents! Week1 ~ Week 15 The nature of the exam: 12 questions: 3 multiple choices questions 1 true or false question
Faculty of King Abdullah II School for Information Technology Department of Computer Science Study Plan Master's In Computer Science (Thesis Track)
Faculty of King Abdullah II School for Information Technology Department of Computer Science Study Plan Master's In Computer Science (Thesis Track) Plan Number Serial # Degree First: General Rules Conditions:.
Textbook Charles Petzold, Programming Windows, 5th edition, Microsoft Press. References - other textbooks or materials none
CS351 Systems Programming Last Updated - 03/01/02 Course Manager Dr. Phil Dickens, Assistant Professor 3 credit hours; required for CS & CPE; 100 min. lecture & 100 min. lab each week Current Catalog Description
Distributed Deadlock
Distributed Deadlock 9.55 DS Deadlock Topics Prevention Too expensive in time and network traffic in a distributed system Avoidance Determining safe and unsafe states would require a huge number of messages
CS544 Computer Networks Midterm Examination Spring Professor Mike Kain
CS544 Computer Networks Midterm Examination Spring 12-13 Professor Mike Kain By turning in this exam, each one of you is explicitly making the following pledge of honesty: "I understand that this exam
Charlie Garrod School of Computer Science
Principles of Software Construction: Objects, Design, and Concurrency Distributed System Design, Part 4 Spring 2014 Charlie Garrod Christian Kästner School of Computer Science Administrivia Homework 6,
Cristina Nita-Rotaru. CS355: Cryptography. Lecture 17: X509. PGP. Authentication protocols. Key establishment.
CS355: Cryptography Lecture 17: X509. PGP. Authentication protocols. Key establishment. Public Keys and Trust Public Key:P A Secret key: S A Public Key:P B Secret key: S B How are public keys stored How
Computer Information Systems (CIS) CIS 105 Current Operating Systems/Security CIS 101 Introduction to Computers
Computer Information Systems (CIS) CIS 101 Introduction to Computers This course provides an overview of the computing field and its typical applications. Key terminology and components of computer hardware,
ECE : Fundamentals of Wireless Networking - Spring 2007
ECE 6962-003: Fundamentals of Wireless Networking - Spring 2007 Instructors: Roland Kempter and Rong-Rong Chen Grader: Hong Wan 1 Roland Kempter Office: MEB 3252 Phone: (801) 581 3380 Email: kempter@eng.utah.edu
Announcements. me your survey: See the Announcements page. Today. Reading. Take a break around 10:15am. Ack: Some figures are from Coulouris
Announcements Email me your survey: See the Announcements page Today Conceptual overview of distributed systems System models Reading Today: Chapter 2 of Coulouris Next topic: client-side processing (HTML,
CIS 4360 Secure Computer Systems Applied Cryptography
CIS 4360 Secure Computer Systems Applied Cryptography Professor Qiang Zeng Spring 2017 Symmetric vs. Asymmetric Cryptography Symmetric cipher is much faster With asymmetric ciphers, you can post your Public
ES623 Networked Embedded Systems
ES623 Networked Embedded Systems Introduction to Network models & Data Communication 16 th April 2013 OSI Models An ISO standard that covers all aspects of network communication is the Open Systems Interconnection
ECPE / COMP 177 Fall Some slides from Kurose and Ross, Computer Networking, 5 th Edition
ECPE / COMP 177 Fall 2012 Some slides from Kurose and Ross, Computer Networking, 5 th Edition Application Layer Transport Layer Network Layer Link Layer Physical Layer 2 Application Layer HTTP DNS IMAP
Exam : ST Title : Symantec Mail Security 8300 Series (STS) Version : Demo
Exam : ST0-030 Title : Symantec Mail Security 8300 Series (STS) Version : Demo 1. What is a key prerequisite for enabling the end-user Email Spam Quarantine feature? A. Selecting the 'Delete messages sent
CS 428/528 Computer Networks Lecture 01. Yan Wang
1 CS 428/528 Computer Lecture 01 Yan Wang 2 Motivation: Why bother? Explosive growth of networks 1989, 100,000 hosts on the Internet Distributed Applications and Systems E-mail, WWW, multimedia, distributed
Chapter 1: Distributed Systems: What is a distributed system? Fall 2013
Chapter 1: Distributed Systems: What is a distributed system? Fall 2013 Course Goals and Content n Distributed systems and their: n Basic concepts n Main issues, problems, and solutions n Structured and
Cryptography and Network Security Overview & Chapter 1. Network Security. Chapter 0 Reader s s Guide. Standards Organizations.
Cryptography and Network Security Overview & Chapter 1 Fifth Edition by William Stallings Lecture slides by Lawrie Brown (with edits by RHB) Chapter 0 Reader s s Guide The art of war teaches us to rely
CS Protocol Design. Prof. Clarkson Spring 2017
CS 5430 Protocol Design Prof. Clarkson Spring 2017 Review Cryptography: Encryption, block ciphers, block cipher modes, MACs, cryptographic hash functions, digital signatures, authenticated encryption,
Network Security: Broadcast and Multicast. Tuomas Aura T Network security Aalto University, Nov-Dec 2011
Network Security: Broadcast and Multicast Tuomas Aura T-110.5241 Network security Aalto University, Nov-Dec 2011 Outline 1. Broadcast and multicast 2. Receiver access control (i.e. data confidentiality)
Lecture Nov. 21 st 2006 Dan Wendlandt ISP D ISP B ISP C ISP A. Bob. Alice. Denial-of-Service. Password Cracking. Traffic.
15-441 Lecture Nov. 21 st 2006 Dan Wendlandt Worms & Viruses Phishing End-host impersonation Denial-of-Service Route Hijacks Traffic modification Spyware Trojan Horse Password Cracking IP Spoofing DNS
Threat Modeling. Bart De Win Secure Application Development Course, Credits to
Threat Modeling Bart De Win bart.dewin@ascure.com Secure Application Development Course, 2009 Credits to Frank Piessens (KUL) for the slides 2 1 Overview Introduction Key Concepts Threats, Vulnerabilities,
IT ACCEPTABLE USE POLICY
CIO Signature Approval & Date: IT ACCEPTABLE USE POLICY 1.0 PURPOSE The purpose of this policy is to define the acceptable and appropriate use of ModusLink s computing resources. This policy exists to
IT 341 Fall 2017 Syllabus. Department of Information Sciences and Technology Volgenau School of Engineering George Mason University
Department of Information Sciences and Technology Volgenau School of Engineering George Mason University Fall 2017 IT 341 Data Communications and Networking Principles Syllabus (Revised 08/14/2017) Section
Cryptographic Primitives and Protocols for MANETs. Jonathan Katz University of Maryland
Cryptographic Primitives and Protocols for MANETs Jonathan Katz University of Maryland Fundamental problem(s) How to achieve secure message authentication / transmission in MANETs, when: Severe resource
E-commerce security: SSL/TLS, SET and others. 4.1
E-commerce security: SSL/TLS, SET and others. 4.1 1 Electronic payment systems Purpose: facilitate the safe and secure transfer of monetary value electronically between multiple parties Participating parties:
IEEE 2013 JAVA PROJECTS Contact No: KNOWLEDGE AND DATA ENGINEERING
IEEE 2013 JAVA PROJECTS www.chennaisunday.com Contact No: 9566137117 KNOWLEDGE AND DATA ENGINEERING (DATA MINING) 1. A Fast Clustering-Based Feature Subset Selection Algorithm for High Dimensional Data
CMPE 150/L : Introduction to Computer Networks
CMPE 150/L : Introduction to Computer Networks Chen Qian Computer Engineering UCSC Baskin Engineering Lecture 1 Slides source: Kurose and Ross, Simon Lam, Katia Obraczka Introduction 1-1 Notetaker Position
Wireless Network Security
Wireless Network Security Wireless LAN Security Slide from 2 nd book 1 802.11 Wireless LAN Security Stations in LAN are connected physically while in WLAN any station in the radio range is connected, so
TECHNISCHE UNIVERSITEIT EINDHOVEN Faculteit Wiskunde en Informatica
TECHNISCHE UNIVERSITEIT EINDHOVEN Faculteit Wiskunde en Informatica Examination Architecture of Distributed Systems (2IMN10), on Thursday, January 25, 2018, from 18.00 to 21.00 hours. Before you start,
the Presence of Adversaries Sharon Goldberg David Xiao, Eran Tromer, Boaz Barak, Jennifer Rexford
Internet Path-Quality Monitoring in the Presence of Adversaries Sharon Goldberg David Xiao, Eran Tromer, Boaz Barak, Jennifer Rexford Princeton University Penn State University CS Seminar November 29,
Oracle Communications WebRTC Session Controller
Oracle Communications WebRTC Session Controller Security Guide Release 7.0 E40975-01 November 2013 Oracle Communications WebRTC Session Controller Security Guide, Release 7.0 E40975-01 Copyright 2013,
Computer Science 461 Final Exam May 22, :30-3:30pm
NAME: Login name: Computer Science 461 Final Exam May 22, 2012 1:30-3:30pm This test has seven (7) questions, each worth ten points. Put your name on every page, and write out and sign the Honor Code pledge
CS-435 spring semester Network Technology & Programming Laboratory. Stefanos Papadakis & Manolis Spanakis
CS-435 spring semester 206 Network Technology & Programming Laboratory University of Crete Computer Science Department Stefanos Papadakis & Manolis Spanakis CS-435 Lecture #2 preview: Data Communications
Data Security and Privacy. Topic 14: Authentication and Key Establishment
Data Security and Privacy Topic 14: Authentication and Key Establishment 1 Announcements Mid-term Exam Tuesday March 6, during class 2 Need for Key Establishment Encrypt K (M) C = Encrypt K (M) M = Decrypt
CS408 Cryptography & Internet Security
CS408 Cryptography & Internet Security Lecture 18: Cryptographic hash functions, Message authentication codes Functions Definition Given two sets, X and Y, a function f : X Y (from set X to set Y), is
A Survey of BGP Security: Issues and Solutions
A Survey of BGP Security: Issues and Solutions Butler, Farley, McDaniel, Rexford Kyle Super CIS 800/003 October 3, 2011 Outline Introduction/Motivation Sources of BGP Insecurity BGP Security Today BGP
L7: Key Distributions. Hui Chen, Ph.D. Dept. of Engineering & Computer Science Virginia State University Petersburg, VA 23806
L7: Key Distributions Hui Chen, Ph.D. Dept. of Engineering & Computer Science Virginia State University Petersburg, VA 23806 9/16/2015 CSCI 451 - Fall 2015 1 Acknowledgement Many slides are from or are
Distributed Systems. Today. Next. Distributed systems The class Models and architectures. A brief, gentle intro to Go
Distributed Systems Today Distributed systems The class Models and architectures Next A brief, gentle intro to Go Image from http://www.vs.inf.ethz.ch/about/zeit.jpg Welcome! What is this all about? A
Master Course Computer Networks IN2097
Chair for Network Architectures and Services Prof. Carle Department for Computer Science TU München Master Course Computer Networks IN2097 Chapter 7 - Network Measurements Introduction Architecture & Mechanisms
Foundations of Cryptography CS Shweta Agrawal
Foundations of Cryptography CS 6111 Shweta Agrawal Course Information 4-5 homeworks (20% total) A midsem (25%) A major (35%) A project (20%) Attendance required as per institute policy Challenge questions
EEL DATA NETWORKS, SYSTEMS, AND SECURITY Fall 2016
EEL 6935 - DATA NETWORKS, SYSTEMS, AND SECURITY Fall 2016 Objectives The objective of this course is to provide a technical and operational introduction to data/computer communication networks. Students
PROGRAMMING Kyriacou E. Frederick University Cyprus. Network communication examples
ACSC424 NETWORK APPLICATION PROGRAMMING Kyriacou E. Frederick University Cyprus communication examples The OSI reference model (proposed by ISO) Application A Application B 2 Application Application Presentation
Student ID: CS457: Computer Networking Date: 5/8/2007 Name:
CS457: Computer Networking Date: 5/8/2007 Name: Instructions: 1. Be sure that you have 10 questions 2. Write your Student ID (email) at the top of every page 3. Be sure to complete the honor statement
Modelling and Analysing of Security Protocol: Lecture 1. Introductions to Modelling Protocols. Tom Chothia CWI
Modelling and Analysing of Security Protocol: Lecture 1 Introductions to Modelling Protocols Tom Chothia CWI This Course This course will primarily teaching you: How to design your own secure communication
Computer Networks. Wenzhong Li. Nanjing University
Computer Networks Wenzhong Li Nanjing University 1 Chapter 7. Network Security Network Attacks Cryptographic Technologies Message Integrity and Authentication Key Distribution Firewalls Transport Layer
Defenses against Wormhole Attack
Defenses against Wormhole Attack Presented by: Kadhim Hayawi, ID: 20364216 COURSE PRESENTATION FOR ECE750 - INTELLIGENT SENSORS AND SENSOR NETWORKS Prof. Otman A. Basir Outline Introduction Packet Leashes
AN exam March
AN exam March 29 2018 Dear student This exam consists of 7 questions. The total number of points is 100. Read the questions carefully. Be precise and concise. Write in a readable way. Q1. UDP and TCP (25
In the Domain Name System s language, rcode 0 stands for: no error condition.
12/2017 SIMPLE, FAST, RESILIENT In the Domain Name System s language, rcode 0 stands for: no error condition. If a DNS server answers a query with this result code, the service is running properly. This
Security and Anonymity
Security and Anonymity Distributed Systems need a network to send messages. Any message you send in a network can be looked at by any router or machine it goes through. Further if your machine is on the
Total No. of Questions : 09 ] [ Total No.of Pages : 02
![Total No. of Questions : 09 ] [ Total No.of Pages : 02](/thumbs/86/93170507.jpg "Total No. of Questions : 09 ] [ Total No.of Pages : 02")
CS / IT 321 (CR) Total No. of Questions : 09 ] [ Total No.of Pages : 02 III/IV B. TECH. DEGREE EXAMINATIONS, OCT / NOV - 2015 Second Semester COMPUTER SCIENCE & ENGINEERING NETWK SECURITY Time : Three
Introduction to Cryptology ENEE 459E/CMSC 498R. Lecture 1 1/26/2017
Introduction to Cryptology ENEE 459E/CMSC 498R Lecture 1 1/26/2017 Syllabus Highlights Best way to contact me is via email: danadach@ece.umd.edu My office hours; Thurs 3:00-4:00pm, Friday, 12:00-1pm in
ACMS: The Akamai Configuration Management System. A. Sherman, P. H. Lisiecki, A. Berkheimer, and J. Wein
ACMS: The Akamai Configuration Management System A. Sherman, P. H. Lisiecki, A. Berkheimer, and J. Wein Instructor: Fabian Bustamante Presented by: Mario Sanchez The Akamai Platform Over 15,000 servers
Advanced Relational Database Management MISM Course S A3 Spring 2019 Carnegie Mellon University
Advanced Relational Database Management MISM Course S19-95736 A3 Spring 2019 Carnegie Mellon University Instructor: Randy Trzeciak Office: HBH 1104C Office hours: By Appointment Phone: 412-268-7040 E-mail:
Authenticating People and Machines over Insecure Networks
Authenticating People and Machines over Insecure Networks EECE 571B Computer Security Konstantin Beznosov authenticating people objective Alice The Internet Bob Password= sesame Password= sesame! authenticate
Wireless Networks (CSC-7602) Lecture 1 (27 Aug 2007)
Wireless Networks (CSC-7602) Lecture 1 (27 Aug 2007) Seung-Jong Park (Jay) http://www.csc.lsu.edu/~sjpark 1 Handouts Class information Schedule (check online frequently) 2 1 Goals Principles on Wireless
WAFA X3 Evolution Grade of Service. 13 October 2008
Evolution Grade of Service 13 October 2008 1 Grades of Service at a glance The following table (Figure 1) highlights the various Grades of Service that are available on the Evolution Service. It enables
8 Supervised Overlay Networks
8 Supervised Overlay Networks Every application run on multiple machines needs a mechanism that allows the machines to exchange information. An easy way of solving this problem is that every machine knows
Communicating over the Network. Network Fundamentals. ITE PC v4.0 Chapter Cisco Systems, Inc. All rights reserved.
Communicating over the Network Network Fundamentals 1 Network Structure Define e the components of a network Network components hardware software 2 Network Structure End Devices and their Role in the Network
Security in ECE Systems
Lecture 11 Information Security ECE 197SA Systems Appreciation Security in ECE Systems Information security Information can be very valuable Secure communication important to protect information Today
Security for Structured Peer-to-peer Overlay Networks. Acknowledgement. Outline. By Miguel Castro et al. OSDI 02 Presented by Shiping Chen in IT818
Security for Structured Peer-to-peer Overlay Networks By Miguel Castro et al. OSDI 02 Presented by Shiping Chen in IT818 1 Acknowledgement Some of the following slides are borrowed from talks by Yun Mao
System Models for Distributed Systems
System Models for Distributed Systems INF5040/9040 Autumn 2015 Lecturer: Amir Taherkordi (ifi/uio) August 31, 2015 Outline 1. Introduction 2. Physical Models 4. Fundamental Models 2 INF5040 1 System Models
CIS 5373 Systems Security
CIS 5373 Systems Security Topic 4.1: Network Security Basics Endadul Hoque Slide Acknowledgment Contents are based on slides from Cristina Nita-Rotaru (Northeastern) 2 Network Security INTRODUCTION 3 What
Academic Course Description
BEC601 - COMPUTER COMMUNICATION AND NETWORKS Course (catalog) description Academic Course Description BHARATH UNIVERSITY Faculty of Engineering and Technology Department of Electronics and Communication
Networks and Communications MS216 - Course Outline -
Networks and Communications MS216 - Course Outline - Objective Lecturer Times Overall Learning Outcomes Format Programme(s) The objective of this course is to develop in students an understanding of the
CS 134: Elements of Cryptography and Computer + Network Security Winter sconce.ics.uci.edu/134-w16/ CS 134 Background
CS 134: Elements of Cryptography and Computer + Network Security Winter 2016 sconce.ics.uci.edu/134-w16/ 1 CS 134 Background 11:00-12:20 @ SSL 290 Discussions section as needed (must register!) Senior-level
ECE 646 Cryptography and Computer Network Security. Kris Gaj Research and teaching interests:
646 Cryptography and Computer Network Security Course web page: web page Courses 646 Kris Gaj Research and teaching interests: cryptography network security computer arithmetic FPGA & ASIC design and testing
A Policy Framework for a Secure
A Policy Framework for a Secure Future Internet Jad Naous(Stanford University) Arun Seehra(UT Austin) Michael Walfish(UT Austin) David Mazières(Stanford University) Antonio Nicolosi(Stevens Institute of
NETWORKING. 8. ITDNW08 Congestion Control for Web Real-Time Communication
NETWORKING 1. ITDNW01 Wormhole: The Hidden Virus Propagation Power of a Search Engine in Social 2. ITDNW02 Congestion Control for Background Data Transfers With Minimal Delay Impact 3. ITDNW03 Transient
CS 6903: Modern Cryptography Spring 2011
Lecture 1: Introduction CS 6903: Modern Cryptography Spring 2011 Nitesh Saxena NYU-Poly Outline Administrative Stuff Introductory Technical Stuff Some Pointers Course Web Page http://isis.poly.edu/courses/cs6903-s11
System models for distributed systems
System models for distributed systems INF5040/9040 autumn 2010 lecturer: Frank Eliassen INF5040 H2010, Frank Eliassen 1 System models Purpose illustrate/describe common properties and design choices for
Distributed Systems 11. Consensus. Paul Krzyzanowski
Distributed Systems 11. Consensus Paul Krzyzanowski pxk@cs.rutgers.edu 1 Consensus Goal Allow a group of processes to agree on a result All processes must agree on the same value The value must be one
20-CS Cyber Defense Overview Fall, Network Basics
20-CS-5155 6055 Cyber Defense Overview Fall, 2017 Network Basics Who Are The Attackers? Hackers: do it for fun or to alert a sysadmin Criminals: do it for monetary gain Malicious insiders: ignores perimeter
Elements of Cryptography and Computer and Network Security Computer Science 134 (COMPSCI 134) Fall 2016 Instructor: Karim ElDefrawy
Elements of Cryptography and Computer and Network Security Computer Science 134 (COMPSCI 134) Fall 2016 Instructor: Karim ElDefrawy Homework 3 Due: Monday, 11/28/2016 at 11:55pm PT Solution: Will be posted
Diffie-Hellman. Part 1 Cryptography 136
Diffie-Hellman Part 1 Cryptography 136 Diffie-Hellman Invented by Williamson (GCHQ) and, independently, by D and H (Stanford) A key exchange algorithm o Used to establish a shared symmetric key Not for