Abstract: "This paper gives a survey of recent results on generalized Jackson networks, where classical exponential or i.i.d. assumptions on services and routings are replaced by stationary and ergodic assumptions. We first show that the most basic features of the network may exhibit unexpected behaviour. Several probabilistic properties are then discussed, including a strong law of large numbers for the number of events in the stations, the existence, uniqueness and representation of stationary regimes for queue size and workload."