Multiway Trie Based Data Structure for Retrieval of Time Series Traffic With Varying Granularity

Akhil M. R.; Rahul V Cheeran; Joby George

CALL FOR PAPERS : Mar-2023

Submission Last Date

25-Mar-23

Submit Manuscript Online

FOR AUTHORS

FOR REVIEWERS

ARCHIEVES

DOWNLOADS

Open Access

Multiway Trie Based Data Structure for Retrieval of Time Series Traffic With Varying Granularity

Author(s):

Akhil M. R. , Mar Athanasius College of Engineering, Kothamangalam; Rahul V Cheeran, Mar Athanasius College of Engineering, Kothamangalam,; Joby George, Mar Athanasius College of Engineering, Kothamangalam,

Keywords:

Time Tree, Source IP Tree, Destination IP Tree, Traffic data, Traffic Observer

Abstract:

Analyzing the network traffic for network management require the fine grained information regarding the network traffic. In real-time, analyzing the traffic is a tedious task since there is no dedicated data structure to handle the traffic data. To obtain the fine grained information on the traffic it requires a large overhead. In this method the traffic information is stored at each observer point and the required information is passed to the requesting network manager. Since the network manager receives only the intended information the network won’t get flooded with the log information. As a dedicated data structure for analyzing traffic, we propose a three tree structure consisting of Time Tree, Source Tree and Destination Tree. Time tree hold data regarding the time slots and the Source & Destination Tree holds IP addresses and packet information. Source and Destination Tree is constructed using Multiway Tries. A wide range of granularity over the time and IP addresses are possible in the system.