We address the Round Weighting Problem in which one has to find a minimum-length schedule of selected links. As we deal with multi-hop networks, these selected links represent a routing solution providing enough capacity to achieve the routers requirements of bandwidth. We give a \textit{lower bound} for this problem derived from a bottleneck region and exact formulas for grid graphs.