Completed Releases

• 0.1 - 1/13/2014
  • Initial Release
  • Jiras Resolved
• 0.2 - 4/21/2014
  • Added configurable address-forwarding semantics
  • Jiras Resolved

Planned Releases

• 0.3 - Planned for July, 2014
  • Theme: Management and Stability
  • Jiras
  • Management and Configuration Features
  • Stability Features and Fixes
• 0.4 - Planned for October, 2014
  • Theme: Security
  • Jiras
  • Planned Features
    • SASL Integration for Connectors and Listeners
    • Per-Connection management access for
      • SSL/TLS/en-clair
      • Endpoint certificates for SSL/TLS
      • SASL mechanism in-effect
      • Authenticated identity of client
    • Tracing and troubleshooting support for networks of routers

Features not Assigned to a Release

Link Cost in Route Computation

Allow each inter-router connection to be configured with a cost metric.  The metric is an natural number (non-zero positive integer) and represents relative cost where higher numbers denote higher cost.  This value shall then be added to the link-state data and used in the computation of least-cost paths across the router topology.  This involves the following changes:

• Add link-cost value to the configuration of inter-router connectors and listeners.
• Enhance the HELLO protocol to negotiate cost, where each side provides requested cost and negotiated cost.  Requested cost is the locally configured cost metric and negotiated cost is the greater of the local configured cost and the peer's requested cost.
• Enhance the Link State Update messages to contain the negotiated link cost per link-state record.
• Enhance the Dijkstra lowest-cost-path computation to use the cost metric instead of the hard-coded value of 1.

Possible extensions and enhancements to consider:

• Asymmetric connection cost.

Link Attach Routing

Currently Dispatch performs routing on delivered messages based on the address in the message's metadata.  There is a second mode of routing in which routing is performed on the link-attach command.  In this case, an attached link causes another link to be established along the next-hop connection to the destination.  The process is repeated until a serially connected set of links is established from node-to-node across the network.  The result is like a Virtual Circuit for AMQP.  In each router, the links are paired, incoming to outgoing.  The forwarding of performatives between the links is trivially simple.  Everything that comes out of one is propagated out the other in both directions.  There is no need to decode or interpret any of the transfers or controls flowing between the links.

xxx

• Policy expression and enforcement
• Distributed/central management and provisioning
• Improved scale for mobile addresses
• Link-attach-routing
• Other access protocols