NETWORKING & INTERNETWORKING

Types of Networks
Network Principles
 Internet Protocols
NETWORKS IN DS

 Built from various transmission mdeia –wire

,cable,fibre & wireless channels
 Hardware devices – switches,bridges,hubs
 Software devices – protocol stacks,drivers

3/30/2019 UNIT -1 :DC 2

Basic terminology
• A communication subsystem is used to refer
to the collection of hardware and software
components that provide the communication
facilities for a distributed system.
• Hosts are used to refer to the computers and
other devices that use the network for
communication purposes.
• A node is used to refer to any computer or
switching device attached to a network.
• A subnet is a unit of routing and a collection of
nodes that can all be reached on the same
physical hardware.
3/30/2019 UNIT -1 DC 3
Network Issues
• Performance – latency and data transfer rate.
• Scalability – ability to cope with the growth of
connected hosts.
• Reliability - error detection and correction.
• Security - integrity and protection.
• Mobility – accessibility without the location
constraint.
• Quality of service – timely data transmission
without data loss.
• Multicasting – simultaneous transmission of
messages to several recipients.
3/30/2019 UNIT -1 DC 4
Performance

• Message transmission time:

latency + length/data transfer rate
(assuming no message fragmentation)
• Total system bandwidth:
Total volume of traffic that can be transferred
across the network in a given time
• Data transfer rate and the total system
bandwidth of a network depends strongly on the
network technology.
• Impact of High-Speed Networks - new design
issues
3/30/2019 UNIT -1 DC 5
Types of Networks

• Local Area Networks (LAN) :

 Ethernet: 10/100 Mbps, 1Gbps
 FDDI (Fiber Distributed Data Interface): 100Mbps
 Token Ring: 4/16 Mbps
• Wide Area Networks (WAN) :
 Big Latency (typical 100 - 500 ms)
 Typical Transfer Rate: 20 - 50 Kbps
 ISDN (Integrated Service Digital Networks)
 ATM (asynchronous transfer mode)
• Metropolitan Area Networks (MAN)
• Wireless Network: IEEE 802.11 (WaveLAN)
3/30/2019 UNIT -1 DC 6
Figure 3.1
Network types

Range Bandwidth (Mbps) Latency (ms)

LAN 1-2 kms 10-1000 1-10
WAN worldwide 0.010-600 100-500
MAN 2-50 kms 1-150 10
Wireless LAN 0.15-1.5 km 2-11 5-20
Wireless WAN worldwide 0.010-2 100-500
Internet worldwide 0.010-2 100-500

3/30/2019 UNIT -1 DC 7
Network Principles

• Packet transmission – messages are

transmitted in packets.
• Switching schemes – schemes are required to
transmit between two arbitrary nodes.
• Protocols – a well-known set of rules and
formats used for communication.
• Routing – decision where to forward the packet.
• Congestion control – control of the incoming
transfer rate.
• Internetworking – integration of subnets.
3/30/2019 UNIT -1 DC 8
Switching schemes

• Broadcast – Everything is transmitted to every

node.
• Circuit switching – Communication circuits are
built by making and breaking wire.
• Packet switching – Messages are packed in a
packet being stored and forwarded to their
destination.
• Frame relay – Switch small packets (frames) on
the fly.

3/30/2019 UNIT -1 DC 9
Protocols

• Protocol is a well known set of rules and formats

to be used for communication between
processes.
• Protocols specify both data format and the
exchange mechanism (sequence of messages).
• A protocol layer represents a layer of network
software (Fig. 3.2).
• Each layer encapsulate the data in the format
specified for that layer (Fig. 3.3).
• A complete set of protocol layers is referred to
as a protocol suite or a protocol stack.
3/30/2019 UNIT -1 DC 10
Figure 3.2
Conceptual layering of protocol software

Message sent Message received

Layer n

Layer 2
Layer 1
Sender Communication Recipient
medium

3/30/2019 UNIT -1 DC 11
Figure 3.3
Encapsulation as it is applied in layered protocols

Applic ation-layer mess age

Pres entation header

Sess ion header

Transport header

Netw ork header

3/30/2019 UNIT -1 DC 12
Protocols

• Figure 3.4 shows a protocol stack that conforms

to the seven-layer Reference Model for open
systems interconnection (OSI) adopted by ISO.
• The purpose of each level in the OSI Reference
Model is summarized in Fig. 3.5. It is a
framework for the definition of protocols.
• The application, presentation and session layers
are not clearly distinguished.
• The session layer is integrated with the
transport layer.
3/30/2019 UNIT -1 DC 13
Figure 3.4
Protocol layers in the ISO Open Systems Interconnection (OSI) model

Mess age s ent Mess age receiv ed

Lay ers
Applic ation
Pres entation
Sess ion
Transport
Netw ork
Data link
Phy sical
Sender Communic ation Recipient
medium

3/30/2019 UNIT -1 DC 14
OSI 7 Layer Reference Model

• Physical - transmission of raw bits over a

communication channel
• Data Link - reliable transmission of a block of data
(frame)
• Network - routing a packet from the source to the
destination (packet)
• Transport - logical communication channel between
processes (message)
• Session - dialog control between end applications
• Presentation - data format translation
• Application - eg. ftp, telnet, Netscape, and etc.

3/30/2019 UNIT -1 DC 15
Figure 3.5
OSI protocol summary

Layer Description Examples

Application Protocols that are designed to meet the communication requirements of HTTP, FTP , SMTP,
specific applications, often defining the interface to a service. CORBA IIOP
Presentation Protocols at this level transmit data in a network representation that is Secure Sockets
independent of the representations used in individual computers, which may (SSL),CORBA Data
differ. Encryption is also performed in this layer, if required. Rep.
Session At this level reliability and adaptation are performed, such as detection of
failures and automatic recovery.
Transport This is the lowest level at which messages (rather than packets) are handled. TCP, UDP
Messages are addressed to communication ports attached to processes,
Protocols in this layer may be connection-oriented or connectionless.
Network Transfers data packets between computers in a specific network. In a WAN IP, ATM virtual
or an internetwork this involves the generation of a route passing through circuits
routers. In a single LAN no routing is required.
Data link Responsible for transmission of packets between nodes that are directly Ethernet MAC,
connected by a physical link. In a WAN transmission is between pairs of ATM cell transfer,
routers or between routers and hosts. In a LAN it is between any pair of hosts. PPP
Physical The circuits and hardware that drive the network. It transmits sequences of Ethernet base- band
binary data by analogue signalling, using amplitude or frequency modulation signalling, ISDN
of electrical signals (on cable circuits), light signals (on fibre optic circuits)
or other electromagnetic signals (on radio and microwave circuits).

