<Table> <Tr> <Td> </Td> <Td> This article needs additional citations for verification . Please help improve this article by adding citations to reliable sources . Unsourced material may be challenged and removed . (April 2015) (Learn how and when to remove this template message) </Td> </Tr> </Table> <Tr> <Td> </Td> <Td> This article needs additional citations for verification . Please help improve this article by adding citations to reliable sources . Unsourced material may be challenged and removed . (April 2015) (Learn how and when to remove this template message) </Td> </Tr> <P> Round - robin (RR) is one of the algorithms employed by process and network schedulers in computing . As the term is generally used, time slices (also known as time quanta) are assigned to each process in equal portions and in circular order, handling all processes without priority (also known as cyclic executive). Round - robin scheduling is simple, easy to implement, and starvation - free . Round - robin scheduling can also be applied to other scheduling problems, such as data packet scheduling in computer networks . It is an operating system concept . </P> <P> The name of the algorithm comes from the round - robin principle known from other fields, where each person takes an equal share of something in turn . </P>

Protocol that is used to transmit data without any schedule time is