Thumbnail
Access Restriction
Subscribed

Author Dalal, Yogen K. ♦ Metcalfe, Robert M.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Keyword Routing ♦ Store-and-forward packet switching ♦ Computer networks ♦ Broadcast packets ♦ Reverse path forwarding ♦ Broadcast protocols
Abstract A broadcast packet is for delivery to all nodes of a network. Algorithms for accomplishing this delivery through a store-and-forward packet switching computer network include (1) transmission of separately addressed packets, (2) multidestination addressing, (3) hot potato forwarding, (4) spanning tree forwarding, and (5) source based forwarding. To this list of algorithms we add (6) reverse path forwarding, a broadcast routing method which exploits routing procedures and data structures already available for packet switching. Reverse path forwarding is a practical algorithm for broadcast routing in store-and-forward packet switching computer networks. The algorithm is described as being practical because it is not optimal according to metrics developed for its analysis in this paper, and also because it can be implemented in existing networks with less complexity than that required for the known alternatives.
Description Affiliation: Stanford Univ., Stanford, NJ (Metcalfe, Robert M.) || Xerox Corp., Palo Alto, CA (Dalal, Yogen K.)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 21
Issue Number 12
Page Count 9
Starting Page 1040
Ending Page 1048


Open content in new tab

   Open content in new tab
Source: ACM Digital Library