Data Communication Slide
Data Communication Slide
•
Serial Communications conti’
• As another example, it is common practice to use a 16-
bit-wide data bus to transfer data between a
microprocessor and memory chips
• This provides the equivalent of 16 parallel channels. On
the other hand, when communicating with a
timesharing system over a modem, only a single
channel is available, and bit-serial transmission is
required
• This figure illustrates these ideas:
• Each bit represents a part of the message.
• The individual bits are then reassembled at the
destination to compose the message
Serial Communications conti’
• In general, one channel will pass only one bit
at a time.
• Thus, bit-serial transmission is necessary in
data communications if only a single channel
is available.
• Bit-serial transmission is normally just called
serial transmission and is the chosen
communications method in many computer
peripherals
TRANSMISSION MEDIA
• If the receiver fails to detect this, the received message will be incorrect,
resulting in possibly serious consequences
• As a first line of defense against data errors, they must be detected
• The parity bit, unlike the start and stop bits, is an optional parameter, used in serial communications to
determine if the data character being transmitted is correctly received by the remote device
• Figure 1. Parity
• The parity bit can have one of the following five specifications:
• none Specifies that the local system must not create a parity bit for data characters being transmitted.
It also indicates that the local system does not check for a parity bit in data received from a remote host
• even Specifies that the total number of binary 1s, in a single character, adds up to an even number. If
they do not, the parity bit must be a 1 to ensure that the total number of binary 1s is even. For
example, if the letter a (binary 1100001) is transmitted under even parity, the sending system adds the
number of binary 1s, which in this case is three, and makes the parity bit a 1 to maintain an even
number of binary 1s
• If the letter A (binary 1000001) is transmitted under the same circumstances, the parity bit would be a
0, thus keeping the total number of binary 1s an even number
• odd Operates under the same guidelines as even parity except that the total number of binary 1s must
be an odd number. space Specifies that the parity bit will always be a binary zero. Another term used
for space parity is bit filling, which is derived from its use as a filler for seven-bit data being transmitted
to a device which can only accept eight bit data
• Such devices see the space parity bit as an additional data bit for the transmitted character
• mark Operates under the same guidelines as space parity except that the parity bit is always a binary
1. The mark parity bit acts only as a filler.
• The parity bit for each data packet is computed before the data is transmitted. Below are examples of how a
parity bit would be computed using both odd and even parity settings.
• Odd parity: Initial value: 1010101 (four 1s)
• Parity bit added: 1
• Transmitted value: 10101011
• Result: Odd parity (five 1s)
• Even parity: Initial value: 1010101 (four 1s)
• Parity bit added: 0
• Transmitted value: 10101010
• Result: Even parity (four 1s)
• The value of the parity bit depends on the initial parity of the data. For example, the binary value 10000000 has
an odd parity
• Therefore, a 0 would be added to keep the parity odd and a 1 would be added to give the value an even parity
• While parity checking is a useful way validating data, it is not a foolproof method. For instance, the values 1010
and 1001 have the same parity
• Therefore, if the value 1010 is transmitted and 1001 is received, no error will be detected. This means parity
checks are not 100% reliable when validating data
• Still, it is unlikely that more than one bit will be incorrect in a small packet of data
• As long as only one bit is changed, an error will result. Therefore, parity checks are most reliable when using
small packet sizes
• If an error can be flagged, it might be possible
to request that the faulty packet be resent, or
to at least prevent the flawed data from being
taken as correct
• If sufficient redundant information is sent,
one- or two-bit errors may be corrected by
hardware within the receiver before the
corrupted data ever reaches its destination
• A parity bit is added to a data packet for the purpose of
error detection
• In the even-parity convention, the value of the parity
bit is chosen so that the total number of '1' digits in the
combined data plus parity packet is an even number
• Upon receipt of the packet, the parity needed for the
data is recomputed by local hardware and compared to
the parity bit received with the data
• If any bit has changed state, the parity will not match,
and an error will have been detected. In fact, if an odd
number of bits (not just one) have been altered, the
parity will not match
• If an even number of bits have been reversed, the
parity will match even though an error has
occurred
• However, a statistical analysis of data
communication errors has shown that a single-bit
error is much more probable than a multi-bit error
in the presence of random noise.
• Thus, parity is a reliable method of error detection
• Another approach to error detection involves
the computation of a checksum
• In this case, the packets that constitute a
message are added arithmetically
• A checksum number is appended to the
packet sequence so that the sum of data plus
checksum is zero
• When received, the packet sequence may be
added, along with the checksum, by a local
microprocessor
• If the sum is nonzero, an error has occurred
As long as the sum is zero, it is highly unlikely
(but not impossible) that any data has been
corrupted during transmission
• Errors may not only be detected, but also corrected
if additional code is added to a packet sequence
• If the error probability is high or if it is not possible
to request retransmission, this may be worth doing
• However, including error-correcting code in a
transmission lowers channel efficiency, and results
in a noticeable drop in channel throughput
Data Compression
X-Rays 1017
Ultra-Violet Light 7.5 x 1015
Visible Light 4.3 x 1014
Infrared Light 3 x 1011
Radio Frequencies cont.
•
•
•
•
•
•
•
•
•
•
•
•
•
•
•
•
•
•
• Radio frequencies are in the range of
300 kHz to 10 GHz.
• We are seeing an emerging technology
called wireless LANs.
• Some use radio frequencies to connect
the workstations together, some use
infrared technology.
.
Microwave
• A packet is still stored temporarily at each node and queued for onward
transmission together with other packets
• Access to the data is obtained using a set of numbers
• A virtual circuit is referred to as permanent if it is a leased line or
personal.
• If the virtual connection can be transferred only to the device the
message is intended to, it is termed a virtual call ( eg phoning from a
public phone ) and this is connected by means of a call request packet.
• This call request packet must contain both the called end
number ( or address ) and the number of a free local
logical channel . In the call request, the network routes
it to the node connected to the end device called
• If this device is free to receive the call the node inserts
the number of a logical channel which can carry the
incoming data and forwards the call request as an
incoming call packet. The end device then retains a call
accept packet, which is routed back to the Network
connected to the sending device .
• This node thus sends a call connects packet to the source
node and the establishment of the virtual call is
completed.
• Propagation delay - This is the time taken to
transmit the data across the media.
• Node delay - It is the time taken by the
node to carry out the switching process.
• Transmission delay -Is the time required for
a sending device to transmit data across the
network. This depends on the length of the
message and the pace of the transmission the
network.
• Control for data flowing thro a NW is vested as
the used which are generally intelligent
microprocessor ie device in and stoned py /
data
• ( i ) Knotting ( ii ) Flowing ( iii)
Enron Control
•
•
ROUTING
• Introduction
• We all understand that TCP/IP, IPX-SPX are protocols which are used in
a Local Area Network (LAN) so computers can communicate between
with each other and with other computers on the Internet.
• Chances are that in your LAN you are most probably running TCP/IP.
This protocol is what we call a "routed" protocol. The term "routed"
refers to something which can be passed on from one place (network)
to another. In the example of TCP/IP, this is when you construct a data
packet and send it across to another computer on the Internet
• This ability to use TCP/IP to send data across networks and the
Internet is the main reason it's so popular and dominant. If you're
thinking also of NetBeui and IPx/SPX,
• then note that NetBeui is not a routed protocol, but
IPX/SPX is! The reason for this is actually in the
information a packet holds when it uses one of the
protocols.
• explaination:
• If you looked at a TCP/IP or IPX/SPX packet, you will
notice that they both contain a "network" layer. For
TCP/IP, this translates to the IP layer (Layer 3), as for
IPX/SPX, it's the IPX layer (Layer 3). To make it easy to
understand, I will use TCP/IP as an example.
• NetBeui on the other hand has no such information! This
means that NetBeui has no information about the
destination network to which it needs to send the data, as
it was developed for LAN use only, or you could say that all
hosts are considered to be on the same logical network and
all resources are considered to be local. This classifies
NetBeui as a "non
• Routing protocols were created for routers. These protocols
have been designed to allow the exchange of routing
tables, or known networks, between routers. There are a
lot of different routing protocols, each one designed for
specific network sizes, so I am not going to be able to
mention and analyse them all, but I will focus on the most
popular.
The two main types of routing: Static routing and Dynamic routing
• The router learns about remote networks from neighbor routers or from an administrator. The
router then builds a routing table, the creation of which I will explain in detail, that describes
how to find the remote networks. If the network is directly connected then the router already
knows how to get to the network. If the networks are not attached, the router must learn how to
get to the remote network with either static routing (administrator manually enters the routes in
the router's table) or dynamic routing (happens automatically using routing protocols).
• The routers then update each other about all the networks they know. If a change occurs e.g a
router goes down, the dynamic routing protocols automatically inform all routers about the
change. If static routing is used, then the administrator has to update all changes into all routers
and therefore no routing protocol is used.
• Only Dynamic routing uses routing protocols, which enable routers to:
• Dynamically discover and maintain routes
• Calculate routes
• Distribute routing updates to other routers
• Reach agreement with other routers about the network topology
• Statically programmed routers are unable to discover routes, or send routing information to
other routers. They send data over routes defined by the network Administrator.
• A Stub network is so called because it is a
dead end in the network. There is only one
route in and one route out and, because of
this, they can be reached using static routing,
thus saving valuable bandwidth.
Dynamic Routing Protocols
• Routers keep an entry for the network-down state, allowing time for
other routers to re-compute for this topology change, this way,
allowing time for either the downed router to come back or the
network to stabilize somewhat before changing to the next best
route is the hold-down time
• When a router receives an update from a neighbor indicating that a
previously accessible network is not working and is inaccessible, the
hold-down timer will start
• If a new update arrives from a neighbor with a better metric than
the original network entry, the hold-down is removed and data is
passed
• But an update is received from a neighbor router before the hold-
down timer expires and it has a lower metric than the previous
route, therefore the update is ignored and the hold-down timer
keeps ticking
Hold-Down Timers
There are three instances when triggered updates will reset the
hold-down timer:
1) The hold-down timer expires
2) The router received a processing task proportional to the
number of links in the internetwork.
3) Another update is received indicating the network status has
changed.
In our example, any update received by Router B from Router A,
would not be accepted until the hold-down timer expires
This will ensure that Router B will not receive a "false" update
from any routers that are not aware that Network 5 is unreachable
Router B will then send a update and correct the other routers'
tables.
Link State Routing Protocols
•The computers (nodes) connect to the hub using Unshielded Twisted Pair cable
(UTP).
•Only one node can be connected to each port of the hub. The pictured hub has a
total of 8 ports, which means up to 8 computers can be networked
•When hubs were not that common and also expensive, most offices and home
networks use to install coax cable
•The way hubs work is quite simple and straightforward: When a computer on
any one of the eight ports transmits data, this is replicated and sent out to the
other seven ports
•Check out the below picture which shows it clearly
Hubs
• EXPLANATION:
• Node 1 is transmitting some data to Node 6 but all nodes
are receiving the data as well. This data will be rejected by
the rest of the nodes once they figure out it's not for them
• This is accomplished by the node's network card reading
the destination MAC address of the frame (data) it
receives, it examines it and sees that it doesn't match with
it's own and therefore discards the frame
• Please see the Datalink layer in the OSI section for more
information on MAC addresses
• Most hubs these days also have a special port which can
function as a normal port or as an "uplink" port
Hubs
• An uplink port allows you to connect another
hub to the existing one, increasing the amount
of ports which will be available to you
• This is a cheap solution when you need to get
a few more computers networked and it works
quite well up to a point
• This is how 2 eight port hubs would look when
connected via the uplink port and how the
data is replicated to all 16 ports :
Hubs
• In the above picture you can see that Node 1 is again transmitting data
to Node 6 and that every other node connected to the hub is receiving
the information
• As we said, this is a pretty good and cheap solution, but as the network
gets busier, you can clearly understand that there is going to be a lot of
unnecessary data flowing all over the network
• All Nodes here are in the same broasdcast and collision domain since
they will hear every broadcast and collision that occurs
• This is the same situation you get when you use coax cable, where
every node or computer is connected onto the same cable and the data
that's put onto it travels along the cable and is received by every
computer
Hubs
• Most hubs these days also have a special port which
can function as a normal port or as an "uplink" port
• An uplink port allows you to connect another hub
to the existing one, increasing the amount of ports
which will be available to you
• This is a cheap solution when you need to get a few
more computers networked and it works quite well
up to a point
• This is how 2 eight port hubs would look when
connected via the uplink port and how the data is
replicated to all 16 ports :
Hubs
• You probably also noticed the two orange boxes labled
"50 Ohm"
• These are called terminating resistors and are used on
both ends of the coax cable so when the signal gets to
them, it's absorbed by them and that way you don't get
the signal reflecting back
• Think of them as shock absorbent and the data signal is
the shock wave which gets absorbed when it reaches
the destination
• terminating resistors
• The coax cable can be up to 185 meters and can contain
no more than 30 nodes per segment
Hubs
• What you're looking at in the above picture is one
segment 25 meters long with 4 nodes attached to it
• Now coming back to the hubs, there are a few standard
features most of them have these include a link and
activity LED for each port, a power LED and collision LED
• Some hubs have separate link lights and activity lights,
others combine them into one where the link light will
flash when there is activity, otherwise it remains
constantly on
• The Netgear hub which is displayed at the beginning of
this page has two separate LEDs for the activity and link
but the Compex hub below has only one.
Hubs
• This little hub also contains a special BNC connection so you
can connect a coax cable to it
• When you do connect it, the BNC light comes on. Notice the
label at the top where they have written "8 port Ethernet
Repeater"
• As we already have said, hubs are just simple repeaters
• The collision light on the hubs will only light up when a
collision is detected.
Hubs
• Collision is when 2 computers or nodes try to talk on the network at the
same time.
• When this happens, their frames will collide and become corrupted. The
hubs are smart enough to detect this and will light up the collision LED for
a small amount of time (1/10 of a second for each collision)
• If you find yourself wondering why couldn't they make things work so
more than two computers can talk on the network
• It's always a good idea to have a redundant link between your switches, in case one
decides to go for a holiday.
• When you setup redundant switches in your network to stop failures, you can create
problems.
• Have a look at the picture below and I'll explain:
• The above picture shows an example of two switches which have been placed in the
network to provide redundancy in case one fails.
• Both switches have their first port connected to the upper section of the network, while
their port 2 is connected to the lower section of the same network.
• This way, if Switch A fails, then Switch B takes over, or vice versa.
• Things will work fine until a broadcast come along and causes alot of trouble.
• For the simplicity of this example, I am not going to show any workstations, but only the
server which is going to send a broadcast over the network, and keep in mind that this is
what happens in real life if your switch does not support Spanning-Tree Protocol (STP),
this is why I stuck the "Optional" near the "Loop Avoidance" at the start of this section:
Loop Avoidance
• The Fragment free switching method is mainly used to check for frames
which have been subject to a collision.
• The frame's first 64 bytes are only checked before forwarding the frame
out the designated port.
• Reason for this is because almost all collisions will happen within the first
64 bytes of a frame.
• If there is corruption in the first 64 bytes, it's most likely that that frame
was a victim of a collision
• Just keep one important detail in mind:
When you go out to buy a switch, make sure you check the amount of
memory it has.
Fragment Free conti’
Self configuring
Primitive bridges are often inexpensive
Reduce the size of collision domain by
microsegmentation in non switched networks
Transparent to protocols above the MAC layer allows
the introduction of management/performance
information and access control
LANs interconnected are separate, and physical
constraints such as number of stations, repeaters and
segment length don't apply
Helps minimize bandwidth usage
Disadvantages of network bridges
•Note that both source and destination addresses are used in this
algorithm. Source addresses are recorded in entries in the table,
while destination addresses are looked up in the table and matched
to the proper segment to send the frame to.
•As an example, consider two hosts (A and B) and a bridge (C). The
bridge has two interfaces, (C1, C2).
•A is connected to the C1 and B is connected to the C2. Note the
physical connection is A - C - B, since C has two ports.
•A sends a frame to (C), and C records the source MAC address into
its table
•The bridge now has an address for A in its table, so it forwards it to
B by broadcasting it to FF:FF:FF:FF:FF:FF, or every address possible
•B, having received a packet from A, now transmits a packet in
response
Transparent Bridging cont’
this time, the bridge has A's address in the table, so it
records B's address sends it to A's unique MAC
address specifically
Two-way communication is now possible between A
and B without any further broadcasting.
Note, however, that only the bridge along the direct
path between A and B possess table entries for B
If a third host (D), on the same side as A sends a
frame to B, the bridge simply records the address
source, and broadcasts it to B's segment
Source route bridging
• Source route bridging is used primarily on
token ring networks, and is standardized in
Section 9 of the IEEE 802.2 standard
• The spanning tree protocol is not used, the
operation of the network bridges is simpler,
and much of the bridging functions are
performed by the end systems, particularly
the sources, giving rise to its name.
Source route bridging
• A field in the token ring header, the routing
information field (RIF), is used to support
source-route bridging
• Upon sending a packet, a host attaches a RIF
to the packet indicating the series of bridges
and network segments to be used for
delivering the packet to its destination
• The bridges merely follow the list given in the
RIF - if a given bridge is next in the list, it
forwards the packet, otherwise it ignores it.
Source route bridging
• When a host wishes to send a packet to a destination for
the first time, it needs to determine an appropriate RIF
• A special type of broadcast packet is used, which
instructs the network bridges to append their bridge
number and network segment number to each packet as
it is forwarded
• Loops are avoided by requiring each bridge to ignore
packets which already contain its bridge number in the
RIF field
• At the destination, these broadcast packets are modified
to be standard unicast packets and returned to the
source along the reverse path listed in the RIF
Source route bridging
Thus, for each route discovery packet
broadcast, the source receives back a set of
packets, one for each possible path through
the network to the destination