0
How does a packet from one LAN node find its way to a recipient on the same LAN?
Wiki User
∙ 15y ago
If you have a hub then the packet is sent to every computer, and only the right computer will read it. The rest just quietly ignore it. Obviously this poses a major security risk.
If its a switch then the switch has a table which tells it which address matches which port. So when the packet arrives, the switch checks the destination address then it goes to the table and gets the corresponding port and then sends the packet accordingly.
A router works similarly enough. Except a router can do alot more complex operations.
Wiki User
∙ 15y ago
Add your answer:
Earn +20 pts
What is the difference between nonadaptive and adaptive routing algorithms?
Adaptive Routing Algorithm: These algorithms change their routing decisions to reflect changes in the topology and in traffic as well. These get their routing information from adjacent routers or from all routers. The optimization parameters are the distance, number of hops and estimated transit time. This can be further classified as follows: Centralized: In this type some central node in the network gets entire information about the network topology, about the traffic and about other nodes. This then transmits this information to the respective routers. The advantage of this is that only one node is required to keep the information. The disadvantage is that if the central node goes down the entire network is down, i.e. single point of failure.Isolated: In this method the node decides the routing without seeking information from other nodes. The sending node does not know about the status of a particular link. The disadvantage is that the packet may be send through a congested route resulting in a delay. Some examples of this type of algorithm for routing are:Hot Potato: When a packet comes to a node, it tries to get rid of it as fast as it can, by putting it on the shortest output queue without regard to where that link leads. A variation of this algorithm is to combine static routing with the hot potato algorithm. When a packet arrives, the routing algorithm takes into account both the static weights of the links and the queue lengths.Backward Learning: In this method the routing tables at each node gets modified by information from the incoming packets. One way to implement backward learning is to include the identity of the source node in each packet, together with a hop counter that is incremented on each hop. When a node receives a packet in a particular line, it notes down the number of hops it has taken to reach it from the source node. If the previous value of hop count stored in the node is better than the current one then nothing is done but if the current value is better then the value is updated for future use. The problem with this is that when the best route goes down then it cannot recall the second best route to a particular node. Hence all the nodes have to forget the stored informations periodically and start all over again.Distributed: In this the node receives information from its neighbouring nodes and then takes the decision about which way to send the packet. The disadvantage is that if in between the the interval it receives information and sends the paket something changes then the packet may be delayed. Non-Adaptive Routing Algorithm: These algorithms do not base their routing decisions on measurements and estimates of the current traffic and topology. Instead the route to be taken in going from one node to the other is computed in advance, off-line, and downloaded to the routers when the network is booted. This is also known as static routing. This can be further classified as: Flooding: Flooding adapts the technique in which every incoming packet is sent on every outgoing line except the one on which it arrived. One problem with this method is that packets may go in a loop. As a result of this a node may receive several copies of a particular packet which is undesirable. Some techniques adapted to overcome these problems are as follows:Sequence Numbers: Every packet is given a sequence number. When a node receives the packet it sees its source address and sequence number. If the node finds that it has sent the same packet earlier then it will not transmit the packet and will just discard it.Hop Count: Every packet has a hop count associated with it. This is decremented(or incremented) by one by each node which sees it. When the hop count becomes zero(or a maximum possible value) the packet is dropped.Spanning Tree: The packet is sent only on those links that lead to the destination by constructing a spanning tree routed at the source. This avoids loops in transmission but is possible only when all the intermediate nodes have knowledge of the network topology.Flooding is not practical for general kinds of applications. But in cases where high degree of robustness is desired such as in military applications, flooding is of great help.Random Walk: In this method a packet is sent by the node to one of its neighbours randomly. This algorithm is highly robust. When the network is highly interconnected, this algorithm has the property of making excellent use of alternative routes. It is usually implemented by sending the packet onto the least queued link.
In binary tree what is the name given to node that share the same parent node?
Sibling.
What does a bridge do when it receives a packet that is destined for a system on the same network segment from which the packet arrived?
jamaican
What part of the wave stays at the same place?
The node.
A packet of butter is it the same as a tablespoon of butter?
No.
What is the icd code for reactive lymph node?
A reactive lymph node is the same as an enlarged lymph node. Lymph nodes can become enlarged for a variety of reasons, most of which aren't serious. The ICD code for a reactive lymph node is 785.6.
The Indian people who most successfully adapted to the European incursion were the coastal tribes like the powhatans who first encounter English colonizers?
i have the same packet to do, and you should be doing the reaserch yourself. i have the same packet to do, and you should be doing the reaserch yourself. i have the same packet to do, and you should be doing the reaserch yourself.
Difference between packet switching and message switching by table format?
In Packet switching the packetss are stored and forwarded from primary storage (RAM) while in Message switching the message are stored and relayed from seconadary storage (disk). In Packet switched network data are transmitted in discrete units of potentially variable length blocks called packets, while in Message switching mecahnism a node recives a message stores it until the apporiarate route is free, then sends it along. Message switching sends data units that can be of any length. Packetswitching has a maximum packet size. Any message longer than that is splitup into multiple packets.
What is the 'ringing' sound you hear when you call someone - is it the same 'ring' the recipient hears?
The sound you hear is just a tone meant to indicate that your call is going through. It is not the same as the one the recipient hears.
Receives a packet that is destined for 192.168.1.4 How will router treat the packet?
the router will enqueue the packet that is sent to the destination 192.168.1.4.and then that packet is sent on transmission media(cable).it checks every ip address that is holding the ip same as the destination ,if it reaches there then it deleiver it on that machine.
How does Venus transit the Sun?
sun Venus and earth are coming in the same node
Is one packet of certo the same as one bottle?
You make no sense.
