In a LAN environment if a host wants to learn the MAC address of a specific host

Question

In a LAN environment if a host wants to learn the MAC address of a specific host, what does it have to do to achieve it? 29. What is CIDR and what are the key problems it solves in the Internet? 30. What are the agencies in USA, Europe and Japan that provide Autonomous Systems/Network IDs/Addresses to ISP? 31. What are different types of ICMP codes and their description? 32. What is the concept of Source Routing? 33. What is the concept of static routing? 34. When does Route Convergence mean? 35. What is the disadvantage of flooding in a network and what carn done to avoid it? 36. Is there any port number associated with BGP? What are the port numbers associated with RIP and BGP? What are the output of routing table in a host or in a router? What is Bellman-Ford Equation For Shortest Path Algorithm? 37. 38. 39.

Explanation / Answer

28.

If you are on a Windows operating system machine, open a command prompt (Start--->Run--->cmd), ping the target machine so you have made contact with it, and then issue the command "arp -a "to view your local ARP table, which will list IP addresses and their corresponding MAC addresses.

On linux Machine : install the arp-scan utility, and then from a command line you can ask for a scan of your network .

29.Classless inter-domain routing (CIDR) is a part of Internet protocol (IP) standards and is used to create unique identifiers for networks and individual nodes . The IP addresses allow particular information packets to be sent to specific node computers. CIDR is an effecient alternative solution for IP subnetting.

30. The "Internet Assigned Numbers Authority (IANA)" is a department of ICANN, a nonprofit private American corporation that oversees global IP address allocation, autonomous system number allocation.

Japan's Internet industry is characterized by voluntary self-regulation. There is no independent internet regulatory commission in Japan. The Ministry of Internal Affairs and Communications (MIC) oversees the telecommunications, Internet, and broadcast sectors.

31.

ICMP codes are internet control message protocol (ICMP) has many messages that are identified by a "type" field.

Example : Type 0 — Echo Reply , Type 1 — Unassigned , Type 3 — Destination Unreachable [ Please Read RFC 792]

32.

In networking of computers, source routing, allows a sender of a packet to partially or completely specify the route that the packet takes through the network. In contrast, in non-source routing protocols, routers in the network determine the path based on the packet's destination(mentioned in packet header)

33.

Unlike Dynamic routing, static routing is not a routing protocol; instead, it is the manual configuration and selection of a network route, usually managed by the network administrator. It is employed in scenarios where the network parameters and environment are expected to remain constant. Static routing is only optimal in a few situations.

34.

Convergence is an essential part of the routing table updation process. When any link fails or changes, updates are sent across the network that describe changes in the network topology. Each router then runs a assigned routing algorithm to recompute routes and build new routing tables based on this information

35.

Flooding is a simple computer network routing algorithm in which every incoming packet is sent through every outgoing link except the one it arrived on. Each node act as transmitter and reciever . Following problems are encountered in flooding

1. Duplication of packets

2. Wastage of resources like bandwidth

3. Network reliability suffers

To avoide that "Selective flooding" and " hope count " can be adopted .

36.

Yes, When BGP runs over TCP then it requires a port number , which is 179

37.

BGP uses TCP port 179

RIP uses UDP port 520

38.

In general routing table outputs following informations

1. list of routes

2. destination subnet for each route

3. subnet mask for each subnet

4. next-hop/exit interface.

39. Bellman - Ford Algorithm for shortest path

In a given graph start with "source vertex " and Calculate shortest distance using follwing equation

Do following for each edge a-b
If dist[b] > dist[a] + weight of edge ab, then update dist[b]

.dist[b] = dist[a] + weight of edge ab

Related Questions

Navigate

• Browse (All)
• Browse I
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.