Overflow and losses in a network queue with a self-similar input View Full Text


Ontology type: schema:ScholarlyArticle     


Article Info

DATE

2000-07

AUTHORS

Boris Tsybakov, Nicolas D. Georganas

ABSTRACT

This paper considers a discrete time queuing system that models a communication network multiplexer which is fed by a self-similar packet traffic. The model has a finite buffer of size h, a number of servers with unit service time, and an input traffic which is an aggregation of independent source-active periods having Pareto-distributed lengths and arriving as Poisson batches. The new asymptotic upper and lower bounds to the buffer-overflow and packet-loss probabilities P are obtained. The bounds give an exact asymptotic of log P/log h when h → to ∞. These bounds decay algebraically slow with buffer-size growth and exponentially fast with excess of channel capacity over traffic rate. Such behavior of the probabilities shows that one can better combat traffic losses in communication networks by increasing channel capacity rather than buffer size. A comparison of the obtained bounds and the known upper and lower bounds is done. More... »

PAGES

201-235

Identifiers

URI

http://scigraph.springernature.com/pub.10.1023/a:1019150312811

DOI

http://dx.doi.org/10.1023/a:1019150312811

DIMENSIONS

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


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": {
          "alternateName": "Qualcomm (United States)", 
          "id": "https://www.grid.ac/institutes/grid.430388.4", 
          "name": [
            "QUALCOMM Inc., 5775 Morehouse Drive, 92121-1714, San Diego, CA, USA"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Tsybakov", 
        "givenName": "Boris", 
        "id": "sg:person.07532451723.73", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.07532451723.73"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "University of Ottawa", 
          "id": "https://www.grid.ac/institutes/grid.28046.38", 
          "name": [
            "Multimedia Communications Research Laboratory (MCRLab), School of Info. Tech. & Engin. (SITE), University of Ottawa, K1N 6N5, Ottawa, Ontario, Canada"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Georganas", 
        "givenName": "Nicolas D.", 
        "id": "sg:person.0671247226.24", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.0671247226.24"
        ], 
        "type": "Person"
      }
    ], 
    "citation": [
      {
        "id": "https://doi.org/10.1016/s0166-5316(97)00016-3", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1008190068"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1016/0169-7552(94)00006-f", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1020857916"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1098/rspa.1955.0198", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1048554076"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1023/a:1019143221956", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1049350833", 
          "https://doi.org/10.1023/a:1019143221956"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1017/s0305004100073709", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1053749183"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1109/18.705538", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1061100729"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1109/90.282603", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1061247074"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1109/90.611104", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1061247321"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1109/90.650143", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1061247355"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1109/icc.1997.609995", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1093221550"
        ], 
        "type": "CreativeWork"
      }
    ], 
    "datePublished": "2000-07", 
    "datePublishedReg": "2000-07-01", 
    "description": "This paper considers a discrete time queuing system that models a communication network multiplexer which is fed by a self-similar packet traffic. The model has a finite buffer of size h, a number of servers with unit service time, and an input traffic which is an aggregation of independent source-active periods having Pareto-distributed lengths and arriving as Poisson batches. The new asymptotic upper and lower bounds to the buffer-overflow and packet-loss probabilities P are obtained. The bounds give an exact asymptotic of log P/log h when h \u2192 to \u221e. These bounds decay algebraically slow with buffer-size growth and exponentially fast with excess of channel capacity over traffic rate. Such behavior of the probabilities shows that one can better combat traffic losses in communication networks by increasing channel capacity rather than buffer size. A comparison of the obtained bounds and the known upper and lower bounds is done.", 
    "genre": "research_article", 
    "id": "sg:pub.10.1023/a:1019150312811", 
    "inLanguage": [
      "en"
    ], 
    "isAccessibleForFree": false, 
    "isPartOf": [
      {
        "id": "sg:journal.1048269", 
        "issn": [
          "0257-0130", 
          "1572-9443"
        ], 
        "name": "Queueing Systems", 
        "type": "Periodical"
      }, 
      {
        "issueNumber": "1-4", 
        "type": "PublicationIssue"
      }, 
      {
        "type": "PublicationVolume", 
        "volumeNumber": "35"
      }
    ], 
    "name": "Overflow and losses in a network queue with a self-similar input", 
    "pagination": "201-235", 
    "productId": [
      {
        "name": "readcube_id", 
        "type": "PropertyValue", 
        "value": [
          "d70e4bdb0013979fa450c54c901e22bafc675ee717c9044f45199615b09d4374"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1023/a:1019150312811"
        ]
      }, 
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1045148109"
        ]
      }
    ], 
    "sameAs": [
      "https://doi.org/10.1023/a:1019150312811", 
      "https://app.dimensions.ai/details/publication/pub.1045148109"
    ], 
    "sdDataset": "articles", 
    "sdDatePublished": "2019-04-10T18:25", 
    "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_8675_00000537.jsonl", 
    "type": "ScholarlyArticle", 
    "url": "http://link.springer.com/10.1023%2FA%3A1019150312811"
  }
]
 

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/a:1019150312811'

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/a:1019150312811'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1023/a:1019150312811'

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

curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1023/a:1019150312811'


 

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

102 TRIPLES      21 PREDICATES      37 URIs      19 LITERALS      7 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1023/a:1019150312811 schema:about anzsrc-for:10
2 anzsrc-for:1005
3 schema:author N20ddd00da62147f4b926642f118aef9f
4 schema:citation sg:pub.10.1023/a:1019143221956
5 https://doi.org/10.1016/0169-7552(94)00006-f
6 https://doi.org/10.1016/s0166-5316(97)00016-3
7 https://doi.org/10.1017/s0305004100073709
8 https://doi.org/10.1098/rspa.1955.0198
9 https://doi.org/10.1109/18.705538
10 https://doi.org/10.1109/90.282603
11 https://doi.org/10.1109/90.611104
12 https://doi.org/10.1109/90.650143
13 https://doi.org/10.1109/icc.1997.609995
14 schema:datePublished 2000-07
15 schema:datePublishedReg 2000-07-01
16 schema:description This paper considers a discrete time queuing system that models a communication network multiplexer which is fed by a self-similar packet traffic. The model has a finite buffer of size h, a number of servers with unit service time, and an input traffic which is an aggregation of independent source-active periods having Pareto-distributed lengths and arriving as Poisson batches. The new asymptotic upper and lower bounds to the buffer-overflow and packet-loss probabilities P are obtained. The bounds give an exact asymptotic of log P/log h when h → to ∞. These bounds decay algebraically slow with buffer-size growth and exponentially fast with excess of channel capacity over traffic rate. Such behavior of the probabilities shows that one can better combat traffic losses in communication networks by increasing channel capacity rather than buffer size. A comparison of the obtained bounds and the known upper and lower bounds is done.
17 schema:genre research_article
18 schema:inLanguage en
19 schema:isAccessibleForFree false
20 schema:isPartOf Nddc0c5614f1849e7b41e16d81d33f3ab
21 Nf2430930dbc64174a27d62d9aac6bab6
22 sg:journal.1048269
23 schema:name Overflow and losses in a network queue with a self-similar input
24 schema:pagination 201-235
25 schema:productId N6bcd64dc3392414cb6968f0e2bb88865
26 Nbdb41365abdf4c798f236de43b5fd7be
27 Ncf33015194b54b5693c0f733b2b969fd
28 schema:sameAs https://app.dimensions.ai/details/publication/pub.1045148109
29 https://doi.org/10.1023/a:1019150312811
30 schema:sdDatePublished 2019-04-10T18:25
31 schema:sdLicense https://scigraph.springernature.com/explorer/license/
32 schema:sdPublisher Nfc821dd22bc04da4b1a5932ffdacb528
33 schema:url http://link.springer.com/10.1023%2FA%3A1019150312811
34 sgo:license sg:explorer/license/
35 sgo:sdDataset articles
36 rdf:type schema:ScholarlyArticle
37 N20ddd00da62147f4b926642f118aef9f rdf:first sg:person.07532451723.73
38 rdf:rest N24811d896cae43ee92addb8f730799d9
39 N24811d896cae43ee92addb8f730799d9 rdf:first sg:person.0671247226.24
40 rdf:rest rdf:nil
41 N6bcd64dc3392414cb6968f0e2bb88865 schema:name readcube_id
42 schema:value d70e4bdb0013979fa450c54c901e22bafc675ee717c9044f45199615b09d4374
43 rdf:type schema:PropertyValue
44 Nbdb41365abdf4c798f236de43b5fd7be schema:name doi
45 schema:value 10.1023/a:1019150312811
46 rdf:type schema:PropertyValue
47 Ncf33015194b54b5693c0f733b2b969fd schema:name dimensions_id
48 schema:value pub.1045148109
49 rdf:type schema:PropertyValue
50 Nddc0c5614f1849e7b41e16d81d33f3ab schema:volumeNumber 35
51 rdf:type schema:PublicationVolume
52 Nf2430930dbc64174a27d62d9aac6bab6 schema:issueNumber 1-4
53 rdf:type schema:PublicationIssue
54 Nfc821dd22bc04da4b1a5932ffdacb528 schema:name Springer Nature - SN SciGraph project
55 rdf:type schema:Organization
56 anzsrc-for:10 schema:inDefinedTermSet anzsrc-for:
57 schema:name Technology
58 rdf:type schema:DefinedTerm
59 anzsrc-for:1005 schema:inDefinedTermSet anzsrc-for:
60 schema:name Communications Technologies
61 rdf:type schema:DefinedTerm
62 sg:journal.1048269 schema:issn 0257-0130
63 1572-9443
64 schema:name Queueing 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 Nicolas D.
69 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.0671247226.24
70 rdf:type schema:Person
71 sg:person.07532451723.73 schema:affiliation https://www.grid.ac/institutes/grid.430388.4
72 schema:familyName Tsybakov
73 schema:givenName Boris
74 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.07532451723.73
75 rdf:type schema:Person
76 sg:pub.10.1023/a:1019143221956 schema:sameAs https://app.dimensions.ai/details/publication/pub.1049350833
77 https://doi.org/10.1023/a:1019143221956
78 rdf:type schema:CreativeWork
79 https://doi.org/10.1016/0169-7552(94)00006-f schema:sameAs https://app.dimensions.ai/details/publication/pub.1020857916
80 rdf:type schema:CreativeWork
81 https://doi.org/10.1016/s0166-5316(97)00016-3 schema:sameAs https://app.dimensions.ai/details/publication/pub.1008190068
82 rdf:type schema:CreativeWork
83 https://doi.org/10.1017/s0305004100073709 schema:sameAs https://app.dimensions.ai/details/publication/pub.1053749183
84 rdf:type schema:CreativeWork
85 https://doi.org/10.1098/rspa.1955.0198 schema:sameAs https://app.dimensions.ai/details/publication/pub.1048554076
86 rdf:type schema:CreativeWork
87 https://doi.org/10.1109/18.705538 schema:sameAs https://app.dimensions.ai/details/publication/pub.1061100729
88 rdf:type schema:CreativeWork
89 https://doi.org/10.1109/90.282603 schema:sameAs https://app.dimensions.ai/details/publication/pub.1061247074
90 rdf:type schema:CreativeWork
91 https://doi.org/10.1109/90.611104 schema:sameAs https://app.dimensions.ai/details/publication/pub.1061247321
92 rdf:type schema:CreativeWork
93 https://doi.org/10.1109/90.650143 schema:sameAs https://app.dimensions.ai/details/publication/pub.1061247355
94 rdf:type schema:CreativeWork
95 https://doi.org/10.1109/icc.1997.609995 schema:sameAs https://app.dimensions.ai/details/publication/pub.1093221550
96 rdf:type schema:CreativeWork
97 https://www.grid.ac/institutes/grid.28046.38 schema:alternateName University of Ottawa
98 schema:name Multimedia Communications Research Laboratory (MCRLab), School of Info. Tech. & Engin. (SITE), University of Ottawa, K1N 6N5, Ottawa, Ontario, Canada
99 rdf:type schema:Organization
100 https://www.grid.ac/institutes/grid.430388.4 schema:alternateName Qualcomm (United States)
101 schema:name QUALCOMM Inc., 5775 Morehouse Drive, 92121-1714, San Diego, CA, USA
102 rdf:type schema:Organization
 




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


...