  Quantum networks are considered as a promising future platform for quantum
information exchange and quantum applications, which have capabilities far
beyond the traditional communication networks. Remote quantum entanglement is
an essential component of a quantum network. How to efficiently design a
multi-routing entanglement protocol is a fundamental yet challenging problem.
In this paper, we study a quantum entanglement routing problem to
simultaneously maximize the number of quantum-user pairs and their expected
throughput. Our approach is to formulate the problem as two sequential integer
programming steps. We propose efficient entanglement routing algorithms for the
two integer programming steps and analyze their time complexity and performance
bounds. Results of evaluation highlight that our approach outperforms existing
solutions in both served quantum-user pairs numbers and the network expected
throughput.
