Task 1: Application of scheduling process in a control processor of a switch in a network System Details:- Design a system that uses a queue in a control processor of a switch in a network. A request for the establishment of a new virtual connection that arrives to the switch generates a job of type A. If that job has to wait for other jobs, it is put in a buffer. Finally, the job is executed and the connection is established. When the connection shall be taken down, a new job is generated. Some jobs have quite a long time to be processed and thus jobs with a short time which came in late need to wait quite a long time. The jobs that tear down connections (jobs of type B) have a higher priority than jobs of type A. Thus, when a job has been served, need to check if there are any jobs of type B in the buffer. If there are no jobs of type B in the buffer, the processor can start to serve jobs of type A, if there are any. Demonstrate the scheduling process of a switch in a network by using queue. Construct a program to demonstrate the problem. Calculate the average waiting time for the jobs. Task 2: Complexity Analysis - Theoretically discuss and compute the complexity of all algorithms that you implemented. The discussion will describe your understanding of the algorithm. Define the complexity of the algorithm by using Big 'O notation.
Task 1: Application of scheduling process in a control processor of a switch in a network System Details:- Design a system that uses a queue in a control processor of a switch in a network. A request for the establishment of a new virtual connection that arrives to the switch generates a job of type A. If that job has to wait for other jobs, it is put in a buffer. Finally, the job is executed and the connection is established. When the connection shall be taken down, a new job is generated. Some jobs have quite a long time to be processed and thus jobs with a short time which came in late need to wait quite a long time. The jobs that tear down connections (jobs of type B) have a higher priority than jobs of type A. Thus, when a job has been served, need to check if there are any jobs of type B in the buffer. If there are no jobs of type B in the buffer, the processor can start to serve jobs of type A, if there are any. Demonstrate the scheduling process of a switch in a network by using queue. Construct a program to demonstrate the problem. Calculate the average waiting time for the jobs. Task 2: Complexity Analysis - Theoretically discuss and compute the complexity of all algorithms that you implemented. The discussion will describe your understanding of the algorithm. Define the complexity of the algorithm by using Big 'O notation.
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
Related questions
Question
Please use
Transcribed Image Text:Task 1: Application of scheduling process in a control processor of a switch in a network
System Details:-
Design a system that uses a queue in a control processor of a switch in a network. A request for the
establishment of a new virtual connection that arrives to the switch generates a job of type A. If that job
has to wait for other jobs, it is put in a buffer. Finally, the job is executed and the connection is
established. When the connection shall be taken down, a new job is generated. Some jobs have quite a
long time to be processed and thus jobs with a short time which came in late need to wait quite a long
time. The jobs that tear down connections (jobs of type B) have a higher priority than jobs of type A.
Thus, when a job has been served, need to check if there are any jobs of type B in the buffer. If there
are no jobs of type B in the buffer, the processor can start to serve jobs of type A, if there are any.
Demonstrate the scheduling process of a switch in a network by using queue.
Construct a program to demonstrate the problem.
Calculate the average waiting time for the jobs.
Task 2: Complexity Analysis - Theoretically discuss and compute the complexity of all algorithms that
you implemented. The discussion will describe your understanding of the algorithm. Define the
complexity of the algorithm by using Big 'O' notation.
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 4 steps with 3 images
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.Recommended textbooks for you
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education