HEXA: Compact Data Structures for Faster Packet Processing

@article{Kumar2007HEXACD,
  title={HEXA: Compact Data Structures for Faster Packet Processing},
  author={Sailesh Kumar and Jonathan S. Turner and Patrick Crowley and Michael Mitzenmacher},
  journal={2007 IEEE International Conference on Network Protocols},
  year={2007},
  pages={246-255}
}
Data structures representing directed graphs with edges labeled by symbols from a finite alphabet are used to implement packet processing algorithms used in a variety of network applications. In this paper we present a novel approach to represent such data structures, which significantly reduces the amount of memory required. This approach called history-based encoding, execution and addressing (HEXA) challenges the conventional assumption that graph data structures must store pointers of… CONTINUE READING
Highly Cited
This paper has 38 citations. REVIEW CITATIONS
26 Citations
27 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 26 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 27 references

An encoded version of regex database from cisco systems provided for research purposes ”

  • A. Ahuja, Will Eatherton, John Williams
  • Proc . ACM SIGCOMM
  • 2005

Vijaykumar, "Dynamic Pipelining: Making IP- Lookup Truly Scalable

  • T.N.J. Hasan
  • in Proc. ACM SIGCOMM
  • 2005

Similar Papers

Loading similar papers…