Classless Inter-Domain Routing Research Articles

Research on IP Address Allocation of Tactical Communication Network

According to the IP address allocation problem of tactical communication network, the structure and IP address requirements of tactical communication network are analyzed in paper. A tactical communication network IP allocation method based on Classless Inter-Domain Routing (CIDR) addressing technology and without network-wide routing configuration is proposed. The allocation principle, addressing method and allocation process of the method are analyzed in detail. Based on this, the algorithm and model of IP address allocation in tactical communication network are given. Finally, the model and algorithm are analyzed and verified with examples. .

Mathematical Model of the Relationship between BGP Convergence Delay and Network Topologies

BGP is a distant vector inters Autonomous System (AS) routing protocol that comes up after EGP to eliminate the inefficiency of EGP with respect to flexibility and scalability and to give support of an actual routing protocol. BGP handles the scalability problem using Classless Inter-Domain Routing (CIDR) and solves the inefficiency of EGP by accumulating all the possible route information to a destination and running a decision process to select a route to be used and to advertise to the peers. Recently BGP protocol starts to encounter several problems such as routing table growth, load balancing problems, BGP hijacking and transit-AS problems and increasing time of Convergence delay. Convergence delay is the time between the selection process for the best path and when the routers settled. Convergence delay started recently to be an issue for internet and larger network as it started to be increased which causes instability in the network. Instability lead to lost packets, delayed delivery, loss of connectivity and long end-to-end delay in the Internet as well as added overhead to BGP routers. The goal of this research is to study the behavior of different network topology in terms of BGP convergence delay besides defining a mathematical model to represent the relationship between convergence delay and number of nodes. Simulation results show that Mesh topology has the highest convergence delay. The study of the relation between convergence delay and number of nodes leads to mathematical equations which some of them represent linear relationship while others represent compound relationship.

Cloud-DLT: A Disruptive Cloud based Digital Library using Lean Design Technique

Cloud based libraries connect individuals to on-demand information needed to solve problems, expand frontiers and re-shape the future. In the era of disruptive computing, a digital library model using cloud computing Infrastructure as a Service (IaaS) is proposed. The proof of concept is used to demonstrate the viability of deploying and running virtualized digital library in Nigerian higher institutions. Lean design phases are used in developing the library application program interface (API) as well as the network design. Programming languages such as CSS, JavaScript, PHP and MYSQL are used for the API integration while demonstrating a hypervisor based server infrastructure on a Wi-Fi hotspot. For access control on the network, a network IP address configuration based on classless inter-domain routing (CIDR-192.168.0.0/24) is applied while using TP-Link 3G/4G Wireless N-Router (TL-MR3420) access point for 300Mbps wireless connectivity. Front-end vulnerability threats are addressed during the coding phase while demonstrating improvement on the level of services provided for resource accessibility and management. A faculty wide scenario in Federal University of Technology is used as a validation case study. The proposed system is flexible, offers robust security support with 64/128bit wired equivalent privacy (WEP), WPA/WPA2 and WPA-PSK/WAP2-PSK encryption standards. Cloud-DLT eradicates the challenges and inconveniences associated with accessing and managing the library resources. The work highlighted its usefulness and implications to academics and students in the next few years.

A Multi-Index Hybrid Trie for Lookup and Updates

\begin{abstract} High-performance routers require high-speed IP address lookup to achieve wire-speed packet forwarding. This study proposes a new data structure, the Multi-Index Hybrid Trie (MIHT), for dynamic router table designs. This data structure was constructed by combining the useful characteristics of the ${\rm B}^{+}$ tree and priority trie. IP lookup operations can be performed efficiently by associating each prefix with a key value in the MIHT. Furthermore, because the required tree height and number of prefixes were reduced, dynamic router table operations were performed efficiently using the MIHT. To reduce the memory requirement, each prefix stored its corresponding suffix in a node of the MIHT, rather than storing a full prefix. Experiments using IPv4 and IPv6 routing databases indicated that the proposed data structure has efficient memory usage and performs well for lookup, insertion, and deletion operations. This study reports the results of the experiments performed to compare the proposed data structure with other structures using the benchmark IPv4 and IPv6 prefix databases AS1221, AS4637, AS6447, AS65000, AS1221*, and AS6447* with 407,067, 219,581, 417,995, 406,973 , 12,155, and 12,278 prefixes, respectively, where AS1221* and AS6447* are IPv6 BGP routing tables. \end{abstract} \begin{IEEEkeywords} Classless inter domain routing (CIDR), dynamic router tables, IP address lookup, longest matching prefix, multi-index hybrid trie. \end{IEEEkeywords}

Can Longest Prefix Matching Make The Path Length Shorter?

It has been recognized that the existing routing architecture of today’s Internet is facing scalability problems. Although deployment of CIDR (Classless Inter-Domain Routing) slows the growth of global routing tables, LPM (longest prefix matching), which is greedily pursuing for more-specific prefixes, seriously restricts the advance of scalable routing. The prevalent LPM algorithm for routing lookup is considered the best path to the destination, which logically makes sense. However, we find that LPM algorithm does not necessarily provide shortest path length for routing lookup in most cases with comparison experiment. To find more general prefixes, we first present SPM (shortest prefix matching) algorithm, and then make a comparative evaluation between SPM and LPM by using the metric of average AS path length. In conclusion, we analyze the reasons that cause longer average AS path length for LPM algorithm in most cases and discuss the impact of LPM to scaling routing.

Efficient IP forwarding engine with incremental update

Nowadays, the commonly used table lookup scheme for IP routing is based on the so-called classless interdomain routing (CIDR). With CIDR, routers must find out the best matching prefix (BMP) for IP...

High-performance IP routing table lookup

Nowadays, the commonly used table lookup scheme for IP routing is based on the so-called classless interdomain routing (CIDR). With CIDR, routers must find out the best matching prefix (BMP) for IP packets forwarding, which complicates the IP lookup. Currently, this process is mainly done in software and several schemes have been proposed for hardware implementation. Since the IP lookup performance is a major design issue for the new generation routers, in this article we propose a fast IP address lookup scheme, which significantly reduces the forwarding table to fit into SRAM with very low cost. It can also be implemented in hardware using the pipeline technique. By using our proposed method, the required memory space can be 90–170 Kb less than the previous scheme and three memory accesses for a lookup in the worst case. When implemented in hardware pipeline architecture, our mechanism can achieve one routing lookup per memory access.

An efficient IP routing lookup by using routing interval

Nowadays, the commonly used table lookup scheme for IP routing is based on the so-called classless interdomain routing (CIDR). With CIDR, routers must find out the best matching prefix (BMP) for IP packets forwarding, this complicates the IP lookup. Currently, this process is mainly performed in software and several schemes have been proposed for hardware implementation. Since the IP lookup performance is a major design issue for the new generation routers, in this article we investigate the properties of the routing table and present a new approach for IP lookups, our approach is not based on BMP and significantly reduces the complexity, thus the computation cost of existing schemes can be significantly reduced. We also propose an efficient IP lookup algorithm, with which we improve the binary search on prefixes to 30 millions of packets per second (MPPS) and 5,000 route updates/s under the same experiment setup with an even larger routing table.