Optimal Routing in Gossip Networks
โ Scribed by Shavitt, Y.; Shay, A.
- Book ID
- 114671893
- Publisher
- IEEE
- Year
- 2005
- Tongue
- English
- Weight
- 448 KB
- Volume
- 54
- Category
- Article
- ISSN
- 0018-9545
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Given integers n โฅ 7 and a, b, c with 1 โค a, b, c โค n -1 such that a, na, b, nb, c, nc are pairwise distinct, the (undirected) triple-loop network TL n (a, b, c) is the degree-six graph with vertices 0, 1, 2, . . . , n -1 such that each vertex x is adjacent to x ยฑ a, x ยฑ b, and x ยฑ c, where the oper
Markov decision theory is applied to general Markov queueing networks with finite buffer capacity. Existence of optimal dynamic routing policies is proved for the long-run average and infinite-horizon discounted cases. With the aid of a process that is equivalent to the state process, the subordinat