✦ LIBER ✦

A priority-based resource allocation strategy in distributed computing networks

✍ Scribed by Yin-Fu Huang; Bo-Wei Chao

Book ID: 108407909
Publisher: Elsevier Science
Year: 2001
Tongue: English
Weight: 335 KB
Volume: 58
Category: Article
ISSN: 0164-1212
DOI: 10.1016/s0164-1212(01)00040-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Development and Comparison Between Resou

Development and Comparison Between Resource Allocation Strategies Based on Intelligent Scheme and Traditional Distributed Dynamic Resource Allocation Strategies in Mobile Communication Networks

✍ Jamal Raiyn 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 323 KB

Automatic resource allocation in a distr

Automatic resource allocation in a distributed camera network

✍ Deepak R. Karuppiah; Roderic A. Grupen; Zhigang Zhu; Allen R. Hanson 📂 Article 📅 2009 🏛 Springer-Verlag 🌐 English ⚖ 739 KB

Resource allocation in computer networks

Resource allocation in computer networks by a regional accessibility model

✍ John J. Dinkel; G.A. Kochenberger; Y. Seppälä 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 718 KB

On formulation of a reliable cost alloca

On formulation of a reliable cost allocation strategy in centralized computer networks

✍ Inder M Soi; K.K Aggarwal 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 405 KB

A dynamic bandwidth resource allocation

A dynamic bandwidth resource allocation based on neural networks in euroskyway multimedia satellite system

✍ P. Camarda; M. Castellano; G. Piscitelli; D. Striccoli; G. Tomasicchio 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 474 KB 👁 1 views

Updating routing tables after resource f

Updating routing tables after resource failure in a distributed computer network

✍ Marjory J. Johnson 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 726 KB

## Abstract This paper is an analysis of overhead required by the MERIT routing table update algorithm after failure of a single network resource. The number of update messages sent by each node during the update process is used as the measure of update overhead. Both synchronous behavior and async