Explain classless inter-domain routing, Computer Engineering

Assignment Help:

Explain Classless Inter-Domain Routing.

It is a new addressing scheme for the internet that permits for more efficient allocation of IP addresses than old class A, B and C addressing scheme. In place of being restricted to network identifier or prefixes of 8, 16, or 24 bits, CIDR at present uses prefixes wherever from 13 to 27 bits. Therefore, block of addresses can be allocated to a network as small as 32 hosts or to such with 500,000 hosts. It permits for address assignments which much more closely fit an organization's specific require.

A CIDR address contains the standard 32- bit address and also information on how many bits are utilized for the network prefix. For illustration in CIDR address 206.13.01.48/25, the /25 shows that the first 25 bits are used to recognize unique network leaving the remaining bits to identify the exact host.


Related Discussions:- Explain classless inter-domain routing

Explain about the public key cryptography, Explain about the Public Key Cry...

Explain about the Public Key Cryptography. Public Key Cryptography: It is a cryptographic system which uses two keys as a public key identified to everyone and a private

Grapgh, representation of the adjacency matrix and adjacency list

representation of the adjacency matrix and adjacency list

Define cache memory, Define cache memory? A special very high speed mem...

Define cache memory? A special very high speed memory known as a cache is sometimes used to increase the speed of processing by making current programs and data available to th

Example of processor arrangements, Q. Example of processor arrangements? ...

Q. Example of processor arrangements? !HPF$ PROCESSORS P (10) This initiates a group of 10 abstract processors assigning them combined name P. !HPF$ PROCESSORS Q (4, 4)

Explain fundamental models of inter process communication, Explain the two ...

Explain the two fundamental models of inter process communication. Two kinds of message passing system are given as: (a) Direct Communication : Along with direct communicat

What is a spanning tree, What is a spanning Tree? A spanning tree is a ...

What is a spanning Tree? A spanning tree is a tree associated with a network. All the nodes of the graph appear on the tree once. A minimum spanning tree is a spanning tree

Identify which stores most no. of bits in memory store, Which of the memori...

Which of the memories stores the most number of bits ? Ans. 5Mx8 = 5 x 220 x 8 = 40M (max).

Sites are useful to the target audience members, Normal 0 false...

Normal 0 false false false EN-IN X-NONE X-NONE MicrosoftInternetExplorer4 Select a range of a

Write a program for comparing two strings, Q. Write a program for comparing...

Q. Write a program for comparing two strings? Let's write a program for comparing two strings. Determine the following piece of code that has been written in C to compare two s

Explain busy waiting semaphores, Explain busy waiting semaphores. Weak,...

Explain busy waiting semaphores. Weak, Busy-wait Semaphores: The simplest method to implement semaphores. Useful while critical sections last for a short time, or we

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd