Fill in the blanks where necessary. 1. A datagram is dropped by a ______________ when TTL is equal to ______________. 2. In a data link layer-level communication, sender wants to send following data in bits 1100111101110101110010101001 using n-bit Parity Check where n is equal to 7. Hence, total size of data block would be _____ bits. 3. An IP Datagram is fragmented at sender and reassembled at receiver when _____________________________________________________________________. 4. A virtual circuit is necessary for an application requiring __________ ______________. 5. The identifier of each link between a host and router or a router and another router on a virtual circuit is ______________. 6. DHCP is the protocol to assign ___ ________________ to hosts in a network _______________.

Fill in the blanks where necessary. 1. A datagram is dropped by a __ when TTL is equal to . 2. In a data link layer-level communication, sender wants to send following data in bits 1100111101110101110010101001 using n-bit Parity Check where n is equal to 7. Hence, total size of data block would be _ bits. 3. An IP Datagram is fragmented at sender and reassembled at receiver when _______________________________________________________. 4. A virtual circuit is necessary for an application requiring . 5. The identifier of each link between a host and router or a router and another router on a virtual circuit is . 6. DHCP is the protocol to assign _ __ to hosts in a network _.

Systems Architecture

7th Edition

ISBN:9781305080195

Author:Stephen D. Burd

Publisher:Stephen D. Burd

Chapter9: Computer Networks

Section: Chapter Questions

Problem 3VE

See similar textbooks

Similar questions

O Differentiate between error detection and error correction. A bit string needs to be 0110111111100111110111111111100000 transmitted at the data link layer, what is string actually transmitted after bit stuffing, if flag patterns is 01111110?
1. In a data link layer-level communication, sender wants to send following data in bits 1100111101110101110010101001 using n-bit Parity Check where n is equal to 7. Hence, total size of data block would be _____ bits. 2. Calculate the data block mentioned in the 1st question.
The following character encoding is used in a data link protocol: A: 01000111; B: 11100011; FLAG: 01111110; ESC: 11100000 Show the bit sequence transmitted in binary for the four character frame: A B ESC FLAG when each of the following framing methods is used: a) Character count b) Flag bytes with byte stuffing c) Starting and ending flag bytes, with bit stuffing. Please solve within 30 minutes. Asap.
The term synchronization has many meanings in Computer Science. Within the networking field, the term is usually used to describe making asynchronous communication synchronous (A coordination of activities; running at the same rate) We see synchronization occurring in different layers, but we are mostly concerned with the physical layer and the data link layer (L1 and L2). a) In what ways is synchronization in these two layers similar? b) In what ways is synchronization in these two layers dissimilar?
Discrete Mathematic Question: Pretend we are defining a new class of networks: 1 byte for network IDs and 1 byte for hostID. The definition of class A is: networkdID is : 0xxx-xxxx and the one byte (8 bits) hostID cannot contain all 0s and 1s. The definition of class B is: networkdID is : 10xx-xxxx and the one byte (8 bits) hostID cannot contain all 0s and 1s The definition of class C is: networkdID is : 110x-xxxx and the one byte (8 bits) hostID cannot contain all 0s and 1s. How many total IP addresses can we have with the above definition?
dont dont post existing one strict warning skip if not known A new architecture, with N layers, is proposed. User application at the top layer generates a message of M bytes. At each layer, an H bytes header is added. The second layer of that architecture also adds T bytes trailer. In this architecture, the message M is not divided into smaller packets at any layer. • What is the size of the final message (in bytes) transferred by the lower layer? • If we consider the headers and trailers to be an overhead, what is the percentage of such overhead to the total size of the final message?
Suppose you are designing a sliding window protocol for a 1-Mbps point-to-point link to a stationary satellite revolving around the earth at 3 x 104 km altitude. Assuming that each frame carries 1 KB of data, what is the minimum number of bits you need for the sequence number in the following cases? Assume the speed of light is 3 x 108 m/s. (a) RWS=1 (b) RWS=SWS
Refer the exhibit and the required number of hosts given. Subnet the address 192.168.50.0/24 for the required number of hosts using VLSM and complete the subnet table using the following instructions: NW: 192.168.50.0/24 NET-X: 45 USABLE HOSTS NET-Z: 2 USABLE HOSTS NET-Y: 25 USABLE HOSTS ------ GO/O R2 G0/0 GO/1 GO/1 R1 PC2 PC1 Assign the first subnet to network with the highest host requirement. Assign the second subnet to the network with the second highest host requirement. Assign the third subnet to the network with the third highest host requirement. Subnet Table: Subnet No. of Subnet First Last Usable Broadcast Subnet Name Usable Address Usable Host Address Mask hosts Host Address required Address
2) Will the following message-passing code cause communication deadlock if 2) implemented in a synchronous message-passing system such as MPI blocking send/receive? Explain why or why not. P1 P2 P3 recv (&data3, P1) send (&msgl, P3) send (&msg2, P1) ... ... recv (&datal, P2) recv (&data2, P3) send (&msg3, P2)
5. A wireless Base Station (BS) is serving N users with a single channel having a capacity C bits/second. The BS has two options for serving the users a) Option1: BS divides the channel into multiple sub-channels using FDMA and assigns a dedicated sub-channel to each user and process his traffic in a separate buffer. b) Option2: BS put the traffic from all users in one buffer and transmits all traffic packet- by-packet on the same channel in a first-come-first serve order 1 Compute the transmission time of each packet (on the air) for Option1 and Option2 if the packet size is L bits.
A certain link layer interfaces uses CRC to detect errors. Answer the following questions. a. For each 8-bit data frame, the layer users a generator polynomial G(x0 = x^4 + x^2+ 1 to add redundant bits. What is the sequence of bits actually sent when the 8-bit data frame is "10011101"? b. Assume a sender has a 6-bit data fame "101110" to transmit to a receiver. The sender generates the data frame "101110011" and sends it to a receiver. The sender uses the generator "1001" to find an R. Assume there will be no errors in the CRC bits. Can the receiver detect all errors in the received frame using the given generator and the CRC bits? Justify your answer. Please show step by step explanations and solution for a good understanding. Thank you very much.
6. Delays. A user in Madagascar, connected to the internet via a 100 Mb/s (b-bits) connection retrieves a 250 KB (B-bytes) web page from a server in Tokyo, where the page references three images of 500 KB each. Assume that the one-way propagation delay is 82 ms and that the user's access link is the bandwidth bottleneck for this connection. a. Approximately how long does it take for the page (including images) to appear on the user's screen, assuming non-persistent HTTP using a single connection at a time? (For this part, you should ignore queueing delay and transmission delays at other links in the network) How long does it take if the connection uses persistent HTTP (single connection)? b. c. Suppose that user's access router has a 4 MB buffer (B-byte) on the link from the router to the user. How much delay does this buffer add during periods when the buffer is full? d. Assume a cache rate of 45% on the information received by the user in Madagascar from the Tokyo server. How does…