Homework Assignment 1
Lookup of IP Addresses
Assigned Date: September 2, 2009
Due Date: September 28, 2009
In the class, we discussed various issues related to the lookup of stored IP addresses in
the routers. In this assignment, you should first implemen
esses.
For 1Gbps line, the search time has to be < 512 nano sec.
1000 prefixes
contiguous
more than 1M soon.
service differentiation, and
are strong drivers
a
s
s
Problems to Consider
What are the potential problems?
How do we improve the search algorit
esses.
For 1Gbps line, the search time has to be < 512 nano sec.
1000 prefixes
contiguous
more than 1M soon.
service differentiation, and
are strong drivers
a
s
s
Problems to Consider
What are the potential problems?
How do we improve the search algorit
Routing Lookups in Hardware at Memory Access Speeds
Pankaj Gupta, Steven Lin, and Nick McKeown Computer Systems Laboratory, Stanford University Stanford, CA 943059030 cfw_pankaj, sclin, nickm@stanford.edu
Abstract
Increased bandwidth in the Internet puts
Routing in Communication Networks
Routing: Network layer protocol that guides information units to correct destinations. A
complex collection of decision rules that work somewhat independently.
 Determination of allowable path set for each origin  desti
Lecture on Multi Access Communication
For many applications (e.g.,satellite, radio broadcast, Ethernet), users share the same
channel. The received signal is the sum of the transmitted signal from the source that is
intended, the transmitted signals from
Finite M/M/1 queue
Consider an M/M/1 queue with finite waiting room.
(The previous result had infinite waiting room)
~
We can have up to N packets in the system.
After filling the system, packets are returned, or blocked.
Balance equations:
1
1
0
1
1
1
ESE 572 Homework Assignment 2
Chapters 1 and 2 of Text
Assigned Date: September 23, 2009
Due Date: October 5, 2009
Problem 1.1
Problem 1.2
Problem 1.3
Problem 2.7
Problem 2.9
Problem 2.11
Problem 2.16
Problem 2.17
Problem 2.19
Problem 2.30
Problem 2.31
Pr
ESE 572 Homework Assignment 3
Chapter 3 of Text
Assigned Date: October 7, 2009
Due Date: October 14, 2009
Problem 3.5
Problem 3.8
Problem 3.12
Problem 3.15
Problem 3.25
Problem 3.50
Problem 3.62
ESE 572 Homework Assignment 4
Chapter 4 of Text
Assigned Date: November 4, 2009
Due Date: November 18, 2009
Problem 4.2
Problem 4.3
Problem 4.13
Problem 4.15
Problem 4.25
Problem 4.31
ESE 572 Homework Assignment 5
Chapter 5 of Text
Assigned Date: November 23, 2009
Due Date: November 30, 2009
Problem 5.2
Problem 5.3
Problem 5.22
Problem 5.26
Problem 5.36
Lecture on Data Link Control
Goal : Conversion of a virtual bit pipe into an error free link.
Functions
Error Detection
Automatic Repeat Request (ARQ)
Framing

Sending DLC receives packets from Network layer.
Receiving DLC delivers packets to Network Lay
Lecture on Markov Chain
Definition : Markov Chain is a discrete time discrete alphabet random process
cfw_Xn, n>0 such that
Pr( X n +1 = j  X n = i , X n1 = in1 ,., X 0 = i0 ) = Pr( X n+1 = j  X n = i )
X n +1 is conditionally independent of X 0 , X 1
Midterm Exam BB 572
October 21, 2009
Your Name: 30% mm 3;
Your ID #I,
You need to Show all your work in order to get the
full credit. There are four problems in this
examination.
3
i I. Consider a. 10 Mbps link that is 280 km in iength. Every packet i