Question
What does 'record route' option signify in an IP header?(A) Routes that processed the packet, stores the packet details in local memory.(B) Follow the path already available without further use of any routing algorithm.(C) Make each router append its IP address to the packet in transit.(D) Make routers inform the source about the path taken.
Step 1
This option is a part of the Internet Protocol (IP) that allows for the recording of the route that a packet of data has taken through the network. Show more…
Show all steps
Your feedback will help us improve your experience
Samriddhi Singh and 53 other AP CS educators are ready to help you.
Ask a new question
Labs
Want to see this concept in action?
Explore this concept interactively to see how it behaves as you change inputs.
Key Concepts
Recommended Videos
Which of the below statements hold good with respect to routing done by a bridge? (i) they can route packets using IP addresses (ii) they use data link layer addresses to do routing (iii) the LAN route IPv4,IPv6,Apple Talk, ATM, OSI packets (A) (i), (ii) (B) (ii), (iii) (C) (i), (iii) (D) (i), (ii), (iii)
NETWORKS, INFORMATION SYSTEMS, SOFTWARE ENGINEERING AND WEB TECHNOLOGY
TCP/UDP
Consider the routing table below: $$ \begin{array}{lllcc} \hline {\text { Destination }} & {\text { Gateway }} & {\text { Mask }} & \text { Flags } & \text { Interface } \\ \hline 165.230 .198 .64 & 165.230 .198 .119 & 255.255 .255 .192 & \mathrm{U} & \text { eth0 } \\ 192.168 .1 .0 & 192.168 .1 .1 & 255.255 .255 .0 & \mathrm{U} & \text { eth1 } \\ 127.0 .0 .0 & 127.0 .0 .1 & 255.0 .0 .0 & \mathrm{U} & \text { Loop back } 0 \\ \text { Default } & 165.230 .198 .65 & 255.255 .255 .255 & \mathrm{UG} & \text { eth0 } \\ \hline \end{array} $$ How many IP addresses can this machine reach to (excluding the loop back route)? (A) 64 (B) 256 (C) 320 (D) 192
$\mathrm{IP}\left(\mathrm{V}_{4}\right)$
Select the correct alternative from the given choices. What are the advantages of reverse path forwarding over other broadcasting algorithms like spanning trees, multidestination routing, broadcasting, and flooding? (i) Route does not need to know information regarding spanning tree structures (ii) Uses destination tables for further forwarding (iii) Does not need a halt mechanism to stop packets from further getting routed (A) (i), (ii) (B) (ii), (iii) (C) (i), (iii) (D) (i), (ii), (iii)
ROUTING ALGORITHMS
Transcript
Watch the video solution with this free unlock.
EMAIL
PASSWORD