Recursive solution of a class of non-product form protocol models

Thomas G. Robertazzi

doi:10.1109/INFCOM.1989.101431

Recursive solution of a class of non-product form protocol models

Thomas G. Robertazzi

Electrical Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

7 Scopus citations

Abstract

Two classes of non-product form protocol models where the equilibrium probabilities of state may be computed recursively are described. An algorithm is presented for the computer generation of the these recursions. The use of the algorithm is described for manufacturing nets, a class of Petri type networks. These are useful for modeling a linear process where one must wait for components to arrive before one can move to the next step of the process. Aside from the manufacturing context, these are useful for modeling certain communication processes such as multihop radio transmission and layered architecture communication.

Original language	English
Title of host publication	IEEE INFOCOM'89, Proceedings of the 8th Annual Joint Conference of the IEEE Computer and Communications Societies
Pages	38-46
Number of pages	9
DOIs	https://doi.org/10.1109/INFCOM.1989.101431
State	Published - 1989
Event	8th Annual Joint Conference of the IEEE Computer and Communications Societies, INFOCOM'89 - Ottawa, ON, Canada Duration: Apr 23 1989 → Apr 27 1989

Publication series

Name	Proceedings - IEEE INFOCOM
ISSN (Print)	0743-166X

Conference

Conference	8th Annual Joint Conference of the IEEE Computer and Communications Societies, INFOCOM'89
Country/Territory	Canada
City	Ottawa, ON
Period	04/23/89 → 04/27/89

Access to Document

10.1109/INFCOM.1989.101431

Cite this

@inproceedings{8d7075c6a32b4de99093b1cf0aee0686,

title = "Recursive solution of a class of non-product form protocol models",

abstract = "Two classes of non-product form protocol models where the equilibrium probabilities of state may be computed recursively are described. An algorithm is presented for the computer generation of the these recursions. The use of the algorithm is described for manufacturing nets, a class of Petri type networks. These are useful for modeling a linear process where one must wait for components to arrive before one can move to the next step of the process. Aside from the manufacturing context, these are useful for modeling certain communication processes such as multihop radio transmission and layered architecture communication.",

author = "Robertazzi, \{Thomas G.\}",

year = "1989",

doi = "10.1109/INFCOM.1989.101431",

language = "English",

isbn = "0818619201",

series = "Proceedings - IEEE INFOCOM",

pages = "38--46",

booktitle = "IEEE INFOCOM'89, Proceedings of the 8th Annual Joint Conference of the IEEE Computer and Communications Societies",

note = "8th Annual Joint Conference of the IEEE Computer and Communications Societies, INFOCOM'89 ; Conference date: 23-04-1989 Through 27-04-1989",

}

Robertazzi, TG 1989, Recursive solution of a class of non-product form protocol models. in IEEE INFOCOM'89, Proceedings of the 8th Annual Joint Conference of the IEEE Computer and Communications Societies., 101431, Proceedings - IEEE INFOCOM, pp. 38-46, 8th Annual Joint Conference of the IEEE Computer and Communications Societies, INFOCOM'89, Ottawa, ON, Canada, 04/23/89. https://doi.org/10.1109/INFCOM.1989.101431

TY - GEN

T1 - Recursive solution of a class of non-product form protocol models

AU - Robertazzi, Thomas G.

PY - 1989

Y1 - 1989

N2 - Two classes of non-product form protocol models where the equilibrium probabilities of state may be computed recursively are described. An algorithm is presented for the computer generation of the these recursions. The use of the algorithm is described for manufacturing nets, a class of Petri type networks. These are useful for modeling a linear process where one must wait for components to arrive before one can move to the next step of the process. Aside from the manufacturing context, these are useful for modeling certain communication processes such as multihop radio transmission and layered architecture communication.

AB - Two classes of non-product form protocol models where the equilibrium probabilities of state may be computed recursively are described. An algorithm is presented for the computer generation of the these recursions. The use of the algorithm is described for manufacturing nets, a class of Petri type networks. These are useful for modeling a linear process where one must wait for components to arrive before one can move to the next step of the process. Aside from the manufacturing context, these are useful for modeling certain communication processes such as multihop radio transmission and layered architecture communication.

UR - https://www.scopus.com/pages/publications/0024648165

U2 - 10.1109/INFCOM.1989.101431

DO - 10.1109/INFCOM.1989.101431

M3 - Conference contribution

AN - SCOPUS:0024648165

SN - 0818619201

SN - 9780818619205

T3 - Proceedings - IEEE INFOCOM

SP - 38

EP - 46

BT - IEEE INFOCOM'89, Proceedings of the 8th Annual Joint Conference of the IEEE Computer and Communications Societies

T2 - 8th Annual Joint Conference of the IEEE Computer and Communications Societies, INFOCOM'89

Y2 - 23 April 1989 through 27 April 1989

ER -

Recursive solution of a class of non-product form protocol models

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this