WO2009078028A1

WO2009078028A1 - A method for the route aggregation of mobile ip routes

Info

Publication number: WO2009078028A1
Application number: PCT/IN2007/000592
Authority: WO
Inventors: Sanjay Kuhikar; Narendra Kumar Sirugudi; Subendu Chattopadhyay
Original assignee: Lucent Technologies Inc
Priority date: 2007-12-14
Filing date: 2007-12-14
Publication date: 2009-06-25
Also published as: EP2225856A1

Abstract

A method for aggregating IP routes in a mobile communication network using a binary trie having a plurality of radix tries. The method comprises the steps of receiving a new IP route for insertion in the binary trie; identifying a radix trie associated with the new IP route; traversing the radix trie to reach a node therein under which the new IP route is to be inserted; incrementing, for a given node so traversed, a count of leaf nodes that are children of the given node; comparing the count to a maximum leaf count for the given node; and installing as an aggregated IP route in the binary trie, a prefix associated with the given node responsive to the count reaching the maximum leaf count for the given node.

Description

Title

A method for the route aggregation of mobile IP routes

Background of the Invention

Mobile IP Home Agent (HA) has to support millions of Mobile Nodes. This amounts to millions of IP route in forwarding table. All of these routes are 32 bit routes and have point-to-point Tunnels as a forwarding link. These tunnels run between Home Agent and Foreign Agent (FA). Typically these tunnels run in the order of 800-1000. The major problem the HA faces, is to maintain these million routes which can exhaust the CAM (Content Address Memory) used for maintaining forwarding table.

The route aggregation problem exists in all routing protocol and is solved by algorithms like Optimal Routing Table Constructor (ORTC) Algorithm. ORTC optimizes a routing table using three passes over the binary tree in which routes are stored. The 1st pass propagates routing information down to the tree's leaves. The second pass finds the most prevalent next hops, by percolating information (sets of next hops) from the leaves back up towards the root. Finally, a third pass moves down the tree, choosing a next hop from the set of possibilities for a prefix and eliminating redundant routes. The computation complexity of the ORTC is O(N) where N is number of nodes in the tree. Since the computation complexity is linear the algorithms become expensive with increase in mobile nodes.

Summary of the Invention The present invention provides a method by which the (Home Agent) HA can maintain the forwarding table with minimal use of the Content Access Memory (CAM). The method utilizes the characteristics of mobile routes to aggregate IP routes. These being (1) mobile routes are 32 bit routes (2) Forwarding Link of mobile routes is point-to-point tunnels and number of tunnels is far less than number of mobile routes (3) Home Agent has the liberty to allocate IP address to the mobile nodes. The method uses a radix trie data structure, which is based on the trie that is used to store a set of strings. The mobile routes are segregated based on the forwarding tunnel. The segregated routes are stored in separate radix tries. Since each radix trie stores the routes belonging to same tunnel they can be aggregated using simple Leaf Counting Algorithm (LCA) to the trie. Leaf counting algorithm counts the number of leaf nodes that are children of a particular node. If the leaf count reaches to maximum that a node can hold for its prefix level, then the route is aggregated and installed in CAM and all children routes are withdrawn from CAM.

Brief description of the drawings

Figure 1 represents a simple prefix based trie.

Figure 2 represents a graph showing the percentage of saving on number of routes against the percentage of mobile missing from the tunnel on which they are registered initially.

Figure 3 represents a 3 bit binary trie. Detailed Description Of The Drawings

A network connection between two hosts is defined by the tuple of source IP address, source port and destination IP address, destination port. Any changes to these could lead to a termination of connection. An IP address can be divided into network part and a host part. The network part of the IP address defines the network to which the host is a part of. This is called the home network. A mobile node, like any other host is assigned an IP address by the home network. When the mobile node moves out of range of the home network, it is said to have moved into a foreign network. The IP address that was assigned to the mobile node in the home network is no longer reachable from the home network and it is not valid in the foreign network. Mobile IP defines two modules, a home agent and foreign agent which will ensure that mobile node can still remain connected to the network without a change in its IP address. It enables this to happen by introducing another IP address called the "care-of-address". When the mobile node moves out of range of the home network, it registers a "care-of-address" with the home agent via the foreign agent. Any packet that is destined for the mobile node will first reach the home network. The home agent will tunnel the packet to the "care-of-address". The packet is de-encapsulated at the end of tunnel by the "care-of-address" and then forwarded to the mobile node. The Home agent defines the module in the home network that will ensure the network connectivity of the mobile node irrespective of the location of the mobile node.

Typically the Home Agent serves two million mobile nodes and generally CAM has a space of 32MB. To store the two million routes in a CAM will require up to 24 mega bytes of CAM space (considering 1 route require 12 bytes (destination, netmask, nexthop pointer)) This leaves very little space to store normal routes, ARP entries, Access List etc. Since larger CAMs require more power, it is not always possible to add larger CAMs to the system. Hence without route aggregation it is virtually impossible to support two million Mobile Nodes Routes.

In the present invention the IP routes are pre-sorted before entering them in the Home Agent. The invention provides a method of aggregating IP routes in a binary trie having a plurality of radix tries. The radix trie is associated with a forwarding link, which is a point-to-point tunnel. A new IP route received is inserted into the binary trie using the characteristics of radix trie. First a radix tree associated with the IP route is identified. Then the identified radix trie is traversed to reach a node therein, under which the new IP route is to be inserted. For every node traversed a count of leaf nodes that are children of the given node is incremented. The count is compared to the maximum leaf count for the given node. The given node is then installed as an aggregated IP route in the binary trie, a prefix associated with the given node responsive to the count reaching the maximum leaf count. Once the maximum leaf count is reached the routes to the leaf nodes that are children of the given node is removed from the binary trie. The leaf nodes of the trie are 32 bit nodes and the maximum leaf count of the node is dependent upon a prefix level of the given node which is calculated as 2**(32-N) where N is the prefix level.

