Optimal Linear Broadcast Routing with Capacity Limitations

We study the problem of broadcast routing in high-speed networks with special switching hardware. In such networks replication of a packet in each internal vertex (as done in traditional broadcast algorithms) is inefficient. The method that is used in such networks is linear broadcast routing, in which the packets travel along linear routes, determined in the header of the packet. In this routing several packets travel simultaneously through one communication line and one switching subsystem. Each edge has a communication cost, and the total cost of the routing is determined by either the number of the packets or by the total cost of edges traversed.

[1]  Shimon Even,et al.  Graph Algorithms , 1979 .

[2]  Israel Cidon,et al.  Paris: An approach to integrated high‐speed private networks , 1988 .

[3]  Inder S. Gopal,et al.  Linear Broadcast Routing , 1989, J. Algorithms.

[4]  Shmuel Zaks,et al.  Optimal Linear Broadcast , 1990, J. Algorithms.

[5]  David S. Johnson,et al.  The Planar Hamiltonian Circuit Problem is NP-Complete , 1976, SIAM J. Comput..

[6]  Adrian Segall,et al.  Distributed network protocols , 1983, IEEE Trans. Inf. Theory.

[7]  Shay Kutten,et al.  New models and algorithms for future networks , 1988, PODC '88.