✦ LIBER ✦

A comparison of hashing schemes for address lookup in computer networks

✍ Scribed by Jain, R.

Book ID: 117860668
Publisher: IEEE
Year: 1992
Tongue: English
Weight: 332 KB
Volume: 40
Category: Article
ISSN: 0090-6778
DOI: 10.1109/26.168785

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Characteristics of destination address l

Characteristics of destination address locality in computer networks: A comparison of caching schemes

✍ Raj Jain 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 960 KB

A comparison of duplicate and triplicate

A comparison of duplicate and triplicate redundancy schemes for binary logical networks

✍ J.C. Cluley 📂 Article 📅 1964 🏛 Elsevier Science 🌐 English ⚖ 753 KB

A comparison of two mutual-exclusion alg

A comparison of two mutual-exclusion algorithms for computer networks

✍ Alain Dupuis; Gérard Hebuterne; Jean-Marc Pitie 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 813 KB

A Comparison of Adaptive Location Tracki

A Comparison of Adaptive Location Tracking Schemes in Personal Communications Networks

✍ A. Lombardo; S. Palazzo; G. Schembra 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 190 KB

A scheme for providing security services

A scheme for providing security services in ISO-OSI computer network architecture

✍ Raju Ramaswamy 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 547 KB

A gradient-based binary feedback scheme

A gradient-based binary feedback scheme for congestion control in computer networks

✍ James Aweya; Delfin Y. Montuno; Qi-jun Zhang; Luis Orozco-Barbosa 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 296 KB 👁 2 views

In this paper, we propose a binary feedback scheme for congestion control in computer networks using a gradient-based mechanism which employs neural network modelling of the system dynamics. The optimal direction for rate adjustment at the source is based on a single bit feedback signal which depend