Abstract
As network architectures transition to high-dimensional telemetry, traditional combinatorial models face a "computational wall" caused by factorial expansion and integer overflow. This paper presents the Annamalai Coefficient as a robust alternative. It analyzes its product-based formulation and recursive properties, demonstrating how it simplifies high-dimensional data analysis and provides numerical stability for real-time packet-loss and latency modeling. By replacing complex floating-point operations with an Additive Identity compatible with simple 8-bit/16-bit ALUs, the proposed framework offers a path toward low-latency, energy-efficient Software Defined Networking (SDN).



![Author ORCID: We display the ORCID iD icon alongside authors names on our website to acknowledge that the ORCiD has been authenticated when entered by the user. To view the users ORCiD record click the icon. [opens in a new tab]](https://www.cambridge.org/engage/assets/public/coe/logo/orcid.png)