Admission control is a network Quality of Service (QoS) procedure. Admission control determines how bandwidth and latency are allocated to streams with various requirements. Admission control schemes therefore need to be implemented between network edges and core to control the traffic entering the network. An application that wishes to use the network to transport traffic with QoS must first request a connection, which involves informing the network about the characteristics of the traffic and the QoS required by the application. This information is stored in a traffic contract. The network judges whether it has enough resources available to accept the connection, and then either accepts or rejects the connection request. This is known as Admission Control. Here in our project we are concerning for the different measurement based admission control algorithms used for this purpose. For this we will discuss four measurement based admission control algorithms, such as Hoeffding Bounds, Acceptance Region and Measured Sum. Further a new algorithm is proposed using priority measurement based on the round trip times of the nodes. we will show the output of the algorithms using the NS-2 simulator and compare the simulation output of the four measurement based admission control algorithms using Nam. We will simulate using X-graph to find the throughput and utilization of the bandwidth. Further these parameters are compared performing the video transmission on all the four admission control algorithms.

1. Ferrai D. and D. C. Verma. “A scheme for real time channel establishment in wide area networks. “IEEE. J. Select. Area. Commun. Vol. 8 no. 3. Pp. 368-379. 1990.
2. Ohnishi, H, T. Okada and K. Noguchi. “Flow control schemes and delay/loss tradeoff in ATM networks “IEEE J Select Areas Commun. Vol. 6 no 9 pp. 1609-1616. Dec. 1988
3. Clark, D. D. S. J. Shenker and L. Zhang. “Supporting real time applications in an integrated services packet network; architecture and mechanism” in Proc. ACM SIGCOMM’ 92, pp. 14-26.
4. Zhang, H. and D. Ferrari. Improving utilization for deterministic service in multimedia communication, presented at the IEEE Int. Conf. Multimedia Computing and Systems, 1994.
5. Duffy D. E. A. A. Mclntosh, M. Rosenten and W. Willinger. Statistical analysis of CCSNSS7 traffic data from working CCS subnetworks. “IEEE J Select. Areas Commn. Vol. 12. No 3. Pp. 544-551. 1994.
6. Hiroshi Saito (1993). Teletraffic Technologies in ATM Networks. Artech House. ISBN 0-89006-622-1.
7. N. Hemrajani, Dharm Singh, A. Rawal and E. Menghani, Generation of a New Algorithm using Priority Measurement Based Routes, Global Journal of Computer Science and Technology (GJCST) Volume 11 Issue 13 Version 1.0 August 2011, pp24-29, Online ISSN: 0975-4172 & Print ISSN: 0975-4350.

Video Transmission Admission Control bounded delay link utilization intricate collisions