Final Exam Review Knowledge questions True or false statement (explain why) Protocol Calculation Cover the second half contents.

Slides:



Advertisements
Similar presentations
Communication Networks ( ) / Spring 2011 The Blavatnik School of Computer Science, Tel-Aviv University Allon Wagner.
Advertisements

Chapter 5 Link Layer Computer Networking: A Top Down Approach 6th edition Jim Kurose, Keith Ross Addison-Wesley March 2012 A note on the use of these.
8-1 Last time □ Network layer ♦ Introduction forwarding vs. routing ♦ Virtual circuit vs. datagram details connection setup, teardown VC# switching forwarding.
Week 5: Internet Protocol Continue to discuss Ethernet and ARP –MTU –Ethernet and ARP packet format IP: Internet Protocol –Datagram format –IPv4 addressing.
Secure communications Week 10 – Lecture 2. To summarise yesterday Security is a system issue Technology and security specialists are part of the system.
8-1 Internet security threats Mapping: m before attacking: gather information – find out what services are implemented on network  Use ping to determine.
بسم الله الرحمن الرحيم NETWORK SECURITY Done By: Saad Al-Shahrani Saeed Al-Smazarkah May 2006.
Announcement r Project 3 out, due 3/10 r Homework 3 out last week m Due next Mon. 3/1.
CSIT435 Spring 2001 Final Examination Study Guide.
Routing & IP Routing Protocols
MAC Addresses and ARP 32-bit IP address: –network-layer address –used to get datagram to destination IP subnet MAC (or LAN or physical or Ethernet) address:
Review and Announcement r Ethernet m Ethernet CSMA/CD algorithm r Hubs, bridges, and switches m Hub: physical layer Can’t interconnect 10BaseT & 100BaseT.
16 – CSMA/CD - ARP Network Layer4-1. 5: DataLink Layer5-2 CSMA (Carrier Sense Multiple Access) CSMA: listen before transmit: If channel sensed idle: transmit.
Announcement r Project 2 Extension ? m Previous grade allocation: Projects 40% –Web client/server7% –TCP stack21% –IP routing12% Midterm 20% Final 20%
IP Address 0 network host 10 network host 110 networkhost 1110 multicast address A B C D class to to
Computer Networking Intra-Domain Routing, Part I RIP (Routing Information Protocol)
1 ECE453 – Introduction to Computer Networks Lecture 10 – Network Layer (Routing II)
Network Security7-1 Today r Collect Ch6 HW r Assign Ch7 HW m Ch7 #2,3,4,5,7,9,10,12 m Due Wednesday Nov 19 r Continue with Chapter 7 (Security)
Introduction1-1 Data Communications and Computer Networks Chapter 5 CS 3830 Lecture 26 Omar Meqdadi Department of Computer Science and Software Engineering.
Network LayerII-1 RSC Part II: Network Layer 4. IP in operation Redes y Servicios de Comunicaciones Universidad Carlos III de Madrid These slides are,
5: DataLink Layer5-1 LAN technologies Data link layer so far: m services, error detection/correction, multiple access Next: LAN technologies m addressing.
Network Layer Lecture # 2 MAHS. 4: Network Layer 4b-2 Hierarchical Routing scale: with 200 million destinations: r can’t store all dest’s in routing tables!
Final Exam Review Knowledge questions True or false statement (explain why) Protocol Calculation Cover the contents after midterm coverage.
Objectives: Chapter 5: Network/Internet Layer  How Networks are connected Network/Internet Layer Routed Protocols Routing Protocols Autonomous Systems.
IP routing. Simple Routing Table svr 4% netstat –r n Routing tables DestinationGatewayFlagsRefcntUseInterface UGH00emd UH10lo0.
Network Layer (4). Classless Addressing Addresses allocated in contiguous blocks – Number of addresses assigned always power of 2 Network portion of address.
Final Review. The exam Two double-sided letter size cheating sheets allowed Closed book, closed note McMaster calculator allowed Types of questions: –
Network Security7-1 CIS3360: Chapter 8: Cryptography Application of Public Cryptography Cliff Zou Spring 2012 TexPoint fonts used in EMF. Read the TexPoint.
1 Week 5 Lecture 2 IP Layer. 2 Network layer functions transport packet from sending to receiving hosts transport packet from sending to receiving hosts.
8-1 Chapter 8 Security Computer Networking: A Top Down Approach 6 th edition Jim Kurose, Keith Ross Addison-Wesley March 2012 part 2: Message integrity.
Introduction1-1 Data Communications and Computer Networks Chapter 6 CS 3830 Lecture 28 Omar Meqdadi Department of Computer Science and Software Engineering.
Network Layer4-1 The Internet Network layer forwarding table Host, router network layer functions: Routing protocols path selection RIP, OSPF, BGP IP protocol.
Transport Layer3-1 Chapter 4: Network Layer r 4. 1 Introduction r 4.2 Virtual circuit and datagram networks r 4.3 What’s inside a router r 4.4 IP: Internet.
5: DataLink Layer5-1 Chapter 5 Link Layer and LANs Computer Networking: A Top Down Approach Featuring the Internet, 3 rd edition. Jim Kurose, Keith Ross.
Internet Protocols. ICMP ICMP – Internet Control Message Protocol Each ICMP message is encapsulated in an IP packet – Treated like any other datagram,
Review. Layers Physical layer – sending bits from one place to another, ensuring an okay BER Data link layer – encapsulate information bits into frames,
Transport Layer3-1 Network Layer Every man dies. Not every man really lives.
Network Security7-1 Firewalls isolates organization’s internal net from larger Internet, allowing some packets to pass, blocking others. firewall.
EEC-484/584 Computer Networks Lecture 14 Wenbing Zhao
IP. Classless Inter-Domain Routing Classful addressing scheme wasteful – IP address space exhaustion – A class B net allocated enough for 65K hosts Even.
4: Network Layer4a-1 Distance Vector Routing Algorithm iterative: r continues until no nodes exchange info. r self-terminating: no “signal” to stop asynchronous:
Net5: ARP 協定 授課教師:雲林科技大學 張慶龍 老師. IP Address/Physical Address Static Mapping  IP broadcast address maps to Ethernet broadcast address  IP Multicast Address.
Final Exam Review Knowledge questions True or false statement (explain why) Protocol Calculation Cover the contents after midterm coverage –Homework 3,
Network Layer4-1 Chapter 4: Network Layer r 4. 1 Introduction r 4.2 Virtual circuit and datagram networks r 4.3 What’s inside a router r 4.4 IP: Internet.
Network Layer (2). Review Physical layer: move bits between physically connected stations Data link layer: move frames between physically connected stations.
4: Network Layer4-1 Chapter 4: Network Layer Last time: r Chapter Goals m Understand network layer principles and Internet implementation r Started routing.
Lecture 22 Network Security (cont) CPE 401 / 601 Computer Network Systems slides are modified from Dave Hollinger slides are modified from Jim Kurose,
Final Exam Review Will release at 10:00am Dec. 7 th, Due on Webcourse at 11:59pm the next day.
CSEN 404 Data Link Layer Amr El Mougy Lamia AlBadrawy.
4: DataLink Layer1 LAN technologies Data link layer so far: m services, error detection/correction, multiple access Next: LAN technologies m addressing.
CPSC 441: Link Layer1 Link Layer Addressing Slides originally from Carey Williamson Notes derived from “ Computer Networking: A Top Down Approach”, by.
Network Security Chapter 8 roadmap 8.1 What is network security? 8.2 Principles of cryptography (confidentiality) 8.3 Message integrity 8.4 End-point authentication.
Introduction to Networks
Chapter 4: Network Layer
NAT – Network Address Translation
Chapter 4 Network Layer Computer Networking: A Top Down Approach 6th edition Jim Kurose, Keith Ross Addison-Wesley March 2012 CPSC 335 Data Communication.
IT443 – Network Security Administration Instructor: Bo Sheng
Final Exam Review Will release at 10:00am Dec. 6th,
MAC Addresses and ARP 32-bit IP address:
ICMP ICMP – Internet Control Message Protocol
ARP: Address Resolution Protocol
Introduction to Networks
Final Exam Review Will release at 10:00am Dec. 4th,
Review and Announcement
Chapter 4: Network Layer
Chapter 4: Network Layer
Final Exam Review Will release at 10:00am Dec. 11th,
Chapter 4: Network Layer
Chapter 8 roadmap 8.1 What is network security?
Chapter 5: Link Layer 5.1 Introduction and services
Presentation transcript:

