IJBTT

A Study of QoS Metrics

	International Journal of Recent Engineering Science (IJRES)
	© 2014 by IJRES Journal
	Volume-1 Issue-5
	Year of Publication : 2014
	Authors : Dr.J.Kannan, S.Shanpagapriya, M.E
	DOI : 10.14445/23497157/IJRES-V1I5P101

How to Cite?

Dr.J.Kannan, S.Shanpagapriya, M.E, "A Study of QoS Metrics," International Journal of Recent Engineering Science, vol. 1, no. 5, pp. 1-7, 2014. Crossref, https://doi.org/10.14445/23497157/IJRES-V1I5P101

Abstract
Quality of Service is an area, at present lot of research work is being carried out. The main thirst for QoS is to improve the ‘best effort’ paradigm. To provide QoS based service in the network is extremely difficult, it is done at the routing layer. The difficulties involved in the QoS routing come in the form of constraints like delay, cost and jitter. These constraints act as one or in multiple constraints, which is known as NP-hard. QoS routing is an important aspect in the entire QoS framework. In this paper, a detailed study is made on metrics which act as single or in dual metrics, which influence the performance of QoS. Various real-time services, like web casting, audio/video conferencing and television, are being deployed over the Internet. For the above listed services we have to provide a guaranteed service, which can be achieved only by scrutinizing the metric constraints like delay, bandwidth, jitter or metric combination like delay and cost, bandwidth and delay, bandwidth and cost. To implement an algorithm to enhance the QoS routing, cost to implement increases, this cost issue gets balanced if the performance of the end service is considerably improved.

Keywords
QoS routing, delay, bandwidth, cost.

Reference
[1] G. Apostolopoulos, D. Williams, S. Kamat, R. Guérin, A. Orda, T. Przygienda, “QoS Routing Mechanisms and OSPF Extensions”, IETF, RFC 2676, August 1999.
[2] Shigang Chen, Klara Nahrstedt, “An Overview of Quality-ofService Routing for the Next Generation High-Speed Networks: Problems and Solutions”, in IEEE Network, Special Issue on Transmission and Distribution of Digital Video, November/December 1998, pp. 64-79.
[3] Shiang Chen, Klara Nahrstedt, ”On finding Multi-constrained path (MCP) in International Journal of computational Geometry and Application ,1998 ,pp 874-879.
[4] Shigang Chen, Klara Nahrstedt, “On Finding Multi-constrained Paths (MCP)”,in International Journal of Computational Geometry and Applications, 1998, pp. 874-879.
[5] Shigang Chen, Klara Nahrstedt, “Distributed QoS Routing with Imprecise State Information”,in Proceedings of 7th IEEE International Conference on Computer, Communications and Networks, Lafayette, LA, October 1998, pp. 614-621.
[6] Hans De Neve, Piet Van Mieghem, “TAMCRA: A Tunable Accuracy Multiple Constraints Routing Algorithm”, In Computer Communications, Vol. 23, pp. 667-679
[7] Liang Guo, Ibrahim Matta, “Search Space Reduction in QoS Routing”, College of Computer Science, Northeastern University, USA, October 1998, Technical Report NU-CCS-98-09.
[8] Luis Henrique M. K. Costa, Serge Fdida (LIP6/UPMC), Otto Carlos M. B. Duarte, “Hop-by-Hop Multicast Routing Protocol”, In ACM SIGCOMM, August 2001, pp. 249-259
[9] M. Jain and C. Dovrolis, “End-to-end available bandwidth: measurement methodology, dynamics, and relation with TCP throughput,” IEEE/ACM Trans. Networking, vol. 11, pp. 537– 549, Aug. 2003.
[10] Alpar Juttner, Balazs Szviatovszki, Ildiko Mecs, Zsolt Rajko, “Lagrange Relaxation Based Method for the QoS Routing Problem”, in IEEE INFOCOM 2001, pp. 782-791.
[11] D. H. Lorenz, A. Orda, “QoS Routing in Networks with Uncertain Parameters”,Department of Electrical Engineering, Technion, Haifa, Israel, June 97, Research Report EE Pub. No. 1094.
[12] Qingming Ma, Peter Steenkiste, “Quality of Service Routing for Traffic with Performance Guarantees”,in IFIP Fifth International Workshop on Quality of Service, NY, May 1997, pp. 115-126.
[13] B. Melander, M. Bjorkman, and P. Gunningberg, “A new end-toend probing and analysis method for estimating bandwidth bottlenecks,” in Proc. IEEE Global Internet Symp., 2000.
[14] R. S. Prasad, M. Murray, C. Dovrolis, and K. Claffy, “Bandwidth estimation: metrics, measurement techniques, and tools,” IEEE Network, vol. 17, pp. 27–35, Nov. 2003.
[15] V. Ribeiro, R. Riedi, R. Baraniuk, J. Navratil, and L. Cottrell, “PathChirp: efficient available bandwidth estimation for network paths,” in Proc. Passive and Active Measurements (PAM) Workshop, Apr. 2003.
[16] J. L. Sobrinho, “Algebra and algorithms for QoS path computation and hop-by-hop routing in the Internet”, IEEE Transactions on Networking, August 2002.
[17] Telecommunication Standardization Sector of ITU. ITU-T Recommendation E.800: Terms and Definition related to Quality of Service and Network Performance including Dependability, 1994.
[18] Turgay Korkmaz, Marwan Krunz, “Multi-Constrained Optimal Path Selection”,in Proceedings of the IEEE INFOCOM 2001 Conference, Vol 2, Anchorage, Alaska, April 2001, pp. 834-843.
[19] P.Van Miegham, F.A.Kuipers,”On the Complexity of QoS Routing”, Computer Communication, http://www.tvs.et.tudeltt.nl.2001.
[20] Piet Van Mieghem, Hans De Neve, “Aspects of Quality of Service Routing”,in SPIE'98, Nov. 1-6, Boston (USA), 3529A-05.
[21] Ronny Vogel, Ralf G. Herrtwich, Winfried Kalfa, Hartmut Wittig, Lars C. Wolf, “QoS Based Routing of Multimedia Streams in Computer Networks”, in IEEE JSAC, Vol. 14, No. 7, 1996, pp. 1235-1244
[22] Zheng Wang and J.Crowcroft, ”Quality-of-service routing for supporting Areas in Communication,14(7):1228-1234,1996.
[23] Xin Yuan, Xingming Liu, “Heuristic Algorithms for MultiConstrained Quality of Service Routing”,in IEEE INFOCOM 2001, pp. 355- 364