Professional Documents
Culture Documents
Port addresses
Dr. Ramesh Babu H S, Professor & Head, Dept. of ISE, AcIT, Bangalore 1
Computer Networks II Unit - IV TCP/IP - II
TCP Protocol
Source Port and Destination port:-The source and destination ports identify the sending
and receiving applications.
Sequence number:- 32 bit sequence numbers are used for acknowledgements and window
mechanism
1. The active open is performed by the client sending a SYN to the server.
2. In response, the server replies with a SYN-ACK.
3. Finally the client sends an ACK back to the server.
At this point, both the client and server have received an acknowledgment of the connection.
Example:
1. The initiating host (client) sends a synchronization packet (SYN flag set to 1) to initiate a
connection. It sets the packet's sequence number to a random value x.
2. The other host receives the packet, records the sequence number x from the client, and
replies with an acknowledgment and synchronization (SYN-ACK). The
Acknowledgment is a 32-bit field in TCP segment header. It contains the next sequence
number that this host is expecting to receive (x + 1). The host also initiates a return
session. This includes a TCP segment with its own initial Sequence Number of value y.
3. The initiating host responds with the next Sequence Number (x + 1) and a simple
Acknowledgment Number value of y + 1, which is the Sequence Number value of the
other host + 1.
Dr. Ramesh Babu H S, Professor & Head, Dept. of ISE, AcIT, Bangalore 2
Computer Networks II Unit - IV TCP/IP - II
Figure: - Justifying a three way handshake: If a host always uses the same initial
sequence, old segments cannot be distinguished from the current ones.
In above case, after connection is established, a delayed segment from the previous
connection arrives.
Host B accepts this segment, since the sequence number is legal.
Dr. Ramesh Babu H S, Professor & Head, Dept. of ISE, AcIT, Bangalore 3
Computer Networks II Unit - IV TCP/IP - II
If a segment from current connection arrives later, it will be rejected by host B, thinking that
the segment is a duplicate. Thus host B cannot distinguish a delayed segment from the new
one.
Dr. Ramesh Babu H S, Professor & Head, Dept. of ISE, AcIT, Bangalore 4
Computer Networks II Unit - IV TCP/IP - II
The above figure illustrates an example for TCP Window flow control
Suppose at time t0, the TCP module in host B advertised a window of 2048 and expected
next byte received to have a sequence number 2000. This advertised window size allows
host A to transmit upto 2048 bytes of unacknowledged data.
At time t1, host A has only assumed 1024 bytes to transmits all the data starting with
sequence number 2000, and this TCP entity also advertises a window of size 1024 bytes
to host B and next byte expected to have a sequence number 1.
When the segment arrives, host B chooses to delay the acknowledgement for
piggybacking (the technique of temporarily delaying outgoing acknowledgments so that
they can be looked onto the next outgoing data frame is known as piggybacking).
Meanwhile at t2, host A has another 1024 bytes of data and transmits it. After the
transmission, A’s sending window closes completely. It is not allowed to transmit any
more data until an acknowledgment comes back.
At time t3, host B has 128 bytes of data to transmit. Host B simply piggybacks the
acknowledgment (ACK=4048) to the data segment. at this time also host B also
advertises the window size of 512 bytes (because of some other connection the window
size may shrink).
When host A receives the segment, at time t4, assume that host A has nearly 2048 bytes
of data, but it is allowed only 512 bytes.
Like this, window advertisement dynamically controls the flow of data from one host to
another and it prevents the receiver buffer from being overrun.
Dr. Ramesh Babu H S, Professor & Head, Dept. of ISE, AcIT, Bangalore 5
Computer Networks II Unit - IV TCP/IP - II
Nagle Algorithm
• Situation: user types 1 character at a time
– Transmitter sends TCP segment per character (41B)
– Receiver sends ACK (40B)
– Receiver echoes received character (41B)
– Transmitter ACKs echo (40 B)
– 162 bytes transmitted to transfer 1 character!
• Solution:
– TCP sends data & waits for ACK
– New characters buffered
– Send new characters when ACK arrives
– Algorithm adjusts to RTT
• Short RTT send frequently at low efficiency
• Long RTT send less frequently at greater efficiency
Solution:
Receiver does not advertise window until window is at least ½ of receiver buffer or
maximum segment size
Transmitter refrains from sending small segments.
TCP provides two types of connection terminations i.e. graceful and abrupt termination.
A graceful termination can be initiated by an application, when it is having no more data
to send.
The TCP entity completes transmission of its data and, upon receiving acknowledgement
from the receiver, issues a segment with the FIN bit set.
Upon receiving the FIN segment, a TCP entity informs its application that other entity
has terminated its transmission of data.
Dr. Ramesh Babu H S, Professor & Head, Dept. of ISE, AcIT, Bangalore 6
Computer Networks II Unit - IV TCP/IP - II
The second type of termination is an abrupt connection termination through reset (RST)
segments.
If an application decides to terminate a connection abruptly, it issues an ABORT
command, which causes TCP to discard any data that is queued for transmission and to
send an RST segment.
The TCP that receives the RST segment then notifies its application process that the
connection has been terminated.
Dr. Ramesh Babu H S, Professor & Head, Dept. of ISE, AcIT, Bangalore 7
Computer Networks II Unit - IV TCP/IP - II
A connection progresses through a series of states during its lifetime. The states are:
LISTEN, SYN-SENT, SYNRECEIVED, ESTABLISHED, FIN-WAIT-1, FIN-WAIT-2,
CLOSE-WAIT, CLOSING, LAST-ACK, TIME-WAIT, and the fictional state CLOSED.
CLOSED is fictional because it represents the state when there is no TCB, and therefore,
no connection.
Briefly the meanings of the states are:
LISTEN represents waiting for a connection request from any remote TCP and port.
SYN-SENT represents waiting for a matching connection request after having sent a
connection request.
SYN-RECEIVED represents waiting for a confirming connection request acknowledgment
after having both received and sent a connection request.
ESTABLISHED represents an open connection, data received can be delivered to the user.
The normal state for the data transfer phase of the connection.
FIN-WAIT-1 represents waiting for a connection termination request from the remote TCP,
or an acknowledgment of the connection termination request previously sent.
FIN-WAIT-2 represents waiting for a connection termination request from the remote TCP.
Dr. Ramesh Babu H S, Professor & Head, Dept. of ISE, AcIT, Bangalore 8
Computer Networks II Unit - IV TCP/IP - II
CLOSE-WAIT represents waiting for a connection termination request from the local user.
CLOSING represents waiting for a connection termination request acknowledgment from
the remote TCP.
LAST-ACK represents waiting for an acknowledgment of the connection termination
request previously sent to the remote TCP (which includes an acknowledgment of its
connection termination request).
TIME-WAIT represents waiting for enough time to pass to be sure the remote TCP received
the acknowledgment of its connection termination request.
CLOSED represents no connection state at all.
Dr. Ramesh Babu H S, Professor & Head, Dept. of ISE, AcIT, Bangalore 9
Computer Networks II Unit - IV TCP/IP - II
The operation of TCP congestion control algorithm may be divided into three phases and
they are as follows:-
Dr. Ramesh Babu H S, Professor & Head, Dept. of ISE, AcIT, Bangalore 10
Computer Networks II Unit - IV TCP/IP - II
Multihomed AS: large corporation (no transit): multiple connections to other AS’s, it
carries only local traffic and does not support transit traffic.
Transit AS: provider, it has multiple connections to the outside world and can carry
transit and local traffic.
Intra-AS Routing
The Routing Information Protocol (RIP) is a dynamic routing protocol used in local
and wide area networks.
it is classified as an interior gateway protocol (IGP) using the distance-vector routing
algorithm.
A RIP run on top of UDP, port number 520 is used.
RIP is a distance-vector routing protocol, Which employs the hop count as a routing
metric.
Suitable for small networks (local area environments)
The maximum number of hops allowed with RIP is 15, and the hold down time is 180
seconds.
Value of 16 is reserved to represent infinity, i.e. node is not reachable.
Small number limits the count-to-infinity problem.
Originally each RIP router transmits full updates every 30 seconds by default.
A router expects to receive an update message from each of its neighbors within 180
seconds in the worst case
If router does not receive update message from neighbor X within this limit, it assumes
the link to X has failed and sets the corresponding minimum cost to 16 (infinity)
Originally, routing tables were small enough that the traffic was not significant.
RIP implements the split horizon, route poisoning and holddown mechanisms to prevent
incorrect routing information from being propagated. These are some of the stability
features of RIP.
RIP is available in two versions, i.e. RIP1 and RIP2.
In many current networking environments RIP would not be the preferred choice for
routing as its time to converge and scalability are poor compared to EIGRP, OSPF
The hop limit severely limits the size of network it can be used in.
The periodic routing updates do not carry subnet information, lacking support for
variable length subnet masks (VLSM). This limitation makes it impossible to have
different-sized subnets inside of the same network class.
Dr. Ramesh Babu H S, Professor & Head, Dept. of ISE, AcIT, Bangalore 11
Computer Networks II Unit - IV TCP/IP - II
Advantages of OSPF:
Dr. Ramesh Babu H S, Professor & Head, Dept. of ISE, AcIT, Bangalore 12
Computer Networks II Unit - IV TCP/IP - II
Using areas, OSPF networks can be logically segmented to decrease the size of routing
tables. Table size can be further reduced by using route summarization.
OSPF is an open standard, not related to any particular vendor.
Disadvantages of OSPF:
OSPF Network
Dr. Ramesh Babu H S, Professor & Head, Dept. of ISE, AcIT, Bangalore 13
Computer Networks II Unit - IV TCP/IP - II
Designated Routers
Reduces number of adjacencies
Elected by each multi-access network after neighbor discovery by hello protocol
Election based on priority & id fields
Generates link advertisements that list routers attached to a multi-access network
Forms adjacencies with routers on multi-access
network
Backup prepared to take over if designated router fails
Dr. Ramesh Babu H S, Professor & Head, Dept. of ISE, AcIT, Bangalore 14
Computer Networks II Unit - IV TCP/IP - II
Each OSPF packet consists of an OSPF header followed by the packet body (data)
The description of each field in the OSPF header is given below:
Version: This field specifies the protocol version, current version is 2.
Type: This field specifies the type of OSPF packet. The following types are defined hello,
database description, link-state request, link-state update, link-state acknowledgements.
Packet length: This field specifies the length of OSPF packet in bytes, including OSPF
header.
Router ID: This field identifies the sending router’s ip address.
Area ID: This field identifies the area this packet belongs to. The area ID of 0.0.0.0 is
reserved for backbone.
Checksum: to detect errors in packet.
Authentication type and Authentication: Combination of these fields can be used to
authenticate OSPF packets.
There are five types of OSPF packets
Hello Packet
Database description Packet
Link-state request Packet
Link-state update Packet and
Link-state acknowledgement
Dr. Ramesh Babu H S, Professor & Head, Dept. of ISE, AcIT, Bangalore 15
Computer Networks II Unit - IV TCP/IP - II
Dr. Ramesh Babu H S, Professor & Head, Dept. of ISE, AcIT, Bangalore 16
Computer Networks II Unit - IV TCP/IP - II
LSA Header: The Link State Advertisement (LSA) header describes the state of the router
or network.
Each LSA header contains enough information to uniquely identify an entry in the LSA
(type, ID and advertising router).
The format contains multiple LSA headers and routers will send only their LSA header
instead of entire database.
The format of LSA header is as shown below
Figure: - LSA Header
The function of LSA header is given below
Step 3: Propagation of OSPF Link State Request and building routing tables
When a router wants to update the link-state database, it sends a LS request packet to
neighbor to update part of its link-state database
Dr. Ramesh Babu H S, Professor & Head, Dept. of ISE, AcIT, Bangalore 17
Computer Networks II Unit - IV TCP/IP - II
Each LSA request is specified by the link state type, link state ID, and the advertising
router.
Dr. Ramesh Babu H S, Professor & Head, Dept. of ISE, AcIT, Bangalore 18
Computer Networks II Unit - IV TCP/IP - II
All BGP message types use the basic packet header. Open, update, and notification
messages have additional fields, but keep-alive messages use only the basic packet
header.
The below figure illustrates the fields used in the BGP header.
Dr. Ramesh Babu H S, Professor & Head, Dept. of ISE, AcIT, Bangalore 19
Computer Networks II Unit - IV TCP/IP - II
Dr. Ramesh Babu H S, Professor & Head, Dept. of ISE, AcIT, Bangalore 20
Computer Networks II Unit - IV TCP/IP - II
Dr. Ramesh Babu H S, Professor & Head, Dept. of ISE, AcIT, Bangalore 21
Computer Networks II Unit - IV TCP/IP - II
Multicast Routing
The sending of a packet from one sender to multiple receivers with a single "transmit"
operation is known as multicast routing. Teleconferencing is an example which requires
multicast routing.
The goal of multicast routing is to find a tree of links that connects all of the routers that
have attached hosts belonging to the multicast group. Multicast packets will then be
routed along this tree from the sender to all of the hosts belonging to the multicast tree.
There are many ways to generate multicast tree, MBONE is also one approach to
generate multicast tree. The Internet Multicast Backbone (MBone) is an interconnected
set of subnetworks and routers that support the delivery of IP multicast traffic.
An IP multicast group is identified by a Class D address.
Dr. Ramesh Babu H S, Professor & Head, Dept. of ISE, AcIT, Bangalore 22
Computer Networks II Unit - IV TCP/IP - II
For each source, if a packet arrives on a link that the local router believes to be on the
shortest path back toward the packet's source, then the router forwards the packet on all
interfaces except the incoming interface.
If the packet does not arrive on the interface that is on the shortest path back toward the
source, then the packet is discarded.
The interface over which the router expects to receive multicast packets from a particular
source is referred to as the "parent" link.
The outbound links over which the router forwards the multicast packet are called "child"
links for this source.
The key benefit to reverse path broadcasting is that it is reasonably efficient and easy to
implement.
It does not require that the router know about the entire spanning tree, nor does it require
a special mechanism to stop the forwarding process (as flooding does).
In addition, it guarantees efficient delivery since multicast packets always follow the
"shortest" path from the source station to the destination group.
Finally, the packets are distributed over multiple links, resulting in better network
utilization since a different tree is computed for each source.
One of the major limitations of the RPB algorithm is that it does not take into account
multicast group membership when building the delivery
TRPB
Truncated Reverse Path Broadcasting (TRPB) was developed to overcome the limitations
of Reverse Path Broadcasting.
With information provided by IGMP, multicast routers determine the group memberships
on each leaf subnetwork and avoid forwarding datagrams onto a leaf subnetwork if it
does not contain at least one member of a given destination group. Thus, the delivery
tree is "truncated" by the router if a leaf subnetwork has no group members.
RPM allows the source-based "shortest-path" tree to be "pruned" so that datagrams are
only forwarded along branches that lead to active members of the destination group.
When a multicast router receives a packet for a (source, group) pair, the first packet is
forwarded following the TRPB algorithm across all routers in the internetwork.
Routers on the edge of the network (which have only leaf subnetworks) are called leaf
routers.
The TRPB algorithm guarantees that each leaf router will receive at least the first
multicast packet.
Dr. Ramesh Babu H S, Professor & Head, Dept. of ISE, AcIT, Bangalore 23
Computer Networks II Unit - IV TCP/IP - II
If there is a group member on one of its leaf subnetworks, a leaf router forwards the
packet based on this group membership information.
If none of the subnetworks connected to the leaf router contain group members, the leaf
router may transmit a "prune" message on its parent link, informing the upstream router
that it should not forward packets for this particular (source, group) pair on the child
interface on which it received the prune message.
Prune messages are sent just one hop back toward the source.
An upstream router receiving a prune message is required to store the prune information
in memory.
If the upstream router has no recipients on local leaf subnetworks and has received prune
messages from each downstream neighbor on each of the child interfaces for this (source,
group) pair, then the upstream router does not need to receive any more packets for this
(source, group) pair.
Therefore, the upstream router can also generate a prune message of its own, one hop
further back toward the source.
A host may later decide to join a multicast group after a prune message has been sent by
its leaf router. In this case the leaf router may send graft message to its upstream router
to cancel its earlier prune message
The above figure shows the graft message flow when a host attached to router 6 wants to
join the group.
Subsequently, router 1 will forward the multicast packets to router 4, which will forward
the multicast packets to router 6. then the multicast packets arrive at the host.
DVRMP
The first multicast routing protocol used in the Internet and the most widely supported
multicast routing algorithm is the distance vector multicast routing protocol (DVMRP)
DVMRP implements source-based trees with reverse path forwarding, pruning, and
grafting.
Dr. Ramesh Babu H S, Professor & Head, Dept. of ISE, AcIT, Bangalore 24
Computer Networks II Unit - IV TCP/IP - II
The (IGMP) runs between hosts and their immediately-neighboring multicast routers.
The mechanisms of the protocol allow a host to inform its local router that it wishes to
receive transmissions addressed to a specific multicast group. Also, routers periodically
query the LAN to determine if any group members are still active.
If there is more than one IP multicast router on the LAN, one of the routers is elected
"querier" and assumes the responsibility of querying the LAN for the presence of any
group members.
Based on the group membership information learned from the IGMP, a router is able to
determine which (if any) multicast traffic needs to be forwarded to each of its "leaf"
subnetworks.
"Leaf" subnetworks are those that have no further downstream routers; they either
contain receivers for some set of groups, or they do not.
Multicast routers use the information derived from IGMP, along with a multicast routing
protocol, to support IP multicasting across the MBone.
Dr. Ramesh Babu H S, Professor & Head, Dept. of ISE, AcIT, Bangalore 25
Computer Networks II Unit - IV TCP/IP - II
Mobile IP
The Mobile IP protocol allows location-independent routing of IP datagrams on the
Internet.
Each mobile node is identified by its home address disregarding its current location in the
Internet. While away from its home network, a mobile node is associated with a care-of
address which identifies its current location and its home address is associated with the
local endpoint of a tunnel to its home agent.
Mobile IP specifies how a mobile node registers with its home agent and how the home
agent routes datagrams to the mobile node through the tunnel.
Mobile IP provides an efficient, scalable mechanism for roaming within the Internet.
Using Mobile IP, nodes may change their point-of-attachment to the Internet without
changing their home IP address.
Mobile IP allows portable devices called mobile hosts (MHs) to roam from one area to
another.
A common analogy to understand Mobile IP is that when someone moves his residence from
one location to another. Person moves from Boston to New York. Person drops off new
mailing address to New York post office. New York post office notifies Boston post office of
new mailing address. When Boston post office receives mail for person it knows to forward
mail to person's New York address.
Dr. Ramesh Babu H S, Professor & Head, Dept. of ISE, AcIT, Bangalore 26
Computer Networks II Unit - IV TCP/IP - II
When a correspondent host (CH) wants to send a packet to MH, the CH transmits the
standard IP packet with its address as the source IP address and MH’s address as
destination IP address.
This packet will be intercepted by the mobile host’s router called home agent (HA),
which keeps track of the current location of the MH. The HA manages all MHs in its
home network that use the same address prefix
If the MH is located in the home network, the HA simply forwards the packet to its home
network.
When an MH moves to a foreign network, the MH obtains a care of address from the
foreign agent (FA) and registers the new address with its HA. The care-of-address
reflects the MH’s current location and is typically the address of FA.
Once the HA knows the care-of-address of the MH, the HA can forward the registration
packet to the MH via the FA.
Destination address of the other end of the tunnel (FA) and Final destination MH.
Dr. Ramesh Babu H S, Professor & Head, Dept. of ISE, AcIT, Bangalore 27
Computer Networks II Unit - IV TCP/IP - II
Address translation
Dr. Ramesh Babu H S, Professor & Head, Dept. of ISE, AcIT, Bangalore 28
Computer Networks II Unit - IV TCP/IP - II
DHCP discover message - The initial broadcast sent by the client to obtain a DHCP lease. It
contains the client MAC address and computer name. This is a broadcast using
255.255.255.255 as the destination address and 0.0.0.0 as the source address.
Dynamic Host Configuration Protocol (DHCP) is a network protocol that enables a server
to automatically assign an IP address to a computer from a defined range of numbers (i.e., a
scope) configured for a given network.
Dr. Ramesh Babu H S, Professor & Head, Dept. of ISE, AcIT, Bangalore 29
Computer Networks II Unit - IV TCP/IP - II
6. The server sends an ACK (or DHCPACK) packet, confirming that the client has a
been given a lease on the address for a server-specified period of time.
When a computer uses a static IP address, it means that the computer is manually configured
to use a specific IP address. One problem with static assignment, which can result from user
error or inattention to detail, occurs when two computers are configured with the same IP
address. This creates a conflict that results in loss of service. Using DHCP to dynamically
assign IP addresses minimizes these conflicts.
Figure 1
In figure 1, a new client that just joined the network, needs an IP address. Since it does not
know the DHCP server's location, the client broadcasts (step 1) a DHCPDISCOVER
message on the local network. The message packet contains a hardware identifier (usually the
MAC address), the source port (68), the destination IP (255.255.255.255), destination port
(67), and a randomly generated transaction id. Optionally the client can specify the IP
address it wants and the lease duration in the message. Once the DHCP relay receives the
broadcasted message, it fills in the "giaddr" field of the packet with the gateway IP address of
10.1.2.9 . This piece of information is critical because the DHCP Server needs it to determine
which subnet the client is on and thus which IP address to allocate to the client. Afterwards
the DHCPDISCOVER message is relayed to the DHCP Server via unicast (step 2). A
unicast, instead of a broadcast, is sufficient because the DHCP relay knows the exact location
of the DHCP server. For this same reason, the DHCP relay does not allow the other network
segment, 10.1.1.X, to receive the message.
Once the DHCP server receives the DHCPDISCOVER request, it allocates an IP address,
marks it as taken, and then broadcasts a DHCPOFFER message back to the requesting client.
This message packet contains the DHCP server's IP address, the client's hardware identifier,
the same transaction id, and the IP address allocated for the client. Optionally, the message
Dr. Ramesh Babu H S, Professor & Head, Dept. of ISE, AcIT, Bangalore 30
Computer Networks II Unit - IV TCP/IP - II
may also contain the lease time, subnet mask, default TTL, default router(s), and numerous
other parameters.
Figure 2
In figure 2, the DHCP server allocates new IP address 10.1.2.3 for the client and broadcasts a
DHCPOFFER message to its network (step 3). When the DHCP relay sees the DHCPOFFER
broadcast, it relays the broadcast to the 10.1.2.X network and only that network (step 4).
Once the new client sees the DHCPOFFER message, it accepts the IP address (step 5) and
prepares a confirmation message to the DHCP server with a DHCPREQUEST packet. Please
note that the client does not have to accept this IP address, in which case it will not send a
DHCPREQUEST message. If multiple DHCP servers sends out a DHCPOFFER, the client
can choose which one to accept. If for some reason, the DHCPOFFER message fails to ever
arrive, the client will rebroadcast the DHCPDISCOVER message.
Figure 3
Dr. Ramesh Babu H S, Professor & Head, Dept. of ISE, AcIT, Bangalore 31
Computer Networks II Unit - IV TCP/IP - II
If the client included optional information in the initial DHCPDISCOVER message, it must
include that same information in the subsequent DHCPREQUEST message. In step 6 of
figure 3, the new client confirms it wants the IP address 10.1.2.3 by broadcasting a
DHCPREQUEST to the DHCP server. Once the DHCP Server receives this message (with
help again from the DHCP Relay), it first ensures that it is the intended target - because the
client could be responding to another DHCP Server. If this DHCP server is not the intended
target, then it knows some other DHCP server is handling this client. So this DHCP server
can discard any previously allocated IP address for that client. If this DHCP Server is the
intended recipient, then it has to verify the optional parameters that it specified in the
previous DHCPOFFER message to this client, are still valid. Assuming everything is fine up
to this point, the DHCP Server sends a DHCPACK broadcast (step 8) to tell the client that its
new IP address can now officially be used. However, if something is wrong, then a
DHCPNACK is broadcasted instead. Either way, a DHCPACK or DHCPNACK will be the
final message sent by the DHCP server in the dynamic IP address allocation sequence..
Assuming it receives the DHCPACK relayed by the router (step 9), the client is encouraged
to verify no other hosts has the same IP address. This is usually accomplished through a
simple ARP probe. Any response to the probe means that another client is already using the
IP address. In such a situation, the client must send a DHCPDECLINE message to the DHCP
server. Afterwards the client will then need to restart this whole process beginning with
DHCPDISCOVER phase. In most cases, there's no response to the client's ARP probe. This
means the client can go ahead and use the allocated IP address along with any other optional
information stored in the message packet.
If the client got a DHCPNAK instead of DHCPACK, then it has no choice but to restart
everything from the very beginning i.e. the DHCPDISCOVER stage. Finally, if the client
doesn't receive any DHCPACK or DHCPNAK message after a certain period of time, then it
rebroadcasts the DHCPREQUEST message.
Dr. Ramesh Babu H S, Professor & Head, Dept. of ISE, AcIT, Bangalore 32