Research Article
Year 2015,
Volume: 15 Issue: 2, 1913 - 1920, 01.12.2015
Abstract
Different metrics are used for measuring the goodness of packet routing between the source and destination
pairs in a communication network. One approach is to compute the paths from the measured metric values, which are
predetermined independently according to the network resources. The combination of some metrics of different natures
to get a composite cost function for the routing process is non-trivial. We consider two metrics, namely delay and
packet loss rate. The first one takes values from the large numbers and the second from the small. We propose some
methods for constructing composite functions of these metrics without any constraints and use them for the shortest
path calculations. We give the numerical results of the proposed composite functions versus the Dijkstra’s algorithm
with the individual metrics. We spot out the best function according to our computer simulation results. Our composite
function works for any arbitrary point-to-point networks. To the best of our knowledge, the technique is novel. Our
results show an efficient way to balance the effects of the metrics in the context of many-to-many routing.
pairs in a communication network. One approach is to compute the paths from the measured metric values, which are
predetermined independently according to the network resources. The combination of some metrics of different natures
to get a composite cost function for the routing process is non-trivial. We consider two metrics, namely delay and
packet loss rate. The first one takes values from the large numbers and the second from the small. We propose some
methods for constructing composite functions of these metrics without any constraints and use them for the shortest
path calculations. We give the numerical results of the proposed composite functions versus the Dijkstra’s algorithm
with the individual metrics. We spot out the best function according to our computer simulation results. Our composite
function works for any arbitrary point-to-point networks. To the best of our knowledge, the technique is novel. Our
results show an efficient way to balance the effects of the metrics in the context of many-to-many routing.
References
- [1] Hanzo II, L. and Tafazolli, R., “A Survey of QoS Routing Solutions for Mobile Ad Hoc Networks”. IEEE Communications Surveys & Tutorials, Vol: 9, No: 2, pp. 50-70, 2007. [2] Yin, C.S., Chaw, L.T., and Yaacob, M., “Hop-by-Hop QoS Routing Using Statistical Distribution-Free Approach”. Malaysian Journal of Computer Science, Vol: 18 No: 2, pp. 28-37, December 2005. [3] Brunsting, R.J., “Quality of Service Issues in Wireless Networks”, in An essay presented to the University of Waterloo, Ontario, Canada, 1995. [4] Obreja, Ş.G. and Borcoci, E., “Interdomain QoS paths finding based on overlay topology and QoS negotiation approach”. Trends in Telecommunications Technologies, InTech Publisher, pp. 345-365, 2010. [5] Iqbal, M., Wang, X., Li, S., and Ellis, T., “QoS scheme for multimedia multicast communications over wireless mesh networks”. IET Communications, Vol: 4, No: 11, pp. 1312–1324, 2010. [6] Djarallah, N.B., Sauze, N.L., Pouyllau, H., Lahoud, S., and Cousin, B., “Distributed E2E QoS-Based Path Computation Algorithm Over Multiple Inter-Domain Route”, Int. Conf. on P2P, Parallel, Grid, Cloud and Internet Computing (3PGCIC), Barcelona, pp. 169-176, 2011. [7] Ali, N.B., Molnár, M., and Belghith, A., “Multiconstrained QoS Multicast Routing Optimization”, inria00271795, version 2 – 10, 2008. [8] Yampolskiy, M., Hommel, W., Lichtinger, B., Fritz, W., and Hamm, M.K., “Multi-Domain End-to-End (E2E) Routing with multiple QoS Parameters-Considering Real World User Requirements and Service Provider Constraints”, Second International Conference on Evolving Internet (INTERNET), Valcencia, pp. 9-18, 2010. [9] Bertrand, G., Lahoud, S., Texier, G., and Molnár, M., “Computation of Multi-Constrained Paths in Multi-Domain MPLS-TE Networks”, Next Generation Internet Networks, Aveiro, pp.1-8, 2009. [10] Masip-Bruin, X., Yannuzzi, M., Serral-Gràcia, R., DomingoPascual, J., Enríquez-Gabeiras, J., Callejo, M.Á., Diaz, M., Racaru, F., Stea, G., Mingozzi, E., Beben, A., Burakowski, W., Monteiro, E., and Cordeiro, L., “The EuQoS System: A Solution for QoS Routing in Heterogeneous Networks”. IEEE Communications Magazine, pp. 96-103, 2007. [11] Shin, D.-w., Chong, E.K.P., and Siegel, H.J., “Multipostpath-based lookahead multiconstraint QoS Routing”. Journal of the Franklin Institute, Vol: 349, No: 3, pp. 1106- 1124, 2012. [12] Xue, Q. and Ganz, A., “Ad hoc QoS on-demand routing (AQOR) in mobile ad hoc networks”. Journal of Parallel and Distributed Computing, Vol: 63, pp. 154-165, 2003. [13] Yuan, X. and Liu, X., “Heuristic Algorithms for MultiConstrained Quality of Service Routing”, IEEE INFOCOM, Vol: 2, pp. 844-853, 2001. [14] Yiltas, D. and Perros, H., “Quality of service-based multidomain routing under multiple quality of service metrics”. IET Communications, Vol: 5, No: 3, pp. 327-336, 2011. [15] Van Mieghem, P., De Neve, H. and Kuipers, F., “Hop-by-hop quality of service routing”. Computer Networks, Vol: 37, pp. 407-423, 2001. [16] Jaffe, J.M., “Algorithms for finding paths with multiple constraints”. Networks, Vol: 14, pp. 95-116, 1984.
Year 2015,
Volume: 15 Issue: 2, 1913 - 1920, 01.12.2015
Abstract
References
- [1] Hanzo II, L. and Tafazolli, R., “A Survey of QoS Routing Solutions for Mobile Ad Hoc Networks”. IEEE Communications Surveys & Tutorials, Vol: 9, No: 2, pp. 50-70, 2007. [2] Yin, C.S., Chaw, L.T., and Yaacob, M., “Hop-by-Hop QoS Routing Using Statistical Distribution-Free Approach”. Malaysian Journal of Computer Science, Vol: 18 No: 2, pp. 28-37, December 2005. [3] Brunsting, R.J., “Quality of Service Issues in Wireless Networks”, in An essay presented to the University of Waterloo, Ontario, Canada, 1995. [4] Obreja, Ş.G. and Borcoci, E., “Interdomain QoS paths finding based on overlay topology and QoS negotiation approach”. Trends in Telecommunications Technologies, InTech Publisher, pp. 345-365, 2010. [5] Iqbal, M., Wang, X., Li, S., and Ellis, T., “QoS scheme for multimedia multicast communications over wireless mesh networks”. IET Communications, Vol: 4, No: 11, pp. 1312–1324, 2010. [6] Djarallah, N.B., Sauze, N.L., Pouyllau, H., Lahoud, S., and Cousin, B., “Distributed E2E QoS-Based Path Computation Algorithm Over Multiple Inter-Domain Route”, Int. Conf. on P2P, Parallel, Grid, Cloud and Internet Computing (3PGCIC), Barcelona, pp. 169-176, 2011. [7] Ali, N.B., Molnár, M., and Belghith, A., “Multiconstrained QoS Multicast Routing Optimization”, inria00271795, version 2 – 10, 2008. [8] Yampolskiy, M., Hommel, W., Lichtinger, B., Fritz, W., and Hamm, M.K., “Multi-Domain End-to-End (E2E) Routing with multiple QoS Parameters-Considering Real World User Requirements and Service Provider Constraints”, Second International Conference on Evolving Internet (INTERNET), Valcencia, pp. 9-18, 2010. [9] Bertrand, G., Lahoud, S., Texier, G., and Molnár, M., “Computation of Multi-Constrained Paths in Multi-Domain MPLS-TE Networks”, Next Generation Internet Networks, Aveiro, pp.1-8, 2009. [10] Masip-Bruin, X., Yannuzzi, M., Serral-Gràcia, R., DomingoPascual, J., Enríquez-Gabeiras, J., Callejo, M.Á., Diaz, M., Racaru, F., Stea, G., Mingozzi, E., Beben, A., Burakowski, W., Monteiro, E., and Cordeiro, L., “The EuQoS System: A Solution for QoS Routing in Heterogeneous Networks”. IEEE Communications Magazine, pp. 96-103, 2007. [11] Shin, D.-w., Chong, E.K.P., and Siegel, H.J., “Multipostpath-based lookahead multiconstraint QoS Routing”. Journal of the Franklin Institute, Vol: 349, No: 3, pp. 1106- 1124, 2012. [12] Xue, Q. and Ganz, A., “Ad hoc QoS on-demand routing (AQOR) in mobile ad hoc networks”. Journal of Parallel and Distributed Computing, Vol: 63, pp. 154-165, 2003. [13] Yuan, X. and Liu, X., “Heuristic Algorithms for MultiConstrained Quality of Service Routing”, IEEE INFOCOM, Vol: 2, pp. 844-853, 2001. [14] Yiltas, D. and Perros, H., “Quality of service-based multidomain routing under multiple quality of service metrics”. IET Communications, Vol: 5, No: 3, pp. 327-336, 2011. [15] Van Mieghem, P., De Neve, H. and Kuipers, F., “Hop-by-hop quality of service routing”. Computer Networks, Vol: 37, pp. 407-423, 2001. [16] Jaffe, J.M., “Algorithms for finding paths with multiple constraints”. Networks, Vol: 14, pp. 95-116, 1984.
There are 1 citations in total.
Details
| Primary Language | English |
|---|---|
| Subjects | Engineering |
| Journal Section | Articles |
| Authors | |
| Publication Date | December 1, 2015 |
| Published in Issue | Year 2015 Volume: 15 Issue: 2 |
