Up- and Downlink Admission/Congestion Control and Maximal Load in Large Homogeneous CDMA Networks View Full Text


Ontology type: schema:ScholarlyArticle      Open Access: True


Article Info

DATE

2004-12

AUTHORS

François Baccelli, Bartłomiej Błaszczyszyn, Mohamed Kadhem Karray

ABSTRACT

This paper proposes scalable admission and congestion control schemes that allow each base station to decide independently of the others what set of voice users to serve and/or what bit rates to offer to elastic traffic users competing for bandwidth. These algorithms are primarily meant for large CDMA networks with a random but homogeneous user distribution. They take into account in an exact way the influence of geometry on the combination of inter-cell and intra-cell interferences as well as the existence of maximal power constraints of the base stations and users. We also study the load allowed by these schemes when the size of the network tends to infinity and the mean bit rate offered to elastic traffic users. By load, we mean here the number of voice users that each base station can serve. More... »

PAGES

605-617

Journal

TITLE

Mobile Networks and Applications

ISSUE

6

VOLUME

9

Author Affiliations

Identifiers

URI

http://scigraph.springernature.com/pub.10.1023/b:mone.0000042499.64488.ba

DOI

http://dx.doi.org/10.1023/b:mone.0000042499.64488.ba

DIMENSIONS

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


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/1005", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Communications Technologies", 
        "type": "DefinedTerm"
      }, 
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/10", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Technology", 
        "type": "DefinedTerm"
      }
    ], 
    "author": [
      {
        "affiliation": {
          "name": [
            "INRIA and \u00c9cole Normale Sup\u00e9rieure, 45 rue d'Ulm, 75005, Paris, France"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Baccelli", 
        "givenName": "Fran\u00e7ois", 
        "id": "sg:person.013374336621.69", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013374336621.69"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "name": [
            "INRIA and \u00c9cole Normale Sup\u00e9rieure, 45 rue d'Ulm, 75005, Paris, France"
          ], 
          "type": "Organization"
        }, 
        "familyName": "B\u0142aszczyszyn", 
        "givenName": "Bart\u0142omiej", 
        "id": "sg:person.013154315266.38", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013154315266.38"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Orange (France)", 
          "id": "https://www.grid.ac/institutes/grid.89485.38", 
          "name": [
            "France T\u00e9l\u00e9com R&D, 38/40 rue du G\u00e9n\u00e9ral Leclerc, 92794, Issy-Moulineaux, France"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Karray", 
        "givenName": "Mohamed Kadhem", 
        "id": "sg:person.015464012570.16", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015464012570.16"
        ], 
        "type": "Person"
      }
    ], 
    "citation": [
      {
        "id": "https://doi.org/10.1109/25.120145", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1061134250"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1109/25.155977", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1061134288"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1109/25.260747", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1061134373"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1109/25.289411", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1061134424"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1109/25.312818", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1061134530"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1109/26.486617", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1061137205"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1109/26.752823", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1061138177"
        ], 
        "type": "CreativeWork"
      }
    ], 
    "datePublished": "2004-12", 
    "datePublishedReg": "2004-12-01", 
    "description": "This paper proposes scalable admission and congestion control schemes that allow each base station to decide independently of the others what set of voice users to serve and/or what bit rates to offer to elastic traffic users competing for bandwidth. These algorithms are primarily meant for large CDMA networks with a random but homogeneous user distribution. They take into account in an exact way the influence of geometry on the combination of inter-cell and intra-cell interferences as well as the existence of maximal power constraints of the base stations and users. We also study the load allowed by these schemes when the size of the network tends to infinity and the mean bit rate offered to elastic traffic users. By load, we mean here the number of voice users that each base station can serve.", 
    "genre": "research_article", 
    "id": "sg:pub.10.1023/b:mone.0000042499.64488.ba", 
    "inLanguage": [
      "en"
    ], 
    "isAccessibleForFree": true, 
    "isPartOf": [
      {
        "id": "sg:journal.1136741", 
        "issn": [
          "1383-469X", 
          "1572-8153"
        ], 
        "name": "Mobile Networks and Applications", 
        "type": "Periodical"
      }, 
      {
        "issueNumber": "6", 
        "type": "PublicationIssue"
      }, 
      {
        "type": "PublicationVolume", 
        "volumeNumber": "9"
      }
    ], 
    "name": "Up- and Downlink Admission/Congestion Control and Maximal Load in Large Homogeneous CDMA Networks", 
    "pagination": "605-617", 
    "productId": [
      {
        "name": "readcube_id", 
        "type": "PropertyValue", 
        "value": [
          "bfe9b9539be3543c436505a2e0ec0d02e47fd2ef749667c7288b6ff4ef412f3d"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1023/b:mone.0000042499.64488.ba"
        ]
      }, 
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1040287600"
        ]
      }
    ], 
    "sameAs": [
      "https://doi.org/10.1023/b:mone.0000042499.64488.ba", 
      "https://app.dimensions.ai/details/publication/pub.1040287600"
    ], 
    "sdDataset": "articles", 
    "sdDatePublished": "2019-04-10T14:59", 
    "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_8663_00000507.jsonl", 
    "type": "ScholarlyArticle", 
    "url": "http://link.springer.com/10.1023%2FB%3AMONE.0000042499.64488.ba"
  }
]
 

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.1023/b:mone.0000042499.64488.ba'

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.1023/b:mone.0000042499.64488.ba'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1023/b:mone.0000042499.64488.ba'

