Tree structure-based smart inter-computing routing model

Systems and methods are disclosed for retrieving, from a database, over a network, historical routing data for multiple attributes and determining, for each attribute, based on its respective historical routing data, whether processing volume and processing error rates for each attribute exceed resp...

Full description

Saved in:
Bibliographic Details
Main Authors Cao, Yuanpei, Guo, Yu, Betz, William Andrew, Andersen, Reid Marlow
Format Patent
LanguageEnglish
Published 21.02.2023
Subjects
Online AccessGet full text

Cover

Loading…
More Information
Summary:Systems and methods are disclosed for retrieving, from a database, over a network, historical routing data for multiple attributes and determining, for each attribute, based on its respective historical routing data, whether processing volume and processing error rates for each attribute exceed respective threshold. If both processing volume and error rate exceed their respective thresholds, the systems and methods describe herein calculate, for each qualifying attribute, a degree to which routing for each attribute can be improved. The systems and methods described herein output a ranking for each qualifying attribute based on their respective degrees to which routing can be improved for the respective attributes.
Bibliography:Application Number: US201816218057