This paper presents new mathematical models and algorithms of optimal control of multiple parallel FIFO-queues in the memory of one level, where the queues are moving consecutive and one after another in a circle. As mathematical models we propose random walks on the integer lattice in different areas on the plane and in 3-dimensional space. The optimality criterion is the minimum average portion of lost elements on infinite working time.