The aim of this course is to describe and analyse the main algorithms used to share resources (bandwidth, memory) in data networks. These include packet switching algorithms, packet scheduling algorithms, packet processing algorithms and queue management algorithms. Using various tools of queuing theory, we study some key properties of these algorithms like stability and delay performance, accounting for the random nature of traffic. A large proportion of time will be dedicated to exercices and practicals where students will model, analyse and simulate these algorithms.