QUESTION 44.01-3. Packet scheduling (c). Consider the same pattern of red and green packet arrivals to a router's output port queue, shown below. Suppose each packet takes onetime slot to be transmitted, and can only begin transmission at the beginning of a time slot after its arrival. Indicate the sequence of departing packet numbers (at t = 1, 2, 3,4, 5, 6, 7) under round robin scheduling. Assume a round-robin scheduling cycle beings with green packets. Give your answer as 7 ordered digits (each corresponding to thepacket number of a departing packet), with a single space between each digit, and no spaces before the first or after the last digit, e.g., in a form like 7 65432 1).(Note: You can find more examples of problems similar to this here.]2345arrivalspacketin servicedeparturesQUESTION 54.02. Subnet addressing. Consider the three subnets below, each in the larger 128.119.160/24 network. The following questions are concerned with subnet addressing.Answer each question by selecting a matching answer. Each answer can be used to answer only one question.(Note: You can find more examples of problems similar to this here.): A 128.119.160/24B :48 hosts21 hosts50 hostsWhat is the maximum number of hosts possible in the larger 128.119.160/24network?A. 96В. 2"°32How many bits are needed to be able to address all of the host in subnet A?C. 256Suppose that subnet A has a CIDRized subnet address range of128.119.160.128/26 (hint: 128 is 1000 0000 in binary); Subnet B has anCIDRied subnet address range of 128.119.160.64/26. We now want a validCIDRized IP subnet address range for subnet C of the form 128.119/160.x/26.What is a valid value of x?D. 6Е. 64F. O

the solution is an given below ;

4.01-3. Packet scheduling (c). Consider the same pattern of red and green packet arrivals to a router's output port queue, shown below. Suppose each packet takes one time slot to be transmitted, and can only begin transmission at the beginning of a time slot after its arrival. Indicate the sequence of departing packet numbers (at t = 1, 2, 3, 4, 5, 6, 7) under round robin scheduling. Assume a round-robin scheduling cycle beings with green packets. Give your answer as 7 ordered digits (each corresponding to the packet number of a departing packet), with a single space between each digit, and no spaces before the first or after the last digit, e.g., in a form like 7 654 32 1). (Note: You can find more examples of problems similar to this here.]

4.01-3. Packet scheduling (c). Consider the same pattern of red and green packet arrivals to a router's output port queue, shown below. Suppose each packet takes one time slot to be transmitted, and can only begin transmission at the beginning of a time slot after its arrival. Indicate the sequence of departing packet numbers (at t = 1, 2, 3, 4, 5, 6, 7) under round robin scheduling. Assume a round-robin scheduling cycle beings with green packets. Give your answer as 7 ordered digits (each corresponding to the packet number of a departing packet), with a single space between each digit, and no spaces before the first or after the last digit, e.g., in a form like 7 654 32 1). (Note: You can find more examples of problems similar to this here.]

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

Similar questions

Consider a simple protocol for transferring files over a link. After some initial negotiation, A sends data packets of size 1 KB to B; B then replies with an acknowledgment. A always waits for each ACK before sending the next data packet; this is known as stop-and-wait. Packets that are overdue are presumed lost and are retransmitted. (a) In the absence of any packet losses or duplications, explain why it is not necessary to include any "sequence number" data in the packet headers. (b) Suppose that the link can lose occasional packets, but that packets that do arrive always arrive in the order sent. Is a 2-bit sequence number (that is, N mod 4) enough for A and B to detect and resend any lost packets? Is a 1-bit sequence number enough? (c) Now suppose that the link can deliver out of order and that sometimes a packet can be delivered as much as 1 minute after subsequent packets. How does this change the sequence number requirements?
2. The following illustration shows a transmission from Host A to Host B using Network Address Translation (NAT). Host A is located inside a Local Area Network (LAN) with an IP address of 192.168.1.2. The LAN is connected to the Wide Area Network (WAN), i.e. the Internet, through a router R1 that conducts NAT. R1 has two interfaces with an internal LAN IP address (192.168.1.1) and and external WAN IP address (127.45.10.35). Host B is located outside the LAN and is a well-known server, e.g., Google's server. Host B has an IP address of 130.160.23.45. Port numbers for the application components running at both hosts are provided in the figure. For a single message M1 being sent from Host A to Host B, please fill in the blanks in the illustration below with the source IP address and Port number at Host A and at the Router R1. Any information not provided may be assumed, however, please state your assumption clearly. Host A Local Area Network (LAN) IP: 192.168.1.2 Port: 5252 Source IP…
Compare GBN, SR, and TCP (no delayed ACK). Assume that the timeout values for all three protocols are sufficiently long such that 5 consecutive data segments and their corresponding ACKs can be received (if not lost in the channel) by the receiving host (Host B) and the sending host (Host A) respectively. Suppose Host A sends 5 data segments to Host B, and the 3rd segment (sent from A) is lost. In the end, all 5 data segments have been correctly received by Host B. How many segments has Host A sent in total and how many ACKs has Host B sent in total? What are their sequence numbers? Answer this question for all three protocols. The previous expert did the wrong question and the answer was incorrect. The 3rd packet is lost not the 2nd packet
Calculate the total time required to transfer a 1.5-MB file in the following cases, assuming an RTT of 80 ms, a packet size of 1 KB and an initial 2 x RTT of "hand- shaking" before data is sent. (b) The bandwidth is 10 Mbps, but after we finish sending each data packet we must wait one RTT before sending the next. (c) The link allows infinitely fast transmit, but limits bandwidth such that only 20 packets can be sent per RTT. (d) Zero transmit time as in (c), but during the first RTT we can send one packet, during the second RTT we can send two packets, during the third we can send four = 23-1, and so on.
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.
as a possible congestion control mechanism in a subnet using virtual circuits internally, a router could refrain from acknowledging a received packet until (1) it knows its last transmission along the virtual circuit was received successfully and (2) it has a free buffer. for simplicity, assume that the routers use a stop-and-wait protocol and that each virtual circuit has one buffer dedicated to it for each direction of traffic. if it takes 7 sec to transmit a packet (data or acknowledgement) and there are n routers on the path, what is the rate at which packets are delivered to the destination host? assume that transmission errors are rare and that the host-router connection is infinitely fast.
1. What is the difference between packet fragmentation (i.e., at network layer) and frame frag- mentation (i.e., at link layer) in terms of purpose? 2. Suppose that host A is connected to a router R1, R1 is connected to another router, R2, and R2 is connected to host B. Suppose that a TCP message that contains 800 bytes of data and 20 bytes of TCP header is passed to the IP function at host A for delivery to B. Show the Total length, DF, MF, and Fragment offset fields of the IP header in each packet transmitted over the three links. (Assume that link A-R1 can support a maximum frame size of 1024 bytes including a 14-byte frame header, link R1-R2 can support a maximum frame size of 512 bytes, including an 8-byte frame header, and link R2-B can support a maximum frame size of 432 bytes including a 12-byte frame header.) (*hint: the Fragment offset field is denominated by 8-bytes, not bytes) 3. What is the purpose of the path MTU discovery process (see textbook Figure 5-42) and why does…
To ensure the quality of service, especially for multiple applications, regulating the rate at which packets are sent to the network is an important strategy. The leaky bucket is just one of such mechanisms. A flow of packets is said to conform to the leaky bucket specification (r, b), where r is the average rate and b is the burst rate, if the number of packets arriving at the leaky bucket is less than r*t + b in every time interval of t. What is the implication of that? What will happen if the number of packets arriving at the leaky bucket is equal to or greater than r*t + b?
2. Consider a slotted TDM hierarchical network in which there are 8 computers sharing a 10 Mbps channel to a router R1, sending packets to R1 which must all be forwarded by R1 over an outgoing link (called the MAN link), as shown in Figure 1. Computers A-H always have packets waiting to be sent, so no timeslot on the shared LAN is idle. Ignore the propagation delay on the LAN. The MAN link outgoing from R1 is a 100 Mbps link. The network layer protocol in use has a PDU with exactly 40 bytes of header and exactly 200 bytes of payload (SDU). The DLC layer protocol in use on the LAN has a PDU with exactly 40 bytes of header and 20 bytes of trailer. The DLC layer protocol in use on the outgoing link from R1 has a PDU with 40 bytes of header and no trailer. The physical layer does not impose any bit overhead in either channel. Use 1 Mbps = 1000000 bps. B D E F G H R1 R2 Figure 1 (a) What is the transmission delay of a bit for Computer A? (b) What is the transmission delay of a DLC PDU for…
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.
A workstation uses the HTTP protocol to download a large file from a web server. No proxy server is used. One router's queue is full when one of the web server's packets arrives.Select the four best statements to describe this situationa. The router stores the packet until such time that it can be sent.b. Further packets sent by the server are transmitted at a higher rate to compensate for the lost packet.c. The router sends an ICMP link congested message to the server.d. The packet must be retransmitted.e. Router configuration and network behavior could be improved by configuring FQ or WFQ.f. Further packets sent by the server are transmitted at a lower rate to reduce the load on the congested link.g. Router configuration and network behavior could be improved by configuring RED or WRED.h. A tail drop will happen.
Consider a router that interconnects three subnets: Subnet 1, Subnet 2, and Subnet 3. Suppose all of the interfaces in each of these three subnets are required to have the prefix 223.10.128/24. Also suppose that Subnet 1 is required to support at least 50 interfaces, Subnet 2 is to support at least 100 interfaces, and Subnet 3 is to support at least 12 interfaces. Provide three network addresses (of the form a.b.c.d/x) that satisfy these constraints.