ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/AnyEvent-MP/MP.pm
(Generate patch)

Comparing AnyEvent-MP/MP.pm (file contents):
Revision 1.118 by root, Thu Jun 30 09:31:58 2011 UTC vs.
Revision 1.119 by root, Sun Feb 26 10:29:59 2012 UTC

78 78
79Ports allow you to register C<rcv> handlers that can match all or just 79Ports allow you to register C<rcv> handlers that can match all or just
80some messages. Messages send to ports will not be queued, regardless of 80some messages. Messages send to ports will not be queued, regardless of
81anything was listening for them or not. 81anything was listening for them or not.
82 82
83Ports are represented by (printable) strings called "port IDs".
84
83=item port ID - C<nodeid#portname> 85=item port ID - C<nodeid#portname>
84 86
85A port ID is the concatenation of a node ID, a hash-mark (C<#>) as 87A port ID is the concatenation of a node ID, a hash-mark (C<#>) as
86separator, and a port name (a printable string of unspecified format). 88separator, and a port name (a printable string of unspecified format).
87 89
91which enables nodes to manage each other remotely, and to create new 93which enables nodes to manage each other remotely, and to create new
92ports. 94ports.
93 95
94Nodes are either public (have one or more listening ports) or private 96Nodes are either public (have one or more listening ports) or private
95(no listening ports). Private nodes cannot talk to other private nodes 97(no listening ports). Private nodes cannot talk to other private nodes
96currently. 98currently, but all nodes can talk to public nodes.
99
100Nodes is represented by (printable) strings called "node IDs".
97 101
98=item node ID - C<[A-Za-z0-9_\-.:]*> 102=item node ID - C<[A-Za-z0-9_\-.:]*>
99 103
100A node ID is a string that uniquely identifies the node within a 104A node ID is a string that uniquely identifies the node within a
101network. Depending on the configuration used, node IDs can look like a 105network. Depending on the configuration used, node IDs can look like a
102hostname, a hostname and a port, or a random string. AnyEvent::MP itself 106hostname, a hostname and a port, or a random string. AnyEvent::MP itself
103doesn't interpret node IDs in any way. 107doesn't interpret node IDs in any way except to uniquely identify a node.
104 108
105=item binds - C<ip:port> 109=item binds - C<ip:port>
106 110
107Nodes can only talk to each other by creating some kind of connection to 111Nodes can only talk to each other by creating some kind of connection to
108each other. To do this, nodes should listen on one or more local transport 112each other. To do this, nodes should listen on one or more local transport
113endpoints - binds.
114
109endpoints - binds. Currently, only standard C<ip:port> specifications can 115Currently, only standard C<ip:port> specifications can be used, which
110be used, which specify TCP ports to listen on. 116specify TCP ports to listen on. So a bind is basically just a tcp socket
117in listening mode thta accepts conenctions form other nodes.
111 118
112=item seed nodes 119=item seed nodes
113 120
114When a node starts, it knows nothing about the network. To teach the node 121When a node starts, it knows nothing about the network it is in - it
115about the network it first has to contact some other node within the 122needs to connect to at least one other node that is already in the
116network. This node is called a seed. 123network. These other nodes are called "seed nodes".
117 124
118Apart from the fact that other nodes know them as seed nodes and they have 125Seed nodes themselves are not special - they are seed nodes only because
119to have fixed listening addresses, seed nodes are perfectly normal nodes - 126some other node I<uses> them as such, but any node can be used as seed
120any node can function as a seed node for others. 127node for other nodes, and eahc node cna use a different set of seed nodes.
121 128
122In addition to discovering the network, seed nodes are also used to 129In addition to discovering the network, seed nodes are also used to
123maintain the network and to connect nodes that otherwise would have 130maintain the network - all nodes using the same seed node form are part of
124trouble connecting. They form the backbone of an AnyEvent::MP network. 131the same network. If a network is split into multiple subnets because e.g.
132the network link between the parts goes down, then using the same seed
133nodes for all nodes ensures that eventually the subnets get merged again.
125 134
126Seed nodes are expected to be long-running, and at least one seed node 135Seed nodes are expected to be long-running, and at least one seed node
127should always be available. They should also be relatively responsive - a 136should always be available. They should also be relatively responsive - a
128seed node that blocks for long periods will slow down everybody else. 137seed node that blocks for long periods will slow down everybody else.
129 138
139For small networks, it's best if every node uses the same set of seed
140nodes. For large networks, it can be useful to specify "regional" seed
141nodes for most nodes in an area, and use all seed nodes as seed nodes for
142each other. What's important is that all seed nodes connections form a
143complete graph, so that the network cannot split into separate subnets
144forever.
145
146Seed nodes are represented by seed IDs.
147
130=item seeds - C<host:port> 148=item seed IDs - C<host:port>
131 149
132Seeds are transport endpoint(s) (usually a hostname/IP address and a 150Seed IDs are transport endpoint(s) (usually a hostname/IP address and a
133TCP port) of nodes that should be used as seed nodes. 151TCP port) of nodes that should be used as seed nodes.
134 152
135The nodes listening on those endpoints are expected to be long-running, 153=item global nodes
136and at least one of those should always be available. When nodes run out 154
137of connections (e.g. due to a network error), they try to re-establish 155An AEMP network needs a discovery service - nodes need to know how to
138connections to some seednodes again to join the network. 156connect to other nodes they only know by name. In addition, AEMP offers a
157distributed "group database", which maps group names to a list of strings
158- for example, to register worker ports.
159
160A network needs at least one global node to work, and allows every node to
161be a global node.
162
163Any node that loads the L<AnyEvent::MP::Global> module becomes a global
164node and tries to keep connections to all other nodes. So while it can
165make sense to make every node "global" in small networks, it usually makes
166sense to only make seed nodes into global nodes in large networks (nodes
167keep connections to seed nodes and global nodes, so makign them the same
168reduces overhead).
139 169
140=back 170=back
141 171
142=head1 VARIABLES/FUNCTIONS 172=head1 VARIABLES/FUNCTIONS
143 173
236used, meaning the node will bind on a dynamically-assigned port on every 266used, meaning the node will bind on a dynamically-assigned port on every
237local IP address it finds. 267local IP address it finds.
238 268
239=item step 3, connect to seed nodes 269=item step 3, connect to seed nodes
240 270
241As the last step, the seeds list from the profile is passed to the 271As the last step, the seed ID list from the profile is passed to the
242L<AnyEvent::MP::Global> module, which will then use it to keep 272L<AnyEvent::MP::Global> module, which will then use it to keep
243connectivity with at least one node at any point in time. 273connectivity with at least one node at any point in time.
244 274
245=back 275=back
246 276
862ports being the special case/exception, where transport errors cannot 892ports being the special case/exception, where transport errors cannot
863occur. 893occur.
864 894
865=item * Erlang uses processes and a mailbox, AEMP does not queue. 895=item * Erlang uses processes and a mailbox, AEMP does not queue.
866 896
867Erlang uses processes that selectively receive messages, and therefore 897Erlang uses processes that selectively receive messages out of order, and
868needs a queue. AEMP is event based, queuing messages would serve no 898therefore needs a queue. AEMP is event based, queuing messages would serve
869useful purpose. For the same reason the pattern-matching abilities of 899no useful purpose. For the same reason the pattern-matching abilities
870AnyEvent::MP are more limited, as there is little need to be able to 900of AnyEvent::MP are more limited, as there is little need to be able to
871filter messages without dequeuing them. 901filter messages without dequeuing them.
872 902
873(But see L<Coro::MP> for a more Erlang-like process model on top of AEMP). 903This is not a philosophical difference, but simply stems from AnyEvent::MP
904being event-based, while Erlang is process-based.
905
906You cna have a look at L<Coro::MP> for a more Erlang-like process model on
907top of AEMP and Coro threads.
874 908
875=item * Erlang sends are synchronous, AEMP sends are asynchronous. 909=item * Erlang sends are synchronous, AEMP sends are asynchronous.
876 910
877Sending messages in Erlang is synchronous and blocks the process (and 911Sending messages in Erlang is synchronous and blocks the process until
912a conenction has been established and the message sent (and so does not
878so does not need a queue that can overflow). AEMP sends are immediate, 913need a queue that can overflow). AEMP sends return immediately, connection
879connection establishment is handled in the background. 914establishment is handled in the background.
880 915
881=item * Erlang suffers from silent message loss, AEMP does not. 916=item * Erlang suffers from silent message loss, AEMP does not.
882 917
883Erlang implements few guarantees on messages delivery - messages can get 918Erlang implements few guarantees on messages delivery - messages can get
884lost without any of the processes realising it (i.e. you send messages a, 919lost without any of the processes realising it (i.e. you send messages a,
887AEMP guarantees (modulo hardware errors) correct ordering, and the 922AEMP guarantees (modulo hardware errors) correct ordering, and the
888guarantee that after one message is lost, all following ones sent to the 923guarantee that after one message is lost, all following ones sent to the
889same port are lost as well, until monitoring raises an error, so there are 924same port are lost as well, until monitoring raises an error, so there are
890no silent "holes" in the message sequence. 925no silent "holes" in the message sequence.
891 926
927If you want your software to be very reliable, you have to cope with
928corrupted and even out-of-order messages in both Erlang and AEMP. AEMP
929simply tries to work better in common error cases, such as when a network
930link goes down.
931
892=item * Erlang can send messages to the wrong port, AEMP does not. 932=item * Erlang can send messages to the wrong port, AEMP does not.
893 933
894In Erlang it is quite likely that a node that restarts reuses a process ID 934In Erlang it is quite likely that a node that restarts reuses an Erlang
895known to other nodes for a completely different process, causing messages 935process ID known to other nodes for a completely different process,
896destined for that process to end up in an unrelated process. 936causing messages destined for that process to end up in an unrelated
937process.
897 938
898AEMP never reuses port IDs, so old messages or old port IDs floating 939AEMP does not reuse port IDs, so old messages or old port IDs floating
899around in the network will not be sent to an unrelated port. 940around in the network will not be sent to an unrelated port.
900 941
901=item * Erlang uses unprotected connections, AEMP uses secure 942=item * Erlang uses unprotected connections, AEMP uses secure
902authentication and can use TLS. 943authentication and can use TLS.
903 944
906 947
907=item * The AEMP protocol is optimised for both text-based and binary 948=item * The AEMP protocol is optimised for both text-based and binary
908communications. 949communications.
909 950
910The AEMP protocol, unlike the Erlang protocol, supports both programming 951The AEMP protocol, unlike the Erlang protocol, supports both programming
911language independent text-only protocols (good for debugging) and binary, 952language independent text-only protocols (good for debugging), and binary,
912language-specific serialisers (e.g. Storable). By default, unless TLS is 953language-specific serialisers (e.g. Storable). By default, unless TLS is
913used, the protocol is actually completely text-based. 954used, the protocol is actually completely text-based.
914 955
915It has also been carefully designed to be implementable in other languages 956It has also been carefully designed to be implementable in other languages
916with a minimum of work while gracefully degrading functionality to make the 957with a minimum of work while gracefully degrading functionality to make the
917protocol simple. 958protocol simple.
918 959
919=item * AEMP has more flexible monitoring options than Erlang. 960=item * AEMP has more flexible monitoring options than Erlang.
920 961
921In Erlang, you can chose to receive I<all> exit signals as messages 962In Erlang, you can chose to receive I<all> exit signals as messages or
922or I<none>, there is no in-between, so monitoring single processes is 963I<none>, there is no in-between, so monitoring single Erlang processes is
923difficult to implement. Monitoring in AEMP is more flexible than in 964difficult to implement.
924Erlang, as one can choose between automatic kill, exit message or callback 965
925on a per-process basis. 966Monitoring in AEMP is more flexible than in Erlang, as one can choose
967between automatic kill, exit message or callback on a per-port basis.
926 968
927=item * Erlang tries to hide remote/local connections, AEMP does not. 969=item * Erlang tries to hide remote/local connections, AEMP does not.
928 970
929Monitoring in Erlang is not an indicator of process death/crashes, in the 971Monitoring in Erlang is not an indicator of process death/crashes, in the
930same way as linking is (except linking is unreliable in Erlang). 972same way as linking is (except linking is unreliable in Erlang).

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines