In this paper, flow models of networks without congestion control are considered. We suppose that users transmit data in the network at their maximum throughput and some erasure codes  make the transmission robust to packet loss . We study the stability of the resulting stochastic processes in two particular cases: linear networks and upstream trees. For the case of linear networks, we notably use fluid limits and an interesting phenomenon of "time scale separation" is occurring. Tight bounds on the stability region of linear networks are given. For the case of upstream trees, underlying monotonic properties are used. Finally, the asymptotic stability of those processes is analyzed when the maximum throughput of the users decreases to 0. An appropriate scaling is introduced and used to prove that the stability region of thoses networks is asymptotically maximized.
In this paper, flow models of networks without congestion control are considered. Users generate data transfers according to some Poisson processes and transmit corresponding packet at a fixed rate equal to their access rate until the entire document is received at the destination; some erasure codes are used to make the transmission robust to packet losses . We study the stability of the stochastic process representing the number of active flows in two particular cases: linear networks and upstream trees. For the case of linear networks, we notably use fluid limits and an interesting phenomenon of "time scale separation" occurs. Bounds on the stability region of linear networks are given. For the case of upstream trees, underlying monotonic properties are used. Finally, the asymptotic stability of those processes is analyzed when the access rate of the users decreases to 0. An appropriate scaling is introduced and used to prove that the stability region of those networks is asymptotically maximized.
R
We suppose that users transmit data in the network at their maximum throughput and
Users generate data transfers according to some Poisson processes and transmit corresponding packet at a fixed rate equal to their access rate until the entire document is received at the destination;
A
are used to
R
loss
losses
R
resulting stochastic processes
stochastic process representing the number of active flows
R
is occurring. Tight bounds
occurs. Bounds
R
maximum throughput
access rate
R
thoses
those