• Citations Per Year
Learn More
We present in this article an external memory algorithm, called disk SA-IS (DSA-IS), to exactly emulate the induced sorting algorithm SA-IS previously proposed for sorting suffixes in RAM. DSA-IS is a new disk-friendly method for sequentially retrieving the preceding character of a sorted suffix to induce the order of the preceding suffix. For a(More)
  • Yi Wu, Ge Nong
  • 2011 17th IEEE International Conference on…
  • 2011
While the throughput demand for a backbone router keeps increasing constantly, both routing and switching of packets are facing tough challenges for running faster. Currently, the prefix tries based routing algorithms are playing a key role in building high performance routing systems. We proposed in this article a routing architecture for scaling the(More)
  • Yi Wu, Ge Nong
  • 2012 21st International Conference on Computer…
  • 2012
The gap between high throughput demand of Internet traffic and low speed capacity of a router's interface has become a bottleneck for packet forwarding. One way to close the gap is to employ a parallel mechanism, where the route lookups of multiple packets are processed simultaneously, yielding a substantial improvement in the system's throughput. This(More)
We present in this article a pipeline architecture built with multiple memory blocks for IP route lookup using trie-based routing algorithms. A two-hierarchy prefix distribution scheme is employed to balance the storage demands among the memory blocks, where prefixes not longer than r bits in the routing table are mapped to an index table and the remaining(More)
  • Yi Wu, Ge Nong
  • 2012 18th IEEE International Conference on…
  • 2012
When the Internet is evolving from IPv4 to IPv6, there is a need in practice for route lookup algorithms that can simultaneously support IPv4 and IPv6 packets. A scalable pipeline routing architecture for route lookups of IPv4/IPv6 packets using a prefix trie is studied in this work. In this routing architecture, a routing table is mapped into an index(More)
For full-text indexing of massive data, the suffix and LCP (longest common prefix) arrays have been recognized as fundamental data structures, and there are at least two needs in practice for checking their correctness, i.e., program debugging and verifying the arrays constructed by probabilistic algorithms. Two probabilistic methods are proposed to check(More)
  • 1