Efficient information dissemination in computer networks

Ambarish Malpani, Divyakant Agrawal

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

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 log information must be accompanied with temporal information, i.e., the state of the site sending the message when the message is sent. The authors eliminate the need for sending the log and temporal components together. They demonstrate that the separation of these two components leads to a more efficient and flexible solution of the log propagation problem. Also, the solution is more scalable, which makes it more suitable for large and geographically dispersed networks.

Original languageEnglish
Title of host publicationUnknown Host Publication Title
Editors Anon
Place of PublicationPiscataway, NJ, United States
PublisherPubl by IEEE
Pages202-211
Number of pages10
ISBN (Print)0818619686
Publication statusPublished - 1 Dec 1989
Externally publishedYes
Event14th Conference on Local Computer Networks - Minneapolis, MN, USA
Duration: 10 Oct 198912 Oct 1989

Other

Other14th Conference on Local Computer Networks
CityMinneapolis, MN, USA
Period10/10/8912/10/89

Fingerprint

Information dissemination
Computer networks

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Malpani, A., & Agrawal, D. (1989). Efficient information dissemination in computer networks. In Anon (Ed.), Unknown Host Publication Title (pp. 202-211). Piscataway, NJ, United States: Publ by IEEE.

Efficient information dissemination in computer networks. / Malpani, Ambarish; Agrawal, Divyakant.

Unknown Host Publication Title. ed. / Anon. Piscataway, NJ, United States : Publ by IEEE, 1989. p. 202-211.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Malpani, A & Agrawal, D 1989, Efficient information dissemination in computer networks. in Anon (ed.), Unknown Host Publication Title. Publ by IEEE, Piscataway, NJ, United States, pp. 202-211, 14th Conference on Local Computer Networks, Minneapolis, MN, USA, 10/10/89.
Malpani A, Agrawal D. Efficient information dissemination in computer networks. In Anon, editor, Unknown Host Publication Title. Piscataway, NJ, United States: Publ by IEEE. 1989. p. 202-211
Malpani, Ambarish ; Agrawal, Divyakant. / Efficient information dissemination in computer networks. Unknown Host Publication Title. editor / Anon. Piscataway, NJ, United States : Publ by IEEE, 1989. pp. 202-211
@inproceedings{01150b7a0a374ee180ece9919d4f69b2,
title = "Efficient information dissemination in computer networks",
abstract = "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 log information must be accompanied with temporal information, i.e., the state of the site sending the message when the message is sent. The authors eliminate the need for sending the log and temporal components together. They demonstrate that the separation of these two components leads to a more efficient and flexible solution of the log propagation problem. Also, the solution is more scalable, which makes it more suitable for large and geographically dispersed networks.",
author = "Ambarish Malpani and Divyakant Agrawal",
year = "1989",
month = "12",
day = "1",
language = "English",
isbn = "0818619686",
pages = "202--211",
editor = "Anon",
booktitle = "Unknown Host Publication Title",
publisher = "Publ by IEEE",

}

TY - GEN

T1 - Efficient information dissemination in computer networks

AU - Malpani, Ambarish

AU - Agrawal, Divyakant

PY - 1989/12/1

Y1 - 1989/12/1

N2 - 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 log information must be accompanied with temporal information, i.e., the state of the site sending the message when the message is sent. The authors eliminate the need for sending the log and temporal components together. They demonstrate that the separation of these two components leads to a more efficient and flexible solution of the log propagation problem. Also, the solution is more scalable, which makes it more suitable for large and geographically dispersed networks.

AB - 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 log information must be accompanied with temporal information, i.e., the state of the site sending the message when the message is sent. The authors eliminate the need for sending the log and temporal components together. They demonstrate that the separation of these two components leads to a more efficient and flexible solution of the log propagation problem. Also, the solution is more scalable, which makes it more suitable for large and geographically dispersed networks.

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

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

M3 - Conference contribution

SN - 0818619686

SP - 202

EP - 211

BT - Unknown Host Publication Title

A2 - Anon, null

PB - Publ by IEEE

CY - Piscataway, NJ, United States

ER -