We show that the number of length- n words over a k -letter alphabet having no even palindromic prefix is same as unbordered words, by constructing an explicit bijection between two sets. A slightly different but analogous result holds for those odd prefix. Using known results on borders, we get asymptotic enumeration (resp., odd) obtain nontrivial Finally, similar square prefix, thus proving 2...

The Border Gateway Protocol (BGP) populates Internet backbone routers with routes or prefixes. We present an algorithm to locally compute (without any modification to BGP) equivalent forwarding tables that provably contain the minimal number of prefixes. For large backbone routers, the Optimal Routing Table Constructor (ORTC) algorithm that we present produces routing tables with roughly 60% of...

IP address lookup is becoming critical because of increasing entries in a forwarding table, linespeed and traffic in the Internet. Binary search is the most popular scheme based on S/W implementation. This search scheme has problems according to the parentchild relationship of prefixes. In this paper, we proposed the partitioned binary search scheme to split the parentchild relationship. All pr...