Red Hat AMQ 6.3 Using Networks of Brokers Networking multiple brokers for better performance Last Updated: 2020-10-23 Red Hat AMQ 6.3 Using Networks of Brokers Networking multiple brokers for better performance JBoss A-MQ Docs Team Content Services [email protected] Legal Notice Copyright © 2016 Red Hat. The text of and illustrations in this document are licensed by Red Hat under a Creative Commons Attribution–Share Alike 3.0 Unported license ("CC-BY-SA"). An explanation of CC-BY-SA is available at http://creativecommons.org/licenses/by-sa/3.0/ . In accordance with CC-BY-SA, if you distribute this document or an adaptation of it, you must provide the URL for the original version. Red Hat, as the licensor of this document, waives the right to enforce, and agrees not to assert, Section 4d of CC-BY-SA to the fullest extent permitted by applicable law. Red Hat, Red Hat Enterprise Linux, the Shadowman logo, the Red Hat logo, JBoss, OpenShift, Fedora, the Infinity logo, and RHCE are trademarks of Red Hat, Inc., registered in the United States and other countries. Linux ® is the registered trademark of Linus Torvalds in the United States and other countries. Java ® is a registered trademark of Oracle and/or its affiliates. XFS ® is a trademark of Silicon Graphics International Corp. or its subsidiaries in the United States and/or other countries. MySQL ® is a registered trademark of MySQL AB in the United States, the European Union and other countries. Node.js ® is an official trademark of Joyent. Red Hat is not formally related to or endorsed by the official Joyent Node.js open source or commercial project. The OpenStack ® Word Mark and OpenStack logo are either registered trademarks/service marks or trademarks/service marks of the OpenStack Foundation, in the United States and other countries and are used with the OpenStack Foundation's permission. We are not affiliated with, endorsed or sponsored by the OpenStack Foundation, or the OpenStack community. All other trademarks are the property of their respective owners. Abstract Message brokers can be connected together to form a robust cluster. Once connected the brokers can more easily distribute load and provide more robust fault tolerance. Table of Contents Table of Contents .C . H. .A . P. .T .E . R. 1.. .I .N . T. .R .O . .D . U. .C . T. .I O. N. .4 . OVERVIEW 4 NETWORK OF BROKERS 4 DYNAMIC NETWORKS 4 .C . H. .A . P. .T .E . R. 2. N. E. T. .W . .O . R. .K . .C . O. N. .N . E. .C . T. .O . R. .S . 5. OVERVIEW 5 ACTIVE CONSUMERS 5 SUBSCRIPTIONS 5 PROPAGATION OF SUBSCRIPTIONS 5 NETWORK CONNECTOR 6 SINGLE CONNECTOR 6 CONNECTORS IN EACH DIRECTION 8 DUPLEX CONNECTOR 8 MULTIPLE CONNECTORS 9 CONDUIT SUBSCRIPTIONS 10 .C . H. .A . P. .T .E . R. 3. D. Y. .N . A. .M . .I C. A. .N . D. S. .T . A. .T .I C. .P .R . O. P. .A . G. .A . T. .I O. .N . 1. 2. OVERVIEW 12 DYNAMIC PROPAGATION 12 STATIC PROPAGATION 13 DUPLEX MODE AND STATIC PROPAGATION 15 SELF-AVOIDING PATHS 17 BROKERID AND SELF-AVOIDING PATHS 17 BROKER ID AND BROKER NAME 18 .C . H. .A . P. .T .E . R. 4. .D . E. .S .T . I.N . A. .T . I.O . .N . .F . I.L .T . E. .R . I.N . G. 1.9 . OVERVIEW 19 DESTINATION WILDCARDS 19 FILTERING DESTINATIONS BY INCLUSION 20 FILTERING DESTINATIONS BY EXCLUSION 20 COMBINING INCLUSIVE AND EXCLUSIVE FILTERS 21 .C . H. .A . P. .T .E . R. 5. U. .S . I.N . .G . .J . M. S. .M . .E . S. S. .A . G. E. .S . E. .L .E . C. .T . O. .R . S. 2. 2. OVERVIEW 22 SCENARIOS THAT DO NOT WORK 22 RESOLVING THE PROBLEM 23 .C . H. .A . P. .T .E . R. 6. .N . E. .T .W . .O . .R . K. .T . O. P. .O . L. .O . G. .I .E .S . .2 . 5. OVERVIEW 25 CONCENTRATOR TOPOLOGY 25 HUB AND SPOKES TOPOLOGY 26 TREE TOPOLOGY 26 MESH TOPOLOGY 27 COMPLETE GRAPH 28 .C . H. .A . P. .T .E . R. 7. O. P. .T .I .M . I. Z. I.N . .G . .R . O. .U . T. .E . S. .3 .0 . 7.1. INTRODUCTION TO OPTIMIZING ROUTES 30 7.2. CHOOSING THE SHORTEST ROUTE 30 7.3. SUPPRESSING DUPLICATE ROUTES 32 .C . H. .A . P. .T .E . R. 8. .D . I.S . C. .O . V. .E . R. .I N. .G . B. .R .O . .K . E. R. .S . .3 . 5. 8.1. DISCOVERY AGENTS 35 1 Red Hat AMQ 6.3 Using Networks of Brokers 8.2. DYNAMIC DISCOVERY PROTOCOL 40 8.3. FANOUT PROTOCOL 42 .C . H. .A . P. .T .E . R. 9. .L .O . .A . D. B. .A . L. A. .N . .C . I.N . G. .4 .6 . 9.1. BALANCING CONSUMER LOAD 46 9.2. MANAGING PRODUCER LOAD 49 .C . H. .A . P. .T .E . R. 1.0 . .. J. .M . .S .- .T . O. -. J. M. S. B. .R . I.D . G. .E . 5. .1 . 10.1. BRIDGE ARCHITECTURE 51 10.2. APACHE CAMEL JMS-TO-JMS BRIDGE 52 10.3. NATIVE ACTIVEMQ JMS-TO-JMS BRIDGE (DEPRECATED) 59 .I N. .D . E. .X . .7 . 8. ..