Time Division Multiplexing Algorithm for Routing In Time Critical Scenarios | Original Article
Data density has a linear relation with fixed size of data and non-linear relation with variable size of data. It is challenging to manage variable size data with variable arrival rate. Given a node capacity where arrival rate is not in control then this problem becomes further challenging and requires an algorithmic solution. This research undertakes variable size data and variable rate of arrival at a node capacity and proposes an arbitration algorithm with management of node dispatch capacity algorithm to solve this problem, which will be tested against Knapsack Problem. This work has numerous industrial and social applications. Traffic management for emergency vehicle is one such challenge.