Services & Resources / Wolfram Forums
-----
 /
MathGroup Archive
2005
*January
*February
*March
*April
*May
*June
*July
*August
*September
*October
*November
*December
*Archive Index
*Ask about this page
*Print this page
*Give us feedback
*Sign up for the Wolfram Insider

MathGroup Archive 2005

[Date Index] [Thread Index] [Author Index]

Search the Archive

Re: 3-state markov process

  • To: mathgroup at smc.vnet.net
  • Subject: [mg62692] Re: [mg62646] 3-state markov process
  • From: <bsyehuda at gmail.com>
  • Date: Wed, 30 Nov 2005 22:09:17 -0500 (EST)
  • References: <200511300506.AAA00092@smc.vnet.net>
  • Sender: owner-wri-mathgroup at wolfram.com

Monica,
You probably mean MMPP (Markov Modulated Poisson Process) or IPP
(Interrupted Poisson Process), which are well known models for traffic
sources for communication networks.
However, do not expect too much on the side of closed form analytic
solutions for the queue behavior of the router under discussion.
In these cases of bursty sources, simulations will be a more reasonable
solution.

There are many references on the WEB. However, this is certainly not a
Mathematica Issue, as your question was phrased
I hope this is of help for you
yehuda


On 11/30/05, Monica <leungmonica at yahoo.com> wrote:
>
> Can anyone explain the 3-state markov process?
> I am working on a 3-state markov process for traffic source, with known
> rate and parameters for each state?
> The arrival process is Poisson with known rate.
> I need to determine the bandwidth capacity of the router so as to
> provide stochastic performance guarantees on the router
> Anyone got good web site?
>
> Thanks :)
>
>
>



  • Prev by Date: Visualization site updates
  • Next by Date: Re: Problem with RSolve
  • Previous by thread: Visualization site updates
  • Next by thread: Re: references to numbered equations in arXiv style sheet