A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf
.
Computing the Optimal Longest Queue Length in Torus Networks
[article]
2021
arXiv
pre-print
A collection of k mobile agents is arbitrarily deployed in the edges of a directed torus network where agents perpetually move to the successor edge. Each node has a switch that allows one agent of the two incoming edges to pass to its successor edge in every round. The goal is to obtain a switch scheduling to reach and maintain a configuration where the longest queue length is minimum. We consider a synchronous system. We use the concept of conflict graphs to model the local conflicts that
arXiv:1606.03800v2
fatcat:4y6p72rrkbhzfhqds23xbwv6nu