A Busacker–Gowen Algorithm Based on Routing Scheme for Maximizing Throughput with Minimum Delay in WOBAN

In order to optimize throughput as well as average end-to-end delay in wireless optical broadband access network (WOBAN), a novel delay aware routing algorithm was proposed in this chapter. Routing problem in WOBAN was described as a maximum flow with the minimum cost problem in this chapter. And the proposed routing algorithm which was modified from Busacker–Gowen algorithm was implemented by means of distributing flows along with available routes properly. Simulation results showed that the proposed Busacker–Gowen Routing (BGR) algorithm enhanced the network throughput greatly at a cost of minimal delay compared with the multipaths minimum hop routing (MMHR) algorithm. More specifically, when the wireless link capacity was 20 Mbit, BGR improved throughput by about 21.6 % at the cost of 0.122 ms longer delay compared with MMHR. And when the packet arrival rate was 10Mbps, BGR improved the throughput by about 15.8 % at the cost of 0.12 ms longer delay compared with MMHR. BGR algorithm can maximize the throughput with minimal delay for the data transmission in WOBAN.