Güneş, SalihYılmaz, NihatÖztürk, Ali2020-03-262020-03-2620032193-567X2191-4281https://hdl.handle.net/20.500.12395/18347In this study a multicast routing algorithm has been developed for faulty hypercube parallel processing system using cube algebra. Without any restriction to the number of the faulty nodes, the routing from the source node to the destination node is implemented minimally. The developed routing algorithm has been visually simulated via prepared data routing simulator program. It has been observed that this algorithm can be applied to various routing problems.eninfo:eu-repo/semantics/openAccessfault tolerancemulticast routingcube algebrasubcube allocationhypercube networksArticle281B95103Q1WOS:000188783300006Q4