Part 2: Traffic control in multimedia networks An efficient algorithm for multimedia call-admission control

Qian, K; Georganas, ND; McDonald, D

dc.contributor.author	Qian, K	en
dc.contributor.author	Georganas, ND	en
dc.contributor.author	McDonald, D	en
dc.date.accessioned	2014-03-01T01:44:49Z
dc.date.available	2014-03-01T01:44:49Z
dc.date.issued	1996	en
dc.identifier.issn	09424962	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/24495
dc.relation.uri	http://www.scopus.com/inward/record.url?eid=2-s2.0-5644246089&partnerID=40&md5=6944cffcedf731d89b0f84513bf64e02	en
dc.subject	ATM networks	en
dc.subject	Bandwidth allocation	en
dc.subject	Call admission control	en
dc.subject	Excess-demand probability	en
dc.title	Part 2: Traffic control in multimedia networks An efficient algorithm for multimedia call-admission control	en
heal.type	journalArticle	en
heal.publicationDate	1996	en
heal.abstract	This paper presents a call admission control (CAC) algorithm for multimedia communication systems with diverse bit-rate media sources. The proposed algorithm for making bandwidth allocation decisions is based on bounding the probability of demand for excess bandwidth and the loss (or blocking) probability. Recursion formulas for calculating these probabilities are derived. An algorithm based on these probabilities executes quickly enough so that the response time to a bandwidth request is acceptable.	en
heal.journalName	Multimedia Systems	en
dc.identifier.volume	4	en
dc.identifier.issue	6	en
dc.identifier.spage	339	en
dc.identifier.epage	345	en