Description
In this paper we present two conceptually different methods for buffering packets on modular, decentralized controlled conveyors. At first, we give a short overview over current research projects. Since buffering is closely related to the storage of goods, we also address modular, decentralized controlled storage systems. We then show the general outline of the first algorithm which works with static assignment of buffer spaces. This algorithm assigns a value to every buffer space to assess its suitability. The suitability is defined by the likelihood of buffered packets interfering with the regular transport process. Packets are buffered on the most suitable buffer space and not moved until they get requested. The second algorithm is using dynamic assignment of buffer spaces. Thus, buffered packets can still be moved. We present the emerging behavior of this algorithm arising from the dynamic reassignment of buffer spaces. Both algorithms are designed in such a way that collisions and deadlocks cannot occur. [339]
