Message Delivery Network Route Ranking via Linear Optimization
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Message delivery networks (MDNs) face inefficiencies due to the lack of prioritization of message routes, leading to cost inefficiencies and poor delivery rates, as they often attempt delivery over routes experiencing technical difficulties without considering the pros and cons of available routes.
Innovation Solution
An MDN uses a linear constrained optimization model to rank message routes based on cost and reliability, attempting delivery through the highest ranked route first and switching if unsuccessful, ensuring optimal route selection and minimizing costs and failures.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If MDN attempts delivery over multiple message routes without prioritization, then message delivery coverage is improved, but operational costs increase and delivery reliability deteriorates due to continuous attempts over routes experiencing technical difficulties
Solution Approach 1:
The system performs preliminary actions by pre-calculating and ranking message routes using a linear constrained optimization model before actual message delivery. The MDN evaluates multiple routes, assigns weights based on cost and reliability metrics, and creates a prioritized rank-ordered list in advance, so that when a message needs delivery, the system can immediately attempt routes in the predetermined optimal sequence without needing to evaluate all routes at delivery time.
Solution Approach 2:
The system implements dynamic adaptability by allowing the rank-ordered list of message routes to be updated and recalculated based on changing network conditions, cost variations, and reliability metrics. The linear constrained optimization model can be re-executed when route performance changes, enabling the MDN to dynamically adjust the delivery sequence to maintain optimal cost-efficiency and reliability balance.
2Productivity
If MDN uses linear constrained optimization model to rank message routes, then cost efficiency and delivery reliability are improved, but system complexity increases
Solution Approach 1:
The system introduces an intermediary component - the linear constrained optimization model - that acts as a mediator between the MDN and the message routing process. This model serves as a specialized subsystem that handles the complex calculations of evaluating routes, assigning weights, and generating rank-ordered lists, thereby isolating the complexity from the main message delivery system while still achieving optimized routing decisions.
Solution Approach 2:
The system manages complexity by transforming the routing decision problem into a parameter-based optimization problem. The linear constrained optimization model works with specific parameters (cost metrics, reliability metrics, weights) to generate solutions, allowing the complex routing logic to be expressed through mathematical parameters and constraints rather than complex procedural logic.
Data Source
AI summary
Disclosed are techniques for routing messages from a message delivery network (MDN) to one of a plurality of end user carriers, wherein there are a plurality of message routes capable of servicing each end user carrier. An MDN may receive a message from a sending message service provider. The MDN may identify a destination end user carrier servicing the end user device for the message. The MDN may produce a rank ordered list of message routes from the MDN to the destination end user carrier by solving a linear constrained optimization model configured to converge upon an optimized ranking of message routes from the MDN to the plurality of end user carriers. The MDN may then attach the rank ordered list of message routes to the message before forwarding the message to a gateway within the MDN. The gateway may then initially attempt delivery of the message using the highest ranked message route from the rank ordered list of message routes. If the delivery attempt fails, the next highest ranked message route may be attempted until the message is delivered or no other message routes are available to try. Other embodiments are described herein.