Final Exam Review Knowledge questions True or false statement (explain why) Protocol Calculation Cover the second half contents

Knowledge Question Examples Three classes of switch fabric Where can queue occur in router? TCP header size? IP header size? (20/20) How many bits in IP of IPv6? Address space size? Routing: Link state vs. distance vector ? Internet two-level routing? (inter-AS, intra-AS) RIP, OSPF, BGP? Used where? –OSPF uses link state, BGP uses distance vector Which is better? Slotted ALOHA, pure ALOHA, CSMA/CD? CSMA/CD? CSMA/CA? Why wireless use csma/ca?

Knowledge Question Examples MAC address bytes? Broadcast MAC addr.? What the broadcast address for? What is ARP? Why Ethernet is much better than aloha in efficiency? (homework 3) Hub vs. Switch? (homework 3) a, b, g: speed? Working frequency? ? (personal area network) Wireless no collision detection? (fading, hidden terminal) Network security three elements: –Confidentiality, authentication, integrity What is public key cryptography? Why use “nonce” in security? (replay attack) Usage of firewall? (block outside active traffic to inside) IP spoofing? SYN flood DoS attack?

Protocol Problem Examples NAT address translation procedure Digital signature procedure HTTPS connection procedure –CA, public key Secure (assume known public key) –Confidentiality –Integrity

