Professional Documents
Culture Documents
Roll No : 25
26-09-2007
Computer Network
Computer Network means that
there are interconnected collection of two
or more autonomous Computers.
The connection need not be via a
copper wire, fiber optics,microwaves ,and
communication satellites can also be used.
Two computers are said to be
interconnected if they are able to
exchange information.
Need for a Computer Network
• Resource Sharing
• High Reliability
• Saving Money
• Scalability
• Communication Medium
• Remote Access
• Interactive Entertainment
Some Topologies
• Star
• Ring
• Tree
• Complete
• Intersecting Ring
• Irregular
Client Server
vs
Peer to Peer
Client Server Model
A typical example for a Client –Server
file transfer is an FTP server where the client
and server programs are quite distinct, and
the clients initiate the download / uploads and
the servers react to and satisfy these
requests.
Peer to Peer Network
A peer-to-peer (or "P2P")
computer Network exploits diverse
connectivity between participants in a
network and the cumulative bandwidth of
network participants rather than
conventional centralized resources where
a relatively low number of server provide
the core value to a service or application.
A pure peer-to-peer network does
not have the notion of clients or servers,
but only equal peer nodes that
simultaneously function as both "clients"
and "servers" to the other nodes on the
network.
This model of network arrangement
differs from the client-server model where
communication is usually to and from a
central server.
Peer to Peer Connection
Classification of P2P Network
• Pure peer-to-peer
• Centralized P2P network
• Decentralized P2P network
• Structured P2P network
• Unstructured P2P network
• Hybrid P2P network (Centralized and
Decentralized)
Pure peer-to-peer:
• Collaborative Computing
• Instant Messaging
• Affinity Communities
Collaborative Computing
Also referred to as
distributed computing, it combines the
idle or unused CPU processing power
and/or free disk space of many
computers in the network.
Collaborative computing
is most popular with science and
biotech organizations where intense
computer processing is required.
Instant Messaging
One very common form of P2P
networking is Instant Messaging (IM)
where software applications, allow users
to chat via text messages in real-time.
• Size
Peer-to-peer networks are designed for connecting small
numbers of computers. They tend to run into problems at around 5-10
computers or more.
• Security
Security on a peer-to-peer network is not very powerful. So if
you have security concerns go for something you can control (read server!)
Since on a peer to peer network the users give access to folders, they can
choose not to require passwords. This lack of consistency has a tremendous
impact on the security of your network and you will need adequate training
for your users to prevent problems.
• Growth
If your organization is growing rapidly, it will usually out grow a
peer-to-peer network very quickly. While a peer-to-peer network may work
fine for up to around ten computers, it almost certainly won't for twenty.
• Training
In a peer-to-peer network, the users handle
administration. This means that all the users need to be
trained in how to share files, folders, and printers. In a
peer-to-peer network, suddenly shutting down your
computer can cause one of your colleagues to be unable
to print or worse still corrupt your shared database if you
have one…
• Hosting Resources
The last concern is that each computer that
attaches to another computer, whether for printing or for
file sharing, takes up system resources on the hosting
computer. If the drain becomes dramatic enough to slow
down the host computer (which someone else is working
on) then perhaps it is time to start thinking about a
dedicated server.
Connection Established
Three Ways
1) 10BaseT Cabling
2) Thin Coax Cabling
3) Mixing 10BaseT & Coax
10BaseT Cabling:
--------------------------------------------------------------------------------------------
1) Graphing
The Graphing component is responsible for maintaining a set
2) Grouping
The Grouping component is the security layer provided
by default on top of a graph. The security layer defines the
security model behind group creation, invitation, and
connection to the group. The Grouping component
uses the Group Security and Group Security Service Provider
(SSP) sub components.
3) NSP
The Name Service Provider (NSP) component provides a
mechanism to access an arbitrary name service provider. In the case
of Windows Peer-to-Peer Networking, peer-to peer applications use
the NSP interface to access PNRP.
As an example
If user A has an A and C drive on his computer, and user B
configures his entire C drive so that it is shared, user A can map to the user B's C drive
and have an A, C, and D drive (user A's D drive is actually user B's C drive). Directories
operate in a similar fashion. If user A has an A & C drive, and user B configures his
"C:\WINDOWS" and "C:\DOS" directories as sharable, user A can map to those directories
and then have an A, C, D, and E drive (user A's D is user B's C:\WINDOWS, and E is user
B's C:\DOS).
Because drives can be easily
shared between peer-to-peer computers,
data only needs to be stored on one
computer, not two or three.
Secret key techniques are based on the fact that the sender
and recipient share a secret, which is used for various cryptographic
operations, such as encryption and decryption of messages and the
creation and verification of message authentication data. This secret
key must be exchanged in a separate out of bound procedure prior to
the intended communication.
2)Public Key Techniques
Public Key Techniques are based on
the use of asymmetric key pairs. Usually each
user is in possession of just one key pair. One of
the pair is made publicly available, while the other
is kept private.
Because one is available there is no
need for an out of band key exchange, however
there is a need for an infrastructure to distribute
the public key authentically. Because there is no
need for pre-shared secrets prior to a
communication, public key techniques are ideal for
supporting security between previously unknown
parties.
P2P Routing
Once a servent is connected to the network it can send
information into the network to find out about other servents in the
system. The other servents can respond to this request by sending
information about their own state, including their IP addresses, the
number of files it has decided to share on the network and the total
size of these files.
A servent can then query the network for files meeting
certain search criteria. If a servent has files meeting the criteria, it will
respond with a list of appropriate file details. The servent that made
the initial request can then ask an appropriate servent for a particular
file and have that file routed to it.
Descriptor Header
Byte
0 - 15 16 17 18 19 - 22
Positions
Descriptor Payload
Contents Time To Live Hops Payload Length
ID Descriptor
Descriptor ID
This is used to uniquely identify
the particular message on the network. It is
created by the client and must be unique (in
theory) to ensure that certain other servants
can detect when they are seeing a message
from a particular servant that they have
processed before.
Payload Descriptor
This defines the type of descriptor
which is following the header.
Time To Live (TTL):
This field outlines the maximum amount of servants
that the message can be routed through before it must be discarded.
Each time the message passes through a servant this field is
decremented.
When the value reaches 0 the message is discarded.
This ensures that a particular message will not be routed continually
around the network. This would cause an immediate degradation of
network performance if all servants were sending out many packets in
succession which were never being removed from the network.
Hops:
This is a count of the number of servents through
which the message has been passed. The count is incremented each
time it passes through a new servent.
Payload Length:
The length of the payload immediately following this header.
This header is important because the protocol does not define any
flags to define where one payload ends and the next descriptor
begins.
This means that if the fields in the descriptor header are
invalid then that message cannot be routed. As a result it is impossible
to find the beginning of the next descriptor and the connection must be
terminated
Peer to Peer File sharing Program
Kazaa
Napster
BitTorrent
WinMX
Shareaza
Ares
Bear Share
Kazaa