The invention is illustrated using the example in Figure 1. The IP addresses are 2 bit and^* are arranged in the prefix tree for Tunnel 1. Each node stores the prefix, which it represents and from which the prefix level can be derived. For example the prefix level of 0* is 1 in 2 bit trie, since * represents 1 missing bit. Similarly prefix level of * is 2 since 2 bits are missing. Also the node keeps the count of actual leaf nodes attached to that node. The dull nodes in Figure 1 represent the nodes for which routes are withdrawn from FIB/CAM.

A simple prefix based trie shown in Figure 1 Binary TrieA stores following IP addresses 00 and 10. Each node in the trie keeps the count of the number of leaf routes that are attached to it. If the count reaches the maximum for a particular node that it can support then the node prefix is installed as the aggregated route and the leaf nodes are removed (Note the leaf count are still maintained).

For example in Binary Trie B, the 0* node in a 2 bit trie can support maximum of 2 leaf nodes and when both IP address 00 and 01 are present the Leaf Count of 0* node becomes 2 and can be installed as a aggregated route. Further when 11 route is also added to trie the node * can act as an aggregated route to support all four routes.

The route entries for various trie shown above will be as follows:

Another example shown in Figure 3, describes the 3 bit Binary trie. The route entries for various trie shown in Figure 3 will be as follows:

On registration of Mobile Node the following steps are performed:

1. When a new Mobile Node is registered and tunnel exists for its IP₅ then identify the radix trie corresponding to the tunnel.

2. While traversing the trie for insertion of route increment the leaf count on each node and verify whether leaf count has reached the maximum. The maximum leaf count for a node is = 2**(32-N), where N is the prefix level the node is supporting. If the count has reached maximum, add the prefix route of the node in forwarding table and withdraw all the children node routes.

3. If tunnel doesn't exist for the Mobile Node then after the tunnel creation is done the new radix trie is created and no aggregation is required.

Similarly on deregistration of Mobile Node while traversing the trie for deletion of route decrement the leaf count on traversing node and verify if the count is max-1. If yes then it implies that, between the two children of the current node, one has max leaf count and the other has leaf count = max- 1. Withdraw the aggregate route for the current node and add a new route (Possibly aggregate if the level of the current node is 2 or higher) for the child with max leaf count. Repeat this process for the other child that has leaf count = max - 1 , until you reach the actual route to be deleted.

The memory requirement of the CAM and forwarding table will be reduced by the amount of aggregation. Also memory requirement for maintaining routes at MIP will be approximately same as what is required in maintaining one radix trie.

On Mobile N registration if the aggregation happened at N^th prefix level then (32-N) route withdrawals will be required and 1 addition will be required. On Mobile Nodes Deregistration if the de-aggregation happened at N^th prefix level then (32-N) routes are added and two routes (the aggregated route and other is the actual route which was deregistered) are withdrawn.

. The graph (Figure 2) shows the amount of saving achieved for different percentage of random routes are missing from aggregated route. The missing route can happen when the mobile node is moved out of the tunnel on which first registration happened and IP address was allocated. The graph shows that even if 30% mobiles are missing then the saving is at least 30 %.

In this method, if the IP addresses are allocated properly, routes are aggregated at the root of a complete binary tree. So at any point if there are 2^Λm active mobile nodes in a foreign agent and their IP addresses are allocated correctly, all the 2^Λm specific routes will be aggregated to one route. However this is an ideal condition. After the aggregation if one mobile node is removed, this will lead to adding m routes. However the worst-case behavior is also efficient. Let's assume that 2^Λk routes are aggregated to one route and 2^Λm (m < k) routes are selectively deleted. Then it can be shown that even in the worst-case behavior, no more than (k-m)*2^Λm routes will be added.

The advantages of the present invention over the previous ORTC solutions is that the proposed algorithm is very simple and executed on every insertion/deletion of route and is not periodic as done in ORTC which is a three stage process and has a complex algorithm. The computation complexity of the ORTC is O(N) where N is number of nodes in the tree. Since the computation complexity is linear the algorithms become expensive with increase in mobile nodes. The computation complexity of our solution is constant 0(32), and is therefore much faster to execute than the prior art ORTC technique. Also the ORTC is tailored for variable length-prefix routes and does not provide much benefit for constant 32 bit prefix-routes, which is typical scenario in Mobile Nodes.

Claims

1. A method of aggregating IP routes in a mobile communication network using a binary trie having a plurality of radix tries, the said method comprising the steps of:

- receiving a new IP route for insertion in the binary trie;

- identifying a radix trie associated with the new IP route;

- traversing the radix trie to reach a node therein under which the new IP route is to be inserted; - incrementing, for a given node so traversed, a count of leaf nodes that are children of the given node;

- comparing the count to a maximum leaf count for the given node;

- installing as an aggregated IP route in the binary trie, a prefix associated with the given node responsive to the count reaching the maximum leaf count for the given node.

2. The method as claimed in claim 1 wherein the routes to the leaf nodes that are children of the given node are removed from the binary trie.

3. The method as claimed in claim 1, wherein the said radix trie is associated with a forwarding link being a point-to-point tunnel.

4. The method of claim 1, wherein the routes to the leaf nodes are 32 bit routes and the maximum leaf count being 2**(32-N) is dependent upon a prefix level N of the given node.