DocumentCode
2416450
Title
Call admission control and congestion control for integrated packet networks
Author
Harlapur, Supriya B. ; Mallapur, J.D. ; Katageri, Ajayakumar C. ; Patil, Virupakshreddy S.
Author_Institution
Dept. of E & C E, Basaveshwar Eng. Coll., Bagalkot, India
fYear
2010
fDate
13-14 Dec. 2010
Firstpage
100
Lastpage
105
Abstract
Call admission and congestion control mechanisms are the integral parts of any Quality of Service (QoS) design for computer networks that support integrated traffic. In this paper, we propose an call admission control algorithm and a congestion control algorithm for cluster based networks, which are used in a various set of applications that require QoS guarantees. We mainly consider queue length as a main parameter to provide service to the client. Scheduler will keep the track of all the necessary information about the various servers i.e., server which is busy, in which server the queue length is less etc. As the clients arrive for service, scheduler will check out the queue length of the packets and status of the server, then accordingly route the clients request to the desired idle server, if the server is busy, packets will be queued up.
Keywords
computer networks; quality of service; queueing theory; telecommunication congestion control; telecommunication traffic; QoS; call admission control; cluster based network; congestion control; integrated packet network; quality of service; queue length; Computers; Call Admission Control; Computer network; Congestion control; Queuing;
fLanguage
English
Publisher
ieee
Conference_Titel
Methods and Models in Computer Science (ICM2CS), 2010 International Conference on
Conference_Location
New Delhi
Print_ISBN
978-1-4244-9701-0
Type
conf
DOI
10.1109/ICM2CS.2010.5706727
Filename
5706727
Link To Document