TY - GEN
T1 - On the effectiveness of path pre-computation in reducing the processing cost of on-demand QoS path computation
AU - Apostolopoulos, G.
AU - Tripathi, S. K.
N1 - Publisher Copyright:
© 1998 IEEE.
PY - 1998
Y1 - 1998
N2 - Quality of service (QoS) routing algorithms have become the focus of recent research due to their potential for increasing the utilization of an integrated services packet network (ISPN) that handles requests with QoS requirements. While heuristics for determining paths for such requests have been formulated for a variety of QoS models, little attention has been given to the overall processing complexity of the QoS routing architecture. Although on demand path computation is very attractive due to its simplicity, many believe that its processing cost will be prohibitive in environments with high request rates. In this work, we first characterize the processing cost of QoS routing algorithms that use the constrained widest-shortest path heuristic to compute QoS paths in a link state based routing environment. By simulating a variety of realistic traffic conditions we investigate the effectiveness of path pre-computation in reducing the amount of routing protocol computation. We mainly want to determine how much reduction in routing processing cost is possible before the routing performance becomes unacceptably low. Our results show that path pre-computation can significantly reduce the processing cost of on-demand path computation but with a proportional routing performance loss.
AB - Quality of service (QoS) routing algorithms have become the focus of recent research due to their potential for increasing the utilization of an integrated services packet network (ISPN) that handles requests with QoS requirements. While heuristics for determining paths for such requests have been formulated for a variety of QoS models, little attention has been given to the overall processing complexity of the QoS routing architecture. Although on demand path computation is very attractive due to its simplicity, many believe that its processing cost will be prohibitive in environments with high request rates. In this work, we first characterize the processing cost of QoS routing algorithms that use the constrained widest-shortest path heuristic to compute QoS paths in a link state based routing environment. By simulating a variety of realistic traffic conditions we investigate the effectiveness of path pre-computation in reducing the amount of routing protocol computation. We mainly want to determine how much reduction in routing processing cost is possible before the routing performance becomes unacceptably low. Our results show that path pre-computation can significantly reduce the processing cost of on-demand path computation but with a proportional routing performance loss.
UR - https://www.scopus.com/pages/publications/0346235589
U2 - 10.1109/ISCC.1998.702437
DO - 10.1109/ISCC.1998.702437
M3 - Conference contribution
AN - SCOPUS:0346235589
SN - 0818685387
SN - 9780818685385
T3 - Proceedings - 3rd IEEE Symposium on Computers and Communications, ISCC 1998
SP - 42
EP - 46
BT - Proceedings - 3rd IEEE Symposium on Computers and Communications, ISCC 1998
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 3rd IEEE Symposium on Computers and Communications, ISCC 1998
Y2 - 30 June 1998 through 2 July 1998
ER -