Contact
How to shop
Delivery
Shopping guide
Markov Chain Models for Stochastic Shortest Path Problem
English
82 b
Delivery to Austria
Up to 30 days for returns
Customers also purchased
/
Hardback
9.79
€
/
Calendar
56.39
€
/
Paperback
6.49
€
/
Paperback
15.09
€
The Markov stochastic process is used to model lots of optimization problems, especially in the network optimization problems. In the routing optimization problems there could be either continuous or discrete parameters in the networks. Suppose the length of an arc is defined as the time that takes to transmit flow between the pair linked nodes of the arc; then, in this situation the cost parameters of the network are continuous variables and it may be modeled by a continuous time Markov chain (CTMC) stochastic process. In other situation consider the topology of the network that shows the location of the nodes and their related linked arcs; so, a connecting path from a given source node to a given destination node may be modeled by a discrete time Markov chain (DTMC) stochastic process. Then, some stochastic routing models in the networks with an established Markov stochastic process are discussed. So, a new criterion will be presented for the probabilistic evaluation of the message transmission between two given nodes by time T, which is applicable for large size networks. Then, a genetic algorithm is performed to find the best established connection.
About the book
English
Categories
Give this book today
It's easy
1 Add to cart and choose Deliver as present at the checkout 2 We'll send you a voucher 3 The book will arrive at the recipient's addressYou might also be interested in
/
Paperback
17.19
€
/
Paperback
83.09
€
/
Paperback
17.95
€
/
Paperback
18.59
€
Hi! I'm Libroamiko, your book advisor.
How can I help you?