Geographic Routing for Transport Network Exit Points
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing data packet routing methods, such as those using Border Gateway Protocol (BGP) routing information, can cause data packets to exit a dedicated transport network prematurely, leading to longer delivery times and inadequate performance for time-sensitive services like video-conferencing and gaming, especially when scaling with increasing customer numbers.
Innovation Solution
A method and system that utilize a database with geographical location information to determine the closest router to a network address, ensuring data packets remain within the transport network until the nearest exit point, using a predetermined proximity metric for efficient routing and quality of service guarantees.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of operation
If BGP routing information is used for mapping, then routing simplicity is improved, but data packets exit the transport network prematurely leading to longer delivery times
Solution Approach 1:
The patent introduces geographical location information as an intermediary layer between BGP routing information and router selection. Instead of directly using BGP routes, the system queries geographical databases to determine the physical location associated with a destination IP address, then selects the transport network router closest to that location. This intermediary step ensures packets exit at the nearest point while maintaining automated routing.
Solution Approach 2:
The patent adds a geographical dimension to traditional network routing. Instead of routing decisions being made solely based on network topology and BGP path information, the system incorporates physical geographical coordinates (latitude, longitude) into the routing decision process. This dimensional addition allows packets to be routed to the geographically closest exit point, optimizing delivery time without manual configuration.
2Loss of time
If manual adjustments to BGP routing information are made to optimize packet exit points, then data packet delivery time is improved, but system complexity and scalability worsen
Solution Approach 1:
The system implements self-service routing by automatically querying geographical databases and determining optimal exit routers without manual intervention. When a packet needs to be routed, the system automatically looks up the destination IP address in the geographical database, determines the closest router based on geographical proximity, and routes the packet accordingly. This eliminates the need for manual routing table adjustments while maintaining optimal performance.
Solution Approach 2:
The routing configuration becomes dynamic rather than static. Instead of requiring manual updates to BGP routing information, the system dynamically queries geographical databases in real-time or near-real-time to determine the closest exit router for each destination. This dynamic approach automatically adapts to changing network conditions and geographical data without requiring manual reconfiguration, enabling scalability.
3Productivity
If load statistics are used for mapping, then network resource utilization is improved, but packets still exit the network prematurely
Solution Approach 1:
The patent changes the primary parameter for router selection from network load statistics to geographical proximity. While load information may be considered as a secondary factor, the decisive parameter becomes the physical distance between the destination IP address location and the transport network routers. This parameter change ensures packets exit at the geographically nearest point, optimizing delivery time while the system can still monitor and respond to load conditions.
Data Source
AI summary
A public network links a plurality of nodes, each associated with at least one network address. A transport network connects a plurality of routers, each of which is also connected to the public network. A database holds geographical location information associated with respective network addresses on the public network. The database is used to determine which of the routers is closest to geographical locations associated with the network addresses. Information is stored that identifies these closest routers. The information is suitable for use in a routing protocol for routing data packets through the transport network to a destination outside the transport network.