Generalization of MLB Routing Protocol: Candidate Paths Filtering and Optimal Parameter Setting

We have proposed the multinomial logit-based (MLB) routing protocol, which is a new multipath routing protocol implemented as a linkstate protocol and as a distance-vector protocol. In this study, we first extend the MLB routing in terms of eliminating paths including loops from candidate paths. For this purpose, we reformulate MLB routing with respect to link-to-link data transition. Furthermore, we discuss the optimal parameter setting, which minimizes total transfer costs in a network. Using numerical examples, we have also shown that our extension causes significant improvements in transfer costs.