Abstract
This paper describes a heuristic method of finding prefix pairs in IP traffic, which represent more than a prescribed threshold of global traffic. Two Patricia trees are used for finding those source and destination prefixes with a sufficient amount of traffic. A heuristic method is then proposed to identify those pairs of prefixes with a total amount of traffic exceeding a given proportion of global traffic. The proposed algorithm is tested against NetFlow data from Orange's transit IP network.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
