3.1 Algorithm Details
This section describes a conceptual model of possible data organization that an implementation maintains to implement in this algorithm. The described organization is provided to facilitate the explanation of how the algorithm behaves. This document does not mandate that implementations adhere to this model as long as their external behavior is consistent with that described in this document.
Figure 3: Message Routing
This diagram represents all possible paths that a message can take through an MSMQ enterprise. Each box represents a class of MSMQ queue manager participating in message transfer. Each arrow represents a transfer of a message from an MSMQ queue manager in the class at the tail of the arrow to an MSMQ queue manager in the class at the head of the arrow. In this diagram, the only arrow that represents a message transfer between MSMQ queue managers in different MSMQ sites is the inter-site routing arrow between two MSMQ site gates. All other arrows represent message transfer between MSMQ queue managers within the same MSMQ site.
The Message Queuing (MSMQ): Binary Reliable Message Routing Algorithm determines the path that a message traverses between MSMQ queue managers. The path computed by this algorithm is agnostic of message or queue priorities.