3/30/2019 UNIT -1 DC 16
Protocols

• Internetwork protocol suites include an

application layer, a transport layer and an
internetwork layer (Fig. 3.6).
• The AppleTalk Data Stream Protocol (ADSP) is
a session layer protocol in the AppleTalk
protocol suite that establishes and maintains
full-duplex communication between two
AppleTalk sockets.
• The session layer protocol of the WAP suit is
called the Wireless Session Protocol (WSP).

3/30/2019 UNIT -1 DC 17
Figure 3.6
Internetwork layers

Mess age
Lay ers

Applic ation

Internetw ork
Transport protocols

Internetw ork
Internetw ork pac kets

Netw ork interface

Underly ing
Netw ork-spec ific packets netw ork
protocols
Underly ing netw ork

3/30/2019 UNIT -1 DC 18
3/30/2019 UNIT -1 DC 19
Packet assembly

• Transport layer usually handles assembly and

reassembly
• Packets consist of a header and a data.
• If the data > MTU (maximum transfer unit), must
be divided into multiple packets with sequence
number.
• MTU for IP packets = 64KB
• MTU for Ethernet = 1500B

3/30/2019 UNIT -1 DC 20
Ports, Addressing

• The transport layer’s task is to provide a

network-independent message transport service
between pairs of network ports.
• Ports are software-definable destination points
for communication within a host computer.
• A transport address is network address of host +
port number.
• A network address is a numeric identifier that
uniquely identifies a host computer.
• In the Internet every host computer is assigned
an IP number.
3/30/2019 UNIT -1 DC 21
Addressing

• There are typically several ports at each host

computer with well-know numbers, each
allocated to a given Internet service such as
HTTP or FTP. Refer to /etc/services.
• Well-known port number and service definitions
are registered at www.iana.org.
• Port numbers above 1023 are available for
general use by new services and by client
processes.

3/30/2019 UNIT -1 DC 22
Comparisons

• Reliable vs. Unreliable Communications :

 Packet Damage
 Packet Lost (congestion, bad delivery)
 Packet Out of Order
• Connection-oriented vs. Connectionless
Communications :
 Connection-oriented -- establish connection, stream data
transfer, close connection
 TCP (Transport Control Protocol) -- reliable stream-based
communication
 Connectionless -- send/receive message (datagram) at any time
 UDP (User Datagram Protocol) -- unreliable datagram-based
communication

3/30/2019 UNIT -1 DC 23
Packet delivery, Routing

• Two approaches to delivery in the network layer:

 Datagram delivery (IP)
 Virtual circuit packet delivery (ATM)
• The determination of routes for the transmission
of packets to their destinations is the
responsibility of a routing algorithm.
• Routing Algorithm has two parts:
 decide the route for each packet
 update knowledge of the network

3/30/2019 UNIT -1 DC 24
Figure 3.7
Routing in a wide area network

A 1 B

Hosts 2
3 Links 4
or local C
networks 5
D 6 E
Routers

3/30/2019 UNIT -1 DC 25
Routing

• Linkstate algorithm:
 keep a distance vector for destinations in routing
table
 send a summary of routing table to neighbors using
RIP (router information protocol)
 read tables from neighbors and update as needed
• The RIP routing algorithm is shown in Fig. 3.9.

3/30/2019 UNIT -1 DC 26
Figure 3.8
Routing tables for the network in Figure 3.7

Routings from A Routings from B Routings from C

To Link Cost To Link Cost To Link Cost
A local 0 A 1 1 A 2 2
B 1 1 B local 0 B 2 1
C 1 2 C 2 1 C local 0
D 3 1 D 1 2 D 5 2
E 1 2 E 4 1 E 5 1

Routings from D Routings from E

To Link Cost To Link Cost
A 3 1 A 4 2
B 3 2 B 4 1
C 6 2 C 5 1
D local 0 D 6 1
E 6 1 E local 0

3/30/2019 UNIT -1 DC 27
Figure 3.9
Pseudo-code for RIP routing algorithm

Send: Each t seconds or when Tl changes, send Tl on each non-faulty

outgoing link.
Receive: Whenever a routing table Tr is received on link n:
for all rows Rr in Tr {
if (Rr.link | n) {
Rr.cost = Rr.cost + 1;
Rr.link = n;
if (Rr.destination is not in Tl) add Rr to Tl;
// add new destination to Tl
else for all rows Rl in Tl {
if (Rr.destination = Rl.destination and
(Rr.cost < Rl.cost or Rl.link = n)) Rl = Rr;
// Rr.cost < Rl.cost : remote node has better route
// Rl.link = n : remote node is more authoritative
}
}
}
3/30/2019 UNIT -1 DC 28
RIP, Congestion control

• RIP routing algorithm details:

 t is typically 30 seconds
 when a faulty link is detected, cost is set to infinity
 costs can be based on bandwidth rather than hops
 slow convergence and loops are a problem
• Congestion control is achieved by informing
nodes along a route that congestion has
occurred, and their rate of packet transmission
should be reduced.

3/30/2019 UNIT -1 DC 29
Internetworking terminology

• Internetworking devices:
 Router/Gateway - connects to at least two networks
(network/packet level)
 Bridge – links networks of different type (datalink/frame level)
 Repeater – physical/electronic signal level
 Brouter – the bridge and router combination
