Efficient dissemination of information in computer networks

D. Agrawal, A. Malpani

Research output: Contribution to journalArticle

9 Citations (Scopus)

Abstract

Many distributed applications require that information be propagated in the system efficiently. Propagation of information, as soon as it becomes known, via direct messages, is prohibitively expensive even in relatively small networks. Fortunately, in many applications, one can use lazy propagation of information, where each site eventually obtains all the information in the network. A common method for spreading information is by exchanging information logs amongst sites in the network. Several mechanisms for log propagation have already been proposed. All these mechanisms require that information log must be accompanied with temporal information, which is the state of the site sending the message, when the message is sent. In this paper, we eliminate the need for sending the log and temporal components together. We demonstrate that the separation of these two components leads to a more efficient and flexible solution of the log propagation problem. Also, our solution is more scalable, which makes it more suitable for large and geographically dispersed networks.

Original languageEnglish
Pages (from-to)534-541
Number of pages8
JournalComputer Journal
Volume34
Issue number6
Publication statusPublished - 1 Dec 1991
Externally publishedYes

Fingerprint

Information Dissemination
Computer Networks
Computer networks
Information Services
Propagation
Distributed Applications
Eliminate

ASJC Scopus subject areas

  • Computer Graphics and Computer-Aided Design
  • Hardware and Architecture
  • Information Systems
  • Software
  • Molecular Biology
  • Statistics and Probability
  • Computational Mathematics
  • Development
  • Management, Monitoring, Policy and Law
  • Demography
  • Computer Science(all)

Cite this

Agrawal, D., & Malpani, A. (1991). Efficient dissemination of information in computer networks. Computer Journal, 34(6), 534-541.

Efficient dissemination of information in computer networks. / Agrawal, D.; Malpani, A.

In: Computer Journal, Vol. 34, No. 6, 01.12.1991, p. 534-541.

Research output: Contribution to journalArticle

Agrawal, D & Malpani, A 1991, 'Efficient dissemination of information in computer networks', Computer Journal, vol. 34, no. 6, pp. 534-541.
Agrawal D, Malpani A. Efficient dissemination of information in computer networks. Computer Journal. 1991 Dec 1;34(6):534-541.
Agrawal, D. ; Malpani, A. / Efficient dissemination of information in computer networks. In: Computer Journal. 1991 ; Vol. 34, No. 6. pp. 534-541.
@article{816ce756338f45a99478f63ca941c733,
title = "Efficient dissemination of information in computer networks",
abstract = "Many distributed applications require that information be propagated in the system efficiently. Propagation of information, as soon as it becomes known, via direct messages, is prohibitively expensive even in relatively small networks. Fortunately, in many applications, one can use lazy propagation of information, where each site eventually obtains all the information in the network. A common method for spreading information is by exchanging information logs amongst sites in the network. Several mechanisms for log propagation have already been proposed. All these mechanisms require that information log must be accompanied with temporal information, which is the state of the site sending the message, when the message is sent. In this paper, we eliminate the need for sending the log and temporal components together. We demonstrate that the separation of these two components leads to a more efficient and flexible solution of the log propagation problem. Also, our solution is more scalable, which makes it more suitable for large and geographically dispersed networks.",
author = "D. Agrawal and A. Malpani",
year = "1991",
month = "12",
day = "1",
language = "English",
volume = "34",
pages = "534--541",
journal = "Computer Journal",
issn = "0010-4620",
publisher = "Oxford University Press",
number = "6",

}

TY - JOUR

T1 - Efficient dissemination of information in computer networks

AU - Agrawal, D.

AU - Malpani, A.

PY - 1991/12/1

Y1 - 1991/12/1

N2 - Many distributed applications require that information be propagated in the system efficiently. Propagation of information, as soon as it becomes known, via direct messages, is prohibitively expensive even in relatively small networks. Fortunately, in many applications, one can use lazy propagation of information, where each site eventually obtains all the information in the network. A common method for spreading information is by exchanging information logs amongst sites in the network. Several mechanisms for log propagation have already been proposed. All these mechanisms require that information log must be accompanied with temporal information, which is the state of the site sending the message, when the message is sent. In this paper, we eliminate the need for sending the log and temporal components together. We demonstrate that the separation of these two components leads to a more efficient and flexible solution of the log propagation problem. Also, our solution is more scalable, which makes it more suitable for large and geographically dispersed networks.

AB - Many distributed applications require that information be propagated in the system efficiently. Propagation of information, as soon as it becomes known, via direct messages, is prohibitively expensive even in relatively small networks. Fortunately, in many applications, one can use lazy propagation of information, where each site eventually obtains all the information in the network. A common method for spreading information is by exchanging information logs amongst sites in the network. Several mechanisms for log propagation have already been proposed. All these mechanisms require that information log must be accompanied with temporal information, which is the state of the site sending the message, when the message is sent. In this paper, we eliminate the need for sending the log and temporal components together. We demonstrate that the separation of these two components leads to a more efficient and flexible solution of the log propagation problem. Also, our solution is more scalable, which makes it more suitable for large and geographically dispersed networks.

UR - http://www.scopus.com/inward/record.url?scp=0026375914&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0026375914&partnerID=8YFLogxK

M3 - Article

VL - 34

SP - 534

EP - 541

JO - Computer Journal

JF - Computer Journal

SN - 0010-4620

IS - 6

ER -