Point to point architecture - application layer, Computer Networking

Point to Point Architecture

The term  peer means equal which can  be informally  interpreted as a process with  capability similar to the other processes with process communicates. In the context of P2P networks a peer process acts as a client process and at the same  time a server process for the  same functions. For example  a process  that downloads files from other and meanwhile  the process shared files  for others  to download  is a peer process in file downloading uploading. There is  no distinction between  these  processes  in terms  of which  is  providing  or using  services. Peer processes communicate  with each other  in  a symmetric pattern.  Note that the function that a peer process requests and offer  must  by the  same  within  the context of a given applications.

In P2P architecture  there is not an always   on server at the  centre of the applications. Instead arbitrary pairs of hosts called peers communicate directly with  each other because the peers communicate  without  passing through some  special server, the  architecture is called peer to peer. The P2P architecture is illustrated in figure 3.1 (b).

 One of the greatest strengths of the P2P architecture is its scalability. For  example  in a P2P file  sharing application millions of peers may participate  in the file sharing community with each one functioning  as a server and contributing resources  files and also  community. This while  each peer  will generals work load by requesting files, and  also adds serves  capacity to the system sub responding to the requests of other peers. Thus  increases the demand but also increase service capacity on the  other hand because of  the highly  distributed and decentralized nature  of P2P applications they can be difficult  to manage.

183_Point to Point Architecture.png

                                             figure client Server Application P2P architecture

Posted Date: 3/5/2013 1:28:18 AM | Location : United States

Related Discussions:- Point to point architecture - application layer, Assignment Help, Ask Question on Point to point architecture - application layer, Get Answer, Expert's Help, Point to point architecture - application layer Discussions

Write discussion on Point to point architecture - application layer
Your posts are moderated
Related Questions
Illustrate the Bellman-Ford algorithm The Bellman-Ford algorithm uses only on information from its neighbours and knowledge of its link costs, to update it costs and paths. Dij

DNS - Server Attacks It’s not so easy to list all the associated attacks as they are evolving way so fast. As any error of flaw is identified, a patch is released in response

#questionWrite a program to find the area under the curve y = f(x) between x = a and x = b, integrate y = f(x) between the limits of a and b. The area under a curve between two poi

UDP sends packets 'blind' down the network, and relies on upper-layer protocols to form connections and identify errors. TCP is a connection-oriented protocol that can give reliabl

Each link layer process will have two connections: one "up" to the appropriate IP layer process, and one "sideways" to the link layer process on the simulated machine at the other

What is meant by Symmentric Multiprocessing (SMP)? It treats all processors as equal. Any processor can do the work of any other processor. Applications are divided into thread

1.  What does RIP stand for? 2.  What metric does RIP use for Path Selection? 3.  If the metric used by RIP exceeds this value for a route it is considered unreachable, effec

1.  A virtual memory system has a virtual address space of 4 Gigabytes and a page size of 8 Kilobytes.  Each page table entry occupies 4 bytes.   a)  How many bits remain unchanged

Introduction of DNS While discussing about the Internet, one things comes automatically in the n=mind and hence it is directly or indirectly depended on DNS. The DNS which sta

What are the advantages and disadvantages of the three types of routing tables? The three types of routing tables are fixed, dynamic, and fixed central. The fixed table must be