Scribd
Upload
127 views30 pages

Computer Network - CS610 Power Point Slides Lecture 27

This document discusses how computers resolve protocol addresses to hardware addresses in order to deliver packets across networks. It describes three common techniques for address resolution: table lookup, closed-form computation, and message exchange. The Address Resolution Protocol (ARP) standardizes the message format for address resolution using the message exchange approach.

Uploaded by

Ibrahim Choudary
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
127 views30 pages

Computer Network - CS610 Power Point Slides Lecture 27

This document discusses how computers resolve protocol addresses to hardware addresses in order to deliver packets across networks. It describes three common techniques for address resolution: table lookup, closed-form computation, and message exchange. The Address Resolution Protocol (ARP) standardizes the message format for address resolution using the message exchange approach.

Uploaded by

Ibrahim Choudary
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 30

COMPUTER NETWORKS

CS610
Lecture-27
Hammad Khalid Khan
Review Lecture 26
 Subnet and Classless Addressing

 Subnet/Address Mask

 CIDR Notation

 Special IP Addresses
Chapter 19

Binding Protocol Addresses


Protocol Addresses and Packet Delivery

 Protocol address are abstractions provided by software.

 Physical network hardware does not know how to locate a


computer from it protocol address.

 The protocol address of the next hop must be translated to


an equivalent hardware address before a packet can be sent.
Protocol Addresses and Packet Delivery
Address Resolution
 Mapping between a protocol address and a hardware
address is called Address Resolution.

 A host or router uses address resolution when it needs to


send a packet to another computer on the same physical
network.

 A computer never resolves the address of a computer that


attaches to a remote network.
Address Resolution
Address Resolution
 A resolves protocol address for B for protocol messages from
an application on A sent to an application on B.

 A does not resolve a protocol address for F.
– Through the internet layer, A delivers to F by routing
through R1 and R2.
– A resolves R1 hardware address.
–
 Network layer on A passes packet containing destination
protocol address F for delivery to R1.
Address Resolution Techniques
 Address resolution algorithms can be grouped into three
basic categories:

– Table lookup

– Closed-form computation

– Message Exchange
Address Resolution Techniques
 Table lookup
– Binding or mapping are stored in a table in memory, which
the software searches when it needs to resolve an
address.

 Closed-form computation
– The protocol address assigned to a computer is chosen
carefully so that computer’s hardware can be computed
from the protocol address using basic Boolean and
arithmetic operations.
Address Resolution Techniques

 Message Exchange
– Computers exchange messages across a network to
resolve an address.
– One computer sends a message that requests an address
binding (translation) and another computer sends a reply
that contains the requested information.
Address Resolution with Table Lookup

 Resolution requires a data structure that contains information


about address binding.

 A separate address binding table is used for each physical


network.

 The chief advantage of the table look up approach is


generality, a table can store the address bindings for an
arbitrary set of computers.
Address Resolution with Table Lookup

 For less than a dozen hosts, a sequential search can suffice.

 For large networks the sequential approach uses too much


CPU time.
Address Resolution with Table Lookup
Address Resolution with Table Lookup

 Two standard implementations to improve computational


efficiency:
– Hashing
– Direct Indexing
Address Resolution with Table Lookup
 Hashing
– Hashing is the transformation of a string of characters into
a usually shorter fixed-length value or a key that
represents the original string.
– Hashing is used to index and retrieve items in a database
because it is faster to find the item using the shorter
hashed key than to find it using the original value.
– It is also used in many encryption algorithms.
Address Resolution with Table Lookup

 Direct Indexing
– Less generally known technique.
– Possible only in cases where protocols addresses are
assigned from a compact range.
Address Resolution with Table Lookup
Address Resolution with
Closed-Form Computation
 For networks use configurable addressing it is possible to
choose an address that make closed-form address resolution
possible.

 A resolver is used to compute a mathematical function that


maps an IP address to a hardware address.
Address Resolution with
Closed-Form Computation
 When a computer connects to a network that uses
configurable address, the local network administrator must
choose a hardware address as well as an IP address.

 The two values can be chosen to make address resolution


trivial.
Address Resolution with
Closed-Form Computation
 Example:- Suppose a configurable network number:
220.123.5.0 / 24
– The IP address of first host = 220.123.5.1
Hardware Address = 1
– The IP address of second host = 220.123.5.2
Hardware Address = 2
Address Resolution with
Closed-Form Computation
Hardware Address = 101
The IP address of router = 220.123.5.101
A single Boolean ‘and’ operation can compute the computer’s
hardware address i.e.
Hardware address = ip_address & 0xff
Address Resolution with Message Exchange

 An alternative to local computations is a distributed approach.

 A computer that needs to resolve an address, sends a


message across a network and receives a reply.

 The message carries a request that species the protocol


address, and reply carries the corresponding hardware
address.
Address Resolution with Message Exchange

 Two possible designs:

– Centralized

– Distributed
Address Resolution with Message Exchange

 CENTRALIZED

– A network includes one or more servers that are assigned


the task of answering address resolution requests.

– Advantage: Resolution easier to configure, manage and


control.
Address Resolution with Message Exchange

 DISTRIBUTED
– Each computer on the network participates in address
resolution by agreeing to answer resolution request for its
address.

– Advantage: Address resolution servers can become a


bottleneck and reduce cost.
Address Resolution Summary
Address Resolution Protocol
 TCP/IP can use any of the three address resolution method
depending on the addressing scheme used by the underlying
hardware.

 To guarantee that all computers agree on the exact format


and meaning of message used to resolve addresses, the
TCP/IP protocol suite includes an Address Resolution
Protocol (ARP).
Address Resolution Protocol
 The ARP standard defines two basic message types:
 Request
– Contains an IP address and requests the corresponding
hardware address.
 Response
– Contains both the IP address sent in the request and the
hardware address.
Summary
 Address Resolution

 Address Resolution with Table Lookup

 Address Resolution with Closed-Form Computation

 Address Resolution with Message Exchange

You might also like