First In First Out (FIFO): FIFO scheduling is a type of container used to perform FIFO operation in data items. The process of removing an element from the FIFO queue returns the element that has been in the queue for longer time. For example, consider people standing in the line to pay cash in a bank. Here, based on a first-in-first-out operation the person who is standing first will serve first. Priority: Priority scheduling is another type of queue in which each item contains “priority” related with it. The process of removing an element from the priority queue returns the item with the highest priority. For example, consider people standing in the line to buy a coupon ticket in a shopping mart. Here, each person assigned a priority based on their customer review point, so the person with highest priority serves first, apart from order of arrival. Round Robin (RR): Round robin is a preemptive algorithm . It is used to process each job based on the predetermined time slice called time quantum It helps to share the CPU (Central Processing Unit) equally for all jobs. The jobs in the READY queue are processed in the order in which it arrives for the required amount of time quantum and place the job to the end of the queue when the job processing is not completed. Weighted Fair Queuing (WFQ): Weighted Fair Queuing is an algorithm which has information of queuing process related to data packets in the network. It is also termed as Packet-by-Packet network because all the packets are scheduled on after the other.

Question

Want to see the full answer?

Answer 1

Question

Chapter 4, Problem R14RQ

Program Plan Intro

First In First Out (FIFO):

FIFO scheduling is a type of container used to perform FIFO operation in data items.

The process of removing an element from the FIFO queue returns the element that has been in the queue for longer time.

For example, consider people standing in the line to pay cash in a bank.

Here, based on a first-in-first-out operation the person who is standing first will serve first.

Priority:

Priority scheduling is another type of queue in which each item contains “priority” related with it.

The process of removing an element from the priority queue returns the item with the highest priority.

For example, consider people standing in the line to buy a coupon ticket in a shopping mart.

Here, each person assigned a priority based on their customer review point, so the person with highest priority serves first, apart from order of arrival.

Round Robin (RR):

Round robin is a preemptive algorithm.

It is used to process each job based on the predetermined time slice called time quantum

It helps to share the CPU (Central Processing Unit) equally for all jobs.

The jobs in the READY queue are processed in the order in which it arrives for the required amount of time quantum and place the job to the end of the queue when the job processing is not completed.

Weighted Fair Queuing (WFQ):

Weighted Fair Queuing is an algorithm which has information of queuing process related to data packets in the network. It is also termed as Packet-by-Packet network because all the packets are scheduled on after the other.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

A frame containing http request is sent from Computer (A) [in whichever subnet it is now, make sure to show it in your figure], to the access point it is associated with. Draw the address fields (1, 2, and 3) of the frame travelling from Computer A to AP and the source and destination addresses of the frame travelling from AP to R1. The MAC addresses of AP1, AP2, and AP3 are M1, M2, and M3 respectively, and the Router R1’s MAC address connected to this Switch/AP is MRA. IP address values are already given, and the port addresses could also be used as given. The Router’s MAC address facing WAN side is MRW.

3. Consider the M/M/1 queue discussed in class. Assume that packets arrive to a queue with average arrival rate A [pkts/s]. The average service rate of the queue is denoted by u [pkts/s]. (a) Write expressions for: (i) the mean time between packet arrivals to the queue, i.e., the average inter-arrival time; and (ii) the mean service time, i.e., the average time needed to transmit a packet onto the outgoing link. (b) Let N denote the number of packets in the system in steady-state. Suppose A = 850 and u 1000. Find the smallest value of B such that P(N > B) < e = 10¬4. Hint: Use MATLAB or some other computational tool (you could even use an Excel spreadsheet) to test different values of B. 4. Consider the M/M/1 queue from Problem 3. (a) Find an expression for E[N], i.e., the average number of packets in the system in steady- state. For the values of A and µ specified in Problem 4(b), compute the value of E[N]. What happens when A→ µ? (b) Find an expression for Var[N], i.e., the variance…

3. Consider the M/M/1 queue discussed in class. Assume that packets arrive to a queue with average arrival rate A [pkts/s]. The average service rate of the queue is denoted by u [pkts/s]. (a) Write expressions for: (i) the mean time between packet arrivals to the queue, i.e., the average inter-arrival time; and (ii) the mean service time, i.e., the average time needed to transmit a packet onto the outgoing link. (b) Let N denote the number of packets in the system in steady-state. Suppose A and u = 850 %3D 1000. Find the smallest value of B such that P(N > B) < € = 10-4. Hint: Use MATLAB or some other computational tool (you could even use an Excel spreadsheet) to test different values of B.