Abstract
Compact routing addresses the tradeoff between routing state and stretch, where stretch is the ratio between the hop counts of the selected path and that of the optimal path. Recent advances in compact routing protocol show that a stretch of 3 can be achieved while maintaining $O(\sqrt{N})$ routing state per node in an $N$-node network. In this thesis, we present a new routing protocol that achieves a worst-case stretch of 2. Simulations show that our algorithm only requires small amounts of routing state, and we have good performance in the average routing stretch and the load balance of landmarks.