In this talk I will discuss some exact or perfect simulation algorithms in the context of stochastic networks. These are algorithms that allow to simulate without bias and in finite time samples from the steady-state distribution of a Markov process. I will discuss two types of algorithms. The first type is an application of dominated Coupling From The Past (CFTP), Propp-Wilson (1996) and Kendall...