Generation of a New Algorithm using Priority Measurement Based Routes

Authors

  • Dr. Naveen Hemrajani

  • Dharm Singh

  • Arushi Rawal

Keywords:

Admission Control, bounded delay, link utilization, intricate collisions

Abstract

With the explosive growth in multimedia wireless applications such as video streaming and conferencing, the need for appropriate bandwidth allocation mechanism has also increased as in absence of this a flow may experience considerable performance degradation due to free admission of randomly large numbers of flows. Thus, admission control is used to deal with this problem. The role of admission control algorithms is to make sure that admittance of new flows into the networks doesn2019;t violate service commitments made by network to admitted flows. This paper compares the performance of four measurement based admission control algorithms for controlled load service. We evaluate link utilization and adherence to service commitments achieved by these algorithms. Further a new algorithm is proposed using priority measurement based on the round trip times of the nodes.

How to Cite

Dr. Naveen Hemrajani, Dharm Singh, & Arushi Rawal. (2011). Generation of a New Algorithm using Priority Measurement Based Routes. Global Journal of Computer Science and Technology, 11(13), 25–29. Retrieved from https://computerresearch.org/index.php/computer/article/view/771

Generation of  a New Algorithm using Priority Measurement Based Routes

Published

2011-07-02