21-12-2012, 06:23 PM
Compression of View on Anonymous Networks -Folded View
Compression of View.pdf (Size: 462.74 KB / Downloads: 54)
INTRODUCTION
Networking is basically a process through which various computers are interconnected. It
allows computers to communicate with each other and share resources etc. In anonymous
network a network that does not guarantee that every party has a unique identifier. View the all
information about the network that the part corresponding exchanging messages with its
neighbors. It means when sender (party) send message or data to receiver (party) does not
guarantee for receiver only receive the information in anonymous network. So here distributed
problem will be occurred in our project to give a possible solution to this problem using some
algorithm.
EXISTING SYSTEM
Existing System:
In existing system the Distributed System the Message will be exchange between the Parties;
here make a distributed problem because an anonymous network in that network that does not
guarantee that every party has a unique identifier. Existing system works on objects shared by
folder processes consider that the access to operations in these objects is view. This model is not
suitable for the data sharing in distributed Network because not guarantee that file will be seen
by the particular Authorized party.
Distributed Algorithm
Any network there is a distributed algorithm for electing a unique leader processor,
which requires as input data no information about the network, such as the network topology or
the number of processors in it. Also, if a unique initiator (leader) can be used, there are
distributed algorithms for solving the problems listed above, which require no information about
the network. Therefore, if the processors have unique identity numbers, those problems can be
solved without input data containing information about network attributes. Under the distributed
algorithm we see Pseudo–Synchronous Algorithms.
We now define a phase of an algorithm as the following sequence of instructions
send message or data done via each port ;
Send message or data via some ports
Send message or data end-phase via each port ;
Receive message or data until exactly one done or end-phase message is received
from each
Conclusion
In that anonymous network as a network that does not guarantee that every party
has a unique identifier. In that network view the all information about the network that the part
corresponding exchanging messages with its neighbors. It means when sender (party) send
message or data to receiver (party) does not guarantee for receiver only receive the information
in anonymous network. So here distributed problem will be occurred.