ARP and DNS both depend on caches; ARP cache entry lifetimes are typically 10 minutes, while DNS cache lifetimes are on the order of days. Justify this difference. What undesirable consequences might there be in having too long a DNS cache entry lifetime?

ARP and DNS both depend on caches; ARP cache entry lifetimes are typically 10 minutes, while DNS cache lifetimes are on the order of days. Justify this difference. What undesirable consequences might there be in having too long a DNS cache entry lifetime?

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

Related questions

Q: Suppose there is a paging system with a translation lookaside buffer. Assuming that the entire page…

Q: Offer a succinct explanation of one of the cache protocols in use.

A: Introduction Maintaining consistency between these duplicates makes an issue known as cache…

Q: nanoseconds

A: Introduction: Speed up: Cache is the fastest memory by which a computer access its data for…

Q: I'd appreciate it if you could explain the inner workings of one of the cache protocols.

A: Given: Please provide a succinct overview of one of the cache protocols. I shall talk about MESI…

Q: In a multiaccess processing environment, what are the limits on the volume of data that can be…

A: Covert Channel

Q: A given process has a page table as shown below. Assume that the page size is 2048 and that all the…

A: In virtual memory systems, a page table is a type of data structure that converts virtual addresses…

Q: ARP and DNS both depend on caches; ARP cache entry lifetimes are typically 10 minutes, while DNS…

Q: It would be really helpful if you could clarify how one of the cache protocols is supposed to be…

A: The answer to the question is given below:

Q: Consider a system where the page fault service time is 200ms, and the main memory access time is…

A: To find Effective memory access time.

Q: On a simple paging system, Translation Lookaside Buffer (TLB) holds the most active page entries and…

A: TLB is a data structure used to store page details.

Q: What is the definition of effective access time (EAT)?

A: Introduction: When we talk about 'effective access time,' we're talking about the (weighted) average…

Q: I'd appreciate it if you could describe how one of the cache protocols works on the inside.

A: The MESI protocol is a broadly utilized reserve intelligibility protocol, which represents Changed,…

Q: Summarize one of the cache protocols in a few words.

A: Give a quick summary of one of the caching protocols given. Answer: I'll talk about the MESI…

Q: In the MAC address table, a dynamic RAM is utilised to store MAC addresses. Assume the table size is…

A: INTRODUCTION: In most cases, a CPU will access memory (such as RAM) to obtain data for use in its…

Q: ARP and DNS both depend on caches; ARP cache entry lifetimes are typically 10 minutes, while DNS…

A: Address Resolution Protocol is referred to as ARP. ARP converts an IP address, such as 191.138.12.2,…

Q: Consider a cache, in which the block has 512 bytes. The main memory has a latency of 32 ns and a…

A: We are given block size of a cache and main memory latency with bandwidth. We are asked the time…

Q: A computer system has a memory access time of 11.0 ns and is using a SATA III SSD (solid state…

A: Given Data : Memory access time = 11 * 10-9 s. Data rate = 8G bit/s Page size = 1024 Bytes Allowed…

Q: Please provide a concise overview of one of the cache protocols currently in existence?

A: Cache coherence protocol results from the concurrent operation of several processors and the…

Q: Think of a 64-bit word-based 4-way set associative cache. There are 48,400 possible combinations,…

A: Performance, dependability, and security are essential factors. Network performance is affected by…

Q: It would be really helpful if you could provide an example of correct usage of one of the cache…

A: answer is

Q: Assuming a page size of 4 Kbytes and that a page table entry takes 4 bytes, how many levels of page…

Q: Memory access time = 100 ns Page fault rate = 5% Page fault overhead = 1000 ns Swap page time (in or…

A: Below is the answer to above question. I hope this will be helpful for you....

Q: Given is : Logical Address=33bit Physical Address=24bit Page Size =2KB. System is byte addressable.…

A: Given that, Number of Logical address bits= 33 Number of Physical address bits= 24 Page size= 2 kb=…

Q: describe the cache protocol

A: Cache protocol is explained below :

Q: Give a brief summary of one of the available cache protocols.

A: Introduction: A snooping protocol and a directory-based protocol are the most common methods for…

Q: 1 Given an 8-word, 2-way set associative cache, and the sequence of address accesses below, enter…

A: We are given an 8-word , 2-way set associative cache and we are asked to find out the misses for the…

Q: If a page fault occurs, the penalty incurred could be of the order of tens of thousands or even more…

A: Answer

Q: What is the effective memory access time if the memory access time is 450 ns and a page fault takes…

A: Effective access time The 'effective access time' is essentially the (weighted) average time it…

Q: A set of web browsers on the institutional network at USC generates an average of 15.0…

A: Over here given that the access link is 15mbps Generated request is 15 and each request size is 1 Mb

Q: Consider a computer system with 32-bit virtual addressing and a page size of sixty-four kilobytes.…

A: In this question, we are given virtual address and physical memory size and also page size. Page…

Q: It would be really helpful if you could clarify how one of the cache protocols is supposed to be…

A: Introduction: A set of guidelines known as a network protocol must be followed when communicating…

Q: In a few phrases, describe the cache protocol.

A: Introduction: The same datum may be stored in many repositories in multiprocessor systems with…

Q: he physical ad ze of the pages ne page table table entry of

Question

ARP and DNS both depend on caches; ARP cache entry lifetimes
are typically 10 minutes, while DNS cache lifetimes are on the
order of days. Justify this difference. What undesirable
consequences
might there be in having too long a DNS cache
entry lifetime?

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

SEE SOLUTION Check out a sample Q&A here

Step 1

VIEW

Step 2

VIEW

Step by step

Solved in 2 steps

SEE SOLUTION Check out a sample Q&A here

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.

Similar questions

Suppose the virtual address width is 32 bits. Also suppose that the virtual and physical page size is 4Kbytes. If the physical address limit is 220, what is the number of bits in the Physical frame part of the physical address?
Assume that we have a paged memory system with a cache to hold the most active page table entries. It takes 20ns to search the cache. If the page table is normally held in memory, and memory access time is lus, what is the effective access time if the hit ratio is 85%? What hit ratio will be necessary to reduce the effective memory access time to 1.1µs?
In Paging, for CPU requests there are two access times, one for accessing page table and one for physical memory accessing. How should we minimize this access time? Explain it with example and also draw the figure which helps to minimize this access time. Also, discuss the importance of minimizing the access time.
Urgent
Give a brief summary of one of the available cache protocols.
Consider a disk queue with requests for I/O to blocks on Cylinders: 98 183 37 122 14 124 65 67 Consider SSTF (shortest seek time first) scheduling, the total number of head movements is, if the disk is initially 53. Select one: a.245 b.240 c.236 d.224
ARP and DNS both depend on caches; ARP cache entry lifetimes are typically 10 minutes, while DNS cache lifetimes are on the order of days. Justify this difference. What undesirable consequences might there be in having too long a DNS cache entry lifetime?
Given a 2-way set-associative cache with 2 entries (sets) and 1 byte block size (no offset), what is the LRU value of each entry (set) after the following processor access sequence? Assume the LRU bits of both entries are set to 0 initially. Processor accesses: 10000, 10001, 11101, 11011, 11110 LRU (entry 0) = _, LRU (entry 1) = O 1,0 O 0, 0 O 0, 1 O 1, 1
Provide an overview of how one of the cache protocols really works.