Question:: 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?

Question:: 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?

Systems Architecture

7th Edition

ISBN:9781305080195

Author:Stephen D. Burd

Publisher:Stephen D. Burd

Chapter9: Computer Networks

Section: Chapter Questions

Problem 15VE

See similar textbooks

Similar questions

The following bit stream : 0111110001010011111111100101111111111110 represents data that needs to be framed by the link layer on the sender’s side. Derive the resultant bit stream by adding necessary flag bits and performing bits stuffing. assume that the link layer uses the flag bits with bit stuffing approach for framing, with the following details: The beginning and end of a data frame are indicated by the special flag bits 01111110 (i.e., 0x7E). To handle accidental occurrence of the flag bits within the data, a 0 bit is stuffed every time 5 consecutive 1s are found in the data. For simplicity, assume that no other header/trailer information is added to the data. I got this answer below but it is wrong. 0111111001111100001010011111011110010111110111111011001111110
MAC protocols for an access network with N nodes continuously producing data at a constant rate of x bits per second per node are needed, and you are responsible for developing one. The traffic aggregated across nodes is also less than but close to the entire capacity of the access network, which is another positive development. In your opinion, which protocol is preferable: channel partitioning or random access? For this example, let us assume that you have chosen channel partitioning and that the channel has been divided into N subchannels.
Give some details of how you might augment the sliding window protocol with flow control by having ACKs carry additional information that reduces the SWS as the receiver runs out of buffer space. Illustrate your protocol with a timeline for a transmission; assume the initial SWS and RWS are 4, the link speed is instantaneous, and the receiver can free buffers at the rate of one per second (i.e., the receiver is the bottleneck). Show what happens at T = 0, T = 1,...,T = 4 seconds.
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?
Packet buffering in Go-Back-N. What are some reasons for discarding received-but- out-of-sequence packets at the receiver in GBN? Indicate one or more of the following statements that are correct. Group of answer choices a.The implementation at the receiver is simpler. b.Discarding an out of sequence packet will really force the sender to retransmit. c.If some packets are in error, then its likely that other packets are in error as well. d.The sender will resend that packet in any case.
Computer A uses the Go-back-N ARQ protocol to send a 110 Mbytes file to computer B with a window size of 15. Given each frame carries 100K bytes data. How long does it take to send the whole file (the total time taken from A sending the first bit of the file until A receiving the last acknowledgment)? Given that the transmission rate of the link is 500 Mbps and the propagation time between A and B is 15ms. Assume no data or control frame is lost or damaged and ignore the overhead due to header and trailer.
6.7-1. To which protocol do these fields belong? We learned way back in Chapter 1 that "a protocol defines the format and the order of messages exchanged between two or more communicating entities ..." and throughout the course, we saw many, many different messages being used throughout the protocol stack, each with different fields. In this question, for a given field name in a protocol message (i.e., in an application-layer message, transport-layer segment, network-layer datagram, or link-layer frame), use the pulldown menu to match the field name with the protocol (or pair of protocols) where this field name is used. Each protocol name (or pair of protocol names) in the pull-down menu should be matched to exactly one field description.
Discuss the invocation semantics that can be achieved when the request-reply protocol is implemented over a TCP/IP connection, which guarantees that data is delivered in the order sent, without loss or duplication. {Note: Take into account all of the conditions causing a connection to be broken}
Consider a web page whose base file is of size S1 = 10 KB. Assume that the web page consists of N = 20 inline objects each of size S2 = 100 KB. Assume that the round-trip time to the web server is T = 100 ms and the bottleneck capacity is C = 10 Mbps. Ignore any packetization delays and header overhead.a. Assuming non-persistent HTTP is used with a single TCP connection, how long does it take to download the web page?b. Assuming non-persistent HTTP is used with 4 parallel TCP connections, how long does it take to download the web page?c. Assuming pipelined, persistent HTTP is used, how long does it take to download the web page? ”Pipelined” means requests for multiple objects can be sent back-to-back on the same connection.d. Assuming non-pipelined, persistent HTTP with 2 parallel TCP connections is used, how long does it take to download the web page? Assume that the 2 parallel connections equally share the total available bandwidth C.
DONT COPY FROM CHEGG!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! A communication line capable of transmitting at a rate of 50 Kbits/secwill be used to accommodate 10 sessions each generating Poisson traffic at a rate 150 packets/min.Packet length are exponentially distributed with mean 1000 bits. For each session, find the averagenumber of packets in queue, the average number in the system, and the average delay per packetwhen the line is allocated to the sessions by using:i) 10 equal-capacity time-division multiplexed channels;ii) statistical multiplexing
P5. Consider a datagram network using 32-bit host addresses. Suppose a router has four links, numbered 0 through 3, and packets are to be forwarded to the link interfaces as follows: (refer to first image) a. Provide a forwarding table that has five entries, uses longest prefix matching, and forwards packets to the correct link interfaces. b. Describe how your forwarding table determines the appropriate link interface for datagrams with destination addresses: (refer to second image)