Class Notes (1,100,000)
US (490,000)
UCSD (8,000)
CSE 123 (20)
Lecture 1

CSE 123 Lecture Notes - Lecture 1: Sliding Window Protocol, Link Layer, Master Sergeant


Department
Computer Science and Engineering
Course Code
CSE 123
Professor
Alex Snoeren
Lecture
1

This preview shows half of the first page. to view the full 2 pages of the document.
P1 due 6pm Oct, 29th (right before Midterm!)
OH: Mon 10:30am - 12pm
End-to-End Argument - functionality should be implemented at a LOWER layer iff it can be
correctly and completely implemented there
- performance optimizations are NOT a violation
Sliding Window Protocol - single mechanism that supports:
- multiple outstanding packets
- reliable delivery
- in-order delivery
- flow control - prevent “overrunning” the receiver
Often used in the Data Link layer (2)
Project 1
struct Frame_t //packets
struct Sender_t //add more fields to implement SWP
- can add your own global variables!
Main.c - handle command line options and initializing data structures
Communicate.c - transporting messages between the sender and receiver threads
Input.c - handling messages inputted by the user
- These first three files you DO NOT NEED TO CHANGE
Common.h - houses commonly used data structures
SWP between threads
- spawn an input thread to receive your input command
- puts input command into a “input cmd queue”
- for Sender, you just read the command
- also needs to HANDLE the incoming msg from the Receiver in order to update your DS
- construct your own frame
- put to the output queue (automatically sends to receiver)
- create an acknowledgement frame and SEND it back to the Sender
Ex: ./tritontalk -s 1 -r 2
- initializes 1 sender and 2 receivers
msg 0 1 hello
- sender 0 messages receiver 1 “hello”
- 1 on 1 relationship!
HW
Bit Stuffing - how do we identify each frame?
You're Reading a Preview

Unlock to view full version