Professional Documents
Culture Documents
Multimedia (Unit 3 & 4) - 1
Multimedia (Unit 3 & 4) - 1
MULTIMEDIA
INFORMATION
NETWORK
11/19/2020
2
WHAT IS MULTIMEDIA?
• Interactive TV
• Computer Games
• Virtual reality
• Digital video editing and production systems
• Multimedia Database systems
WHAT IS HYPERTEXT AND
HYPERMEDIA?
• Hypertext is a text which contains links to other
texts.
• The term was invented by Ted Nelson around
1965.
WHAT IS HYPERTEXT AND
HYPERMEDIA?
WHAT IS HYPERTEXT AND
HYPERMEDIA?
• HyperText Navigation
• Traversal through pages of hypertext is therefore
usually
• non-linear (as explained later).
WHAT IS HYPERTEXT AND
HYPERMEDIA?
HYPERMEDIA
1. The first three types were initially designed to provide just a single type
of servicess.
2. The last two types were designed to provide multiple services.
COMPONENTS OF TELEPHONE NETWORKS
•
ETHERNET
• Ethernet is the traditional technology for
connecting devices in a wired local area
network (LAN) or wide area network (WAN),
enabling them to communicate with each
other via a protocol ( a set of rules or
common network language).
• Ethernet describes how network devices
can format and transmit data so other
devices on the same local area network
segment can recognize, receive and
process the information.
CSMA/CD
• If two computers send data at the same time,
a collision will occur. When this happens, the
data sent is not usable. In general, both
computers will stop sending, and wait a
random amount of time, before they try
again. A special protocol was developed to
deal with such problems. It is called Carrier
sense multiple access with collision detection
or CSMA/CD.
DIFFERENT TYPES OF ETHERNET CABLE
• 10Base2
• 10BASE5
• 10BASE-T
• 10BASE-F
• 100BASE-T
• 100Base-FX
• 100BASE-TX
• 1000BASE-T
• 1000BASE-SX
• 1000BASE-LX
10BASE-2
◦ A wide range of different local area network technologies were developed in the early 1970s
◦ IBM developed token ring as an alternative to Ethernet in 1984. It was standardized by IEEE
802.5 and became very successful and popular in corporate industries but significantly
decreased in popularity because of later versions of Ethernet.
◦ The IEEE standard versions provides data transfer rates 4Mbps, 16Mbps or
100Mbps.
What is a Token Ring ?
◦ A station is authorized to send data when it receives a special frame called token
◦ Here there is no master node
◦ Tokens are exchanged among the node/workstation in some fixed order
How Token Ring Works
◦ For example the failure of one node can crash the entire channel
◦ Token passing is decentralized and highly efficient, but it has problem as well
If a node accidently neglected to release the token , then some recovery procedure must be
invoked to get the token back in circulation
A Token Ring hub simply changes the topology from a physical ring to
a star wired ring. The Token still circulates around the network and is
still controlled in the same manner, however, using a hub or a switch
greatly improves reliability because the hub can automatically bypass
any ports that are disconnected or have a cable fault.
Time Conversions-
In token passing,
Time may be expressed in seconds, bits or meters.
To convert the time from one unit to another, we use the following conversion chart-
1.Token Passing Terminology-
Ring Latency
Cycle Time
◦ Ring Latency-
◦ Time taken by a bit to complete one revolution of the ring is called as ring latency
LET:
•Length of the ring = d
•Speed of the bit = v
•Number of stations = N
•Bit delay at each station = b
(Bit delay is the time for which a station holds
the bit before transmitting to the other side)
•d / v is the propagation delay (Tp) expressed in
seconds.
•Generally, bit delay is expressed in bits.
•So, both the terms (d / v and N x b) have different
units.
•While calculating the ring latency, both the terms are
brought into the same unit.
After conversion we have :
Cycle Time-
Time taken by the token to
complete one revolution of
the ring is called as cycle
time.
• Length of the ring = d
• Speed of the bit = v
• Number of stations = N
• Token Holding Time = THT
◦ (Token Holding Time is the time for which a
station holds the token before transmitting to the
other side
Efficiency-
Efficiency (η) = Useful Time / Total Time
Assumptions-
Token passing method assumes-
• Each station in the ring has the data to send.
• Each station sends exactly one data packet after acquiring the token.
In one cycle,
• Useful time = Sum of transmission delay of N stations since each station sends 1 data packet = N x Tt
• Total Time = Cycle time = Tp + N x THT
Pros Cons
No collisions Old technology
Internal error detection and correction Slow
Initial 0 0 0
Busy 1 0 0
Error 1 0 1
Copied 1 1 0
NETWORK
BRIDGE
A Bridge is a network device that
connects multiple LANs (local area
networks) together to form a larger
LAN. The process of aggregating
networks is called network
bridging. A bridge connects the
different components so that they
appear as parts of a single network.
TOKEN RING
TOKEN BUS
A Repeater is an electronic
device that receives
a signal and retransmits it.
Repeaters are used to extend
transmissions so that the
signal can cover longer
distances or be received on
the other side of an
obstruction.
BRIDGE = REPEATER + FUNCTIONALITY OF READING THE MAC ADDRESS
TYPES OF BRIDGES-
- THESE ARE THE BRIDGES WHERE STATIONS ARE COMPLETELY UNAWARE OF THE BRIDGE’S EXISTENCE.
- IN THESE BRIDGES THE ROUTING OPERATION IS PERFORMED BY SOURCE STATION AND THE FRAME SPECIFIES
WHICH ROUTE TO FOLLOW.
WORKING OF A BRIDGE -
BRIDGE V/S ROUTER
BRIDGE- ROUTER-
SAME PROTOCOLS DIFFERENT PROTOCOLS
LAYER 2 DEVICE LAYER 3 DEVICE
P1 P2
- Forwarding
- Filtering
QUESTIONS?
FDDI
WHAT IS FDDI ?
-> Conti……
HoW doEs iT WoRk ?
FDDI is used mainly in high traffic networks where large amounts of data flow
needs to flow quickly and efficiently.
FDDI is used anywhere that utilizes a large network in need of high bandwidth.
For example:- Businesses, the Government, hospitals and other medical fields,
stock exchanges and money markets, the automobile industry, and the media,
just to name a few.
HIGH-SPEED LANs
Contents
• Standard Ethernet
• Fast Ethernet
• Gigabit Ethernet
• 10 Gigabit Ethernet
• Fibre Channel
• Wireless LANs
The Emergence of High‐speed LANs
• The speed and computing power of personal computers has
continued to enjoy explosive growth. Today’s more powerful
platforms support graphics intensive applications and ever
more elaborate graphical user interfaces to the operating
system.
• MIS organizations have recognized the LAN as a viable and
indeed essential computing platform, resulting in the focus on
network computing.
• Both of these approaches involve the frequent transfer of
potentially large volumes of data in a transaction‐oriented
environment.
• The effect of these trends has been to increase the volume of
data to be handled over LANs and, because applications are
more interactive, to reduce the acceptable delay on data
transfers.
Requirements for High‐Speed LANs
• Centralized server farms: In many applications, there is a need for
user or client systems to be able to draw huge amounts of data
from multiple centralized servers, called server farms. An example
is a color publishing operation, in which servers typically contain
hundreds of gigabytes of image data that must be downloaded to
imaging workstations. As the performance of the servers
themselves has increased, the bottleneck has shifted to the
network.
• Power workgroups: These groups typically consist of a small
number of cooperating users who need to draw massive data
files across the network. Examples are a software development
group that runs tests on a new software version, or a computer‐
aided design (CAD) company that regularly runs simulations of
new designs. In such cases, large amounts of data are distributed
to several workstations, processed, and updated at very high
speed for multipleiterations.
• High‐speed local backbone: As processing demand grows, LANs
proliferate at a site, and high‐speed interconnection is necessary.
High‐Speed LANs
• The most widely used high‐speed LANs today are based on
Ethernet and were developed by the IEEE 802.3 standards
committee.
• To keep pace with the changing local networking needs of
business, a number of approaches to high speed LAN design
have become commercial products. The most important of these
are:
•Fast Ethernet and Gigabit Ethernet: The extension of 10‐Mbps
CSMA/CD(Standard Ethernet) to higher speeds is a logical
strategy because it tends to preserve the investment in existing
systems.
•Fibre Channel: This standard provides a low‐cost, easily
scalable approach for achieving very high data rates in local
areas.
•High‐speed wireless LANs: Wireless LAN technology and
standards have at last come of age, and high‐speed standards
and products are beingintroduced.
Characteristics of Some High‐Speed LANs
IEEE 802
• IEEE 802 refers to a family of IEEE standards dealing with local
area networks and metropolitan area networks.
• More specifically, the IEEE 802 standards are restricted to
networks carrying variable‐sizepackets.
• The services and protocols specified in IEEE 802 map to the
lower two layers (Data Link and Physical) of the seven‐layer
OSI networking referencemodel.
• IEEE 802 splits the OSI Data Link Layer into two sub‐layers
named Logical Link Control (LLC) and Media Access Control
(MAC), so that the layers can be listed like this:
Data link layer
‐ LLC Sublayer
‐ MAC Sublayer
Physical layer
The Generations of Ethernet
The original Ethernet was created in 1976 at Xerox’s Palo Alto
Research Center (PARC). Since then, it has gone through four
generations.
Standard Ethernet
• In Standard Ethernet, the MAC sub layer governs the operation of
the access method.
• It also frames data received from the upper layer and passes them
to the physical layer forencoding.
• An Ethernet frame needs a minimum length of 512 bits or 64 bytes
and maximum length (without preamble and SFD field) as 1518
bytes.
• Standard Ethernet uses 1‐persistentCSMA/CD.
1
TCP/IP
2
IP Datagram
• A datagram is a self-contained, independent entity of data carrying sufficient
information to be routed from the source to the destination computer without
reliance on earlier exchanges between this source and destination computer
and the transporting network.
• IPv4 was the first version deployed for production on SATNET in 1982 and
on the ARPANET in January 1983. It still routes most Internet traffic today,
despite the ongoing deployment of a successor protocol, IPv6.
3
IP Datagrams
A host:
• creates a packet
• places the destination address in the packet header
• sends the packet to a nearby router
A router
• receives a packet
• uses the destination address to select the next router on the path
• forwards the packet
Eventually, the packet reaches a router that can deliver the packet to its final
destination.
5
IP Datagram Header (Version 4)
8
Version
• Each datagram begins with a 4-bit protocol version number (the figure
shows a version 4 header) 4 Bit
• Current version number is 4
• Next version is 6
Available
options for
IHL 9
Types of Service
• 8-bit field that carries a class of service for the datagram (seldom used in
practice)
• Nowadays called as DSCP (Differentiated Services Code Point)
10
Total Length
• 16-bit integer that specifies the total number of bytes in the datagram (both
header and data)
• Since this field is 16 bit wide, the maximum length of an IP datagram is
65535 bytes, though most are much smaller
11
Identification
• 16-bit number (usually sequential) assigned to the datagram (used in
fragments, too)
• This field is used by the recipient to reassemble messages without
accidentally mixing fragments from different messages. This is needed
because fragments may arrive from multiple messages mixed together, since
IP datagrams can be received out of order from any device
12
Flags
• 3-bit field with individual bits specifying whether the datagram is a
fragment
Fragment Offset
• It is a 13-bit field.
• When fragmentation of a message occurs, this field specifies the position, in
the overall message where the data in this fragment goes. The first fragment
has an offset of 0. (the value of the field is multiplied by 8 to obtain an
offset)
13
Time to Live
• 8-bit integer initialized by the original sender; decremented by each router
that processes the datagram
• If the value reaches zero (0), the datagram is discarded and an error message
is sent back to the source saying something like-
Time Limit Exceeded
Protocol
• 8-bit field that specifies the higher layer protocol of the payload
14
Header Checksum
• 16-bit ones-complement checksum of header fields
• It is calculated by dividing the header bytes into words (a word is two bytes)
and then adding them together
• The data is not check-summed, only the header.
• At each router the datagram does the same checksum calculation and on a
mismatch, discards the datagram as damaged.
15
Source IP Address
• 32-bit Internet address of the original sender (the addresses of intermediate
routers are not in the header)
Destination IP Address
• 32-bit Internet address of the ultimate destination
IP Options
• Optional header fields used to control routing and datagram processing
(seldom used)
Padding
• If options do not end on a 32-bit boundary, zero bits of padding are added to
make the header a multiple of 32 bits
16
Forwarding an IP Datagram
The forwarding table is initialized when the router boots and must be updated if the
topology changes or hardware fails.
17
Forwarding an IP Datagram (cont’d)
Figure shows an example of internet and the contents of a forwarding table for 18
router R2
Network Prefix Extraction
• The router uses the forwarding table to select the next hop for a datagram this
process is called forwarding.
• The mask field in a forwarding table entry is used to extract the network
portion of an address.
The computation to examine the ith entry in the table can be as:
19
The IP Protocol (Layer 3)
IP makes the best effort it can to deliver each datagram, but it does not guarantee that it
will handle all problems, such as:
• Datagram duplication
• Delayed or out-of-order delivery
• Corruption of data
• Datagram loss
IP is designed to run over any type of network.
20
Encapsulation
• The network hardware treats the IP datagram like any other frame.
• The hardware does not examine the data area of the frame.
• The sender and receiver must agree on the value used in the frame type field of
the frame header in order to know the incoming frame contains an IP datagram.
• Encapsulation also requires the sender to supply the physical address of the
next computer to which the datagram should be sent (using the ARP
command).
• Encapsulation applies to one transmission at a time (i.e., to one hop across the
network at a time).
21
MTU
Defn: The maximum transmission unit (MTU) is the maximum amount of data that a
frame can carry.
22
IPv6 Datagram Format
A number of IPv4 fields have been dropped or made optional. The resulting 40-
byte fixed-length header allows for faster processing of the IP datagram. A new
encoding of options allows for more flexible options processing.
23
Version
• This 4-bit field identifies the IP version number.(0110 -fixed)
Traffic Class
• This 8-bit field is similar in spirit to the Type Of Service field we saw in
IPv4
Flow Label
• This 20-bit field is used to identify a flow of datagrams
Payload Length
• This 16-bit value is treated as an unsigned integer giving the number of
bytes in the IPv6 datagram following the fixed-length, 40-byte datagram
header.
Next header
• This field identifies the protocol to which the contents (data field) of this
datagram will be delivered. The filed uses the same values as the protocol
field in the IPv4 header.
Hop limit
• The contents of this field are decremented by one by each router that
forward the datagram. If the hop limit count reaches zero, the datagram is
discarded.
Source and destination addresses
• The formats of IPv6 have 128-bit addresses .
Data 24
• This is the payload portion of the IPv6 datagram. When the datagram
reaches its destination, the payload will be removed from the IP datagram
and passed on to the protocol specified in the next header field.
Fields no longer present in IPv6
We see that there are a few fields that exist in IPv4, but are no longer present in
IPv6.
Fragmentation/Reassembly
• IPv6 does not allow for fragmentation and reassembly at intermediate
routers, these operations can be performed only by the source and
destination. If an IPv6 datagram received by a router is too large to be
forwarded over the outgoing link, the router simply drops the datagram and
send a “Packet Too Big” error message back to the sender.
• The sender can then resend the data, using a smaller IP datagram size.
Fragmentation and reassembly is a time-consuming operation
Header Checksum
• Because the transport-layer (TCP and UDP) and link-layer (Ethernet)
protocols in the internet layers perform checksumming, the designers of IP
probably felt that this functionality was sufficiently redundant in the
network layer that it could be removed. Once again, fast procession of IP
packets was a central concern. Since the IPv4 header contains a TTL field
(similar to hop limit in IPv6), the IPv4 header checksum needed to be
recomputed at every router. As with fragmentation and reassembly , this too
was a costly operation in IPv4.
Options
• An options field is no longer a part of the standard IP header. However, it
has not gone away. Instead, the options field is one of the possible next
headers pointed to from within the IPv6 header. That is, just as TCP or UDP 25
protocol headers can be the next header within an IP packet, so too can an
options field. The removal of the options field results in a fixed-length, 40-
byte IP header.
Difference between IPv4 datagram format and IPv6 Datagram
format
IPv4 IPv6
• IPv4 has 32-bit address length • IPv6 has 128-bit address length
• In IPv4 end to end connection • In IPv6 end to end connection
integrity is Unachievable integrity is Achievable
• Address representation of IPv4 is • Address Representation of IPv6
in decimal is in hexadecimal
• Fragmentation performed by • In IPv6 fragmentation performed
Sender and forwarding routers only by original sender and
• In IPv4 checksum field is receiver
available • In IPv6 checksum field is not
• IPv4 has header of 20-60 bytes. available
• IPv6 has header of 40 bytes fixed
26
IP
FRAGMENTATION
INTRODUCTION
IP
The Internet Protocol (IP) is the method or protocol which enables
communication between the networks.
Each computer or host has unique IP address on the internet and across the
network data can be delivered from source host to the destination host solely based
on the IP addresses.
The internet layer has the IP data attached with the IP header.
THE IP DATAGRAM
Formally, the unit of IP data delivery is called a datagram.
It is Low-level communication model provided by Internet.
Each packet self-contained :
All the information needed to get to destination
source IP address
destination IP address
options (0 to 40 bytes)
payload
4 bytes
Total length : 8 bit field. This specifies the total number of bytes of the data plus the header.
Identification field : The identification is 16 bits field. Each IP datagram is given the
identifier which is assigned by the sender to aid in reassembling the fragments of a datagram.
Flags: The flags are 3 bit field. Bit 0, bit 1 and bit 2. These flag bits are important while
fragmentation and reassembly. The bit 0 is reserved and always set to 0. The bit 1 is DF bit
tells whether the packet is to fragment or not and the bit 2 is MF bit tells whether the fragment
is last fragment or there may be some more fragments to reassemble.
Fragment offset: The fragment offset is 13 bits field. This value is a multiple of eight bytes.
This fragment offset gives the position of the fragment and places where a fragment belongs
in the original IP datagram.
Source IP Address: 32 bit internet address of the original sender.
The limit on the maximum IP datagram size, imposed by the data link protocol is called
maximum transmission unit (MTU)
IP FRAGMENTATION
When a datagram is small enough, it is originally transmitted as a single unit and arrives at its
final destination.
When an IP datagram size is too large than the maximum packet size (MTU size) to be
traversed, then datagram has to be split into several pieces that fits into the packet size of the
link to be traversed called as fragmentation. It allows the fragments to be further fragmented
and fragments are allowed to take the different routes to traverse and reach destination host.
This pieces are called fragments.
This Fragments are still IP packets.
This Fragments are still IP packets.
Only the Original data field is fragmented and New headers are created for each Fragment.
Router
FRAGMENTATION AND IP FIELDS
Identification Field
IP packet has a 16-bit Identification field.
When router fragments, it places the original Identification field value in the Identification
field of each fragment.
It Allows receiving host’s internet layer process know what fragments belong to each
original packet.
It works even if an IP packet is fragmented several times.
47 47 47 47
Original IP Packet Fragments
FRAGMENTATION AND IP FIELDS
Fragment Offset Field
Fragment offset field (13 bits) is used to reorder fragments with the same Identification field.
It Contains the data field’s starting point from the start of the data field in the original IP
packet.
Receiving host’s internet layer process assembles fragments in order of increasing fragment
offset field value.
This works even if fragments arrive out of order.
720 210 0
FRAGMENTATION AND IP FIELDS
Flags (3 bits)
First bit always set to 0.
DF bit set: Datagram cannot be fragmented and must be discarded if MTU is too small.
MF bit set: This datagram is part of a fragment and an additional fragment follows this one.
Total length
Total length of the current fragment in bytes
DEFRAGMENTATION (REASSEMBLY)
The fragments are sent into a series of smaller IP packets fitting a network’s MTU.
Fragmentation is done by routers.
Fragmentation may be done multiple times along the route.
DEFRAGMENTATION: RECAP
IP Defragmentation
All IP packets resulting from the fragmentation of the same
original IP packet have the same Identification field value.
Defragmentation (reassembly) is done once, by destination
host’s internet layer process.
More Fragments field tells whether there are no more
fragments coming.
IP ADDRESS
CONTENT
■ HISTORY
■ DEFINITION
■ UNDERSTANDING IP ADDRESS
■ FORMATS OF IP ADDRESS
■ PARTS OF IP ADDRESS
■ CLASSES OF IP ADDRESS
■ IPv4 and IPv6
HISTORY
■ Internet Protocol (IP) technology was developed in the 1970s to
support some of the first research computer networks.
■ Class E Network
In a Class E Network, binary addresses start with 1111, therefore the
decimal number can be anywhere from 240 to 255. Class E networks are
used for experimentation. They have never been documented or utilized
in a standard way .
Example of IP Address
The address (binary) - 10000000 00000111 00001111
00000001
has the DECIMAL DOT NOTATION: 128.7.15.1
It belongs to Class B addresses.
Its Network-id is: 128.7
Its Host-id is: 15.1
Different Class of IP Address
B 14 16,384 16 65,536
C 21 20,97,157 8 256
IPV Internet protocol versions
Internet protocol version 4 (Ipv4)
Internet protocol version 6 (Ipv6)
Internet Protocol version 4 (IPv4) defines an IP
address as a 32 bit number. However, because of
the growth of the Internet and the depletion of
available IPv4 addresses, a new version of IP
(IPv6), using 128 bits for the IP address.
Internet Protocol Version 4 (Ipv4)
IPV4 ADDRESSES
An IPv4 address is a 32-bit address that uniquely and universally
defines the connection of a device (for example, a computer or a
router) to the Internet.
■ The IPv4 addresses are unique and universal.
■ An IPv4 address is 32 bits long.
– The address space of IPv4 is 232 (4,294,967,296)
– Notation.
■ Dotted-decimal notation
■ Binary notaion
128.11.3.31
Internet Protocol Version 6(IPv6)
■ Internet Protocol version 6 (IPv6) is the most recent
version of the Internet Protocol (IP), the communications
protocol that provides an identification and location
system for computers on networks and routes traffic
across the Internet and IPv6 was developed by the
Internet Engineering Task Force (IETF) to deal with the
long-anticipated problem of IPv4 address exhaustion.
IPv6 is intended to replace IPv4.
■ An IPv6 address is represented as eight groups of four
hexadecimal digits, each group representing 16 bits (two
octets). The groups are separated by colons (.).
Internet Protocol Version 6(IPv6)
■ The hexadecimal digits are case-insensitive, but IETF
recommendations suggest the use of lower case letters. The
full representation of eight 4-digit groups may be simplified by
several techniques, eliminating parts of the representation.
2041:0000:130F:0000:0000:07C0:853A:140B
IPv4 addresses are binary numbers IPv4 addresses are binary numbers
represented in decimals. represented in hexadecimals.
IPv4 IPv6
Checksum field is available in IPv4 header No checksum field in IPv6 header
Options fields are available in IPv4 header No option fields, but IPv6 Extension headers
are available
Broadcast messages are available Broadcast messages are not available . Instead
a link local scope “ All nodes “ multicast IPv6
address is used for broadcast similar
functionality
Manual configuration(static) of IPv4 addresses Auto-configuration of address is available
or DHCP(Dynamic configuration) is required to
configure IPv4 address
Subnetting
Subnetting is a method for getting the most out of the limited
32-bit IP addressing space. With any address class, subnetting
provides a mean of allocating a part of the host address space
to network addresses, which will let you have more networks.
The part of the host address space allocated to new network
addresses is known as the subnet number.
THE InterNIC assigned the University of Windsor one class B
Network address, which is 137.207.0.0 with network number
part 137.207. The Host number part is left to be assigned by
the local management - The Computing Services) .
Subnetting
IP Subnetting
■ Subnetting is a technique used to allow a single IP network
address to span multiple physical networks.
IP hosts should support subnetting.
■ Subnetting is done by using some of the bits of the host-id
part of the IP address as a physical network identifier.
■ The subnet mask is used to determine the bits of the
network identifier.
■ All hosts on the same network should have the same subnet
mask.
Content
1. ARP
• Introduction
• ARP operation
• ARP packet format
2. RARP
• introduction
• RARP operation
• RARP packet format
ARP
•ARP stands for Address Resolution
Protocol.
•ARP associates an IP address with its physical
address. On a typical physical network, such as a
LAN, each device on a link is identified by a
physical or MAC address that is usually
imprinted on the NIC(Network Interface Card).
Logical Address
• The hosts and routers are recognized at the
network level by their logical addresses.
• A logical address is an internet address
• Called a logical address because it is usually
implemented in software.
• The logical addresses in the TCP/IP are
called IP address and are 32 bits long.
Physical Address
• Hosts/routers are recognized at the physical
layer by their physical address.
• A physical address(MAC address) is a local
address.
• Called a physical address because it is usually
implemented in hardware
Examples
•48-bit MAC addresses in Ethernet
We need both the physical address and the
logical address for packet delivery.
o Thus, we need to be able to map a logical
address to its corresponding physical address
and vice versa
o Solutions
n Static mapping
n Dynamic mapping
Static Mapping
o Create a table that associates a logical address with a
physical address and store in each machine
oType field indicates that the data carried by the frame is an ARP packet.
Operations
o The sender knows the target’s IP address
o IP asks ARP to create an ARP request message
n The sender physical address
n The sender IP address
n The target physical address field is filled with 0s
n The target IP address
o The message is passed to the data link layer to
encapsulate in a data link frame
n Physical destination address is broadcast address.
Operations (Cont.)
oEvery host or routers receives the frame and since the
destination address is broadcast, pass it to the ARP.
Source Address
Destination address Here source is
Here destination is System system B
A
Proxy ARP
o Used to create a subnetting effect
o A router running a proxy ARP
n Its ARP acts on behalf of a set of hosts
n If it receives an ARP request message looking for
the address of one of these host
o The router sends an ARP reply announcing its own
hardware (physical) address
n After the router receives the actual IP packet
o It sends the packet to the appropriate host or router
Example
o Administrator need to create a subnet without
changing the whole system
o Add a router running a proxy ARP
Proxy ARP
ARP Cache
• Clearly, sending an ARP request/reply for each IP
datagram is inefficient.
• Each station maintains a cache (ARP Cache) of current
entries. The entries expire after 20 minutes.
• Everytime the ARP cache is consulted for a MAC
address, the expiry timer is reset in common
implementations.
Things to know about ARP
•Being a broadcast ,the server receives this and , on determining its RARP
message,the MAC/LLC sublayer passes the message to the RARP.
•The latter first uses the MAC address within it to obtain the related IP
address from the configuration file and then proceeds to create a RARP
reply message containing the IP address of the host and also its own
address pair.
• The server then sends the reply message back to the host.
RARP operation
NOTE-
Source Destination
Bandwidth Bandwidth is the capacity of a
network communications link to
transmit the maximum amount
of data from one point to
another in a given amount of
time.
QoS Mechanisms
● Classification and Markings
● Congestion Management
● Congestion Avoidance
● Shaping
● Link Efficiency
Classification and Marking
Classification and marking tools differentiate between applications and
sort packets into different traffic types. Marking will mark each packet as a
member of a network class, which allows devices on the network to
recognize the packet's class. Classification and marking are implemented on
network devices such as routers, switches and access points
Congestion Management
Congestion management tools use packet classification and marking to
determine which queue to place the packets in. Congestion management
tools include priority queuing; first-in, first-out; and low-latency queuing.
Congestion Avoidance
Congestion avoidance tools monitor network traffic for congestion and will
drop low-priority packets when congestion occurs. Congestion avoidance
tools include weighted random early detection and random early detection.
Shaping
Shaping tools manipulate traffic entering the network and prioritize real-time
applications over less time-sensitive applications such as email and
messaging. Traffic shaping tools include buffers, Generic Traffic Shaping
and Frame Relay Traffic Shaping. Similar to shaping, traffic policing tools
focus on throttling excess traffic and dropping packets.
Link Efficiency
Link efficiency tools maximize bandwidth use and reduce delay for packets
accessing the network. Link efficiency tools include Real-Time Transport
Protocol header compression, Transmission Control Protocol header
compression and link compression.
QoS Models
● Best Effort
● Integrated Service
● Differentiated Service
Best Effort
It doesn’t implement any QoS mechanism at all, that is the reason why there
isn’t any complexity associated to this QoS model. BE does not allow for
resource reservation or any other mechanism related to asking for some
kind of special treatment to the network. For this reason, BE model does not
work very well will any emerging application with real-time (RT) traffic
demands.
Integrated Service
With the IntServ model, applications ask to the network for an explicit
resource reservation per flow. Network devices keep track of all the flows
traversing the nodes checking if new packets belong to an existing flow and
if there are enough network resources available to accept the packet.
Differentiated Service
DiffServ allows end devices or hosts to classify packets into different
treatment categories or Traffic Classes (TC), each of which will receive a
different Per-Hop-Behaviour (PHB) at each hop from the source to the
destination. Each network device on the path treats packets according to the
locally defined PHB. Priorities are marked in each packet using DSCP for
traffic classification. This marking is performed per packet usually at the
QoS domain boundary. The marking can be done at several levels of the
networking layers.
Reference
● https://searchunifiedcommunications.techtarget.com/definition/QoS-Quality-of-Service
● https://www.cisco.com/c/en/us/tech/quality-of-service-qos/index.html
Multimedia Communication
Internet
Protocol
Version 8
IPv8 Network
Internet Protocol (IP)
2
Currently...
IPv4 IPv6
32 - bit address 128 - bit address
3
Why IPv8?
• Fundamental architectural problem of IPv4, IPv6, Mobile IP, and IPSec
• A need for an overlay network which:
4
IPv8
5
Peer to Peer Network
6
Overlay Network…
Overlay Layer
• An overlay network is a virtual network
of nodes and logical links, which are built Presentation layer
on top of an existing network.
• Using overlay networks, multiple layers Transportation
of network abstraction can be created to layer
run virtualized network layers, which are Network
supported by a physical infrastructure. layer
• The aim of an overlay network is to Data link
enable a new service or function without layer
having to reconfigure the entire network
Physical
design. layer
7
…Overlay Network
• The internet, for example, is the most widely used overlay network.
Before it was commercialized in the 1980s, the web was a
government-based research network, which ran on top of the
physical infrastructure of the Public Switched Telecommunications
Network (PSTN).
• Today, most overlay networks run on top of the public internet.
• Other examples of overlay networks include virtual private networks
(vpn), peer-to-peer networks and voice over IP services like Skype.
8
Peer to Peer Overlay Network
• A peer-to-peer overlay network is a computer network built on top of
an existing network, usually the Internet.
• Peer-to-peer overlay networks enable participating peers to find the
other peers not by the IP addresses but by the specific logical
identifiers known to all peers.
• Usually, peer-to-peer overlays have the advantage over the traditional
client-server systems because of their scalability and lack of single-
point-of-failure.
• Peer-to-peer overlays are commonly used for file sharing and realtime
data streaming.
9
10
IPv8 Objectives
• Authentication: Mutual authentication is executed using strong
cryptography. During an IPv8 communication session, both parties
can be sure of the other party’s identity. IPv8 users are identified by
their public key. The initial key exchange is designed so that secrets
are never transmitted across the Internet, not even in encrypted
form.
• Privacy: IPv8 is specifically designed for strong privacy protection and
end-to-end encryption.
11
IPv8 Objectives
• No infrastructure dependency: Everybody is equal in the world of
IPv8. No central web server, discovery server, or support foundation is
needed.
• Universal connectivity: IPv8 can establish direct communication in
difficult network situations. This includes connecting people behind a
NAT or firewall.
12
IPv8 Functionality
• Direct, safe, and robust communication between nodes.
• Determine the friendship paths between nodes
• Estimate the trust level between nodes
• Exchange of multimedia information of any size or popularity
• Transfer of virtual currency or real money to any other nodes
13
Features
• Using a custom NAT-traversing DHT to find the current IPv4 network
address, IPv8 keeps the network connectivity going, even as the IPv4
addresses change.
• Each network overlay keeps track of a number of neighbors and
occasionally checks if they are still responsive.
• IPv8 has an integrated attestation service.
14
Conclusion
• IPv8 is an p2p overlay network devised to increase the
effectiveness of the IPv4 and IPv6.
• IPv8 ensures safe communication between nodes
• Addresses of IPv4 and IPv6 are limited whereas, every year a new
set of addresses for IPv8 will be added (draft *RFC published on 1999-2000 GitHub)
• Adopting IPv8 to the existing network will increase the trust,
authentication, and robustness in communication.
• IPv8 is still not implemented into any applications.
*RFC -A Request for Comments (RFC) is a numbered document, which includes appraisals, descriptions and definitions of online protocols,
concepts, methods and programmes. RFCs are administered by the IETF (Internet Engineering Task Force). A large part of the standards
used online are published in RFCs
15
References
• https://py-ipv8.readthedocs.io/en/latest
• https://github.com/Tribler/py-ipv8
• Multimedia communications: Applications, Network Protocols, and
Standards: Fred Halsall
16
SWITCH AND PROTOCOL
ARCHITECTURE ATM LANS
ATM
◦ATM is Asynchronous Transfer Mode
◦ATM is a connection- oriented, high-speed, low-delay switching and
transmission technology that uses short and fixed-size packets, called
cells, to transport information
◦ATM is originally the transfer mode for implementing Broadband
ISDN (B-ISDN) but it is also implemented in non-ISDN
environments where very high data rates are required
Why atm
◦ International standard-based technology
◦ Low variance of delay
◦ Guaranteed quality of service
◦ High capacity switching
◦ Bandwidth flexibility
◦ Medium not shared for ATM LAN
◦ Wide range of user access speeds
Supports audio, video, imagery and data traffic
Common LAN/WAN architecture
Problems
◦ Frame networks
◦ Large data fields
◦ Mixed network traffic
ATM LANs:
High data rate
ATM switch will replace the traditional Ethernet switch, in a switched LAN.
But few things have to be kept in mind :
• Connectionless versus connection-oriented
• Physical address versus virtual circuit identifier
LAN
◦LAN Emulation: LAN Emulation (LANE) is a standard
defined by the ATM Forum that gives to stations attached via
ATM the same capabilities that they normally obtain from
legacy LANs, such as Ethernet and Token Ring. As the name
suggests, the function of the LANE protocol is to emulate a
LAN on top of an ATM network. Specifically, the LAN
protocol defines mechanisms for emulating either an IEEE
802.3 Ethernet or an 802.5 Token Ring LAN.