Client Server Protocol Implementation

INTRODUCTION
The main goal of this project is to implement the Client-Server Protocol Implementation.
The dream global communication is solved in a great deal by the introduction of Internet.
This made the necessity of networking in communication clear.
The internet protocol TCPIP uses computers called gateways. !hich provide all
interconnections among physical networks.
" gateway is a special purpose# dedicated computer that attaches to two or more
networks and routes packets from one to other. It will be having the information
regarding the network connected to it. The gateways e$change routing information
periodically to accommodate network changes and keeps their route up-to-date.
This protocol permits a new core gateway to be added to the internet without modifying
the e$isting gateways.
!henever a new core gateway is added to the e$isting internet it will be assigned to one
or more neighbours with which it communicates# the neighbours already members of the
working internet have already propagated routing information among themselves.
Thus the gateway has to inform its neighbours about the network it could reach so that
they can update the routing table and propagate the information to the remaining
gateways in the internet. The new gateway also updates its routing table.
%irstly we deal about the gateways its function and routing in gateway in chapter & we
discuss gateway to gateway protocol# its format and its application.
GATEWAYS
Introduction to gateways:
'(T ) *"T(!"+ '(T ,
'(T &
*ateways connect two networks that are heterogeneous in nature. -That is a network
di.ering in IP/.
2!! "eterogeneous networ#s
0eterogeneous networks may di.er among themselves in no of ways. They are as follows
). "ddressing schemes
,. 1a$imum packet si2e
&. 'etwork accesses mechanism
3. Time-outs
4. 1ethods of error recovery
5. 1ethods of status reporting
6. 7outing techni8ues
9. :sers access control
;. Connection orientedConnectionless
Wor# done $y Gateway
). "ddressing
,. 7outing of <atagram in the Internet
&. <atagram lifetime= if dynami$ or alternate routings are used# the
potentials e$ist for <atagram to loop inde>nitely through the internet#
which is undesirable
" simple way to overcome this is to implement lifetime# which uses hop count. (ach time
the <atagram passes the gateway the count is decrement. ?nce the count becomes 2ero
<atagram is discarded.
2!2 %rag&entation and reasse&$'ing
The fragmentation is done in gateways when the data gram has to pass through
the network which provide smaller ma$imum message si2e# than what is the
present message si2e. 7eassembling is done at the destination. It is advantageous
over the reassemble at intermediate gateways because..
a. @arge bu.ers are re8uired at gateways and there is potential.
b. "ll fragments of data gram must pass through the same gateways.
This inhibits the use of dynamic routing.
Error contro' and (ow contro':
%low control allows the gateway or receiving station or both to limit the rate at
which they receive the data.
Routing in gateways:
7outing is generally accomplished by maintaining the routing table in host and gateways.
0osts do not have complete knowledge of all possible destination networks. They depend
on default entries in the routing table to send to the nearby gateways. "ll data gram for
which they have no speci>c routes.
*ateways have no informationAs of each possible destination networks and the ne$t
gateway to which the IP data gram should be send and also total no. of hops to the
destination.
7outing table may be static or dynamic. The static table however could alternate routes if
gateway is unavailable. <ynamic table is more Be$ible in responding to errors and
congestion control.
7outing table may be also needed to support other Internet services such as security and
priority.
7outing tables in a gateway may have di.erent informationAs. ?ne such routing table is
Cellman %ord routing table. This contains & >elds#
). <estination network
,. 'e$t gateway to which the packet must be sent
&. 'o. of gateway hops to reach the destination
' , ' 3
' , * ) * ,
' & ' 4
%or the above internet the routing table of the gateway * ) will contain
DESTINATION DISTANCE ROUTE
' ) D direct
' , D direct
' & D direct
' 3 ) *"T( E *,
' ) ) *"T( E *,
<istance is measured in hops
IP Gateway :
In an Internet# computers called IP *ateways# or routers that attached to two or more
networks# form interconnections among networks. *ateways route packets between
networks by receiving them from one network and sending them to another
IP Address :
The designer of TCPIP chose scheme analogues to physical network addressing in which
each host on the Internet is assigned an integer address called its Internet address or IP
address. (ach host on a TCPIP Internet is assigned &,-bit Internet address that is used in
all communication with that host. If host moves from one network to another# its IP
address must be changed.
Port Number :
(very incoming information carries along with it the destination place with in the
computer also. This is called Portal the programs are connected to the port and based on
the port number in the incoming information it will be given to the corresponding
program.
C'ient)Ser*er +rotoco' I&,'e&entation-cs,i.
" protocol -i.e. a set of rules/ which is use to transfer routing message from one gateway
to another gateway is a cspi.
The original core gateways use a vector-distance protocol known as the client server
protocol Implementation -CSPI/ to e$change routing information. The e$change of routing
information is necessary to avoid the clash between the di.erent networks in the net.
The CSPI is designed to travel in the IP datagrams or TCP circuits. Client-Server protocol
implements a distributed shortest path routine communication. The original core system
is arranged to permit a new core gateway to be added without modifying e$isting
gateways. !hen a new gate way is added to the core system it is only necessary to
inform its neighbors about the networks it could reach.
CSPI is a true vector distance protocol. The routing information gateways e$change with
CSPI consists of a set of pairs -'.</# where ' is a IP network address and < is a distance
measured in hops. CSPI measures distance in gateway hops from directly connected
networks# one hop from networks that are reachable through one other gateway and so
on.
CSPI measures the distances in gateway hops. " gateway is de>ned to be 2ero hops from
directly connected networks# one hop for a network reachable through one other gateway
and so on. Thus the number of hops or the hop count along a path from a given source to
a given destination refers to the number of gateways that a datagram encounters along
that path is should be obvious that using hop counts to calculated shortest path dose not
always produce desirable results.
/ECTOR DISTANCE -0E112AN %ORD. ROUTING:
The term vector distance refers to a clause of algorithms gateways use to propagate
routing information. The idea behind vector distance algorithms is 8uiet simple. !e
assume that each gateway begins with a set of routes for those networks to which it
attaches. It keeps the list of routes in a table# where each entry identi>es a destination
network and gives the distance to that network measured in hops.
<(STI'"TI?' <IST"'C(
'(T ) D
'(T , D
"n initial distance routing table with an entry for each directly connected network.
Periodically# each gateway sends a copy of its routing table to any other gateways it can
be reach directly. !hen a report arrives at gateway k from gateway j# k e$amines the set
of destinations reported and the distance to each. If j knows a shorter way to reach a
destination# or if j lists a destination that k does not have in its table or if k currently
routes to a destination through j and jA s distance to that destination changes# k replaces
its table entry. %or e$ample from below table shows an e$isting table in a gateway F and
an update message from another gateway j.
ROUTING TA01E O% GATEWAY 3
NETWOR3
DESTINATION
NE4T GATEWAY DISTANCE
'(T ) <I7(CT D
'(T , <I7(CT D
'(T & *"T(!"+ & 3
'(T 3 *"T(!"+ 4 ,
ROUTING TA01E O% GATEWAY 5
NETWOR3
DESTINATION
NE4T GATEWAY DISTANCE
'(T 4 <I7(CT D
'(T 5 <I7(CT D
'(T & *"T(!"+ & )D
ROUTING TA01E O% GATEWAY 5 A%TER U+DATE
NETWOR3
DESTINATION
NE4T GATEWAY DISTANCE
'(T 4 <I7(CT D
'(T 5 <I7(CT D
'(T ) *"T(!"+ F )
'(T , *"T(!"+ F )
'(T & *"T(!"+ F 4
'ote that if j reports distance '# an update entry in F will have distance 'G)# when a
gateway H adds or update an entry in response to a message from gateway k# it assigns
gateway F as the route for that entry.
CS+I 2ESSAGE %OR2AT:
There are four types of messages each with its own format types
! Ty,e ! CS+I routing u,dates &essage
Type -),/ :n used
Se8uence no
:pdate 'um distances
<istance < ) 'um net at < )
%irst net at distance < )
I. I.. II
@ast net at distance <)
<istance < , 'um net at < ,
%irst net at distance < ,
Second net at distance < )
I. I.. II
@ast net at distance <)
This message gateway e$change to learn about the gateway. This information contains a
pair or IP networks and the distance values. To keep this message# small networks are
grouped together by distance and message consists of a se8uence of sets where each
set contains a distance value followed by a list of all the networks at that distance
Jalue ), in the >eld labeled T+P( speci>es that the message is the routing update
message.
)5 bit se8uence no. is used to validate a **P message= Coth sender and receiver
must agree on the se8uence no before the receiver will accept the message.
%ield update is a binary value that speci>es whether the sender needs update from
receiver.
The ':1 <IST"'C( speci>es how many distance groups are present in this
update.
TY+E 2 :
!hen a gateway receives a **P routing update message it sends acknowledgement
back to sender.
:sing positive acknowledgement if routing update was accepted and negative
acknowledgement if an error is detected. In positive acknowledgement the >eld labeled
S(K:('C( speci>es the se8uence no. the receiver last received correctly.
Type , identi>es the message as positive acknowledgement and type )D as negative.
D 9 )5 &,
Type -, or )D/ :n used -D/ Se8uence
Ty,e 6 :
In addition to routing update messages# the **P protocol includes messages that allow
one gateway to test whether another is responding. " gateway sends an echo re8uest so
that the recipient responds by sending back an echo reply message.
D 9 )5 &,
Type -9 or D/ :n used -D/ Se8uence
Type -9/ identi>es the message as an echo re8uest. !hile type -D/ identi>es the message
as echo reply.
A,,'ications o7 GG+
This **P is used in the Internet following cases=
). !hen two e$isting Internets are to be connected to form a single co-ordinate
unit# the corresponding gateway of each Internet are connected to propagate
their routing information.
,. !hen a new network is added to the gateway# the gateway should generate a
**P update message to inform the other gateways about addition of network
so that they make an entry of this network in the routing table# similarly the
deletion of a network is carried on.
&. To ensure that all networks remain reachable with a high reliability# and Internet
must provide globally consistent routine
3. **P ensure the networks to remain reachable and provides a globally
consistent routine.
4. it ensures the Internet from a clash when a new network is added to it.
5. **P ensures the traLc in the network by using the shortest path.
6. **P provides the solution for the routing problem by having each gateway#
having information about the neighbor gateways and their networks.
I C 2 + -Internet Contro' 2essage +rotoco'.
Internet protocol provides an unreliable connectionless data gram delivery
service# and that a data gram travels from gateway to gateway until it reaches
one that can delivery it directly to its >nal destination. If a gateway cannot
route or deliver a data gram or if the gateway detects an unusual condition# like
network condition# that e.ects its ability to forward the data gram# it needs to
instruct the original source to take action to avoid or correct the problem
To allow gateways in an internet to report errors or provide information about
une$pected circumstance# the designers added a special purpose message
mechanism to the TCPIP protocol the mechanism# known as the I'T(7'(T
C?'T7?@ 1(SS"*( P7?T?C?@ -IC1P/
@ike all other traLc# IC1P messages travel across the internet in the data
portion of IP data grams.
The ultimate destination of an IC1P message is not an application program or
user on the destination machine# however# but the Internet protocol software
on that machine that is# when an IC1P error message arrives# the IC1P
software module handles it. ?f course# if IC1P determines that a particular
higher level protocol or application program has caused a problem# it will
inform the appropriate module.
The IC1P allows gateways to send error of control message to other gateways
or hostsM IC1P provides communication between the Internet protocol software
on one machine and the Internet protocol software on the another.
ERROR RE+ORTING /S ERROR CORRECTION:
Technically# IC1P is an error reporting mechanism it provides a way of
gateways that encounter an error to report the error the original source.
"lthough the protocol speci>cation outlines intended uses of IC1P and suggests
possible action to take in response to error reports# IC1P does not fully specify
the action to be taken for each possible error. It takes action to correct the
problem.
TESTING DESTINATION REAC"A0I1ITY AND STATUS
TCPIP protocols provide facilities to help network managers or users identify
network problems. ?ne of the most fre8uently used debugging tools invokes the
IC1P echo re8uest and echo reply message. " host or gateway sends an IC1P
echo re8uest message to a speci>ed destination. "ny machine that receives an
echo re8uests formalities an echo reply and returns to the original sender. The
re8uest contains an optional data area the reply contains the copies of the data
sent in the re8uest. The echo re8uest and the associated reply can used to test
whether a destination is reachable and responding. Cecause both the re8uest and
reply travel in IP datagrams# successful receipt of a reply veri>es and major piees
of transport system work.
I+ data gra&s in a gateway
*ateways in a TCPIP Internet form a cooperative# inter connected structure.
<atagrams pass from gateway to gateway until they reach a gateway that can
deliver the datagram directly.
The usual IP routing algorithm employs an Internet routing table or IP routing table.
?n each machines that stores information about possible destination and how to
reach them. Cecause both gateways and hosts route datagrams# both have IP
routing table. !henever the IP routing software in a host or gateway needs to
transmit a <atagram# it consults the routing table to decide whether to send the
<atagram. If every routing table contained information about every possible
destination address# it would be impossible to keep the tables current.
%urthermore# because the number of possible destinations is large machines would
have insuLcient space to store the information.
%ortunately# the IP address schemes help achieve this goal. IP address or assigned
to make all machines connected to a given
Abstract
Today, the world is on the anvil of being shrunk into a global net. All the systems around the
world are to be used in the epoch of a nanosecond even when installed across continents
and oceans. This is possible only through networks. It is in this context that networks become
crucial to the viability of science and engineering research. The unprecedented growth of
networking has helped in breaking all geographic barriers of the world and building the
information super highway and global village.
In this direction a new technology has developed in the past few years which makes it
possible to interconnect many disparate networks and make them work as a co-coordinated
unit. Thus the technology is designed to foster the communication between 2 machines with
hardware architectures, to accommodate and use any packet switched network hardware
and to accommodate multiple operating systems.
It is in this context that ateway has gained importance for communications between
disparate networks.
Existing System
The present system is having different networks for each department. Where in the
files has to be manually transferred. which is not a good way of practice of file transfer, for
that we have given this proposed system. Where the file transfer is done through the
networks.
Problem Statement
A computer network is a communication system for connecting end system, in order
to send messages or files. From one to another. So to achieve proper
communication the network should be a dedicated one. the interconnection i.e.
physical connections should be proper.
Whenever a new network is added it should not disturb the existing network.
Similarly when a network is deleted communication should be carried on properly
The network should be reachable with a high reliability and should provide
consistent routing and should be able to provide solution for the routing problem.
Proposed System
n the proposed system all the sub!networks are added to the gateway and the
transfer of the different document and file takes place through this gate way. Where we can
not only reduce the delay in file transfer but also we can maintain the log.
PROJECT MODULES
This pro"ect is divided into four modules#

$odule %#

n this module we provide mechanisms for adding a new network to a &ateway
and deleting the existing network from the &ateway and displaying a routing table for a
&ateway.
$odule '#
n this module there are three methods first, to create a route message, second
sending a routing message to other gateways, third updating the routing message.
$odule (#
n this module we develop an application program to know the date and time the
routing table is transferred to other gateway.
$odule )#
n this module the errors occurred by the invalid inputs given by the user or any
unexpected circumstances is reported to the gateway by using *$+ protocol.
ard !are Speci"ication#
Processor # ntel +! based system
Processor Speed # ',- $./ to 0(($./
RAM # 1)$2 to ',1$2
ard Dis$ # '&2 to (-&2
%ey &oard # %-) keys
So"t!are Speci"ication#
Lang'age # 345 %.',Socket+rogrmming.
Protocols # T*+6+, .TT+
Operating System # Windows7T68,6806'---