Welcome to Scribd, the world's digital library. Read, publish, and share books and documents. See more
Standard view
Full view
of .
0 of .
Results for:
P. 1
Network Layer Hazirlik Sorulari

# Network Layer Hazirlik Sorulari

Ratings: (0)|Views: 1,056 |Likes:

### Availability:

See more
See less

12/11/2012

pdf

text

original

Bilgisayar A
lar
Dersi Haz
rl
k Sorular
1.(Problem 20 from Krose and Ross)
Consider the network fragment shown below.
x
hasonly two attached neighbours,
w
and
y
.
w
has a minimum-cost path to destination
u
(notshown) of 5, and
y
has a minimum-cost path to
u
of 6. The complete paths from
w
and
y
to
u
(and between
w
and
y
) are not shown. All link costs in the network have strictly positiveinteger values.a.Give
x
's distance vector for destinations
w
,
y
and
u
.b.Give a link-cost change for either
c(x,w)
or
c(x,y)
such that
x
will inform itsneighbours of a new minimum-cost path to
u
as a result of executing thedistance vector algorithm.c.Give a link-cost change for either
c(x,w)
or
c(x,y)
such that
x
will
not
inform itsneighbours of a new minimum-cost path to
u
as a result of executing thedistance vector algorithm.
2.
(Problem 17 from Krose and Ross) Consider sending a 3,000 byte datagram into a link that has an MTU of 500 bytes. Suppose the original datagram is stamped with theidentification number 422. How many fragments are generated? What are theircharacteristics?
3.
(Problem 19 from Krose and Ross)Suppose datagrams are limited to 1,500 bytes(including header) between source Host A and destination Host B. Assuming a 20-byte IPheader, how many datagrams would be required to send an MP3 consisting of 4 millionbytes?
4.

daki tabloyu Dijkstra algoritmas
na göre doldurunuz. Tablo“y” router
ndan ba
layacak ve a
daki tüm routerlara gidecek en k
sa yolu kullanacak
ekilde doldurulacakt
r. Compute the shortest path from node y to all network nodes. Not:

it a

rl
k durumunda en soldaki routera öncelik veriniz.
WXY522

Step ND(q),p(q) D(t),p(t) D(r),p(r) D(v),p(v) D(w),p(w) D(x),p(x) D(z),p(z)
0y
4,y
1,y
6,y14,y1yv
4,y2,vdone2,v4,v14,y2yvu6,u4,udone2,v4,v14,y3456
5.
(Distance Vector Routing) A

daki a
yap

ve her router
n kendi kom
ular
na olanmasraf

bildi
ini göz önüne ald

zda, distance vector algoritmas

kullanarak y
ümündeki “distance table”
a

daki tabloda doldurunuz.
Masraf “y” dü
ümündekidistance vector tablosuuvxyzvxyFromzUVXYZ1721432ZTYRQ2VXW13316144111429

6.
(Problem 23 from Krose and Ross)Consider the network shown below and assume thateach node initially knows the cost of each of its neighbors. Consider the distance vectorrouting algorithm and show the distance table entries at router Z.
7.
Consider the network shown below. Suppose AS3 and AS2 are running OSPF for theirintra-AS routing protocol. Suppose AS1 and AS4 are running RIP for their intra-ASrouting protocol. Suppose eBGP and iBGP are used for the inter-AS routing protocol.Initially suppose there is no physical link between AS2 and AS4.(a)Router 3c learns about prefix
X
from which routing protocol?(b)Router 3a learns about
X
from which routing protocol?(c)Router 1c learns about
X
from which routing protocol?(d)Router 1d learns about
X
from which routing protocol?
8.
Consider a router that interconnects three subnets: Subnet 1, Subnet 2, and Subnet 3.Suppose all of the interfaces in each of these three subnets are required to have the prefix223.1.17/24. Also suppose that Subnet 1 is required to support up to 125 interfaces, andSubnet 2 and 3 are each required to support up to 60 interfaces. Provide three network addresses (of the form a.b.c.d/x) that satisfy these constraints.
UVYXZ132362