Binding Protocol Addresses - Computer Network - Lecture Slides, Slides of Computer Networks

Binding Protocol Addresses, Protocol Addresses, Packet Delivery, Address Resolution, Address Resolution Techniques, Address Resolution with Table Lookup, Direct Indexing and many other topics of Computer Network can be find in my documents.

Typology: Slides

2011/2012

Uploaded on 11/09/2012

bacha
bacha 🇮🇳

4.3

(41)

213 documents

1 / 29

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
COMPUTER
NETWORKS
Lecture-27
Docsity.com
pf3
pf4
pf5
pf8
pf9
pfa
pfd
pfe
pff
pf12
pf13
pf14
pf15
pf16
pf17
pf18
pf19
pf1a
pf1b
pf1c
pf1d

Partial preview of the text

Download Binding Protocol Addresses - Computer Network - Lecture Slides and more Slides Computer Networks in PDF only on Docsity!

COMPUTER

NETWORKS

Lecture-

Review Lecture 26

Subnet and Classless Addressing

Subnet/Address Mask

CIDR Notation

Special IP 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.

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. Docsity.com

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 R 1 and R 2.

A resolves R 1 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

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. Docsity.com

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

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

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. Docsity.com

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.

Hardware Address = 1

The IP address of second host = 220.123.5.

Hardware Address = 2