Distance-Vector and Path-Vector Routing
Reading: Sections 4.2 and 4.3.4
Acknowledgments: Lecture slides are from Computer networks course
thought by Jennifer Rexford at Princeton University. When slid
Link-State Routing
Reading: Sections 4.2 and 4.3.4
Acknowledgments: Lecture slides are from Computer networks course
thought by Jennifer Rexford at Princeton University. When slides are
obtained from
Links
Reading: Chapter 2
Acknowledgments: Lecture slides are from Computer networks course
thought by Jennifer Rexford at Princeton University. When slides are
obtained from other sources, a reference
Switches
Reading: Section 3.2
Acknowledgments: Lecture slides are from Computer networks course
thought by Jennifer Rexford at Princeton University. When slides are
obtained from other sources, a refe
Middleboxes
Reading: Section 8.4
Acknowledgments: Lecture slides are from Computer networks course
thought by Jennifer Rexford at Princeton University. When slides are
obtained from other sources, a a
Translating Addresses
Reading: Section 4.1 and 9.1
CE443-Fall 1388
Acknowledgments: Lecture slides are from Computer networks course
thought by Jennifer Rexford at Princeton University. When slides ar
Web Content Delivery
Reading: Section 9.1.2 and 9.4.3
Acknowledgments: Lecture slides are from Computer networks course
thought by Jennifer Rexford at Princeton University. When slides are
obtained fr
Congestion Control
Reading: Sections 6.1-6.4
Acknowledgments: Lecture slides are from Computer networks course
thought by Jennifer Rexford at Princeton University. When slides are
obtained from other
Transport Protocols
Reading: Sections 2.5, 5.1, and 5.2
CE443-Fall 1388
Acknowledgments: Lecture slides are from Computer networks course
thought by Jennifer Rexford at Princeton University. When slid
IP Addressing and Forwarding
CE443-Fall 1388
Acknowledgments: Lecture slides are from Computer networks course
thought by Jennifer Rexford at Princeton University. When slides are
obtained from other
CE 443
IP Packet Switching Networks
Fall 1389
Acknowledgments: Lecture slides are from Computer networks course
thought by Jennifer Rexford at Princeton University. When slides are
obtained from other
Networked Applications: Sockets
Spring 1388
Acknowledgments: Lecture slides are from Computer networks course
thought by Jennifer Rexford at Princeton University. This presentation
was edited for CE44
CE 443: Computer Networks
Acknowledgments: Lecture slides are from Computer networks course
thought by Jennifer Rexford at Princeton University. When slides are
obtained from other sources, a a refere
CE 443 - Computer Networks
Mehdi Kharrazi
Department of Computer Engineering
Sharif University of Technology
Acknowledgments: Some of the slides are fully or partially obtained from other sources.
Ref
In the name of God
Sharif University of Technology
Department of Computer Engineering
CE 443: Computer Networks
Mehdi Kharrazi
Aban 22nd, 1388
Homework 2
Please email your answers/report in PDF format
In the name of God
Sharif University of Technology
Department of Computer Engineering
CE 443: Computer Networks
Mehdi Kharrazi
Farvardin 21st, 1389
Homework 1
Solutions
Part I
1. Lets assume that you
In the name of God
Sharif University of Technology
Department of Computer Engineering
CE 443: Computer Networks
Mehdi Kharrazi
Mehr 30th, 1388
Homework 1
This is the solution sheet to HW11 .
Part I
1.
F
: P (X ) P (Y )
:XY Y X
X
Y X x
f
W
P (Y ) P (X )
F (W ) = cfw_y Y | x W
y = f (x)
A, B X
F (A B ) = F (A) F (B ) F (A B ) = F (A) F (B )
b
(regular)
wcx a
|x| = |w|
x w w
L
x(P (x) Q(x)
xP (x) xQ(x)
xP (x) xQ(x)
xy (P (x) Q(y )
C B A
A(BC ) = (AB ) C
(A B ) = A B
(A B ) = A B
(A B )C = (A C ) (B C )
(A B )C = (AC ) (BC )
=
C
. C
.cfw_S , S C .S S C
S C S C
S C S C
C
cfw_, cfw_ C
SC
(ordered pairs)
|S | >
C C
S
(uncountable)
(innite)
(countable)
a
L = cfw_an+m bn : n, m
na (w)
L L
cfw_a, b
L
(L L ) = L L
A B = cfw_xy | x A
AB
L (regular)
L (non-regular)
B
yB
>)
< NP > < V P >
< NP >
< CN > | < CN > < P P >
< VP >
< CV > | < CV > < P P >
< PP >
< P > < CN
A = cfw_< R, S > | L(R) L(S )
cfw_,
A
(decidable)
A
L = cfw_anbn cn | n
(linear bounded automaton)
(Turing recognizable)
AT M
(Turing machine)
L = cfw_< M > |
(mappi
(context-free)
G : S abAB | B A bAB | B BAa | A |
(unit)
G
(useless)
G
(Chomsky Normal
Form)
(pushdown automaton)
G : S AB | A aAA | bBB |b B bA |
(pushdown automa
C
. C
.cfw_S , S C
S C
S C
.S S C
S C
S C
C
cfw_, cfw_ C
SC
(ordered pairs)
(uncountable)
(innite)
S
|S | >
C
C
(countable)
L = cfw_an+m bn : n, m
L = cfw_x c
L = cfw_x cfw_, :
(regular)
L (regular expression)
(regular expressions)
L
(dfa)
L
(context-free)
x
= cfw_a, b
(unambiguous)
L = cfw_w#w : w cfw_a, b
L
Turing Machine
Sunday, October 15, 2006
1:47 PM
Midterm 2 - Nov.1st
Similar to style of the lst midterm
Go up to context-free languages
Turing machine
Tape based processing (two way infinite)
A turi