An algebraic approach in modelling and simulation of queueing networks

Research outputpeer-review

Abstract

A class of queueing networks which consist of single-server fork-join nodes with both infinite and finite buffers is examined to derive a representation of the network dynamics in terms of max-plus algebra. For the networks, we present a common dynamic state equation which relates the departure epochs of customers from the network nodes in an explicit vector form determined by a state transition matrix, and give related examples. Finally, applications of the representation to the analysis and simulation of queueing networks are briefly discussed.
Original languageEnglish
Title of host publicationProceedings of the Circuits, Systems and Computers'96: International Conference, July 15-17, 1996, Hellenic Naval Academy, Piraeus, Greece
EditorsNikos E. Mastorakis
Pages668-672
Publication statusPublished - 1996

Scopus subject areas

  • Modelling and Simulation
  • Management Science and Operations Research
  • Algebra and Number Theory

Fingerprint Dive into the research topics of 'An algebraic approach in modelling and simulation of queueing networks'. Together they form a unique fingerprint.

Cite this