Lab 4: Distribution & Streaming
Lab 4: Distribution & Streaming
NetID:
In this lab, we will take a look at how networks are shared, and how hamming codes work.
Part 1: Simultaneous Network Usage
Part 1: Simultaneous Network Usage
Network Representation using Graphs
Network Representation using Graphs
We will use circles to represent nodes, and lines between these circles (called "edges") to represent connections between nodes. These diagrams containing nodes and edges are called "graphs". The number inside the edges represents the network capacity of the connection (also called "bandwidth" of the edge). Source nodes are in orange, and destination nodes are in purple.
In[]:=
Graph{sa,ad},EdgeWeight{30,10},VertexLabelsAutomatic,EdgeLabels"EdgeWeight",
Out[]=
Network Capacity
Network Capacity
Let’s look at how networks behave when two or more nodes are simultaneously using common links to communicate.
Here is a toy network. S1 and S2 are source nodes, and D1 and D2 are destination nodes . All network traffic has to share the link between P and Q .
Out[]=
Problem 1 (1 point)
Problem 2 (1 point)
Problem 3 (2 points)
Problem 4 (1 point)
Problem 5 (1 point)
Part 2: Hamming Code
Part 2: Hamming Code
Hamming Code is a method of encoding data. In our examples, we will encode 4 bits of data into a sequence of 7 total bits, and observe the properties of the resulting 7-bit sequence.
Message = {1,0,1,0}
Out[]=
Problem 6 (1 point)
Problem 7 (1 point)
Problem 8 (1 point)
Problem 9 (1 point)
Submitting your work
Submitting your work
1
.Ensure you have filled in your NetID at the top of the notebook
2
.Save the notebook as a PDF file (Alternately, "Print to PDF" but please ensure the PDF looks ok and is not garbled)