Connection Admission Control (CAC) is an important function in a computer network that supports Quality of Service (QoS). The function of CAC is to decide whether a new connection can be admitted on the network or a part of the network in such a way that the QoS of the new connection and the already established connections will remain within the requested limits. CAC must also ensure that network resources are used efficiently avoiding unnecessary rejections of candidate connections. Some CAC algorithms attempt to estimate or derive available resources in each hop between the source and the destination. Then they use parameters of the candidate flow and the knowledge about the available resources to make the admission decision. Very often such algorithms use measurements to find out availability of the resources. Hence the name of such algorithms, Measurement-Based CAC (MBCAC). Another class of CAC algorithms assumes that it is the end nodes and not the network that should perform the connection admission. These algorithms use probing packets to probe the path between the end nodes for the requested level of QoS. In this paper a heuristic-based per-hop CAC algorithm is introduced that adapts the average rate of connection admission in response to the measured system performance. In particular, the algorithm decreases the rate of the connection admission when the system is overloaded and increases it when the system is underutilized. The paper uses simulations to show that the algorithm is free from the shortcomings of the current MBCAC algorithms.
End of preview. The entire article is 11 pages. To view the full-text, please rent this article to continue.
/lp/association-for-computing-machinery/an-enforced-inter-admission-delay-performance-driven-connection-mPcuqFQrnj
Welcome to DeepDyve! Rent Premier Research Articles and Save Up to 90%
An enforced inter-admission delay performance-driven connection admission control algorithm
Belenki, Stanislav
Follow ACM SIGCOMM Computer Communication Review
, Volume 32 (2)
Association for Computing Machinery – Apr 1, 2002
More Info
More Like This Article
View All dataSource[]=actageo&dataSource[]=aspet&dataSource[]=aaos&dataSource[]=aacc&dataSource[]=aacr&dataSource[]=aea&dataSource[]=aip&dataSource[]=ajnr&dataSource[]=ams&dataSource[]=aps_physical&dataSource[]=appi_book&dataSource[]=appi_journal&dataSource[]=apha&dataSource[]=asip&dataSource[]=asm&dataSource[]=asn&dataSource[]=aspb&dataSource[]=avs&dataSource[]=annual_reviews&dataSource[]=arxiv&dataSource[]=acm&dataSource[]=berghahn&dataSource[]=cabi&dataSource[]=clinical_trials&dataSource[]=dailymed&dataSource[]=degruyter&dataSource[]=du_press&dataSource[]=esa&dataSource[]=eu_press&dataSource[]=elsevier&dataSource[]=emerald&dataSource[]=ejtr&dataSource[]=emea&dataSource[]=epo&dataSource[]=faseb&dataSource[]=gsa&dataSource[]=health_affairs&dataSource[]=hindawi&dataSource[]=imanager&dataSource[]=imedpub&dataSource[]=informa_healthcare&dataSource[]=informs&dataSource[]=iop&dataSource[]=iucr&dataSource[]=iospress&dataSource[]=jbjs&dataSource[]=leftcoast&dataSource[]=lu_press&dataSource[]=mesharpe&dataSource[]=mary_ann_liebert&dataSource[]=medline&dataSource[]=mit_press&dataSource[]=nature&dataSource[]=oxford&dataSource[]=pier_professional&dataSource[]=pnas&dataSource[]=portlandpress&dataSource[]=psyc_articles&dataSource[]=psyc_books&dataSource[]=psyc_critiques&dataSource[]=plos_journal&dataSource[]=pubmed_central&dataSource[]=rsna&dataSource[]=rockefeller&dataSource[]=rcn&dataSource[]=ria&dataSource[]=rsc&dataSource[]=sage&dataSource[]=spie&dataSource[]=springer_journal&dataSource[]=springer&dataSource[]=taylor_francis&dataSource[]=aps&dataSource[]=the_scientist&dataSource[]=uc_press&dataSource[]=uspto_abstract&dataSource[]=wiley&dataSource[]=pct
© 2012 DeepDyve, Inc. All rights reserved.
Terms of Service | Privacy Policy
