Network routing system providing increased network bandwidth
AssigneeWisconsin Alumni Research Foundation
InventorsSrinivasa Aditya Akella, Ashok Anand, Srinivasan Seshan
Life of this patent
Estimating the term…
Abstract
A network employing multiple redundancy-aware routers that can eliminate the transmission of redundant data is greatly improved by steering redundant data preferentially into common data paths possibly contrary to other routing paradigms. By collecting redundant data in certain pathways, the effectiveness of the redundancy-aware routers is substantially increased.
Claims7
A network router for use in a network between different routers, the network router having an electronic processor executing a stored program to:
- (a) identify data-redundancy in packets:
- (b) link redundancy information about the identified data-redundancy to a destination of the packets;
- (c) transmit the redundancy information about the linked data-redundancy and destination information to a central route manager that is not a destination of the packets;
- (d) receive from the central route manager routing information that instructs the network router as to how to route the packets received by the network router in the future based on the data redundancy in the future packets, this routing information being based on a history of the linked redundancy information and destination information received from multiple other routers in the network, the routing information designating a given routing of packets having a given data redundancy and being based on historical linked redundancy information and destination information received from multiple of the other routers, the received routing information preferentially concentrating data packets with common redundant data along paths;
- and
- (e) route packets having the given data redundancy according to the given routing of the received routing information independent of previous routing by the network router;
- wherein the routing information designates a given routing of packets having a given data redundancy by linear programming, the linear programming configured to reduce a footprint variable over the network of the linked data redundancy and destination information received from multiple other routers, the footprint variable being a function of size of an archetype redundant packet and network path latency.
An electrical data transmission network comprising:
- (a) a plurality of interconnected devices, the devices executing stored programs to:
- (i) select among different network paths to communicate data packets to other devices;
- (ii) identify redundant data among packets passing through the devices to another device to suppress transmission of the redundant data in favor of data cached by the other device;
- and
- (iii) transmit data-redundancy information and destination information for the packets to a route manager;
- and
- (b) a route manager that is not a destination of the data packets communicating with the interconnected devices receiving the linked data-redundancy information and destination information from multiple other interconnected devices and executing a stored program to instruct the multiple other interconnected devices with respect to which network paths to use for data packets, the route manager forwarding routing information to the multiple other interconnected devices that instructs the other interconnected devices as to how to route packets received by the other interconnected devices in the future, based on the redundant data in the packets, the routing information concentrating packets having common redundant data on network paths based on data received by the route manager from multiple of the other interconnected devices;
- wherein each given device further execute the stored programs to route packets having given data redundancy according to the routing information from the routing manager independent of previous routing by the given device;
- wherein each interconnected device samples redundancies of packets associated with particular destinations for a period of time and forwards data from the sampling to the route manager and wherein the route manager returns data indicating preferred network paths for packets according to packet destinations;
- and
- wherein selection of the preferred network path for a packet having redundant data is obtained by linear programming to reduce a footprint variable being a function of archetype packet size and network path latency.
Dependencies are inferred from the claim text.