Round-robin (RR) is one of the algorithms employed by process and network schedulers in computing. As the term is generally used, time slices are assigned to each process in equal portions and in circular order, handling all processes without priority (also known as cyclic executive). Round-robin sche****ng is simple, easy to implement, and starvation-free. Round-robin sche****ng can also be applied to other sche****ng problems, such as data packet sche****ng in computer networks. It is an Operating System concept.