{
  "id": "1212.1521",
  "version": "v1",
  "published": "2012-12-07T02:28:17.000Z",
  "updated": "2012-12-07T02:28:17.000Z",
  "title": "Bounds on mean cycle time in acyclic fork-join queueing networks",
  "authors": [
    "Nikolai K. Krivulin"
  ],
  "comment": "The 4th International Workshop on Discrete Event Systems (WODES'98), University of Cagliary, Cagliari, Sardinia, Italy, August 26-28, 1998",
  "journal": "Proc. 4th Intern. Workshop on Discrete Event Systems (WODES'98), IEE, London, 1998, pp. 469-474",
  "categories": [
    "math.OC",
    "cs.SY"
  ],
  "abstract": "Simple lower and upper bounds on mean cycle time in stochastic acyclic fork-join networks are derived using the $(\\max,+)$-algebra approach. The behaviour of the bounds under various assumptions concerning the service times in the networks is discussed, and related numerical examples are presented.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2012-12-07T02:28:17.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "68M20",
      "15A80",
      "93C65",
      "90B15",
      "68U20"
    ],
    "keywords": [
      "mean cycle time",
      "acyclic fork-join queueing networks",
      "stochastic acyclic fork-join networks",
      "upper bounds",
      "simple lower"
    ],
    "tags": [
      "journal article"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2012arXiv1212.1521K"
    }
  }
}