Consider a network connecting two systems located 4000 kilometers apart. The bandwidth of the network is 500 x Mbps. The propagation speed of the media is 4 x 106 meters per second. It is needed to design a Go-Back-N sliding window protocol for this network. The average packet size is 107 bits. The network is to be used to its full capacity. Assume that processing delays at nodes are negligible. What is the minimum size in bits of the sequence number field?

Consider a network connecting two systems located 4000 kilometers apart. The bandwidth of the network is 500 x Mbps. The propagation speed of the media is 4 x 106 meters per second. It is needed to design a Go-Back-N sliding window protocol for this network. The average packet size is 107 bits. The network is to be used to its full capacity. Assume that processing delays at nodes are negligible. What is the minimum size in bits of the sequence number field?

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Q: Consider the following scenario: Frames of 12000 bits are sent over a 400kbps channel using a…

A: Protocols in Networking A network protocol is a set up set of decides that decide how information…

Q: Consider delivering voice through a direct connection network from Host A to Host B. (for example,…

Q: We consider a noisy communication link in which the message is encoded into binary digits (0,1)…

A: ANSWER 1: The probability that the received message has errors which go undetected can be…

Q: Consider a half-duplex point-to-point link using a stop-and-wait scheme, in which a series of…

A: Half duplex data transmission means that data can be transmitted in both directions on a signal…

Q: What is the number of messages required to send a file F of 4 Mbits from one station to another?…

A: In networking, data transmission involves breaking information into small pieces called…

Q: 1. Alice picks a bit b at random. She picks b = 0 with probability p = 0.2, and she picks b = 1 with…

A: i) Message 1: {"Alice", K, RA}Bob, Message 2: RA, RB "Bob" who is authenticated to person "Alice"…

Q: liseconds. Assume an ACK is small enough that you can ignore its transmission delay. You may also…

A: For a pipelined reliable data transfer protocol with a window size of 6, the sender can send up to 6…

Q: For NAT Network Address Translation Scenario: Jenny Bello is a small business owner selling and…

A: We need to answer questions related to private IPv4 address.

Q: Computer A is sending a 100 kByte long file to Computer B via packet-switching over two consecutive…

A: Given that, Size of the file= 100 KB Bandwidth of the link= 10 Mbps Distance of each link= 1000 Km…

Q: Let's imagine, for the sake of illustration, that a packet is now being sent from one site to…

A: Inspection: Processing delay and Network delay are the two components that contribute to the…

Q: Consider the subnet in Fig. 3.11.5. Distance vector routing is used and the following vectors have…

Concept explainers

Network transmission cabling

A network is a collection of devices connected by communication links. A device can be a computer or any instrument capable of sending and receiving data or information formed by other nodes toward the network. A channel that connects people or things is known as a network. It sends the data from one place to another. It is the basic concept of a computer, network, and data communications.

Question

Consider a network connecting
two systems
located 4000 kilometers apart. The bandwidth of
the network is 500 x Mbps. The propagation
speed of the media is 4 × 106 meters per
second. It is needed to design a Go-Back-N
sliding window protocol for this network. The
average packet size is 107 bits. The network is to
be used to its full capacity. Assume that
processing delays at nodes are negligible. What
is the minimum size in bits of the sequence
number field?

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

SEE SOLUTION Check out a sample Q&A here

Step 1

VIEW

Step 2

VIEW

Step by step

Solved in 2 steps with 1 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions

Consider sending a file of F bits over a path of Q links. Each link transmits at R bits per second (bps). The network is lightly loaded so that there are no queueing delays. When a form of packet switching is used, the F bits are broken up into packets, each packet with L bits, of which h bits of it are header. Propagation delay is negligible. Let F = 5x104, Q = 20, R = 1 Mbps, L = 1000, and h = 10. b) Suppose the network is a packet-switched datagram network and a connectionless service is used. How long does it take to send the file?
Consider sending a file of F bits over a path of Q links. Each link transmits at R bits per second (bps). The network is lightly loaded so that there are no queueing delays. When a form of packet switching is used, the F bits are broken up into packets, each packet with L bits, of which h bits of it are header. Propagation delay is negligible. Let F = 5x104, Q = 20, R = 1 Mbps, L = 1000, and h = 10. c. Suppose the network is a packet-switched virtual circuit network. Denote the VC set-up time by ts = 250 milliseconds. How long does it take to send the file from source to destination?
Consider the subnet in Fig. 3.11.5. Distance vector routing is used and the following vectors have just come in to router C: from B (5, 0, 8, 12, 6, 2); from D(16, 12, 06, 0, 9, 10) and from E(7, 6, 3, 9, 0, 4). The measured delays to B, D and E are 6, 3 and 5 respectively. What is C's new routing table? Give both the outgoing line to used and the expected delay ? A B E Fig. 3.11.5 F D
2. Consider a bus-topology network with five stations. A reservation access method is used. Each station has infinite data to transmit. Each reservation slot has 10 microseconds (note that 1 microsecond = 106 second). For each station, one data transmission sends 1000 bits. The transmission rate over the medium is 10 Mbps. For a station, which is its throughput (in unit "Mbps")?
Computer A is sending a 100 kByte long file to Computer B via packet-switching over two consecutive 10 Mbps links of 1000 km length each.Assume that the signal propagation speed on both links is 2.5 x 108 m/s.Furthermore, assume that the maximum length of a packet is 1500 bytes and that Computer A fills each packet to the max, if possible. How "long" (in meters) is one bit on link 1?
A TCP connection is established through 10 wireless hops in an acoustic underwater ad hoc network. Assume that each hop is 100 meter in the average, acoustic signals travel 1500 meter per second, 10 kilobit data can be sent per second over a link, the source node has one megabyte of data to send, the receiver window size is 64 kilobytes, the maximum segment size is 1 kilobyte and the average processing delay for routing at each node is one millisecond. Assume also that the following segments do not reach the destination: 67, 112, 137. What would be the average utilization of the links for this connection if there is not another communications through them? Explain an alternative approach to increase the bandwidth utilization?
In the congestion control method of TCP we are having a connection between nodes A and node B which is called connection X. There is another TCP connection between node C and node D which is called connection Y. The initial threshold window size for connection X is 20 KB and for Y is 16 KB. Both the connections X, Y are working independently and follow the Additive increase multiplicative decrease algorithm (AIMD) for congestion control with a maximum segment size of 2 KB. The first timeout occurs at the fifth transmission in connection X and at the sixth transmission in connection Y. After every third transmission from timeout, you again encounter the timeout in both X and Y. At which transmission the connection Y reaches to the same threshold value of the connection X for the first time.
In a two-phase, total-order multicast system, messages are sent in the following sequence from node S to G1 and G2. G1 and G2 are the members of the group. S sends m1 to G1 S sends m1 to G2 S sends m2 to G2 S sends m2 to G1 Use the basic implementation of the Lamport clock. The clock s at each node start at: S: 4, G1: 6, G2: 1. Show the exchange of messages and their acknowledgments in a clock diagram using the basic implementation of Lamport's clock. In which order and at what times are m1 and m2 delivered?
Given a M/M/1 queue, which has packets arriving at a rate 2 packets/sec, an output link rate R bps, and an average packet size of 1500 bytes, write down: the expression for T, the average delay for a packet (i.e., from arrival till completing transmission at the output). b. the expression for the output utilization c. the expression for average number of packets in the queue d. the expression for average number of packets in the output NIC