On optimal placement of erasure nodes on a dual bus network

Erasure node placement on the distributed and queue dual bus (DQDB) network is a well investigated problem. For general traffic conditions, achieving maximum throughput by placing a minimum number of erasure nodes optimally is known as the optimal placement of erasure nodes. To date, all the solutions proposed are either of exponential time complexity of generate suboptimal placement or work under impractical assumptions. The authors present a polynomial time algorithm that obtains optimal placement of erasure nodes for general traffic conditions. They derive a closed form expression for maximum achievable throughput and show that several bounds proposed in the literature can be obtained as special cases from the method.