INFORMATION CHANGE THE WORLD

International Journal of Wireless and Microwave Technologies(IJWMT)

ISSN: 2076-1449 (Print), ISSN: 2076-9539 (Online)

Published By: MECS Press

IJWMT Vol.7, No.1, Jan. 2017

IP Packet Filtering using Hash Table for Dedicated Real Time IP Filter

Full Text (PDF, 216KB), PP.24-29


Views:49   Downloads:2

Author(s)

Rohit G Bal

Index Terms

IP Filter;Networks;Firewall;Hashing;Hash Table

Abstract

IP filtering is a technique used to control IP packets flow in and out of a network where Filter engine inspects at source and destination IP of incoming and outgoing packets. Here Filter engine is designed to improve the performance of the filter, i.e. to reduce the processing time of the filtering mechanism. The data structure used in the IP filter is hashing, for larger number of hosts and variety ranges IP network of hosts hashing provides much better performance than link list. Here hash function for the hash table is valid IP classes with host capacities i.e. class A, class B, class C. The IP filter engine have to compare the source and destination IP of each IP packet. In hash table technique the comparison can be done with minimum number of comparisons. 

Cite This Paper

Rohit G Bal,"IP Packet Filtering using Hash Table for Dedicated Real Time IP Filter", International Journal of Wireless and Microwave Technologies(IJWMT), Vol.7, No.1, pp.24-29, 2017.DOI: 10.5815/ijwmt.2017.01.03

Reference

[1]K. G. Coffman and A. M. Odlyzko, Internet growth: Is there a "Moore's Law" for data traffic? Handbook of Massive Data Sets. New York, New York: Kluwer, 2002.

[2]Mathew Gray, Internet Growth Summary. [Online]. Available: http://www.mit.edu/people/mkgray/net/ internet-growth-summary.html

[3]B. Corbridge, R. Henig, C. Slater Packet Filtering in an IP Router in LISA V – Sep. 30-Oct. 3, 1991 – San Diego, CA

[4]Jonathan B Postel, Internet network Protocol Specification version 4 IEN: 54 Section: 2.3.2.1 Sep 1978

[5]Cormen, Thomas H.; Leiserson, Charles E.; Rivest, Ronald L.; Stein, Clifford (2001) [1990]. Introduction to Algorithms (2nd ed.). MIT Press and McGraw-Hill. ISBN 0-262-03293-7

[6]Aho, Alfred V. and Jeffrey D. Ullman [1983]. Data Structures and Algorithms. Addison-Wesley, Reading, Massachusetts. 

[7]Cormen, Thomas H., Charles E. [2009]. Introduction to Algorithms, 2nd edition. McGraw-Hill, New York. 

[8]Knuth, Donald E. [1998]. The Art of Computer Programming, Volume 3, Sorting and Searching. Addison-Wesley, Reading, Massachusetts. 

[9]Pearson, Peter K. [1990]. Fast Hashing of Variable-Length Text Strings. Communications of the ACM, 33(6):677-680, June 1990.

[10]Rohit G Bal, "Hash Data Structure for IPv6 Filters", European Journal of Advances in Engineering and Technology, 2016, 3(10): 32-35.

[11]Pugh, William, "Skip Lists: A Probabilistic Alternative to Balanced Trees". Communications of the ACM, 33(6):668-676, June 1990. 

[12]Stephens, Rod [1998]. Ready-to-Run Visual Basic Algorithms. John Wiley & Sons, New York.

[13]Rohit G Bal, "Review on Tries for IPv6 Lookups", European Journal of Advances in Engineering and Technology, 2016, 3(7): 28-33.