API Server Key-Based Networking Multi-Hop Routing
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Data centers supporting user-facing applications face limitations in performance and functionality due to the design and implementation of general-purpose network technologies like Ethernet switches and Internet protocols, which result in issues such as bandwidth oversubscription and TCP throughput collapse.
Innovation Solution
An API supporting server and key-based networking is introduced, which receives a key or server address to identify suitable next hops for packet transmission, encodes alternative server addresses for failover, and implements multi-hop routing and queuing mechanisms to optimize data transmission across multiple links.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of operation
If general purpose network technology (Ethernet switches, TCP/IP) is used for data center communication, then ease of operation and device compatibility are improved, but bandwidth oversubscription and TCP throughput collapse occur due to small buffer limitations
Solution Approach 1:
The patent introduces a custom network stack and API layer as an intermediary between applications and the physical network infrastructure. This intermediary implements optimized buffering, scheduling, and packet handling that prevents oversubscription and throughput collapse while maintaining compatibility with standard Ethernet interfaces.
Solution Approach 2:
The patent changes key network parameters including buffer sizes, scheduling algorithms, and packet handling characteristics. By adjusting these parameters in the custom network stack, the system achieves higher bandwidth utilization and prevents TCP throughput collapse without requiring changes to standard Ethernet hardware.
2Ease of operation
If standard TCP/IP networking is used, then ease of operation is improved, but TCP throughput collapses when small buffers are overrun
Solution Approach 1:
The patent implements pre-sized buffers and predictive scheduling in the custom network stack that cushion against buffer overruns before they occur. This prevents TCP throughput collapse by ensuring sufficient buffering capacity is available in advance, eliminating the need for TCP retransmissions and maintaining stable throughput.
3Productivity
If key-based networking with multi-hop routing is implemented, then data transmission efficiency and resilience are improved, but device complexity and routing computation increase
Solution Approach 1:
The patent pre-computes routing tables and establishes key-based address mappings before data transmission begins. This preliminary action simplifies runtime routing decisions, allowing efficient multi-hop forwarding without complex real-time computation, thus maintaining low device complexity while achieving high transmission efficiency.
4Productivity
If bandwidth oversubscription is avoided through better network design, then data transmission efficiency is improved, but network infrastructure complexity increases
Solution Approach 1:
The custom network stack implements multiple functions (buffering, scheduling, routing, flow control) within a single integrated software layer. This multi-functionality achieves efficient bandwidth utilization without requiring complex hardware infrastructure, as the software layer handles all optimization tasks on standard Ethernet equipment.
Data Source
AI summary
An application programming interface (API) supporting server and key based networking is described. In an embodiment, the API receives either a key or a server address from a service running on a server in a direct-connect topology and returns data which identifies suitable next hops for transmission of a packet of data which has a destination of the received server address or of a server address which is encoded within the received key. In another embodiment, the key also encodes information specifying alternative server addresses for use in the event that the original server is unreachable. This information may also be used to define servers for replication of the key. A further embodiment describes a method of queuing packets for transmission against multiple links, where the packet is transmitted on the first available link and at this time is removed from the queues for the other links.