Converting FSMs to Queueing networks

Thread View: comp.protocols.misc

1 messages

[T] Back to Threads [V] Tree View [G] Group Articles

1 total messages Started by Graham Wheeler Thu, 25 Oct 1990 08:43

#329

Author: Graham Wheeler
Date: Thu, 25 Oct 1990 08:43

17 lines
1329 bytes

I am interested in the problem of converting extended finite state machines
into (open or closed) multiclass queueing networks (hopefully having
product form solutions). I want to implement a program to do this, so I
need an algorithmic method rather than ad hoc rules, although the latter
would also be helpful.

I haven't thought about this *too* much yet (I'm about to), so I'm not
sure whether it is intractable or fairly trivial. I guess it's somewhere
in-between. Does anyone have any good references/ideas/etc?

Please E-mail responses and I will summarise. Thanks.


Graham Wheeler		      |	"Don't bother me,
Data Network Architectures Lab|		I'm reading a `Crisis'!"
Dept. of Computer Science     | Internet: <gram.uctcs@f4.n494.z5.fidonet.org>
University of Cape Town       |     BANG: <...uunet!ddsw1!olsa99!uctcs!gram>

Thread Navigation

This is a paginated view of messages in the thread with full content displayed inline.

Messages are displayed in chronological order, with the original post highlighted in green.

Use pagination controls to navigate through all messages in large threads.

Back to All Threads