Nested Buddy System: A New Block Address Allocation Scheme for ISPs and IaaS Providers

We propose a novel block address allocation method, called the nested buddy system, which can make use of wasted areas in the classical buddy system due to internal fragmentation. While achieving high utilization of address space, our new scheme supports efficient address matching for routers in packet forwarding and for network middleboxes in packet filtering. Specifically, the scheme uses just one prefix rule for each allocated address block in a packet routing/filtering table. We show by analysis and simulation that the increased address utilization can lead to significant reduction in the probability of a denial-of-service under bursty address allocation requests. In contrast, the classical buddy system requires the aggregation of many requests over time to smooth out demand, resulting in service delays undesirable to end users. Our solution is applicable to ISPs in serving mobile users carrying many network connected IoT devices and IasS providers in the cloud in serving tenants with dynamically varying demands for network addresses.

[1]  Anne G. Hoen,et al.  CRAWDAD dataset ilesansfil/wifidog (v.2015-11-06) , 2015 .

[2]  Donald E. Knuth,et al.  The Art of Computer Programming, Volume I: Fundamental Algorithms, 2nd Edition , 1997 .

[3]  Rina Panigrahy,et al.  Sorting and searching using ternary CAMs , 2002, Proceedings 10th Symposium on High Performance Interconnects.

[4]  W. Marsden I and J , 2012 .

[5]  Avishai Wool,et al.  The Geometric Efficient Matching Algorithm for Firewalls , 2004, IEEE Transactions on Dependable and Secure Computing.

[6]  Huan Liu,et al.  Efficient mapping of range classifier into ternary-CAM , 2002, Proceedings 10th Symposium on High Performance Interconnects.

[7]  Paul R. Wilson,et al.  Some issues and strategies in heap management and memory hierarchies , 1991, SIGP.

[8]  Nick McKeown,et al.  Algorithms for packet classification , 2001, IEEE Netw..

[9]  Charles E. Perkins,et al.  Mobility support in IPv6 , 1996, MobiCom '96.

[10]  George Varghese,et al.  Fast and scalable layer four switching , 1998, SIGCOMM '98.

[11]  Paul R. Wilson,et al.  Dynamic Storage Allocation: A Survey and Critical Review , 1995, IWMM.

[12]  Stephen J. Tarsa,et al.  Trie-based policy representations for network firewalls , 2005, 10th IEEE Symposium on Computers and Communications (ISCC'05).

[13]  D C LittleJohn A Proof for the Queuing Formula , 1961 .

[14]  J. Little A Proof for the Queuing Formula: L = λW , 1961 .