Strategic parameter-driven routing models for multi-destination traffic in telecommunication networks

We present mathematical models that determine the optimal parameters for strategically routing multi-destination traffic in an end-to-end network setting. Multi-destination traffic refers to a traffic type that can be routed to any one of a multiple number of destinations. In reality, there are communication services that constitute multi-destination routing application. In this parameter-driven approach, a multi-destination call is routed to one of the candidate destination nodes in accordance with the predetermined decision parameters associated with each candidate node. We present three different models: (i) Link Utilization (LU) model (ii) Network Cost (NC) model and (iii) Combined Parametric (CP) model. The LU approach provides the solution that would result in an optimally balanced link utilization, whereas the NC approach provides the least expensive way to route traffic to destinations. The CP approach, on the other hand, provides a multiple number of solutions that helps to leverage link utilization and cost. The LU approach has been implemented for a long distance carrier's network for internation direct services where a considerable improvement was achieved.