Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
Q. What is Internet Routing Hierarchy?
So how do packets find their way across Internet? Does every computer connected to Internet know where other computers are? Do packets basically get 'broadcast' to each computer on the Internet? Answer to both the preceding questions is 'no'. No computer knows where any of the other computers are and packets don't get sent to each computer. Information used to get packets to their destinations is contained in routing tables kept by every router connected to Internet.
Routers are packet switches. A router is typically connected between networks to route packets between them. Each router knows about its sub-networks and which IP addresses they use. Router usually doesn't know what IP addresses are 'above' it. Examine the figure below. Black boxes connecting backbones are routers. Larger NSP backbones at the top are connected at a NAP. Under them are various sub-networks and under them, more sub-networks. At bottom are two local area networks with computers attached.
Figure: Routes Connecting in Network
When a packet arrives at a router, router examines IP address put there by IP protocol layer on originating computer. Router checks its routing table. If network containing IP address is found, packet is sent to that network. If network comprising IP address isn't found, then router sends the packet on a default route, usually up backbone hierarchy to the next router. Confidently subsequent router will know where to send packet. If it doesn't, again packet is routed upwards till it reaches a NSP backbone. Routers connected to NSP backbones hold the largest routing tables and here packet would be routed to correct backbone, where it will begin its journey 'downward' through smaller and smaller networks till it finds its destination.
In a particular exchange during busy hour 1200 calls were offered to a group of trunks, during this time 6 calls were lost. The average call duration being 3 minutes Calculate
General principles of pruning: The general principles are such that: 1. Given a node N that can be chosen by player one, thus if there is another node, X, along any path,
how ant solve TSP
Syntax of $display and $strobe - $display ("format_string", par_1, par_2, ... ); - $strobe ("format_string", par_1, par_2, ... ); - $monitor ("format_string", par_1, p
Determine the Uses of memory blocks. Not as common a technique though something to consider. As Verilog has a very convenient syntax for declaring and loading memories, you ca
Define Constraints Constraints can be defined as Preconditions (input values) and Post Conditions (output values). Preconditions on functions are constraints which input value
What is the use of cache memory? The use of the cache memories solves the memory access problem. In certain, when a cache is included on the same chip as the processor, access
zmax=7.5x1-3x2 subject to constraints 3x1-x2-x3>=3 x1-x2+x3>=2 x1,x2,x3>=0
Define Deadlock with Resource request and allocation graph (RRAG) Deadlocks can be described through a directed bipartite graph termed as a RRAG that is Resource Request All
what is depth buffer algorithm?
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!
whatsapp: +1-415-670-9521
Phone: +1-415-670-9521
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd