Bypass Flow-Splitting Forwarding in FISH Networks

According to the fundamental interconnecting structure homogeneous network model and its routing oscillation phenomenon in Internet service provider digital ecosystems, a bypass flow-splitting forwarding (BFF) algorithm is proposed. The BFF algorithm utilizes the mirror process machine (MPM) to analyze the flow characteristics. Using cross-layer ideas, the MPM computes new forwarding granularity. Using the collaboration between MPM and programmable routers (PRs), BFF utilizes the type-of-service field to forward packets and makes full use of available bandwidth of multipath. Using real-world topology and traffic traces in NS2, the simulations prove that the BFF obtains a better forwarding performance with higher link utilization and lower delay. BFF can be easily deployed into the PRs of next-generation Internet.