The risk of congestion collapse on the Internet is becoming a reality, E2 K3 @, O3 l4 A7 _7 N* q2 z
given the increasing number
of audio/video applications that use UDP as their main transport
protocol. Unlike TCP, these
traffic do not respond to congestion signal; i.e., a packet loss. As a
result, audio/video
applications may take an unfair share of the network bandwidth and( i& O' f# }0 D1 }9 x, V8 A
also cause persistent
congestion. To avoid congestion collapse, the IETF has proposed that. k0 D) v/ i, b# R, k5 k/ P j
audio/video applications
use equation based congestion control (see Lecture‐7 and the reference
given on the next
page).
In this assignment, you will simulate n' N3 @* b. V) Y# I
sources that uses1 M3 q" Q ]$ F3 ?' }
equation based congestion control to
set their transmission rate. From your simulation, you will determine' d# u0 \; {5 V/ r' F
whether equation based
congestion
control is effective in reducing packet loss, and hence congestion.
The above network can then be simulated as follows:
Initialization
Set the router’s queue size to N, meaning it can hold up to N packets.
For each sender, set an initial transmission rate, and determine the
time when the first packet is
to be generated.
Body
FOR t=1 to SIM_TIME DO
{
1. IF the router’s queue is not empty then dequeue a packet, and
enqueue that packet in
the corresponding receiver’s queue.
2. IF a sender has a packet to send THEN
‐ Check if the router’s queue is full. If not, enqueue the sender’s$ Z6 \' j7 W# ~, N( O: V; d$ U
packet. Otherwise,
discard the packet.
3. Determine whether any packet loss rate messages are generated by
receivers. If yes,
then re‐compute the sender’s transmission rate. Determine the new time
when the
next packet will be generated. I.e, t+k, where k is the time interval
until the next packet
arrives.
4. Collect all required statistics.
}
In your simulation, collect the (a) queue length over time, (b)
average queue length, (c) average
end‐to‐end packet delay, and (d) Jain’s fairness index. Determine the( f O# S( J$ Y! e1 M1 ?
effect of the following
factors: (i) increasing source and receiver pairs, (ii) varying N
values, (iii) different packet loss
reporting periods, (iv) loss calculation methods, (v) load p, (vi)
router’s transmission rate;
instead of one packet per‐tic, try k packets, and (vii) z
number of new flows
arriving at time t .
- L9 d2 s9 X* V0 d/ {, v, ]
Do with sources
using a token/leaky bucket to control their transmission rate.
Another difference is that each source has an application that( S# u( U% E `# a; R. C; \
generates bursty traffic, where
multiple packets arrive in consecutive time intervals.
To generate bursty traffic, use the following method:
In the diagram above, an application generates a packet when it is in# |) s8 E( R ~) x
the ON state. With
probability k, it will transition to the OFF state where it will remain idle. In, G1 h& _; l0 q& s# n+ k- u
this state, it has
probability z of moving back to the ON state.
The pseudo‐code is as follows:
1. Start at a random state: ON/OFF.
2. At every simulation tic, do
a. Select a random number R in 0<= R <=1.
b. If in state=ON
AND R>=k, set state=OFF.
c. If in state=OFF AND R>z, set state=ON.
d. If state equals ON, generate a packet.
Design an algorithm to control the token/leaky‐bucket rate of each, X. R5 d" w; Q
source (or all sources
simultaneously) such that congestion does not happen. Note, you must; J! F" k. A! F! B2 _; `
experiment with
different k) [1 h6 r9 M* k- D; ]# M/ E- h
and z6 `+ x% f! k: R% G# B
values and determine
their impact on congestion.
Reference
S. Floyd, M. Handley, J. Padhye,$ Y3 T# a9 q" L/ @% D( J
and J. Widmer (2000) Equation-based Congestion Control for Unicast
Applications, ACM SIGCOMM, May,
2000.
| 欢迎光临 数学建模社区-数学中国 (http://www.madio.net/) | Powered by Discuz! X2.5 |