• Switch – interconnects several separate Ethernets. A
type of bridge.
• Hub – connects hosts and extends segments of
Ethernet. A type of repeater.
• Tunnel – is used to hold an alien protocol on the
underlying protocol.
 IPv6 packets are encapsulated in IPv4 and transported over the
IPv4 networks.
3/30/2019 UNIT -1 DC 30
Figure 3.10
Simplified view of the QMW Computer Science network

router/
Campus138.37.95.240/29 138.37.95.241 firewall
router subnet hammer
Staff subnet Student subnet
138.37.88 138.37.88.251 138.37.94.251 138.37.94
compute file server/
server Eswitch Eswitch
gateway
bruno
138.37.88.249 custard
138.37.94.246 printers
dialup
% server
henry
138.37.88.230
other
file servers
server
hotpoint
138.37.88.162
web
server
copper
138.37.88.248
hub hub

desktop computers138.37.88.xx desktop computers138.37.94.xx

sickle
Campus138.37.95.248/29 100 Mbps Ethernet
router subnet router/
138.37.95.249 firewall
1000 Mbps Ethernet
Eswitch: Ethernet switch

3/30/2019 UNIT -1 DC 31
Figure 3.11
Tunnelling for IPv6 migration

IPv6 encapsulated in IPv4 packets

IPv4 network
IPv6 IPv6
A B

Encapsulators

3/30/2019 UNIT -1 DC 32
Internet Protocols

• TCP/IP
• IP addressing
• The IP protocol
• IP routing
• IP version 6
• Mobile IP
• TCP and UDP
• Domain names
• Firewalls
3/30/2019 UNIT -1 DC 33
TCP/IP

• TCP stands for Transmission Control Protocol. IP stands

for Internet Protocol.
• Many application services and application-level
protocols exist based on TCP/IP:
 The Web – HyperText Transfer Protocol (HTTP)
 E-mail – Simple Mail Transfer Protocol (SMTP), Post Office
Protocol (POP)
 Netnews – Network News Transfer Protocol (NNTP)
 File transfer – File Transfer Protocol (FTP), Telnet
• HTTP is usually transported by the direct use of TCP,
but when end-to-end security is required, the Transport
Layer Security (TLS) or Secure Sockets Layer (SSL)
protocol is layered on top of TCP.

3/30/2019 UNIT -1 DC 34
TCP/IP

• The only significant exceptions of the universal

adoption of TCP/IP communication are:
 The use of WAP for wireless applications on portable
devices;
 Special protocols to support multimedia streaming
applications.
• The general illustration of internetwork protocol
layers of Figure 3.6 is translated into the specific
Internet case in Figure 3.12.
• There are two transport protocols – TCP
(Transport/Transmission Control Protocol) and
UDP (User Datagram Protocol).
3/30/2019 UNIT -1 DC 35
Figure 3.12
TCP/IP layers

Message
Layers

Application
Messages (UDP) or Streams (TCP)

Transport
UDP or TCP packets

Internet
IP datagrams

Network interface
Network-specific frames

Underlying network

3/30/2019 UNIT -1 DC 36
TCP/IP

• TCP is a reliable connection-oriented protocol,

and UDP is a unreliable connectionless
protocol.
• The Internet Protocol (IP) is the underlying
network protocol of the Internet virtual network.
• Figure 3.13 illustrated the encapsulation of
packets that would occur for the transmission of
a message via TCP over Ethernet.
• The receiver’s port number enables the TCP
software component at the receiving host to
pass the message to a specific application.
3/30/2019 UNIT -1 DC 37
Figure 3.13
Encapsulation in a message transmitted via TCP over an Ethernet

Application message

TCP header port

IP header TCP

Ethernet header IP

Ethernet frame

3/30/2019 UNIT -1 DC 38
TCP/IP

• The TCP/IP specifications do not specify the

layers below the Internet datagram layer. IP
packets in the Internet layer are transformed
into packets for transmission over any
combination of underlying networks or data
links.
• For example, IP ran initially over the ARPANET.
Today it is used over every known network
technology, including ATM, Ethernets, token
ring, and PPP.

3/30/2019 UNIT -1 DC 39
TCP/IP

• The success of TCP/IP is based on their

independence of the underlying transmission
technology.
• Users and application programs perceive a
single virtual network supporting TCP and UDP
as shown in Figure 3.14.

3/30/2019 UNIT -1 DC 40
Figure 3.14
The programmer's conceptual view of a TCP/IP Internet

Applic ation Applic ation

TCP UDP

IP

3/30/2019 UNIT -1 DC 41
TCP abstractions

• The data is the abstraction of a stream of bytes.

• A connection is established before messages
are sent.
• It assumes one process is the client and one is
the server in establishing a connection.
• Messages are sent using handles rather than
source-destination addresses.

3/30/2019 UNIT -1 DC 42
Common Internet applications that use
TCP
• BGP (routing) – Border Gateway Protocol
• SMTP (email) – Simple Mail Transfer Protocol
• POP (email) – Post Office Protocol
• Telnet (remote login)
• SSH (remote login) – Secure Shell
• FTP (file transfer) – File Transfer Protocl
• HTTP (web) – HyperText Transfer Protocol
• NNTP (netnews) - (Network News Transfer Protocol)
• DNS (name service) – Domain Name Service
• NFS (distributed file system) – Network File System
• Sun RPC (remote procedure call)
• DCE RPC (remote procedure call)
3/30/2019 UNIT -1 DC 43
Internet Protocols

• IP provides an unreliable, connectionless

datagram delivery service.
• IP has a facility for fragmenting datagrams into
fragments and reassembling them on the
receiving side.
• The rapid growth of the Internet led the
development of IPv6 to overcome the
addressing limitations of IPv4 and add features
to support new requirements.

3/30/2019 UNIT -1 DC 44
IP addressing

• The scheme used for assigning host addresses

to networks and the computers connected to
them had to satisfy the following requirements:
 Universal
 Efficient
 The addressing scheme must lend itself to the
development of a flexible and efficient routing
scheme.
• The scheme chosen assigns an IP address to
each host in the Internet.

3/30/2019 UNIT -1 DC 45
IP addressing

• The design adopted for Internet address space

