Electrical computers and digital processing systems: multicomput – Computer-to-computer data addressing
Reexamination Certificate
1999-01-08
2002-06-04
Etienne, Ario (Department: 2155)
Electrical computers and digital processing systems: multicomput
Computer-to-computer data addressing
C709S241000, C709S238000, C712S210000, C370S392000
Reexamination Certificate
active
06401130
ABSTRACT:
FIELD OF THE INVENTION
This invention relates generally to data communications networks, and more particularly, to an auto aggregation method for IP prefix/length pairs.
BACKGROUND OF THE INVENTION
Unicast Internet protocol (IP) subnets are described by an IP prefix and a subnet mask. With the introduction of classless inter-domain routing (CIDR), subnet masks must be contiguous, which allows consistent hierarchical addressing. This allows state requirements for Internet devices to be scalable, as large groups of addresses can be summarized into one entry. Because of the CIDR requirement for contiguous subnet masks, they can be described as an integer, which is the length of the mask.
In certain situations, such as a border gateway protocol (BGP) border, administrators usually configure a summarization of a set of IP subnets to be advertised. This is typically accomplished through manual configuration by an administrator. It is desirable to be able to automatically generate a summary of IP prefix/length pairs for auto-configuration. Situations where this is useful are generally on borders where summarization occurs. Example situations include borders within a given routing protocol, such as open shortest path first (OSPF) area border routers; borders between routing protocols, such as an OSPF or routing information protocol (RIP) border router; borders between autonomous systems, such as BGP-4 border router announce, and special cases such as BGP-4 border router “black-hole” routes.
The hard-coded aggregation state of manual configuration typically does not allow optimal path selection in certain scenarios where routes that are part of a summary have gone away. Therefore, there is a need for a way to automatically generate the largest possible set of aggregates given an set of IP prefix/length pairs.
SUMMARY OF THE INVENTION
The present invention provides a method, apparatus and article of manufacture for aggregating a sorted list of IP prefix pairs. A prefix pair in the list is compared to a lowest IP length subnet boundary. The prefix pair is added to a final list if the prefix pair is not on the lowest IP length subnet boundary and the prefix pair is not a first in pair. The prefix pair is moved to a next lower length list if the prefix pair is on the lowest IP length subnet boundary and the prefix pair is a next expected pair. A next higher list is selected, and the method is repeated until there are no more lists.
REFERENCES:
patent: 5751971 (1998-05-01), Dobbins et al.
patent: 6011795 (2000-01-01), Varghese et al.
patent: 6052683 (2000-04-01), Irwin
patent: 6061712 (2000-05-01), Tzeng
patent: 6237061 (2001-05-01), Srinivasan et al.
Blakely , Sokoloff, Taylor & Zafman LLP
Etienne Ario
Nortel Networks Limited
LandOfFree
Auto aggregation method for IP prefix/length pairs does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Auto aggregation method for IP prefix/length pairs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Auto aggregation method for IP prefix/length pairs will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2940165