Abstract: There are two architectures that preserve the tree topology of the P system: peer-to-peer and hierarchical peer-to-peer. Architectures used the concept of proxy to reduce the size of messages and communication time. In this paper, we propose that the proxy no only reduces the time needed to sending messages, but also reduce the number of connections between processors. Normally, in one transition, two processors communicate three times, but with this algorithm, the communications are reducing to only one. We present the proxy algorithms for these architectures.

Keywords: Distributed Communication, Membrane Computing, Membrane Dissolution, P-Systems? Architectures.

ACM Classification Keywords: F.1.2 Modes of Computation, I.6.1 Simulation Theory, H.1.1 Systems and Information Theory, C.2.4 Distributed Systems

Link:

USE PROXIES IN TREE TOPOLOGY ARCHITECTURES TO REDUCE THE COMMUNICATION TIME IN MEMBRANES SYSTEMS

Miguel Ángel Peña, Ángel Castellanos, Alberto Arteta, Francisco Gisbert

http://www.foibg.com/ijita/vol19/ijita19-3-p01.pdf