Network flow based LP formulation has been proposed in [15] [16] to derive the maximum network throughput.
However, we can not directly apply such formulation on graph G due to the multiple ONUs (gateways) and the wired communications among ONUs features in FiWi network.
We formulate the routing problem as follows.