is shown in Figure 3.15.
• There are four classes – A, B, C, and D.
• Class D is reserved for Internet multicast.
• Class E is reserved for future requirements.
• These 32-bit Internet addresses containing a
network identifier (156.26.10.) and host identifier
(239) are usually written as a sequence of four
decimal numbers separated by dots.
• Each decimal number represents one of the four
bytes, or octets of the IP address.
3/30/2019 UNIT -1 DC 46
Figure 3.15
Internet address structure, showing field sizes in bits

7 24
Clas s A: 0 Netw ork ID Host ID

14 16
Clas s B: 1 0 Netw ork ID Host ID

21 8
Clas s C: 1 1 0 Netw ork ID Host ID

28
Clas s D (multicast): 1 1 1 0 Multicast address

27
Clas s E (reserved): 1 1 1 1 0 unused

3/30/2019 UNIT -1 DC 47
IP addressing

• The permissible values for each class of

network address are shown in Figure 3.16.
• The Class A addresses, with a capacity 2^24
hosts on each subnets, are reserved for very
large networks such as the US NSFNet.
• Class B addresses are allocated to
organizations containing more than 255
computers such as universities.
• Class C are allocated to all other network
operators.
3/30/2019 UNIT -1 DC 48
Figure 3.16
Decimal representation of Internet addresses

octet 1 octet 2 octet 3 Range of addresses

Network ID Host ID
1.0.0.0 to
Class A: 1 to 127 0 to 255 0 to 255 0 to 255 127.255.255.255
Network ID Host ID
Class B: 128 to 191 0 to 255 0 to 255 0 to 255 128.0.0.0 to
191.255.255.255
Network ID Host ID
192.0.0.0 to
Class C: 192 to 223 0 to 255 0 to 255 1 to 254
223.255.255.255
Multicast address
Class D (multicast): 224 to 239 0 to 255 0 to 255 1 to 254 224.0.0.0 to
239.255.255.255

Class E (reserved): 240 to 255 0 to 255 0 to 255 1 to 254 240.0.0.0 to

255.255.255.255

3/30/2019 UNIT -1 DC 49
IP addressing

• Network identifiers are allocated by the Internet

Information Center (NIC) ->organization
• IP address space -> Internet Assigned Numbers
Authority (IANA) & Regional Internet Registry
(RIR)
• IANA allocates -> address space ->RIR
• RIR ->IP address space ->ISP’s
• ISP’s ->customers/organization

3/30/2019 UNIT -1 DC 50
IP protocol overview

• IP protocol is an unreliable or best- effort

delivery semantics.
• IP protocol has a header checksum, but no data
checksum.
• IP protocol breaks up datagrams into fragments
if exceeds MTU
• Obtains a physical address from underlying
network address resolution mechanism.

3/30/2019 UNIT -1 DC 51
Figure 3.17
IP packet layout

header
IP addres s of s ource IP addres s of des tination data
up to 64 kiloby tes

3/30/2019 UNIT -1 DC 52
Address resolution

• The process to convert Internet address to a

network address is called address resolution.
• Address resolution is technology dependent:
 Hosts connected to IP switches don't need
translation.
 Network addresses can be assigned dynamically.
 For some technologies such as Ethernet network no
direct relation b/w n/w & IP address ,
 An address resolution protocol (ARP) is required to
map the IP address to the physical address.

3/30/2019 UNIT -1 DC 53
Example: ARP on an Ethernet

• Each host is running ARP.

• The ARP module maintains a cache of pairs: (IP

address, Ethernet address)

• If the address is in the local cache, use it. If address not

in cache, broadcast a request.

• The host with matching IP address responds and a new

pair is added to the local ARP cache.

3/30/2019 UNIT -1 DC 54
IP Spoofing

What happens if no host responds to an ARP

broadcast? Ignore it.

• Try the ping ,arp ->availability of hosts .

• IP packets -> source + destination address ,port

number in data field

• Dos attack ->malicious ping request

3/30/2019 UNIT -1 DC 55
IP routing
• The topological map of the Internet is partitioned
into autonomous systems (AS)

• Intranets of large organizations ,universites - AS

• Every AS has a backbone area.(high bandwith

links –interconnects routers)

• The collection of routers which allows the non-

backbone areas to connect to the backbone
area is called the backbone of the network.
3/30/2019 UNIT -1 DC 56
Routing Protocols

• RIP1 (Routing Information Protocol) used the

distance vector algorithm.
• RIP2 (1993) handles classless interdomain
routing, better multicast and authentication.
• Open Shortest Path First (OSPF) based on
Dijkstra's shortest path algorithm converges
better. It is the link-state class of algorithms.
• RIP routers exchanged information every 30
seconds, during which time they didn't send out
any IP packets. The remedy is to have a
random value in the range 15-45 seconds.
3/30/2019 UNIT -1 DC 57
Routing Scalability

• It is infeasible for every router to maintain a full

routing table.
• Two possible solutions are employed:
 topological grouping of IP addresses
 the use of the default routes
• In 1993 some location dependence in IP
addresses is introduced:
194.0.0.0 to 195.255.255.255 Europe
198.0.0.0 to 199.255.255.255 North America
200.0.0.0 to 201.255.255.255 Central/South America
202.0.0.0 to 195.203.255.255 Asia and Pacific

3/30/2019 UNIT -1 DC 58
IP Routing

• Key routers close to backbone have more

complete tables.
• The default entry specifies a route to be used for
all IP packets whose destination is not included
in the routing table.
• Addresses on same subnet use local address
resolution. The IP layer uses ARP to get the
network address.

3/30/2019 UNIT -1 DC 59
CIDR –Classless InterDomain Routing

• Gateways and routers are connected to two ore

more networks and they have several Internet
addresses, one for each network to which they
are attached.
• Try the netstat command.
• The CIDR is to allocate a batch of contiguous
class C addresses to a subnet requiring more
than 255 addresses.
• The CIDR scheme also subdivides a Class B
address space for allocation to multiple subnets.

3/30/2019 UNIT -1 DC 60
CIDR

