An ISP is granted a block of addresses starting with 180.100.0.0/16. The ISP needs to distribute these addresses to four groups(A,B,C,D) of customer as follows: The group 'A' has 32 customers; each needs 256 addresses. The second 'B' group has 128 customers; each needs 128 addresses. 1) ii) iii) iv) The third 'C' group has 128 customers; each needs 64 addresses. The Fourth 'D' group has 32 customers; each needs 32 addresses. Design the Network of ISP for both IPv4 and IPv6(you can choose IPv6 addresses as own) according to above conditions and find out how many addresses are still available after these allocations. Analysis network performance for both networks and take a decision which one is the best.

An ISP is granted a block of addresses starting with 180.100.0.0/16. The ISP needs to distribute these addresses to four groups(A,B,C,D) of customer as follows: The group 'A' has 32 customers; each needs 256 addresses. The second 'B' group has 128 customers; each needs 128 addresses. 1) ii) iii) iv) The third 'C' group has 128 customers; each needs 64 addresses. The Fourth 'D' group has 32 customers; each needs 32 addresses. Design the Network of ISP for both IPv4 and IPv6(you can choose IPv6 addresses as own) according to above conditions and find out how many addresses are still available after these allocations. Analysis network performance for both networks and take a decision which one is the best.

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

Similar questions

Design a PDA for a^n b^m | m>n and value of n>0
* Problem 2: create an HTML <iframe> element for the given url. * * An iframe hosts one web page within another. Here is how we might use HTML * to use an iframe: * * <iframe src="https://web222.ca" height="500"></iframe> * * Our <iframe> has two attributes: * * - src: the URL to a web page * - height: the height to use (in pixels) when showing the iframe * * Write the createIframe() function to accept a URL and height, and return the * properly formatted iframe tag. For example: * * createIframe('https://web222.ca', 500); * * should return the following string of HTML: * * '<iframe src="https://web222.ca" height="500"></iframe>' * * A <iframe> can also optionally contain an `allowfullscreen` attribute, * which tells the browser that it's OK for the iframe to expand to fill * the whole screen
The known unsorted sequence is as follows, [170, 45, 75, 90, 802, 2, 24, 66], if the sorting process of LSD is adopted, which of the following is correct? (multiple choice questions)
00000000 <main>: 0: lea 0x4(%esp),%ecx 4: and $0xfffffff0,%esp 7: pushl -0x4(%ecx) a: push %ebp b: mov %esp,%ebp d: push %ebx e: push %ecx f: sub $0x10,%esp 12: mov %ecx,%ebx 14: movl $0x0,-0xc(%ebp) 1b: movl $0x1,-0x10(%ebp) 22: jmp 48 <main+0x48> 24: mov -0x10(%ebp),%eax 27: lea 0x0(,%eax,4),%edx 2e: mov 0x4(%ebx),%eax 31: add %edx,%eax 33: mov (%eax),%eax 35: sub $0xc,%esp 38: push %eax 39: call 3a <main+0x3a> 3e: add $0x10,%esp 41: add %eax,-0xc(%ebp) 44: addl $0x1,-0x10(%ebp) 48: mov -0x10(%ebp),%eax 4b: cmp (%ebx),%eax 4d: jl 24 <main+0x24> 4f: mov -0xc(%ebp),%eax 52: lea -0x8(%ebp),%esp 55: pop %ecx 56: pop %ebx 57: pop %ebp 58: lea -0x4(%ecx),%esp 5b: ret Command line arguments are passed to int main(int argc, char** argv) as arguments argc and argv. You should…
Consider the following BNF: < expr > < expr > + < expr > | < expr > * < expr > | (<expr>) | <digit> <digit> 0| 1|2|3…….|9 What are the terminals and non-terminals?
Note: Please answer in C++ Code An input string S of length N is transferred through the network using a special protocol. The protocol can send the string through a series of operations. In one operation, we can choose a lowercase english alphabet and do one of the following: Transfer 1 copy of C through the network. Transfer 2 copies of C through the network. Each of the above transfers take 1 unit of time. Find the minimum time in which we can transfer the entire string S through the network. Input 1 5 cbcdc Output 5
Please write code n C. and use the alphabet Producer – Consumer as a classical problem of synchronization Step 2. Write a program* that solves the producer - consumer problem. You may use the following pseudo code for implementation. *program to write: produce -consumer problem to produce and consume the alphabet. //Shared data: semaphore full, empty, mutex; //pool of n buffers, each can hold one item //mutex provides mutual exclusion to the buffer pool //empty and full count the number of empty and full buffers //Initially: full = 0, empty = n, mutex = 1 //Producer thread do { ... produce next item ... wait(empty); wait(mutex); ... add the item to buffer ... signal(mutex); signal(full); } while (1); //Consumer thread do { wait(full) wait(mutex); ... remove next item from buffer ... signal(mutex); signal(empty); ... consume the item ... } while (1);
Exercise: A computer has 4 frames. Page size is 2KB (2048). The loaded time, the R and M bits for each page are shown below Page Frame Loaded time M R 11 1 15 3 13 4 5 5 7 6. 3 3 Question: compute the physical address of the following virtual address a) 1000 using FIFO b) 3100 using NRU c) 3100 using LRU d) 6200 using Second chance Note: consider each case separately
A computer network that connects billions of computers throughout the world is known as the internet. "[Citation is required]" Please give a clear description of the following three components and the function each of them plays in allowing communication via the internet using the "nuts and bolts" method:
Consider the following two functions: funA: movq $0x5, %rax leaq (%rax, %rax), retq funB: movq $5, %rax addq %rax, %rax retq %rax What is true about these two functions? A. funA returns the value of memory stored at the address in rax, funB returns 10 B. funA returns the value of memory stored at the address (2*rax), funB returns 10 C. funA and funB move different immediates into rax D. funA and funB both return 5 O E. funA and funB both return 10
Example: P₁ Request (1,0,2) • First, we Check that Request true) Allocation Need Available ABC ABC ABC Available Allocation Max ABC ABC ABC P 010 753 332 Ро 010 743 230 P₁ 200 P₂302 P 211 P₁ 002 322 902 222 P₁ 302 433 P₂ 302 600 P3 211 011 P₁ 002 431 . Second, We must determine whether this new system state is safe. So, we execute our safety algorithm and find that the sequence satisfies the safety requirement. Can request for (3,3,0) by P4 be granted? no, (2,3,0) < (3,3,0) 020
Note: Please answer in C++ Code An input string S of length N is transferred through the network using a special protocol. The protocol can send the string through a series of operations. In one operation, we can choose a lowercase english alphabet and do one of the following: Transfer 1 copy of C through the network. Transfer 2 copies of C through the network. Each of the above transfers take 1 unit of time. Find the minimum time in which we can transfer the entire string S through the network. Input 1 5 cbcdc Output 5