RDF/XML is a standard XML format for linked data.

curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1023/b:mone.0000042499.64488.ba'


 

This table displays all metadata directly associated to this object as RDF triples.

100 TRIPLES      21 PREDICATES      34 URIs      19 LITERALS      7 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1023/b:mone.0000042499.64488.ba schema:about anzsrc-for:10
2 anzsrc-for:1005
3 schema:author Na6428455b82a42aa9f75f74627e3eb01
4 schema:citation https://doi.org/10.1109/25.120145
5 https://doi.org/10.1109/25.155977
6 https://doi.org/10.1109/25.260747
7 https://doi.org/10.1109/25.289411
8 https://doi.org/10.1109/25.312818
9 https://doi.org/10.1109/26.486617
10 https://doi.org/10.1109/26.752823
11 schema:datePublished 2004-12
12 schema:datePublishedReg 2004-12-01
13 schema:description This paper proposes scalable admission and congestion control schemes that allow each base station to decide independently of the others what set of voice users to serve and/or what bit rates to offer to elastic traffic users competing for bandwidth. These algorithms are primarily meant for large CDMA networks with a random but homogeneous user distribution. They take into account in an exact way the influence of geometry on the combination of inter-cell and intra-cell interferences as well as the existence of maximal power constraints of the base stations and users. We also study the load allowed by these schemes when the size of the network tends to infinity and the mean bit rate offered to elastic traffic users. By load, we mean here the number of voice users that each base station can serve.
14 schema:genre research_article
15 schema:inLanguage en
16 schema:isAccessibleForFree true
17 schema:isPartOf N678e7512ec33436694363d81a579c462
18 Nf719fe5e3868486bba80164f32225fea
19 sg:journal.1136741
20 schema:name Up- and Downlink Admission/Congestion Control and Maximal Load in Large Homogeneous CDMA Networks
21 schema:pagination 605-617
22 schema:productId N35d63b91d99a4984985763804a1d1c36
23 N7201f6211754434ebdffb9dafd746cb9
24 Ncb0a613973cb4b83926e2e0a1118cbda
25 schema:sameAs https://app.dimensions.ai/details/publication/pub.1040287600
26 https://doi.org/10.1023/b:mone.0000042499.64488.ba
27 schema:sdDatePublished 2019-04-10T14:59
28 schema:sdLicense https://scigraph.springernature.com/explorer/license/
29 schema:sdPublisher N5539eaf760ca4f7386198d24c69569ec
30 schema:url http://link.springer.com/10.1023%2FB%3AMONE.0000042499.64488.ba
31 sgo:license sg:explorer/license/
32 sgo:sdDataset articles
33 rdf:type schema:ScholarlyArticle
34 N20ca606d2d6749229447b0dd469bc004 rdf:first sg:person.013154315266.38
35 rdf:rest N50d992aca35e4620a30f791edd59ec3f
36 N35d63b91d99a4984985763804a1d1c36 schema:name readcube_id
37 schema:value bfe9b9539be3543c436505a2e0ec0d02e47fd2ef749667c7288b6ff4ef412f3d
38 rdf:type schema:PropertyValue
39 N3b0e270401754b61a9af4c1db6b3174c schema:name INRIA and École Normale Supérieure, 45 rue d'Ulm, 75005, Paris, France
40 rdf:type schema:Organization
41 N4c227b67295641ef91d0fd53ae81b58b schema:name INRIA and École Normale Supérieure, 45 rue d'Ulm, 75005, Paris, France
42 rdf:type schema:Organization
43 N50d992aca35e4620a30f791edd59ec3f rdf:first sg:person.015464012570.16
44 rdf:rest rdf:nil
45 N5539eaf760ca4f7386198d24c69569ec schema:name Springer Nature - SN SciGraph project
46 rdf:type schema:Organization
47 N678e7512ec33436694363d81a579c462 schema:issueNumber 6
48 rdf:type schema:PublicationIssue
49 N7201f6211754434ebdffb9dafd746cb9 schema:name doi
50 schema:value 10.1023/b:mone.0000042499.64488.ba
51 rdf:type schema:PropertyValue
52 Na6428455b82a42aa9f75f74627e3eb01 rdf:first sg:person.013374336621.69
53 rdf:rest N20ca606d2d6749229447b0dd469bc004
54 Ncb0a613973cb4b83926e2e0a1118cbda schema:name dimensions_id
55 schema:value pub.1040287600
56 rdf:type schema:PropertyValue
57 Nf719fe5e3868486bba80164f32225fea schema:volumeNumber 9
58 rdf:type schema:PublicationVolume
59 anzsrc-for:10 schema:inDefinedTermSet anzsrc-for:
60 schema:name Technology
61 rdf:type schema:DefinedTerm
62 anzsrc-for:1005 schema:inDefinedTermSet anzsrc-for:
63 schema:name Communications Technologies
64 rdf:type schema:DefinedTerm
65 sg:journal.1136741 schema:issn 1383-469X
66 1572-8153
67 schema:name Mobile Networks and Applications
68 rdf:type schema:Periodical
69 sg:person.013154315266.38 schema:affiliation N3b0e270401754b61a9af4c1db6b3174c
70 schema:familyName Błaszczyszyn
71 schema:givenName Bartłomiej
72 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013154315266.38
73 rdf:type schema:Person
74 sg:person.013374336621.69 schema:affiliation N4c227b67295641ef91d0fd53ae81b58b
75 schema:familyName Baccelli
76 schema:givenName François
77 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013374336621.69
78 rdf:type schema:Person
79 sg:person.015464012570.16 schema:affiliation https://www.grid.ac/institutes/grid.89485.38
80 schema:familyName Karray
81 schema:givenName Mohamed Kadhem
82 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015464012570.16
83 rdf:type schema:Person
84 https://doi.org/10.1109/25.120145 schema:sameAs https://app.dimensions.ai/details/publication/pub.1061134250
85 rdf:type schema:CreativeWork
86 https://doi.org/10.1109/25.155977 schema:sameAs https://app.dimensions.ai/details/publication/pub.1061134288
87 rdf:type schema:CreativeWork
88 https://doi.org/10.1109/25.260747 schema:sameAs https://app.dimensions.ai/details/publication/pub.1061134373
89 rdf:type schema:CreativeWork
90 https://doi.org/10.1109/25.289411 schema:sameAs https://app.dimensions.ai/details/publication/pub.1061134424
91 rdf:type schema:CreativeWork
92 https://doi.org/10.1109/25.312818 schema:sameAs https://app.dimensions.ai/details/publication/pub.1061134530
93 rdf:type schema:CreativeWork
94 https://doi.org/10.1109/26.486617 schema:sameAs https://app.dimensions.ai/details/publication/pub.1061137205
95 rdf:type schema:CreativeWork
96 https://doi.org/10.1109/26.752823 schema:sameAs https://app.dimensions.ai/details/publication/pub.1061138177
97 rdf:type schema:CreativeWork
98 https://www.grid.ac/institutes/grid.89485.38 schema:alternateName Orange (France)
99 schema:name France Télécom R&D, 38/40 rue du Général Leclerc, 92794, Issy-Moulineaux, France
100 rdf:type schema:Organization
 




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


...