• The CIDR uses a mask to select portion of

address to be compared with routing table.
• The CIDR can use any part of address for
subnet to further subdivide a subnet.
• Figure 3.10 shows the use of CIDR to split the
138.37.95 class C-sized subnet into several
groups of eight host addresses.

3/30/2019 UNIT -1 DC 61
IP version 6

• IPv6 (Internet Protocol Version 6) is the latest

level of the Internet Protocol (IP) and is now
included as part of IP support in many products
including the major computer operating
systems.
• IPv6 has also been called "IPng" (IP Next
Generation).
• Formally, IPv6 is a set of specifications adopted
by the Internet Engineering Task Force (IETF)
in 1994.
• Figure 3.18 shows the layout of IPv6 headers.
3/30/2019 UNIT -1 DC 62
Figure 3.18
IPv6 header layout

Version (4 bits) Priority (4 bits ) Flow label (24 bits)

Pay load length (16 bits ) Next header (8 bits) Hop limit (8 bits)

Sourc e address
(128 bits )

Destination addres s
(128 bits )

3/30/2019 UNIT -1 DC 63
IP version 6 – Address Space

• The most obvious improvement in IPv6 over the

IPv4 is that IP addresses are lengthened from
32 bits to 128 bits.
• This provides 2128 addresses or 3 x 1038.
• This extension anticipates considerable future
growth of the Internet.
• Only 28% addresses are defined. 1/8th partition
is organized according to the geographic
locations and the other according to their
organizational locations.
3/30/2019 UNIT -1 DC 64
IPv6 – Routing Speed

• No checksum is applied to the packet content

(payload). The checksum can be done at higher
levels.
• No fragmentation can occur once a packet is
sent. The smallest MTU is determined before a
packet is transmitted.
• Options are specified in an extension to the
header that is examined only at the destination,
thus speeding up overall network performance.

3/30/2019 UNIT -1 DC 65
IP version 6 – Real-time and Services

• The priority and flow label fields are concerned

with real-time and specific services.
• Priority values 0 to 8 are for those applications
whose transmissions can be slowed. Values 8
to 15 are reserved for real-time applications.
• Flow labels enable resource to be reserved in
order to meet the timing requirements of specific
real-time data streams.
• The use of these facilities of IPv6 will depend on
major enhancements to the infrastructure.
3/30/2019 UNIT -1 DC 66
IP version 6 – Future Evolution

• The next header field provides for future

evolution.
• If non-zero, it specifies an extension header
type in the packet.
• The extension header types include the services
for router information, route definition, fragment
handling, authentication, encryption information,
and destination information.
• Each extension header type has a specific size
and format and is transmitted after the basic
header and before the payload.
3/30/2019 UNIT -1 DC 67
IPv6 – Multicast and Anycast

• IPv6 describes rules for three types of

addressing: unicast (one host to one other host),
anycast (one host to at least one of multiple
hosts), and multicast (one host to multiple
hosts).
• The introduction of an "anycast" address
provides the possibility of sending a message to
the nearest of several possible gateway hosts
with the idea that any one of them can manage
the forwarding of the packet to others.
• Anycast messages can be used to update
routing tables along the line.
3/30/2019 UNIT -1 DC 68
IP version 6 – Security

• The advantage of implementing security at the

IP level is that it can be applied without the need
for security-aware implementations of
application programs.
• Security in IPv6 is implemented through the
authentication and encrypted security payload
extension header types , for ensuring data
integrity, and for ensuring privacy.

3/30/2019 UNIT -1 DC 69
MobileIP

• Dynamic Host Configuration Protocol (DHCP)

enables a newly connected computer to acquire
a temporary IP.
• If a mobile computer is to remain accessible to
client and resource-sharing applications (such
as a share-monitoring service) when moving
between networks, it must retain a single IP
number, but IP routing is subnet-based.
• MobileIP is a solution to allow the correct routing
through different subnets.

3/30/2019 UNIT -1 DC 70
MobileIP

• When a mobile host is connected outside of its

home base, a home agent (HA) and a foreign
agent (FA) take responsibility of rerouting.
• The HA is responsible for holding up-to-date
knowledge of the mobile host’s current location.
• When a mobile host leaves its home site, it
should inform the HA. During the absence it will
behave as proxy for the absent host.

3/30/2019 UNIT -1 DC 71
MobileIP

• Once the mobile host arrives at a new site, it

informs the FA at that site. The FA allocates a
temporary IP address (care-of address) on the
local subnet and notifies the HA the mobile
host’s home IP address and the care-of
address.
• Figure 3.19 illustrates the MobileIP routing
mechanism.
• An IP packet addressed to the mobile host’s
home address is received at the home network
and routed to the HA.

3/30/2019 UNIT -1 DC 72
Figure 3.19
The Mobile IP routing mechanism

Sender Subsequent IP packets

tunnelled to FA Mobile host MH
Address of FA
returned to sender
First IP packet
addressed to MH
Internet
Foreign agent FA
Home
agent First IP packet
tunnelled to FA

3/30/2019 UNIT -1 DC 73
MobileIP

• The HA then encapsulates the IP packet in a

MobileIP packet and sends it to the FA. The FA
unpacks the packet and deliver it to the mobile
host. This uses the tunnelling technique.
• The HA also send the care-of address of the
mobile host to the original sender.
• If the sender is MobileIP enabled, the
subsequent communication will directly go the
new address. If it is not, it will ignore the change
and continue to be routed via the HA.

3/30/2019 UNIT -1 DC 74
Comments on MobileIP

• The MobileIP solution is effective, but hardly

efficient.
• A best solution would be like what is achieved
by the cellular phone network.
• Mobile phones do not change their number as
they move between cells. Instead, they simple
notify the local cellular phone base station of
their presence from time to time.

3/30/2019 UNIT -1 DC 75
TCP and UDP

• TCP and UDP provide the communication

capabilities of the Internet in a form that is useful
for application programs.
• Application developers might wish for the
transport service that provides real-time
guarantees and security, but such services
require more support than IPv4 provides.
• IP supports communication between pairs of
computers.

