<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> 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>
protocol that is used to transmit data without any schedule time is
protocol that is used to transmit data without any schedule time is
Round - robin
Round - robin