Extensive research and studies have shown that the hypercube network is one of the most widely used techniques to build high performance parallel computers and it offers strong hierarchical structure with high symmetry properties. However, the performance of hypercube networks is mainly dependent on the link consistency between the nodes. Due to unexpected links failure and low connectivity, neither the hardware schemes nor point to point and multistage routing algorithms can be used without adding extra links. This paper presents a new stored and forward one-bit round robin routing algorithm that can efficiently send and receive messages between the nodes even in the presence of faulty links. In addition, we also examine and simulate the data throughput and hot spot properties of a hypercube network. Simulation results demonstrate that the proposed routing algorithm improves the overall performance of hypercube network by means of load-scalability that not only reduces the average waiting time per output queue but also increases the total data throughput even in the presence of faulty nodes.