3/30/2019 UNIT -1 DC 76
Ports
• Transport protocols provide process-to-process
communication. This is accomplished by the use
of ports.
• Port numbers are used for addressing
messages to processes within a specified host.
• A port number is specified by a 16-bits integer.
• Once an IP packet has been delivered to the
destination host, the TCP- or UDP-layer
software delivers it to a process via a specific
port at that host.
• This combination is IP address + local port.
3/30/2019 UNIT -1 DC 77
Ports
• IANA (Internet Assigned Numbers Authority)
specifies port usage:
well-known ports: 1 1023
registered ports: 1024 49151
dynamic or private ports: 49152 65535
• ICANN is the new authority for naming and
numbering on the Internet as of 1998.

3/30/2019 UNIT -1 DC 78
UDP features
• UDP (User Datagram Protocol) is an unreliable
datagram-based communication.
• A UDP datagram is encapsulated inside an IP
packet including:
 A short header contains the source and destination
port numbers.
 A length field specifies the length of the packet.
 A checksum is used to verify the integrity of the
packet.
• UDP provides a means of transmitting
messages of up to 64 KB between pairs of
processes.
3/30/2019 UNIT -1 DC 79
UDP features
• It incurs no setup costs or transmission delays
and it requires no administrative
acknowledgement messages.
• But its use is restricted to those applications and
services that do not require reliable delivery of
single or multiple messages.
• Trivial File Transfer Protocol (TFTP) is a file
transfer utility that uses the UDP.
• It is used where user authentication and
directory visibility are not required, for example,
X-Terminal bootup.

3/30/2019 UNIT -1 DC 80
TCP features

• TCP (Transport Control Protocol) is a reliable

stream-based communication.
• Before any data transfer the sending and
receiving must cooperate in the establishment of
a bi-directional communication channel.
• The connection is simply an end-to-end
agreement to perform reliable data
transmission.

3/30/2019 UNIT -1 DC 81
TCP features

• The TCP layer includes additional mechanisms

to meet the reliability requirements:
 Sequencing: The stream is divided into a sequence
of data segments to which a sequence number is
attached and transmitted as IP packets. The receiver
uses this number to order the received segments
 Flow control: The sender takes care not to
overwhelm the receiver or the intervening nodes. The
unreliability of wireless networks and the resulting
frequent loss of packets is one of the reasons for the
adoption of a different transport mechanism in the
WAP family of protocols.

3/30/2019 UNIT -1 DC 82
TCP features
 Retransmission: The sender records the sequence
numbers of the segments. When it receives an
acknowledgement, it notes that the segments were
received and it may then delete them from its
outgoing buffers. If any segment is not acknowledged
within a specified timeout, the sender retransmits it.
 Buffering: The incoming buffer at the receiver is
used to balance the flow between the sender and the
receiver.
 Checksum: Each segment carries a checksum
covering the header and the data segment.

3/30/2019 UNIT -1 DC 83
Domain names

• The Internet supports a scheme for the use of

symbolic names for hosts and networks.
• The named entities are organized into a naming
hierarchy. The named entities are called
domains and the symbolic names are called
domain names.
• The Domain Name System (DNS) is used to
translate domain names into IP address.

3/30/2019 UNIT -1 DC 84
Domain names

• The DNS servers in each domain hold a partial

map of the domain name tree below their
domain.
• DNS servers handle requests for the translation
of domain names outside their portion of the
tree by issuing requests to DNS servers in the
relevant domains. The result is then cached for
the future request.

3/30/2019 UNIT -1 DC 85
Discovering Network Topology

• netstat –ni
• netstat –rn
• Do a man netstat to look at the command
options.
• Try netstat -a
• /sbin/ifconfig eth0
• /sbin/ifconfig lo
• Do a man ifconfig to look at the command
options.
• Do /usr/sbin/ping –s 156.26.10.255 on Solaris.

3/30/2019 UNIT -1 DC 86
Firewalls

• The purpose of a firewall is to monitor and

control all communication into and out of an
intranet :
 Service control: To determine which services on
internal hosts are accessible for external access and
the reject all other incoming service requests.
 Behavior control: To prevent behavior that infringes
the organization’s policies.
 User control: The organization may wish to
discriminate between its users.

3/30/2019 UNIT -1 DC 87
Firewalls

• The policy has to be expressed in terms of

filtering operations:
 IP packet filtering: This is a filter process examining
individual IP packets. It may examine the destination
and source addresses, the service type (port
number). IP filtering is done within a router kernel.
 TCP gateway: A TCP gateway process checks all
TCP connection requests and segment
transmissions.
 Application-level gateway: An application-level
gateway process acts as a proxy for an application
process.

3/30/2019 UNIT -1 DC 88
Firewalls

• The router/filter must run only trusted software

in a manner that enables its enforcement of
filtering policies to be guaranteed.
• This involves ensuring that no Trajan horse
processes can run on it and that software have
not been modified or tampered with.
• Figure 3.20(a) shows a simple firewall.
• When TCP and application-level gateway
processes are required, these usually run on a
separate computer, known as a bastion.
3/30/2019 UNIT -1 DC 89
Firewalls

• A bastion computer is a host that is located

inside the intranet protected by an IP router/filter
and runs the TCP and application-level
gateways (Figure 3.20(b)).
• Security can be enhanced by employing two
router/filters in series, with the bastion and any
public servers located on a separate subnet
linking the router/filters (Figure 3.20(c)).

3/30/2019 UNIT -1 DC 90
Figure 3.20
Firewall configurations

a) Filtering router Protected intranet

Router/
filter

Internet

w eb/ftp
s erv er

b) Filtering router and bastion R/filter Bastion

Internet

w eb/ftp
s erv er

c ) Sc reened s ubnet for bas tion R/filter Bastion R/filter

Internet

w eb/ftp
s erv er

3/30/2019 UNIT -1 DC 91
Firewalls
• This configuration (Fig. 3.20 (c)) has several
security advantages:
 If the bastion policy is strict, the IP addresses of hosts
