The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
Multicast routing in datagram internetworks and extended LANs
Open accessAbstract
Multicasting, the transmission of a packet to a group of hosts, is an important service for improving the efficiency and robustness of distributed systems and applications. Although multicast capability is available and widely used in local area networks, when those LANs are interconnected by store-and-forward routers, the multicast service is usually not offered across the resulting internetwork . To address this limitation, we specify extensions to two common internetwork routing algorithms—distance-vector routing and link-state routing—to support low-delay datagram multicasting beyond a single LAN. We also describe modifications to the single-spanning-tree routing algorithm commonly used by link-layer bridges, to reduce the costs of multicasting in large extended LANs. Finally, we discuss how the use of multicast scope control and hierarchical multicast routing allows the multicast service to scale up to large internetworks.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Bellman, R. E. (2010) · doi:10.1515/9781400835386 · Cited by 14,588
Ford, D. R., & Fulkerson, D. R. (1962) · Cited by 4,072
Data Structures and Algorithms
(2003) · Series on software engineering and knowledge engineering · doi:10.1142/9789812791245 · Cited by 2,117
Data Structures and Algorithms
Wirth, N. (1984) · Scientific American · doi:10.1038/scientificamerican0984-60 · Cited by 1,418
Host extensions for IP multicasting
Deering, S. (1986) · doi:10.17487/rfc1112 · Cited by 1,344
Self-citationPostel, J. B. (1981) · Cited by 1,130
Hedrick, C. L. (1988) · doi:10.17487/rfc1058 · Cited by 765
The New Routing Algorithm for the ARPANET
McQuillan, J., Richer, I., & Rosen, E. (1980) · IEEE Transactions on Communications · doi:10.1109/tcom.1980.1094721 · Cited by 686
Distributed process groups in the V Kernel
Cheriton, D. R., & Zwaenepoel, W. (1985) · ACM Transactions on Computer Systems · doi:10.1145/214438.214439 · Cited by 353
Self-citationInternational Business Machines Corp.
(2006) · Mergent s Dividend Achievers · doi:10.1002/div.3959 · Cited by 147
Host groups: a multicast extension for datagram internetworks
Cheriton, D. R., & Deering, S. (1985) · ACM SIGCOMM Computer Communication Review · doi:10.1145/318951.319039 · Cited by 102
Self-citation
Cited by
Practical Byzantine fault tolerance
Castro, M., & Liskov, B. H. (1999) · Operating Systems Design and Implementation · doi:10.5555/296806.296824 · Cited by 3,205
Practical byzantine fault tolerance and proactive recovery
Castro, M., & Liskov, B. (2002) · ACM Transactions on Computer Systems · doi:10.1145/571637.571640 · Cited by 2,475
Adaptive protocols for information dissemination in wireless sensor networks
Heinzelman, W. R., Kulik, J., & Balakrishnan, H. (1999) · Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking · doi:10.1145/313451.313529 · Cited by 2,308
Scribe: a large-scale and decentralized application-level multicast infrastructure
Castro, M., Druschel, P., Kermarrec, A.-M., & Rowstron, A. I. T. (2002) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2002.803069 · Cited by 1,461
Design and evaluation of a wide-area event notification service
Carzaniga, A., Rosenblum, D. S., & Wolf, A. L. (2001) · ACM Transactions on Computer Systems · doi:10.1145/380749.380767 · Cited by 1,425
Metadata
- Authors
- Deering, S. E., & Cheriton, D. R.
- Venue
- ACM Transactions on Computer Systems
- Published
- 1990-05
- Volume
- 8
- Issue
- 2
- Pages
- 85-110
- ISSN
- 0734-2071 (ISSN-L)
- 1557-7333
- OpenAlex
- W2079994203
- Cited by
- 1,173
- References
- 11
- FWCI
- 15.50
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.