Ontology type: schema:ScholarlyArticle
1996-12
AUTHORSK. Qian, N.D. Georganas, D. McDonald
ABSTRACTThis 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. More... »
PAGES339-345
http://scigraph.springernature.com/pub.10.1007/s005300050035
DOIhttp://dx.doi.org/10.1007/s005300050035
DIMENSIONShttps://app.dimensions.ai/details/publication/pub.1052934062
JSON-LD is the canonical representation for SciGraph data.
TIP: You can open this SciGraph record using an external JSON-LD service: JSON-LD Playground Google SDTT
[
{
"@context": "https://springernature.github.io/scigraph/jsonld/sgcontext.json",
"about": [
{
"id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/0801",
"inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/",
"name": "Artificial Intelligence and Image Processing",
"type": "DefinedTerm"
},
{
"id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/08",
"inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/",
"name": "Information and Computing Sciences",
"type": "DefinedTerm"
}
],
"author": [
{
"affiliation": {
"alternateName": "University of Ottawa",
"id": "https://www.grid.ac/institutes/grid.28046.38",
"name": [
"Multimedia Communications Research Laboratory, University of Ottawa, Ottawa, Ont., Canada, K1N 6N5, CA"
],
"type": "Organization"
},
"familyName": "Qian",
"givenName": "K.",
"type": "Person"
},
{
"affiliation": {
"alternateName": "University of Ottawa",
"id": "https://www.grid.ac/institutes/grid.28046.38",
"name": [
"Multimedia Communications Research Laboratory, University of Ottawa, Ottawa, Ont., Canada, K1N 6N5, CA"
],
"type": "Organization"
},
"familyName": "Georganas",
"givenName": "N.D.",
"id": "sg:person.0671247226.24",
"sameAs": [
"https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.0671247226.24"
],
"type": "Person"
},
{
"affiliation": {
"alternateName": "University of Ottawa",
"id": "https://www.grid.ac/institutes/grid.28046.38",
"name": [
"Department of Mathematics, University of Ottawa, Ottawa, Ont., Canada, K1N 6N5, CA"
],
"type": "Organization"
},
"familyName": "McDonald",
"givenName": "D.",
"type": "Person"
}
],
"datePublished": "1996-12",
"datePublishedReg": "1996-12-01",
"description": "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.",
"genre": "research_article",
"id": "sg:pub.10.1007/s005300050035",
"inLanguage": [
"en"
],
"isAccessibleForFree": false,
"isPartOf": [
{
"id": "sg:journal.1284647",
"issn": [
"0942-4962",
"1432-1882"
],
"name": "Multimedia Systems",
"type": "Periodical"
},
{
"issueNumber": "6",
"type": "PublicationIssue"
},
{
"type": "PublicationVolume",
"volumeNumber": "4"
}
],
"name": "Part 2: Traffic control in Multimedia Networks An efficient algorithm for multimedia call-admission control",
"pagination": "339-345",
"productId": [
{
"name": "readcube_id",
"type": "PropertyValue",
"value": [
"fc23cf763cdd14264f1627070f16cf36b2d70831682fff16ee81129cfa7fb217"
]
},
{
"name": "doi",
"type": "PropertyValue",
"value": [
"10.1007/s005300050035"
]
},
{
"name": "dimensions_id",
"type": "PropertyValue",
"value": [
"pub.1052934062"
]
}
],
"sameAs": [
"https://doi.org/10.1007/s005300050035",
"https://app.dimensions.ai/details/publication/pub.1052934062"
],
"sdDataset": "articles",
"sdDatePublished": "2019-04-10T23:20",
"sdLicense": "https://scigraph.springernature.com/explorer/license/",
"sdPublisher": {
"name": "Springer Nature - SN SciGraph project",
"type": "Organization"
},
"sdSource": "s3://com-uberresearch-data-dimensions-target-20181106-alternative/cleanup/v134/2549eaecd7973599484d7c17b260dba0a4ecb94b/merge/v9/a6c9fde33151104705d4d7ff012ea9563521a3ce/jats-lookup/v90/0000000001_0000000264/records_8693_00000492.jsonl",
"type": "ScholarlyArticle",
"url": "http://link.springer.com/10.1007/s005300050035"
}
]
Download the RDF metadata as: json-ld nt turtle xml License info
JSON-LD is a popular format for linked data which is fully compatible with JSON.
curl -H 'Accept: application/ld+json' 'https://scigraph.springernature.com/pub.10.1007/s005300050035'
N-Triples is a line-based linked data format ideal for batch operations.
curl -H 'Accept: application/n-triples' 'https://scigraph.springernature.com/pub.10.1007/s005300050035'
Turtle is a human-readable linked data format.
curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/s005300050035'
RDF/XML is a standard XML format for linked data.
curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/s005300050035'
This table displays all metadata directly associated to this object as RDF triples.
74 TRIPLES
20 PREDICATES
27 URIs
19 LITERALS
7 BLANK NODES