in the intranet need not be published to the outside
world and the external addresses need not be known,
because all external communication passes through
proxy processes in the bastion.
 If the first filter is compromised, the second one
invisible from outside is less vulnerable.
• Virtual private networks (VPNs) extend the
firewall protection boundary beyond the local
intranet by use of cryptographically protected
secure channels at the IP level.
3/30/2019 UNIT -1 DC 92
 Network Case Studies

3/30/2019 UNIT -1 DC 93
Network Case Studies

• The IEEE 802 network standards are shown in

Figure 3.21.
• The IEEE 802.3 Ethernet standard has largely
won the marketplace.
• The IEEE 802.5 Token Ring standard has now
disappeared from the marketplace.
• The IEEE 802.4 Token Bus standard was
developed for industrial applications with real-
time requirements.
• The IEEE 802.6 Metropolitan Area standard
covers distances up to 50 km.
3/30/2019 UNIT -1 DC 94
Figure 3.21
IEEE 802 network standards

IEEE No. Title Reference

802.3 CSMA/CD Networks (Ethernet) [IEEE 1985a]
802.4 Token Bus Networks [IEEE 1985b]
802.5 Token Ring Networks [IEEE 1985c]
802.6 Metropolitan Area Networks [IEEE 1994]
802.11 Wireless Local Area Networks [IEEE 1999]

3/30/2019 UNIT -1 DC 95
Network Case Studies

• The IEEE 802.11 Wireless LAN standard now

has products from Lucent (WaveLAN).
• The IEEE 802.11 standard is designed to
support communication at speed up to 11 Mbps
over distances of up to 150 m.
• The purpose of ATM is to provide a high-
bandwidth wide-area digital networking
technology suitable for telephone, data and
multimedia applications.

3/30/2019 UNIT -1 DC 96
Ethernet

• History - Xerox PARC in 1973, IEEE/ISO

Standard 802.3 in 1985
• An single Ethernet is a bus-like connection. An
Ethernet LAN consisting of three computers
joined by a shared coaxial cable is shown in the
following diagram:

3/30/2019 UNIT -1 DC 97
Ethernet

• A Ethernet belongs to the class of contention

bus networks. Hubs (repeaters) extend
segments of Ethernet. Switches (bridges)
operate at the level of Ethernet frame.
• The method of operation is defined by
CSMA/CD (Carrier Sensing, Multiple Access
with Collision Detection).
• Contention buses use a single transmission
medium to link all of the hosts.

3/30/2019 UNIT -1 DC 98
Packet Broadcasting

• The method of communication in CSMA/CD

networks is by broadcasting packets of data on
the transmission medium.
• The packet is broadcasting with the destination
address which specifies either a single recipient
node (unicast mode), a group of recipient nodes
(multicast mod), or the set of all recipient nodes
(broadcast mode).

3/30/2019 UNIT -1 DC 99
Ethernet Packet Layout

• Frames of data are formed using a protocol

called Medium Access Control (MAC). It is used
to provide the data link layer of the Ethernet
LAN system.
• The MAC protocol encapsulates a payload data
by adding a 14 byte header (Protocol Control
Information (PCI)) before the data and
appending a 4-byte (32-bit) Cyclic Redundancy
Check (CRC) after the data.

3/30/2019 UNIT -1 DC 100

Ethernet Packet Layout

• The purpose of the preamble is to allow time for

the receiver in each node to achieve lock of the
receiver Digital Phase Lock Loop which is used
to synchronize the receive data clock to the
transmit data clock.
• This consists of 62 alternating 1's and 0's
followed by the pattern 11.
3/30/2019 UNIT -1 DC 101
Ethernet Packet Layout

• The last byte which finished with the '11' is

known as the "Start of Frame Delimiter".
• The header consists of three parts:
 A 6-byte destination address
 A 6-byte source address
 A 2-byte data length
• The data field contains the data for
transmission.

3/30/2019 UNIT -1 DC 102

Ethernet Packet Layout

• The 32-bit CRC added at the end of the frame

provides error detection in the case where line
errors (or transmission collisions in Ethernet)
result in corruption of the MAC frame.
• Any frame with an invalid CRC is discarded by
the MAC receiver without further processing.

3/30/2019 UNIT -1 DC 103

Packet Collisions

• The Ethernet has three mechanisms to deal with

the collisions:
 Carrier sensing – sense if the line is busy.
 Collision detection – detect if the collisions occur.
 Back-off – wait for some time to retransmit.
• T is the time for a signal reaching all other
points.

3/30/2019 UNIT -1 DC 104

Packet Collisions

send_frame (...)
{
while (the bus is busy) wait ();
send the frame to the bus;

if (collision detected in time 2 * T) {

wait for some time;
resend the frame until no collision detected;
}
}
3/30/2019 UNIT -1 DC 105
Ethernet Efficiency

• The efficiency of an Ethernet is the ratio of the

number of packets transmitted successfully as a
proportion of the theoretical maximum number
that could be transmitted without collisions.
• The Ethernet can achieve a channel utilization
of between 80 and 95%. The delays become
noticeable when 50% utilization is exceeded.

3/30/2019 UNIT -1 DC 106

Physical Implementations

• Ethernet LANs may be implemented using a

variety of media.
• The types of media segments supported by
Ethernet are:
 10B5 Low loss coaxial cable (also known as "thick"
Ethernet)
 10B2 Low cost coaxial cable (also known as "thin"
Ethernet)
 10BT/100BT/1000BT Low cost twisted pair copper
cable (also known as Unshielded Twisted Pair (UTP))
 10BF Fiber optic cable
3/30/2019 UNIT -1 DC 107
Wireless LAN

• The IEEE 802.11 standard extends the carrier-

sensing multiple access (CSMA) principle
employed by Ethernet (IEEE 802.3).
• The IEEE 802.11 standard is intended to
support communication between computers
within 150 meter distance at speeds up to
11Mbps.
• Figure 3.22 illustrates portion of an intranet
including a wireless LAN.

3/30/2019 UNIT -1 DC 108

Figure 3.22
Wireless LAN configuration

A B C

Laptops

