Abstract
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.
| Original language | English (US) |
|---|---|
| Title of host publication | Proceedings of the IEEE International Conference on Systems, Man and Cybernetics |
| Publisher | IEEE |
| Pages | 3325-3329 |
| Number of pages | 5 |
| Volume | 4 |
| State | Published - 1997 |
| Externally published | Yes |
| Event | Proceedings of the 1997 IEEE International Conference on Systems, Man, and Cybernetics. Part 3 (of 5) - Orlando, FL, USA Duration: Oct 12 1997 → Oct 15 1997 |
Other
| Other | Proceedings of the 1997 IEEE International Conference on Systems, Man, and Cybernetics. Part 3 (of 5) |
|---|---|
| City | Orlando, FL, USA |
| Period | 10/12/97 → 10/15/97 |
Fingerprint
ASJC Scopus subject areas
- Hardware and Architecture
- Control and Systems Engineering
Cite this
Strategic parameter-driven routing models for multi-destination traffic in telecommunication networks. / Lee, Young; Tien, James M.
Proceedings of the IEEE International Conference on Systems, Man and Cybernetics. Vol. 4 IEEE, 1997. p. 3325-3329.Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
}
TY - GEN
T1 - Strategic parameter-driven routing models for multi-destination traffic in telecommunication networks
AU - Lee, Young
AU - Tien, James M.
PY - 1997
Y1 - 1997
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=0031381814&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0031381814&partnerID=8YFLogxK
M3 - Conference contribution
VL - 4
SP - 3325
EP - 3329
BT - Proceedings of the IEEE International Conference on Systems, Man and Cybernetics
PB - IEEE
ER -