Buzen's algorithm: Difference between revisions

Revision as of 20:24, 17 March 2006

Revision as of 01:58, 19 March 2006

Line 1:

Buzen's algorithm is an algorithm related to [[queueing theory]] used to calculate the [[normalization constant]] <math>G(N)</math> for a [[closed jackson network]]. (Is this true?)

First proposed by [[Jeffery P. Buzen]] in 1973.{{<ref| name="buzen-1973}}">{{cite journal

| first = Jeffrey

| last = Buzen

| authorlink = Jeffrey P. Buzen

| year = 1973

| month = September

| title = Computational algorithms for closed queueing networks with exponential servers

| journal = Communications of the ACM

| volume = 16

| issue = 9

}} (Confirm? Expand?)</ref>

It can be used when <math>G(N)</math> is of the form:

Line 16 ⟶ 26:

==References==

<references/>

<div style="font-size: 90%">

{{note|buzen-1973}}

{{cite journal

| first = Jeffrey

| last = Buzen

| authorlink = Jeffrey P. Buzen

| year = 1973

| month = September

| title = Computational algorithms for closed queueing networks with exponential servers

| journal = Communications of the ACM

| volume = 16

| issue = 9

}} (Confirm? Expand?)

</div>