Part 2: Traffic control in Multimedia Networks An efficient algorithm for multimedia call-admission control View Full Text


Ontology type: schema:ScholarlyArticle     


Article Info

DATE

1996-12

AUTHORS

K. Qian, N.D. Georganas, D. McDonald

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. More... »

PAGES

339-345

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/s005300050035

DOI

http://dx.doi.org/10.1007/s005300050035

DIMENSIONS

https://app.dimensions.ai/details/publication/pub.1052934062


Indexing Status Check whether this publication has been indexed by Scopus and Web Of Science using the SN Indexing Status Tool
Incoming Citations Browse incoming citations for this publication using opencitations.net

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

HOW TO GET THIS DATA PROGRAMMATICALLY:

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

Subject Predicate Object
1 sg:pub.10.1007/s005300050035 schema:about anzsrc-for:08
2 anzsrc-for:0801
3 schema:author N5b07eb73ae0f4145a7b2bc6f91486c9d
4 schema:datePublished 1996-12
5 schema:datePublishedReg 1996-12-01
6 schema: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.
7 schema:genre research_article
8 schema:inLanguage en
9 schema:isAccessibleForFree false
10 schema:isPartOf N1528bf9ac5dc4d15b224bdd26cb8aee2
11 Nbfe7da5c436a487d8cf46fa0a82ee310
12 sg:journal.1284647
13 schema:name Part 2: Traffic control in Multimedia Networks An efficient algorithm for multimedia call-admission control
14 schema:pagination 339-345
15 schema:productId N791583d718cf47ab8ff68f3e376476a4
16 Nd5dba87ecd2042ff9301fca81d28c228
17 Ne2000e47cad8434585be880fe92ace38
18 schema:sameAs https://app.dimensions.ai/details/publication/pub.1052934062
19 https://doi.org/10.1007/s005300050035
20 schema:sdDatePublished 2019-04-10T23:20
21 schema:sdLicense https://scigraph.springernature.com/explorer/license/
22 schema:sdPublisher N753adcadc7974e9aa8091fefe5bf9e16
23 schema:url http://link.springer.com/10.1007/s005300050035
24 sgo:license sg:explorer/license/
25 sgo:sdDataset articles
26 rdf:type schema:ScholarlyArticle
27 N1528bf9ac5dc4d15b224bdd26cb8aee2 schema:issueNumber 6
28 rdf:type schema:PublicationIssue
29 N19836113277f449e8db12b40fe43a14e schema:affiliation https://www.grid.ac/institutes/grid.28046.38
30 schema:familyName McDonald
31 schema:givenName D.
32 rdf:type schema:Person
33 N35261ea69adf40f0aa3ba9abfd14f0bc schema:affiliation https://www.grid.ac/institutes/grid.28046.38
34 schema:familyName Qian
35 schema:givenName K.
36 rdf:type schema:Person
37 N5b07eb73ae0f4145a7b2bc6f91486c9d rdf:first N35261ea69adf40f0aa3ba9abfd14f0bc
38 rdf:rest Nef3941cf220549dcb3a0f217749d5729
39 N753adcadc7974e9aa8091fefe5bf9e16 schema:name Springer Nature - SN SciGraph project
40 rdf:type schema:Organization
41 N791583d718cf47ab8ff68f3e376476a4 schema:name doi
42 schema:value 10.1007/s005300050035
43 rdf:type schema:PropertyValue
44 Nbfe7da5c436a487d8cf46fa0a82ee310 schema:volumeNumber 4
45 rdf:type schema:PublicationVolume
46 Nd5dba87ecd2042ff9301fca81d28c228 schema:name readcube_id
47 schema:value fc23cf763cdd14264f1627070f16cf36b2d70831682fff16ee81129cfa7fb217
48 rdf:type schema:PropertyValue
49 Ne2000e47cad8434585be880fe92ace38 schema:name dimensions_id
50 schema:value pub.1052934062
51 rdf:type schema:PropertyValue
52 Nef3941cf220549dcb3a0f217749d5729 rdf:first sg:person.0671247226.24
53 rdf:rest Nff31b0ac298b491cb93e494cc9b4ce41
54 Nff31b0ac298b491cb93e494cc9b4ce41 rdf:first N19836113277f449e8db12b40fe43a14e
55 rdf:rest rdf:nil
56 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
57 schema:name Information and Computing Sciences
58 rdf:type schema:DefinedTerm
59 anzsrc-for:0801 schema:inDefinedTermSet anzsrc-for:
60 schema:name Artificial Intelligence and Image Processing
61 rdf:type schema:DefinedTerm
62 sg:journal.1284647 schema:issn 0942-4962
63 1432-1882
64 schema:name Multimedia Systems
65 rdf:type schema:Periodical
66 sg:person.0671247226.24 schema:affiliation https://www.grid.ac/institutes/grid.28046.38
67 schema:familyName Georganas
68 schema:givenName N.D.
69 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.0671247226.24
70 rdf:type schema:Person
71 https://www.grid.ac/institutes/grid.28046.38 schema:alternateName University of Ottawa
72 schema:name Department of Mathematics, University of Ottawa, Ottawa, Ont., Canada, K1N 6N5, CA
73 Multimedia Communications Research Laboratory, University of Ottawa, Ottawa, Ont., Canada, K1N 6N5, CA
74 rdf:type schema:Organization
 




Preview window. Press ESC to close (or click here)


...