Automatic update of replicated topology data bases

Jeffrey M. Jaffe; Adrian Segall

doi:10.1145/800056.802071

Automatic update of replicated topology data bases

Jeffrey M. Jaffe, Adrian Segall

IBM

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

In computer communication networks, routing is often accomplished by maintaining copies of the network topology and dynamic performance characteristics in various network nodes. The present paper describes an algorithm that allows complete flexibility in the placement of the topology information. In particular, we assume that an arbitrary subset of network nodes are capable of maintaining the topology. In this environment, protocols are defined to allow automatic updates to flow between these more capable nodes. In addition, protocols are defined to allow less capable nodes to report their topology data to the major nodes, and acquire route information from them.

Original language	English
Title of host publication	Proceedings of the ACM SIGCOMM Symposium on Communications Architectures and Protocols
Subtitle of host publication	Tutorials and Symposium, SIGCOMM 1984
Publisher	Association for Computing Machinery, Inc
Pages	142-148
Number of pages	7
ISBN (Electronic)	0897911369, 9780897911368
DOIs	https://doi.org/10.1145/800056.802071
State	Published - 6 Jun 1984
Externally published	Yes
Event	1984 ACM SIGCOMM Symposium on Communications Architectures and Protocols, SIGCOMM 1984 - Montreal, Canada Duration: 6 Jun 1984 → 8 Jun 1984

Publication series

Name	Proceedings of the ACM SIGCOMM Symposium on Communications Architectures and Protocols: Tutorials and Symposium, SIGCOMM 1984

Conference

Conference	1984 ACM SIGCOMM Symposium on Communications Architectures and Protocols, SIGCOMM 1984
Country/Territory	Canada
City	Montreal
Period	6/06/84 → 8/06/84

Bibliographical note

Publisher Copyright:
© 1984 ACM.

Access to Document

10.1145/800056.802071

Cite this

Jaffe, J. M., & Segall, A. (1984). Automatic update of replicated topology data bases. In Proceedings of the ACM SIGCOMM Symposium on Communications Architectures and Protocols: Tutorials and Symposium, SIGCOMM 1984 (pp. 142-148). (Proceedings of the ACM SIGCOMM Symposium on Communications Architectures and Protocols: Tutorials and Symposium, SIGCOMM 1984). Association for Computing Machinery, Inc. https://doi.org/10.1145/800056.802071

Jaffe, Jeffrey M. ; Segall, Adrian. / Automatic update of replicated topology data bases. Proceedings of the ACM SIGCOMM Symposium on Communications Architectures and Protocols: Tutorials and Symposium, SIGCOMM 1984. Association for Computing Machinery, Inc, 1984. pp. 142-148 (Proceedings of the ACM SIGCOMM Symposium on Communications Architectures and Protocols: Tutorials and Symposium, SIGCOMM 1984).

@inproceedings{74405615ed95497984f09766faf84004,

title = "Automatic update of replicated topology data bases",

abstract = "In computer communication networks, routing is often accomplished by maintaining copies of the network topology and dynamic performance characteristics in various network nodes. The present paper describes an algorithm that allows complete flexibility in the placement of the topology information. In particular, we assume that an arbitrary subset of network nodes are capable of maintaining the topology. In this environment, protocols are defined to allow automatic updates to flow between these more capable nodes. In addition, protocols are defined to allow less capable nodes to report their topology data to the major nodes, and acquire route information from them.",

author = "Jaffe, {Jeffrey M.} and Adrian Segall",

note = "Publisher Copyright: {\textcopyright} 1984 ACM.; 1984 ACM SIGCOMM Symposium on Communications Architectures and Protocols, SIGCOMM 1984 ; Conference date: 06-06-1984 Through 08-06-1984",

year = "1984",

month = jun,

day = "6",

doi = "10.1145/800056.802071",

language = "אנגלית",

series = "Proceedings of the ACM SIGCOMM Symposium on Communications Architectures and Protocols: Tutorials and Symposium, SIGCOMM 1984",

publisher = "Association for Computing Machinery, Inc",

pages = "142--148",

booktitle = "Proceedings of the ACM SIGCOMM Symposium on Communications Architectures and Protocols",

}

Jaffe, JM & Segall, A 1984, Automatic update of replicated topology data bases. in Proceedings of the ACM SIGCOMM Symposium on Communications Architectures and Protocols: Tutorials and Symposium, SIGCOMM 1984. Proceedings of the ACM SIGCOMM Symposium on Communications Architectures and Protocols: Tutorials and Symposium, SIGCOMM 1984, Association for Computing Machinery, Inc, pp. 142-148, 1984 ACM SIGCOMM Symposium on Communications Architectures and Protocols, SIGCOMM 1984, Montreal, Canada, 6/06/84. https://doi.org/10.1145/800056.802071

Automatic update of replicated topology data bases. / Jaffe, Jeffrey M.; Segall, Adrian.
Proceedings of the ACM SIGCOMM Symposium on Communications Architectures and Protocols: Tutorials and Symposium, SIGCOMM 1984. Association for Computing Machinery, Inc, 1984. p. 142-148 (Proceedings of the ACM SIGCOMM Symposium on Communications Architectures and Protocols: Tutorials and Symposium, SIGCOMM 1984).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Automatic update of replicated topology data bases

AU - Jaffe, Jeffrey M.

AU - Segall, Adrian

PY - 1984/6/6

Y1 - 1984/6/6

N2 - In computer communication networks, routing is often accomplished by maintaining copies of the network topology and dynamic performance characteristics in various network nodes. The present paper describes an algorithm that allows complete flexibility in the placement of the topology information. In particular, we assume that an arbitrary subset of network nodes are capable of maintaining the topology. In this environment, protocols are defined to allow automatic updates to flow between these more capable nodes. In addition, protocols are defined to allow less capable nodes to report their topology data to the major nodes, and acquire route information from them.

AB - In computer communication networks, routing is often accomplished by maintaining copies of the network topology and dynamic performance characteristics in various network nodes. The present paper describes an algorithm that allows complete flexibility in the placement of the topology information. In particular, we assume that an arbitrary subset of network nodes are capable of maintaining the topology. In this environment, protocols are defined to allow automatic updates to flow between these more capable nodes. In addition, protocols are defined to allow less capable nodes to report their topology data to the major nodes, and acquire route information from them.

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

U2 - 10.1145/800056.802071

DO - 10.1145/800056.802071

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:85050285294

T3 - Proceedings of the ACM SIGCOMM Symposium on Communications Architectures and Protocols: Tutorials and Symposium, SIGCOMM 1984

SP - 142

EP - 148

BT - Proceedings of the ACM SIGCOMM Symposium on Communications Architectures and Protocols

PB - Association for Computing Machinery, Inc

T2 - 1984 ACM SIGCOMM Symposium on Communications Architectures and Protocols, SIGCOMM 1984

Y2 - 6 June 1984 through 8 June 1984

ER -

Jaffe JM, Segall A. Automatic update of replicated topology data bases. In Proceedings of the ACM SIGCOMM Symposium on Communications Architectures and Protocols: Tutorials and Symposium, SIGCOMM 1984. Association for Computing Machinery, Inc. 1984. p. 142-148. (Proceedings of the ACM SIGCOMM Symposium on Communications Architectures and Protocols: Tutorials and Symposium, SIGCOMM 1984). doi: 10.1145/800056.802071

Automatic update of replicated topology data bases

Abstract

Publication series

Conference

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this