A Hybrid Address Allocation Algorithm for IPv6

• Published in: Recent Trends in Network Security and Applications pp. 509 - 517
• Main Authors: Murugesan, Raja Kumar, Ramadass, Sureswaran
• Format: Book Chapter
• Language: English
• Published: Berlin, Heidelberg Springer Berlin Heidelberg 2010
• Series: Communications in Computer and Information Science
• Subjects: aggregation; conservation; GAP algorithm; IPv6; Rate-Sparse algorithm; routing scalability; Sparse algorithm
• ISBN: 9783642144776; 3642144772
• ISSN: 1865-0929; 1865-0937
• DOI: 10.1007/978-3-642-14478-3_51

The scalability of the Internet routing system has caught much attention in the recent years as it affects the performance of the Internet greatly. IP address fragmentation is one main cause for routing scalability and existing address allocation practices are one major contributor to address fragmentation. Address fragmentation increases routing table size, hence IP look-up and routing efficiency. It also constraints the processing and memory capabilities of routers leading to failing routes if the burgeoning growth of the routing table size is not contained. A proper address allocation algorithm coupled with appropriate address allocation policies will help to scale the existing addressing and routing system. This research proposes a hybrid address allocation algorithm for IPv6 by combining some of the existing address allocation algorithms leveraging on their merits. The proposed hybrid address allocation algorithm would help in reducing address fragmentation to a greater extent compared to the existing address allocation schemes. This would facilitate in reducing routing table size, increase scalability and hence improve the performance of the Internet.