4.3-4a. IPv4/IPv6 co-existence: tunneling (a). Consider the mixed IPv4/IPv6 network shown bwhere an IPv4 tunnel exists between IPv6 routers B and E. Suppose that IPv6 router A sends adatagram to IPv6 router F. IPv6 datagrams are shown in blue; the IPv4 datagram is in red (cont.the encapsulated IPv6 datagram in blue).AIPv6(a)BIPv6/v4 IPv4(b)At point (a), the IP version field in thedatagram is:At point (a), the source IP address is that ofhost:DIPv4Perform the matching below to indicate the datagram field value and type at point (a).At point (a), the destination IP address is thatof host:At point (a), the number of bits in thedestination IP address is:EIPv6/v4 IPv6(c)[Choose ][Choose ][Choose ][Choose ]

We have to talk about the network diagram.IPv4/IPv6 tunnеling is a tеchniquе for еncapsulating IPv6…

4.3-4a. IPv4/IPv6 co-existence: tunneling (a). Consider the mixed IPv4/IPv6 network shown where an IPv4 tunnel exists between IPv6 routers B and E. Suppose that IPv6 router A sends datagram to IPv6 router F. IPv6 datagrams are shown in blue; the IPv4 datagram is in red (con the encapsulated IPv6 datagram in blue). A IPv6 (a) B IPv6/v4 C IPv4 (b) D IPv4 E IPv6/v4 (c) IPv6 Perform the matching below to indicate the datagram field value and type at point (a).

4.3-4a. IPv4/IPv6 co-existence: tunneling (a). Consider the mixed IPv4/IPv6 network shown where an IPv4 tunnel exists between IPv6 routers B and E. Suppose that IPv6 router A sends datagram to IPv6 router F. IPv6 datagrams are shown in blue; the IPv4 datagram is in red (con the encapsulated IPv6 datagram in blue). A IPv6 (a) B IPv6/v4 C IPv4 (b) D IPv4 E IPv6/v4 (c) IPv6 Perform the matching below to indicate the datagram field value and type at point (a).

A+ Guide to Hardware (Standalone Book) (MindTap Course List)

9th Edition

ISBN:9781305266452

Author:Jean Andrews

Publisher:Jean Andrews

Chapter8: Connecting To And Setting Up A Network

Section: Chapter Questions

Problem 10RB

See similar textbooks

Similar questions

