atch each graceful degradation technique with its best description Returning an error rather than processing a request so that the request's load doesn't overload the server Contract between customer and service provider for allowed v rate of usage, so that service can reject requests and provision only for the limit Using CPU used by requests rather than queries per second to account for the variable cost to process a request A. Network QoS B. Load Shedding Mechanism for tracking quota enforcement, where units are v added to a pool at regular interval up to a limit, and requests pull must pull from the pool to be processed C. Query Cost D. LIFO Delaying or rejecting a request at the client to prevent server- side rejection load from overwhelming the server E. Quotas F. Token Bucket Assigning a priority to packets and dropping packets in reverse priority order when the network is overloaded G.Criticality H. Client Side Throttling Field on the request indicating relative priority for a service's v stream of requests, to drop the lowest priority requests when the service / server is overloaded Processing the most recently received request first, rather than v first request received, to ensure the process requests are most likely to still be relevant and create value

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question

Match the following

Match each graceful degradation technique with its best description
Returning an error rather than processing a request so that the
request's load doesn't overload the server
Contract between customer and service provider for allowed
v rate of usage, so that service can reject requests and provision
only for the limit
Using CPU used by requests rather than queries per second to
account for the variable cost to process a request
A. Network QoS
B. Load Shedding
Mechanism for tracking quota enforcement, where units are
v added to a pool at regular interval up to a limit, and requests
pull must pull from the pool to be processed
C. Query Cost
D. LIFO
Delaying or rejecting a request at the client to prevent server-
side rejection load from overwhelming the server
E. Quotas
F. Token Bucket
Assigning a priority to packets and dropping packets in reverse
priority order when the network is overloaded
G.Criticality
H. Client Side Throttling
Field on the request indicating relative priority for a service's
v stream of requests, to drop the lowest priority requests when
the service / server is overloaded
Processing the most recently received request first, rather than
v first request received, to ensure the process requests are most
likely to still be relevant and create value
Transcribed Image Text:Match each graceful degradation technique with its best description Returning an error rather than processing a request so that the request's load doesn't overload the server Contract between customer and service provider for allowed v rate of usage, so that service can reject requests and provision only for the limit Using CPU used by requests rather than queries per second to account for the variable cost to process a request A. Network QoS B. Load Shedding Mechanism for tracking quota enforcement, where units are v added to a pool at regular interval up to a limit, and requests pull must pull from the pool to be processed C. Query Cost D. LIFO Delaying or rejecting a request at the client to prevent server- side rejection load from overwhelming the server E. Quotas F. Token Bucket Assigning a priority to packets and dropping packets in reverse priority order when the network is overloaded G.Criticality H. Client Side Throttling Field on the request indicating relative priority for a service's v stream of requests, to drop the lowest priority requests when the service / server is overloaded Processing the most recently received request first, rather than v first request received, to ensure the process requests are most likely to still be relevant and create value
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY