✦ LIBER ✦

On the Performance of Randomized Embedding of Reproduction Trees in Static Networks

✍ Scribed by Keqin Li

Book ID: 111568738
Publisher: Springer
Year: 2003
Tongue: English
Weight: 327 KB
Volume: 31
Category: Article
ISSN: 1573-7640
DOI: 10.1023/a:1027336712552

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Design and analysis of asymptotically op

Design and analysis of asymptotically optimal randomized tree embedding algorithms in static networks

✍ Keqin Li 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 230 KB

Performance evaluation of a random-walk-

Performance evaluation of a random-walk-based algorithm for embedding dynamically evolving trees in hypercubic networks

✍ Keqin Li 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 250 KB 👁 1 views

On the choice of a spanning tree for gre

On the choice of a spanning tree for greedy embedding of network graphs

✍ Andrej Cvetkovski, Mark Crovella 📂 Article 📅 2013 🏛 Springer-Verlag ⚖ 905 KB

Performance of Random Error Correcting C

Performance of Random Error Correcting Codes on the Switched Telephone Network

✍ Franco, A.; Saporta, L. 📂 Article 📅 1967 🏛 Institute of Electrical and Electronics Engineers 🌐 English ⚖ 453 KB

Calculating the flow level performance o

Calculating the flow level performance of balanced fairness in tree networks

✍ T. Bonald; J. Virtamo 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 319 KB

On the construction of maximum residual

On the construction of maximum residual energy resource broadcast trees with minimum diameter in static ad hoc wireless networks

✍ Chor Ping Low; Lai Woen Goh 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 186 KB 👁 1 views

Each node in a wireless ad hoc network runs on a local energy source that has a limited energy life span. Thus, energy conservation is a critical issue in such networks. In addition, it is in general desirable to construct routes with low hop counts as a route with a high hop count is more likely to