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: In a multiaccess processing environment, what are the limits on the volume of data that can be…

A: Covert Channel

Q: Consider a word-based, four-way set associative cache with 64 bits. Each line has eight words, and…

A: We are given a question based on set associative cache where it is mentioned that the cache is…

Q: Calculate the block number of the main memory for the address 722542 (decimal).

A: Answer:The block number of the main memory is 5645.

Q: Explicit Congestion Notification (ECN) as defined in RFC 3168 requires one bit to indicate whether…

A: Explicit Congestion Notification Explicit Congestion Notification is an augmentation of the…

Q: S. The com ple per proc 6 bytes. If - size suppe be 128 pet

Q: in the case of blockchain a routing security violation can happen if : if the CPU has more…

A: Routing attacks are major security concern in the blockchain technology security. Blockchain depends…

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: If SS = 3500H and the SP is FFFEH, What is the range of physical addresses if CS = FF59?

A: The range of physical addresses

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

Q: For a physically Indexed L1D cache, what is the average read latency if TLB hit rate is 99.5% and…

A: It is defined as a high-speed memory, which is small in size but faster than the main memory (RAM).…

Q: Consider a paging system with the following: Physical memory= 32 bytes. Page size=4 bytes. Page…

A: Page size = 4B. So page offset = 2 bits. The offset for physical and virtual address is same. A)…

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: : Congestion Notification (ECN) as define equires one bit to indicate whether the e are FCN canable…

A: Introduction: Below Explicit Congestion Notification (ECN) as defined in RFC 3168 requires one bit…

Q: Consider a direct mapped cache that consists of 256 blocks where each block has 16 bytes. Suppose we…

A: A certain main memory block could only map to a specific line of cache in the event of direct…

Q: COMPUTER NETWORKS What protocol(s) and layer(s) are available to handle the issue of data collision…

A: The question is to write the name of the protocol and layer used to handle collision and whether it…

Q: COMPUTER NETWORKS What protocol(s) and layer(s) are available to handle the issue of data collision…

A: When many senders: Access the same media at once, data collision occurs. What specific protocol(s)…

Q: Consider a word-based, four-way set associative cache with 64 bits. Each line has eight words, and…

A: INTRODUCTION: The cache is a tiny chunk of memory that is physically closer to the CPU than RAM.…

Q: Consider a word-based, four-way set associative cache with 64 bits. Each line has eight words, and…

A: Consider a word-based, four-way set associative cache with 64 bits. Each line has eight words, and…

Q: COMPUTER NETWORKS What protocol(s) and layer(s) are available to handle the issue of data collision…

A: Answer is

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: Which of the following is a drawback of using larger page size in demand paging? Select one: O A.…

A: 1. Because of larger page size if any processes wants small amount of memory then the remaining…

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: Explicit Congestion Notification (ECN) as defined in RFC 3168 requires one bit to indicate whether…

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: Consider a word-based, four-way set associative cache with 64 bits. Each line has eight words, and…

A: The CPU's small cache is closer to the CPU than the RAM because it is a CPU component. The CPU…

Q: A system that uses a two-level page table has 212 - byte pages and 32 - bit virtual addresses. The…

A: In a two-level paging system, the virtual address is divided into multiple parts, including index…

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

Q: 1. For a 16-word cache, consider the following repeating sequence of lw addresses (given in…

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: 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: I was wondering what the possible dangers of using the SSTF disc scheduling technique would be.

A: Scheduling method for SSTF discs: Shortest Seek Time First, or SSTF, is a It is advantageous and…

Q: Suppose we have a byte-addressable computer using fully associative o 20-bit main memory addresses…

A: Actually, 1 byte =8 bits. cache memory is a fast access memory.

Q: Assume you have a small virtual address space of size 2048 KB, and that the system uses paging, but…

A: Below is the answer to the above question. I hope this will meet your requirement.

Q: This question is about physical addressability in a system that uses paging. Let's say we have a…

A: In a system using paging, the virtual address space is divided into fixed-size pages, and the…

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: In a page addressing system of 10 bits, where four bits are used for the page number, what would be…

A: A page is contiguous virtual memory which is smallest unit to store data in memory management…

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

When a Page Fault is encountered during a Virtual Address translation to Physical Address, either only hardware or only software can be used to handle the page fault. O True O False
The overhead required to read an entry in a page table (including the time to access TIB) is 60 nanoseconds. To reduce this overhead, the computer has a TIB that can hold 16 entries and be accessed in 10 nanoseconds.a) Let B = TLB lookup time, T - memory cycle time, and p = hit ratio. Finda formula that expresses the effective access time.b) What hit ratio is needed to reduce the effective access time to 70 nanoseconds?
In a computer system, the physical address space is 32 bits. The size of the pages is 4 KB. The maximum size of the page table of a process is 72 MB. Each table entry of page contains 2 permission bit,1 valid bit, 1 dirty bit along with the translation bits. What is the length of the virtual address supported by the given computer system? (answer in bits)
Consider a disk queue with requests for I/O to blocks on cylinders 98, 183, 37, 122, 14, 124, 65, 67. Suppose SSTF disk scheduling algorithm implemented to meet the requests then the total number of head movements are if the disk head is initially at 53.
Consider a system with 36-bit virtual addresses, 32-bit physical addresses, and 4KB pages. The Translation Look aside Buffer (TLB) system uses a page table to translate virtual addresses to physical addresses; each page table entry include dirty (D) and resident (R) bits. 8. Virtual Page Number (VPN) Valid Bit (V) Dirty Bit (D) PPN(Physical Page Number) Tag 00000A. in HEX 0000A a) Assuming a flat page table, what is the size of each page table entry, and how many entries does the page table have? b) If you changed the system to use 1KB pages instead of 4 KB pages, how would the number of entries in the page table change? Please give the ratio of the new size to the old size. c) For page size of 4KB, the contents of the page table and TLB are shown to the right. The page table uses an LRU replacement policy, and the LRU page (shown below) will be chosen for replacement. For each of these four accesses, compute its corresponding physical address and indicate whether the access causes a…
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?
A system has 4-kB pages, a 48-bit virtual address space, and a 33-bit physical address space. Assuming that page tables contain only physical page numbers--that is, no meta-data--that it is implemented as a simple lookup table, and that physical page numbers are packed into the smallest number of 8-bit bytes that can hold them (there may be wasted bits at each entry), how many bytes of memory are required to hold the entire page table? Please enter your answer in bytes.
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
Describe one of the potential cache protocols and how it operates.
Consider a system with 8192 byte pages, a page table entry (PTE) size of 8 bytes, 40-bit virtual addresses, and 56-bit physical addresses. Considering the size you calculated in the last question, is it realistic to use a single page table in the real world? Explain why or why not. A- BI U - How many PTES could fit on a single page? Answer: How many levels of page tables would you need, if you ensure that each (smaller) page table fits on a page. Answer: Explain how you arrived at your answer for the previous question.