Suppose a router has three input flows and one output link. It receives packets listed in the following table all at about the same time, in the order list a period in which the output port is busy but all queues are otherwise empty, order in which the packets are transmitted, using.
a) Generalized processor Sharing (GPS) - with flow 1 weight 2, flow 2 weight 1, and flow 3 weight 1
b) Packet by Packet Generalized processor Sharing (PGPS) and WF2Q with flow 1 weight 2, flow 2 weight 2, and flow 3 weight 1
| packet | size | flow |
|---|---|---|
| 1 | 100 | 1 |
| 2 | 100 | 1 |
| 3 | 100 | 1 |
| 4 | 100 | 1 |
| 5 | 190 | 2 |
| 6 | 200 | 2 |
| 7 | 110 | 3 |
| 8 | 50 | 3 |


Suppose a router has three input flows and one output link. It receives packets listed in...
Suppose N packets arrive simultaneously to a router at which no packets are currently being transmitted or queued. Each packet is of length L and the link has transmission rate R (simple proof is needed). 1) What is the transmission time for the last packet? Solution: 2) What is the queue delay for the 4th packet? — Solution: 3) What is the average queue delay for the first three packets? Solution: 4) What is the average transmission delay for the...
Given three packets of size 1500 bytes each are ready inside Computer 1 to be transmitted onto Link 1. Computer 1 has zero processing delay. Assume each router has zero queuing and zero processing delay. Link 1 is a 10 Mbit/sec link and 5000 km long. Link 2 is 100 Mbits/sec and is 5000 km long. Link 3 is 1000 Mbits/sec and is 5000 km long. Propagation speed is 2 × 10 8 m/s. Assume a router has to receive...
Computer Network Performance (20 Points) Suppose N packets arrive simultaneously to a router at which no packets are currently being transmitted or queued. Each packet is of length L and the link has transmission rate R (simple proof is needed). 1111 Font Family . Format B I u 1) What is the transmission time for the last packet? Solution: 2) What is the queue delay for the 4th packet? Solution: 3) What is the average queue delay for the first...
Question 6 A router has the following routing table: Destination Address Range Link Interface 123.46.56.0/22 1 123.46.56.0/23 2 123.46.56.0/24 3 Otherwise 4 The router uses longest-prefix matching. On which interface will the router send each of the following received packets: Packet 1 with a destination: 123.46.56.1 Packet 2 with a destination: 123.46.56.2 Packet 3 with a destination: 123.46.56.3 Packet 4 with a destination: 123.46.56.4
QUESTION 1 "A single router is transmitting packets, each of length L bits, over a single link with transmission rate R Mbps to another router at the other end of the link. Suppose that the packet length is L= 12000 bits, and that the link transmission rate along the link to router on the right is R = 1000 Mbps. What is the maximum number of packets per second that can be transmitted by the link (use a whole number)?"...
3. Suppose there is exactly one packet switch (or router) between a sending host and a receiving host. The transmission rates between the sending host and the switch and between the switch and the receiving host are R1 = 1Mbps and R2 = 2Mbps, respectively. Assuming that the switch uses store-and-forward packet switching, what is the total end-to-end delay to send a packet of length 18000bits? Assume that the propagation speed is 2 * 108 meters/sec, the distance between source...
PROBLEMS 591 8.2 A link with transmission rate R1 Mbi/s is used to forward packets having random size e, which is assumed to be uniformly distributed in the discrete set L [1,2,..., 100] kbyte. a) Find the mean transmission time my of a packet along the line. b) Find the probability that the transmission time of a packet is larger than 500 ms. 8.3 A link with transmission rate R, is used to forward packets having random size E, which...
Q1 Error detection/correction Can these schemes correct bit errors: Internet checksums, two-dimendional parity, cyclic redundancy check (CRC) A. Yes, No, No B. No, Yes, Yes c. No, Yes, No D. No, No, Yes E. Ho, hum, ha Q2 CRC vs Internet checksums Which of these is not true? A. CRC's are commonly used at the link layer B. CRC's can detect any bit error of up to r bits with an r-bit EDC. c. CRC's are more resilient to bursty...
I need help with this assignment, please; Programming Assignment 3: UDP Pinger Lab In this lab, you will study a simple Internet ping server written in the Java language, and implement a corresponding client. The functionality provided by these programs is similar to the standard ping programs available in modern operating systems, except that they use UDP rather than Internet Control Message Protocol (ICMP) to communicate with each other. (Java does not provide a straightforward means to interact with ICMP.)...
Design a sequential system
that has one synchronous input bit stream x and one output z, with
the following functionality and also follows the design
constrains.
Design Specifications: Design a sequential system that has one synchronous input bit stream X and one output Z, with the following functionality 1) We look at every fourth-input-bit, while the other input bits are "don't cares". when three "consecutives" fourth-bits form the sequences 110 or 000 the system should output Z = 1, meaning...