4.3-4a. IPv4/IPv6 co-existence: tunneling (a). Consider the mixed IPv4/IPv6 network shown below, where an IPv4 tunnel exists between IPv6 routers B and E. Suppose that IPv6 router A sends a datagram to IPv6 router F. IPv6 datagrams are shown in blue; the IPv4 datagram is in red (containing the encapsulated IPv6 datagram in blue). A IPv6 (a) B IPv6/v4 C IPv4 (b) At point (a), the IP version field in the datagram is: At point (a), the source IP address is that of host: D IPv4 At point (a), the destination IP address is that of host: At point (a), the number of bits in the destination IP address is: Perform the matching below to indicate the datagram field value and type at point (a). FAB E [Choose ] [Choose ] B D IPv6/v4 (c) IPv4 IPv6 128 32 IPv6 [Choose ]
4.3-4b. IPv4/IPv6 co-existence: tunneling (b). Consider the mixed IPv4/IPv6 network shown below, where an IPv4 tunnel exists between IPv6 routers B and E. Suppose that IPv6 router A sends a datagram to IPv6 router F. IPv6 datagrams are shown in blue; the IPv4 datagram is in red (containing the encapsulated IPv6 datagram in blue). A IPv6 (a) B IPv6/v4 IPv4 (b) At point (b), the larger (red, encapsulating) datagram an IP version field in the datagram of: At point (b), the larger (red, encapsulating) datagram has a source IP address of host: At point (b), the larger (red, encapsulating) datagram has a destination IP address of host: At point (b), the smaller (blue, encapsulated) datagram has a source IP address of host: D At point (b), the smaller (blue, encapsulated) datagram has a destination IP address version of: IPv4 Perform the matching below to indicate the datagram field value and type at point (b). IPv6/v4 (c) E IPv4 B E IPv6 F F IPv6
4.3-4c. IPv4/IPv6 co-existence: tunneling (c). Consider the mixed IPv4/IPv6 network shown below, where an IPv4 tunnel exists between IPv6 routers B and E. Suppose that IPv6 router A sends a datagram to IPv6 router F. IPv6 datagrams are shown in blue; the IPv4 datagram is in red (containing the encapsulated IPv6 datagram in blue). A IPv6 (a) B C IPv6/v4 IPv4 (b) At point (c), the source IP address version is: At point (c), the source IP address is that of host: D IPv4 Perform the matching below to indicate the datagram field value and type at point (c). At point (c), the destination IP address is that of host: At point (c), the number of bits in the destination IP address is: IPv6/v4 IPv6 (c) [Choose ] E [Choose ] [Choose ] [Choose ]
4.04-1. IPV4/IPV6 co-existence: tunneling (a). Consider the mixed IPV4/IPV6 network shown below, where an IPV4 tunnel exists between IPV6 routers B and E. Suppose that IPV6 router A sends a datagram to IPV6 router F. IPV6 datagrams are shown in blue; the IPV4 datagram is in red (containing the encapsulated IPV6 datagram in blue). A B C D E F IPV6 IPV6/v4 IPV4 IPV4 IPV6/v4 IPV6 (a) (b) (c) Perform the matching below to indicate the datagram field value and type at point (a). [Note: You can find more examples of problems similar to this here.] ]At point (a), the IP version field in the datagram is: A. D В. А v At point (a), the source IP address is that of host: C IPV4 At point (a), the destination IP address is that of host: D. 128 Е. В At point (a), the number of bits in the destination F. F IP address is: G. IPV6 Н. 32
5.03-5. Dijkstra's Algorithm (3, part 5). Consider the network shown below, and Dijkstra's link-state algorithm. Suppose that Dijkstra's algorithm has been run to compute the least cost paths from node E to all other nodes. Now suppose that source node E has a packet to send to destination node A. What is the first router to which E will forward this packet on its path to A? OF (A) 3 2 4 B 8 D 10 4 E 4 2 F
In IPV4, consider sending a 4,000 byte datagram (20 bytes of IP header) into a link that has an MTU of 1,500 bytes. The datagram will be allocated to fragments, and the offset value of the third segment is 3, 370 3, 185 4, 185 4, 370
Consider two hosts P and Q connected through a router R. The maximum transfer unit (MTU) value of the link between Pand Ris 1500 bytes, and between Rand Qis 820 bytes. A TCP segment of size 1400 bytes was transferred from P to Q through R, with IP identification value as 0x1234. Assume that the IP header size is 20 bytes. Further, the packet is allowed to be fragmented, i.e., Don't Fragment (DF) flag in the IP header is not set by P, Which of the following statements is/are correct? (a) Two fragments are created at R and the IP datagram size carrying the second fragment is 620 bytes. (b) If the second fragment is lost, P is required to resend the whole TCP segment. (c) TCP destination port can be determined by analysing only the second fragment. (d) If the second fragment is lost, R will resend the fragment with the IP identification value 0x1234
22. A datagram subnet allows routers to drop packets whenever they need to. The probability of a router discarding a packet is p. Consider the case of a source host connected to the source router, which is connected to the destination router, and then to the destination host. If either of the routers discards a packet, the source host eventually times out and tries again. If both host-router and router-router lines are counted as hops, what is the mean number of a. (a) hops a packet makes per transmission? b. (b) transmissions a packet makes? (c) hops required per received packet?
22. A datagram subnet allows routers to drop packets whenever they need to. The probability of a router discarding a packet is p. Consider the case of a source host connected to the source router, which is connected to the destination router, and then to the destination host. If either of the routers discards a packet, the source host eventually times out and tries again. If both host-router and router-router lines are counted as hops, what is the mean number of a. (a) hops a packet makes per transmission? b. (b) transmissions a packet makes? c. (c) hops required per received packet?
Consider four Internet hosts, each with a TCP session. These four TCP sessions share a common bottleneck link - all packet loss on the end-to-end paths for these four sessions occurs at just this one link. The bottleneck link has a transmission rate of R. The round trip times, RTT, for all fours hosts to their destinations are approximately the same. No other sessions are currently using this link. The four sessions have been running for a long time. i) What is the approximate throughput of each of these four TCP sessions? Explain your answer briefly. ii) What is the approximate size of the TCP window at each of these hosts? Explain briefly how you arrived at this answer.
a. Suppose we send into the Internet two IP datagrams, each carrying a different UDP segment. The first datagram has source IP address A1, destination IP address B, source port P1, and destination port T. The second datagram has source IP address A2, destination IP address B, source port P2, and destination port T. Suppose that A1 is different from A2 and that P1 is different from P2. Assuming that both datagrams reach their final destination, will the two UDP datagrams be received by the same socket? Why or why not? b. Suppose Alice, Bob, and Claire want to have an audio conference call using SIP and RTP. For Alice to send and receive RTP packets to and from Bob and Claire, is only one UDP socket sufficient (in addition to the socket needed for the SIP messages)? If yes, then how does Alice's SIP client distinguish between the RTP packets received from Bob and Claire?
Phases of TCP congestion control. Consider the figure below, which plots the evolution of TCP's congestion window at the beginning of each time unit (where the unit of time is equal to the RTT); see Figure 3.53 in the text. In the abstract model for this problem, TCP sends a "flight" of packets of size cwnd at the beginning of each time unit. The result of sending that flight of packets is that either (i) all packets are ACKed at the end of the time unit, (ii) there is a timeout for the first packet, or (iii) there is a triple duplicate ACK for the first packet. At the end of which units of time does TCP detect a triple-duplicate-ACK? Congestion window size (in segments) 40 35 25 20 10 5 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 Time unit (in RTT)