I. (25'0) A. ,hl)"'ll in the figure, 8 queuing ~'stem con,ist> I)f three .Ir.lli qu~ucs "ith service rales 1'1 - 2, JI1 2. and Jil
. 3. respe;:Il'cly. The :smnl r.lle I)fthe 'yste," is ). - I. ,\!'iu pusi,~ queue 1. a padet i. delivered In queue 2 "ith
pf
EE 460 Computer Communication Networks
Prof. / Fuad Alnajjar
Homework #1
1. Find the average buffer occupancy, in messages, at the outgoing link of a concentrator for the following case,
assuming that the infinite buffer M/M/1 model is valid:
10 terminals
Computer Communication Networks
3.1
HW # 2
Eight data terminals statistically share the capacity of an outgoing link. Traffic is combined from the eight
terminals and then served first-come first served. An (M/M/1) queue with infinite buffer is assumed. F
HOMEWORK #1
1. Find the average buffer occupancy, in messages, at the outgoing link of a concentrator
for the following case (assume the infinite buffer, M/M/1 model is valid) :
[1] 10 terminals, each generating on the average of one message every 4 sec,
HOMEWORK #4
1) Assuming a stop-and-wait protocol, describe a scenario to show the need for sequence numbers.
2) A finite-state machine is an important tool in modeling protocols. For the stop-and-wait
protocol, define the status of the system as SRC, wher
Introduction to Numerical Method Homework #2
Due September 24
1. Explain why the trapezoidal rule can integrate a straight line exactly and the
Simpsons rule can integrate a cubic exactly (20 pts).
2. An example of a peaky function is the Lorentz profile
HW # 4
EE460
5.1
Prof. Fuad Alnajjar
For the network shown in the figure below:
a. Use Dijkstras algorithm to obtain the shortest paths from node A to all
other nodes.
b. Use the shortest backwards path tree algorithm to obtain the shortest
paths from all
Computer Communication Networks
EE460
Prof. Fuad Alnajjar
HW # 2
1. Assuming a stop-and wait protocol, describe a scenario to show the need for sequence numbers
-2. A finite machine is an important tool in modeling protocols. For the stop-and-wait protoco
HW 3
Topic 4
Prof. Fuad Alnajjar
1. Apply Dijkstras routing algorithm to the graphs in figure 1. In the figure, the weights between
two adjacent vertices are the same in both directions. Provide a table similar to example 4 in
topic 4.
Figure 1.
-2. Repea
n
=
1
1-
n
n -1
=
n
n
=
1
(1 - )2
(1 - )2
M/G/1
q
=
+
2 x
2
2(1 - )
Go-back N
M/M/1/K
if W > 2a + 1
1- P
Selective Repeat
1 + 2a
= W(1 - P)
if W < 2a + 1
1 P
1 + 2aP
=
1 P
W
1 + 2a
1 + P(W - 1)
Pn
= n
1-
1 - k +1
if W > 2a + 1
if W < 2a + 1
Distributed Link-State Exchange Procedure
- Originally, Adaptive Shortest Path routing algorithm,
distributed.
- When node detects cost change , it informs all other nodes not
only neighbors
- Based on local information (database).
- Delay Measurement and