Calculation Examples Homework 3 prob. 1 (subnet addressing) Homework 3, prob. 3-4 (distance vector) Homework 3, prob. 7 (parity checking) CDMA calculation (textbook fig. 6.5) Caesar cipher decrypt, Vigenere cipher, one-time pad decrypt (given the pad)

Three types of switching fabrics Property? Speed order?

Routing Algorithm classification Global or decentralized information? Global: all routers have complete topology, link cost info “ link state ” algorithms Decentralized: router knows physically-connected neighbors, link costs to neighbors iterative process of computation, exchange of info with neighbors “ distance vector ” algorithms

Intra-AS and Inter-AS routing Host h2 a b b a a C A B d c A.a A.c C.b B.a c b Host h1 Intra-AS routing within AS A Inter-AS routing between A and B Intra-AS routing within AS B –RIP: Routing Information Protocol –OSPF: Open Shortest Path First –BGP: Border Gateway Protocol (Inter-AS)

ARP protocol: Same LAN (network) A wants to send datagram to B, and B ’ s MAC address not in A ’ s ARP table. A broadcasts ARP query packet, containing B's IP address –Dest MAC address = FF-FF-FF-FF-FF-FF –all machines on LAN receive ARP query B receives ARP packet, replies to A with its (B's) MAC address –frame sent to A ’ s MAC address (unicast) A caches (saves) IP-to-MAC address pair in its ARP table until information becomes old (times out) –soft state: information that times out (goes away) unless refreshed ARP is “ plug-and-play ” : –nodes create their ARP tables without intervention from net administrator

What is network security? Confidentiality: only sender, intended receiver should “ understand ” message contents –sender encrypts message –receiver decrypts message Authentication: sender, receiver want to confirm identity of each other –Virus really from your friends? –The website really belongs to the bank? Message Integrity: sender, receiver want to ensure message not altered (in transit, or afterwards) without detection –Digital signature

public key cryptography sender, receiver do not share secret key public encryption key known to all private decryption key known only to receiver record and playback! “I’m Alice” Alice’s IP addr encryppted password OK Alice’s IP addr “I’m Alice” Alice’s IP addr encrypted password Replay Attack

Firewall Block outside-initiated traffic to inside of a local network Usually do not block any traffic initiated from inside to outside firewall

–Denial-of-Service (DoS) attack: Send many fake requests to congest link or consume server resource (CPU, memory) –SYN flooding: attacker sends many SYNs to victim; victim has to allocate connection resource; victim has no resource left for real connection requests any more. Usually with spoofed source IP address IP spoofing: –Attacker can generate “ raw ” IP packets directly from application, putting any value into IP source address field –Hide the identity of the traffic initiator

NAT: Network Address Translation S: , 3345 D: , : host sends datagram to , 80 NAT translation table WAN side addr LAN side addr , , 3345 …… S: , 80 D: , S: , 5001 D: , : NAT router changes datagram source addr from , 3345 to , 5001, updates table S: , 80 D: , : Reply arrives dest. address: , : NAT router changes datagram dest addr from , 5001 to , : random generated, Unique, ID for the connection

Distance table gives routing table (problem 3) D () A B C D A B D8945D8945 E cost to destination via destination ABCD ABCD B,5 A,7 D,4 A,4 Outgoing link to use, cost destination Distance table Routing table

Distance Vector Algorithm: example (for problem 4) X Z Y D (Y,Z) X c(X,Z) + min {D (Y,w)} w = = 7+1 = 8 Z D (Z,Y) X c(X,Y) + min {D (Z,w)} w = = 2+1 = 3 Y

large message m H: Hash function H(m) digital signature (encrypt) Bob’s private key K B - + Bob sends digitally signed message: Alice verifies signature and integrity of digitally signed message: K B (H(m)) - encrypted msg digest K B (H(m)) - encrypted msg digest large message m H: Hash function H(m) digital signature (decrypt) H(m) Bob’s public key K B + equal ? Digital signature = signed message digest No confidentiality !

Secure Alice:  generates random symmetric private key, K S.  encrypts message with K S (for efficiency)  also encrypts K S with Bob’s public key.  sends both K S (m) and K B (K S ) to Bob.  Alice wants to send confidential , m, to Bob. K S ( ). K B ( ). + + K S (m ) K B (K S ) + m KSKS KBKB + Internet KSKS

Secure Bob:  uses his private key to decrypt and recover K S  uses K S to decrypt K S (m) to recover m  Alice wants to send confidential , m, to Bob. K S ( ). K B ( ) K S (m ) K B (K S ) + m KSKS KSKS KBKB + Internet K S ( ). K B ( ). - KBKB - KSKS m K S (m ) K B (K S ) +

Secure (continued) Alice wants to provide message integrity (unchanged, really written by Alice). Alice digitally signs message. sends both message (in the clear) and digital signature. H( ). K A ( ) H(m ) K A (H(m)) - m KAKA - Internet m K A ( ). + KAKA + K A (H(m)) - m H( ). H(m ) compare

Caesar cipher decrypt: –“welcome”, key= +2  Vigenere cipher –“final exam” key=3,4,-1 (blank space does not change)