.B If the Network layer is sending a message from A to D via B, it can be sure that a message sent by the Data Link layer from A to B will always correctly get to B, and a message sent from B to D will always correctly get to D. How then is it possible for the Network layer to be unable to correctly deliver a message from A to D?

.B If the Network layer is sending a message from A to D via B, it can be sure that a message sent by the Data Link layer from A to B will always correctly get to B, and a message sent from B to D will always correctly get to D. How then is it possible for the Network layer to be unable to correctly deliver a message from A to D?

Operations Research : Applications and Algorithms

4th Edition

ISBN:9780534380588

Author:Wayne L. Winston

Publisher:Wayne L. Winston

Chapter20: Queuing Theory

Section20.10: Exponential Queues In Series And Open Queuing Networks

Problem 8P

See similar textbooks

Similar questions

True or False: [ ] Routing decision is always required for every packet of a message at each node in packet switched network. [ ] In OSI model data link layer provides for the reliable transfer of information across the physical link; sends blocks (frames) with the necessary synchronization, error control, and flow control [ ] Because the boundaries between layer are well defined change in standard in one layer effect already existing software in another layer; this makes it difficult to introduce new standard
Suppose, we have a network which is consists of two layer-2 switch, one layer-3 switch and two end devices. If we want to transfer data from this network to another established network which is consists of router, switch and end devices, can it be possible? Explain
This elementary problem begins to explore propagation delay andtransmission delay, two central concepts in data networking. Consider two hosts, Aand B, connected by a single link of rate R bps. Suppose that the two hosts areseparated by m meters, and suppose the propagation speed along the link is smeters/sec. Host A is to send a packet of size L bits to Host B. d. Suppose Host A begins to transmit the packet at time t=0 . At time t= ?????? ,where is the last bit of the packet? e. Suppose ????? is greater than ?????? . At time t= ??????, where is the first bit of the packet?f. Suppose ????? is less than ??????. At time t= ?????? , where is the first bit of thepacket?
b) Both Layer-2 Switch and Router are used to forward network traffic from one interface to another. How are they different in terms of functionality?
1) What is a Software Defined Network and how does it differ from a traditional (non-SDN) network? What are 3 advantages of an SDN? 2) We know that end to end error management is handled by TCP at the transport layer. So theoretically it is not necessary to implement error detection/correction at the link layer – yet it is implemented there. Why is it beneficial to implement error detection/correction at the link layer as well as the transport layer?
Topic: Network Delay Assume two hosts, A and B, that are linked by a single link with a rate of R bps and are spaced m meters away from one another. A packet of size L bits is being sent from Host A to Host B. Suppose that the propagation through the connection is occurring at s meters/second. (Answer the following question while showing work) 1) When d-prop is bigger than d-trans, where is the packet's first bit at time t = d-trans? 2) At time t = d-trans, where d-prop is less than d-trans, where is the packet's first bit?
Suppose users share a 2 Mbps link. Also suppose each user transmits continuously at 1 Mbps when transmitting, but each user transmits only 20 percent of the time. a. When circuit switching is used, how many users can be supported? b. For the remainder of this problem, suppose packet switching is used. Why will there be essentially no queuing delay before the link if two or fewer users transmit at the same time? Why will there be a queuing delay if three users transmit at the same time? c. Find the probability that a given user is transmitting. d. Suppose now there are three users. Find the probability that at any given time, all three users are transmitting simultaneously. Find the fraction of time during which the queue grows.
(a) What services does the network layer provide to the transport layer?(b) Are data packets guaranteed to be delivered from the source to the destination? (c) Are multiple data packets guaranteed to be delivered in a certain order?(d) Is a data packet guaranteed to be delivered within a certain amount of time?
A packet switch receives a packet and determines the outbound link to which the packet should be forwarded. When the packet arrives, one other packet is halfway done being transmitted on this outbound link and four other packets are waiting to be transmitted. Packets are transmitted in order of arrival. Suppose all packets are 1,500 bytes and the link rate is 2 Mbps. What is the queuing delay for the packet? More generally, what is the queuing delay when all packets have length L, the transmission rate is R, x bits of the currently-being-transmitted packet have been transmitted, and n packets are already in the queue?
Assume that 2 packets arrive simultaneously to a switch at which one other packet is halfway done being transmitted on the outbound link and two other packets are waiting to be transmitted. Each packets is of length N = 1600 bytes and the outbound link has transmission rate R = 1.28 Mbps. Assume that the queuing buffer is big enough to hold at least five packets. What is the average queuing delay for the arriving 2 packets?
This elementary problem begins to explore propagation delay and transmission delay, twocentral concepts in data networking. Consider two hosts, A and B, connected by a single link ofrate R bps. Suppose that the two hosts are separated by m meters, and suppose the propagationspeed along the link is s meters/sec. Host A is to send a packet of size L bits to Host B.a. Express the propagation delay, dprop, in terms of m and s.b. Determine the transmission time of the packet, dtrans, in terms of Land R.c. Ignoring processing and queuing delays, obtain an expression for the endto-end delay.d. Suppose Host A begins to transmit the packet at time t = 0. At time t = dtrans,where is the last bit of the packet?e. Suppose dprop is greater than dtrans. At time t = dtrans, where is the first bit ofthe packet?f. Suppose dprop is less than dtrans. At time t = dtrans, where is the first bit ofthe packet?g. Suppose s = 2.5 · 108, L = 120 bits, and R = 56 kbps. Find the distance mso that dprop equals…
Assume that the link has an MSS of 100 bytes and that we are using a stop and wait protocol. If we have no packet loss and an RTT of 100ms, what is the utilization of this link?