A key-order preserving structured overlay network is a class of structured overlay network where the order of keys is preserved in its structure to support efficient range queries. This paper presents a novel key-order preserving structured overlay network “Suzaku”. Similar to the conventional Chord#, Suzaku uses a periodically updated finger table as a routing table but extends its uni-directional finger table to bi-directional, which achieves ⌈log2 n⌉ − 1 maximum lookup hops in the converged state. Suzaku introduces active and passive bi-directional finger table update algorithms on node insertion and deletion. This method maintains good lookup performance (nearly O(log n) hops) even in churn situations. As well as its good performance, the algorithms of Suzaku are simple and easy to implement. This paper describes the principles and designs of Suzaku, followed by the simulation evaluations, in which it showed better performance than the conventional networks, Chord# and Skip Graph.