radio obs truction

Wireless
D LAN
Palmtop E

Server Base s tation/

acc es s point

LAN

3/30/2019 UNIT -1 DC 109

Wireless LAN

• Wireless devices communicate through a base

station called an access point.
• An alternative configuration for wireless
networking is known as an ad hoc network.
They are built on the fly as a result of the mutual
detection of two or more wireless devices.
• The stations in IEEE 802.11 networks use radio
frequency signals (in the 2.4 GHz band) or infra-
red signalling as the transmission medium.

3/30/2019 UNIT -1 DC 110

Wireless LAN

• It uses various frequency-selection and

frequency-hopping techniques to avoid interfere.
• Frequency-hopping uses a narrowband carrier
that changes frequency in a pattern known to
both transmitter and receiver. Properly
synchronized, the net effect is to maintain a
single logical channel.

3/30/2019 UNIT -1 DC 111

Wireless LAN
• Because signal strength is not uniform
throughout the space in which wireless LANs
operate, carrier detection and collision may fail
in the following ways:
 Hidden stations: Carrier sensing may fail to detect
another station. For example, A and D.
 Fading: The strength of radio signals diminished
rapidly with the distance from the transmitter. For
example, A and C.
 Collision masking: The local signal might drown out
the remote transmission. For example, A and C.
• The result scheme is carrier sensing multiple
access with collision avoidance (CSMA/CA).
3/30/2019 UNIT -1 DC 112
Wireless LAN

• When a station is ready for transmission, if it

detects no carrier signal it may assume:
 The medium is available.
 An out-of-range station is in the process of requesting
a slot.
 An out-of-range station is using a slot that it had
previously reserved.
• The slot-reservation protocol involves the
exchange of a request to send (RTS) frame
from the sender to the receiver and clear to
send (CTS) frame from the receiver.
3/30/2019 UNIT -1 DC 113
Wireless LAN

• The effect of this exchange is as follows:

 Stations within range of the sender will pick the RTS
frame and note the duration.
 Stations within range of the receiver will pick the CTS
frame and note the duration.
• The slot-reservation feature of the MAC protocol
helps to avoid the collisions in these ways:
 The CTS frames help to avoid the hidden station and
fading problems.

3/30/2019 UNIT -1 DC 114

Wireless LAN

 If a collision is detected, or an RTS does not result in

a CTS, a random back-off period is used.
 When the RTS and CTS frames have been correctly
exchanged, there should be no collisions.
• The privacy and integrity of communication is an
obvious concern for wireless networks.
• It requires an authentication exchange for each
station joining the network in which knowledge
of a shared key is demonstrated.
• The prevention of eavesdropping is achieved
using a simple encryption scheme.

3/30/2019 UNIT -1 DC 115

Asynchronous Transfer Mode (ATM)

• ATM has been designed to carry a wide variety

of data including multimedia data such as voice
and video.
• It is a fast packet-switching network based on
cell relay.
• It achieves its speed by avoiding flow control
and error checking at the intermediate nodes
and using the small and fixed-length units of
data transmission.

3/30/2019 UNIT -1 DC 116

Asynchronous Transfer Mode (ATM)
• ATM connection is set up only if sufficient
resources are available. Once it is set up, the
quality is guaranteed.
• ATM is a data-switching technology that can be
implemented over existing digital telephony
networks and Synchronous Optical Network
(SONET).
• The resulting virtual circuits can provide
services including voice, fax, HDTV (100-150
Mbps).
• The ATM can transfer data at the rates up to
155 Mbps or 622 Mbps.
3/30/2019 UNIT -1 DC 117
Asynchronous Transfer Mode (ATM)

• ATM networks can also be implemented in

native mode directly over optical fiber, copper,
and other transmission media, allowing
bandwidths of up to several gigabits per second.
• The ATM service is structured in three layers as
shown in Figure 3.23:
 Adaptation layer – end-to-end layer implemented at
the sending and receiving hosts.
 ATM layer – a connection-oriented service that
transmits fixed length packets called cells.
 Physical layer
3/30/2019 UNIT -1 DC 118
Figure 3.23
ATM protocol layers

Mess age
Lay ers

Applic ation

Higher-lay er protoc ols

ATM adaption layer

ATM cells

ATM layer
ATM virtual channels
Phy sical

3/30/2019 UNIT -1 DC 119

Asynchronous Transfer Mode (ATM)

• A connection consists of sequence of virtual

channels within virtual paths. A virtual channel
(VC) is a logical unidirectional association
between two endpoints.
• A virtual path (VP) is a bundle of virtual
channels that are associated with a physical
path between two switching nodes.

3/30/2019 UNIT -1 DC 120

Asynchronous Transfer Mode (ATM)

• The nodes in an ATM network can play three

distinct roles:
 Hosts, that send and receive messages;
 VP switches, that hold tables showing the
correspondence between incoming and outgoing
virtual paths;
 VP/VC switches, that hold similar tables for both
virtual paths and virtual channels.
• An ATM cell has a 5-byte header and a 48-byte
data field as shown in Figure 3.24.

3/30/2019 UNIT -1 DC 121

Figure 3.24
ATM cell layout

Header: 5 by tes

Virtual path id Virtual channel id Flags Data

53 bytes

3/30/2019 UNIT -1 DC 122

Asynchronous Transfer Mode (ATM)

• When a cell arrives at a VP switch, the virtual

path identifier in the header is looked up in its
routing table to work out the corresponding
virtual path for the outgoing physical path as
shown Figure 3.25.
• The VP and VC identifier are defined locally.
This scheme doesn’t need global network-wide
identifiers.
• ATM provides a service with low latency of 25
microseconds per switch.

3/30/2019 UNIT -1 DC 123

Figure 3.25
Switching virtual paths in an ATM network

Host
VPI = 2

VPI = 3 VP/VC
VP sw itch
s w itch

VPI = 4
VPI in VPI out
2 4 VPI = 5
3 5
VP sw itch

Host
VPI : virtual path identifier

Virtual path Virtual channels

3/30/2019 UNIT -1 DC 124