Algorithm for queueing networks with multi-rate traffic

Publication: Research - peer-reviewArticle in proceedings – Annual report year: 2011

Standard

Algorithm for queueing networks with multi-rate traffic. / Iversen, Villy Bæk; King-Tim, Ko.

Conference Proceedings of First European Teletraffic Seminar. 2011.

Publication: Research - peer-reviewArticle in proceedings – Annual report year: 2011

Harvard

Iversen, VB & King-Tim, K 2011, 'Algorithm for queueing networks with multi-rate traffic'. in Conference Proceedings of First European Teletraffic Seminar.

APA

Iversen, V. B., & King-Tim, K. (2011). Algorithm for queueing networks with multi-rate traffic. In Conference Proceedings of First European Teletraffic Seminar.

CBE

Iversen VB, King-Tim K. 2011. Algorithm for queueing networks with multi-rate traffic. In Conference Proceedings of First European Teletraffic Seminar.

MLA

Iversen, Villy Bæk and Ko King-Tim "Algorithm for queueing networks with multi-rate traffic". Conference Proceedings of First European Teletraffic Seminar. 2011.

Vancouver

Iversen VB, King-Tim K. Algorithm for queueing networks with multi-rate traffic. In Conference Proceedings of First European Teletraffic Seminar. 2011.

Author

Iversen, Villy Bæk; King-Tim, Ko / Algorithm for queueing networks with multi-rate traffic.

Conference Proceedings of First European Teletraffic Seminar. 2011.

Publication: Research - peer-reviewArticle in proceedings – Annual report year: 2011

Bibtex

@inbook{80d84cdfd0054ec0aac00e903998f6c2,
title = "Algorithm for queueing networks with multi-rate traffic",
author = "Iversen, {Villy Bæk} and Ko King-Tim",
year = "2011",
isbn = "978-83-925375-5-7",
booktitle = "Conference Proceedings of First European Teletraffic Seminar",

}

RIS

TY - GEN

T1 - Algorithm for queueing networks with multi-rate traffic

AU - Iversen,Villy Bæk

AU - King-Tim,Ko

PY - 2011

Y1 - 2011

N2 - In this paper we present a new algorithm for evaluating queueing networks with multi-rate traffic. The detailed state space of a node is evaluated by explicit formulæ. We consider reversible nodes with multi-rate traffic and find the state probabilities by taking advantage of local balance. Theory of queueing networks in general presumes that we have product form between the nodes. Other ways we have the state space explosion. Even so the detailed state space of each node may easily become very large because there is no product form between chains inside a node. A prerequisite for product form is reversibility which implies that the arrival process and departure process are identical processes, for example state-dependent Poisson processes. This property is equivalent to reversibility. Due to product form, an open network with multi-rate traffic is easy to evaluate by convolution algorithms because the nodes behave as independent nodes. For closed queueing networks with multiple servers in every node and multi-rate services we may apply multidimensional convolutions to aggregate the nodes so that we end up with two nodes, the aggregated node and a single node, for which we can calculate the detailed performance measures.

AB - In this paper we present a new algorithm for evaluating queueing networks with multi-rate traffic. The detailed state space of a node is evaluated by explicit formulæ. We consider reversible nodes with multi-rate traffic and find the state probabilities by taking advantage of local balance. Theory of queueing networks in general presumes that we have product form between the nodes. Other ways we have the state space explosion. Even so the detailed state space of each node may easily become very large because there is no product form between chains inside a node. A prerequisite for product form is reversibility which implies that the arrival process and departure process are identical processes, for example state-dependent Poisson processes. This property is equivalent to reversibility. Due to product form, an open network with multi-rate traffic is easy to evaluate by convolution algorithms because the nodes behave as independent nodes. For closed queueing networks with multiple servers in every node and multi-rate services we may apply multidimensional convolutions to aggregate the nodes so that we end up with two nodes, the aggregated node and a single node, for which we can calculate the detailed performance measures.

M3 - Article in proceedings

SN - 978-83-925375-5-7

BT - Conference Proceedings of First European Teletraffic Seminar

T2 - Conference Proceedings of First European Teletraffic Seminar

ER -