๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

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


Optimal routing in toroidal networks
โœ Izidor Jerebic; Roman Trobec ๐Ÿ“‚ Article ๐Ÿ“… 1992 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 582 KB
Gossiping and routing in undirected trip
โœ Alison Thomson; Sanming Zhou ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 194 KB

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

Optimal routing in shortest-path data ne
โœ K. G. Ramakrishnan; Manoel A. Rodrigues ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Institute of Electrical and Electronics Engineers ๐ŸŒ English โš– 249 KB ๐Ÿ‘ 1 views
Optimal dynamic routing in Markov queuei
โœ Keith W. Ross ๐Ÿ“‚ Article ๐Ÿ“… 1986 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 369 KB

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