An Algorithm for URL Routing Based on Trie Structure

In this paper, a new algorithm based on trie structure is applied to URL routing systems like web MVC system and enterprise service bus, where the routing rules not stored as a table containing regular expressions but a trie. As a result, the table traversing in routing process is replaced by a depth-first searching for trie. Because the static pattern segments are stored as a hash table, the time complexity of matching static pattern are O(1), so that the whole time taken in routing process is reduced. The experiment shows that, compared to ASP.NET routing module which use the route table, the routing module with this algorithm have excellent performance when there are plenty of routing rules in system. It just cost about 10% time of the ASP.NET routing module.