Method and apparatus for data network traffic control optimization

Abstract

Alternate data packet routing includes employing an existing enterprise MPRS network that includes an edge enterprise network and a core network as defined by an internet service provider to the enterprise. Data is more optimally routed using multipath routing algorithms, rather than traditional single path routing as typical in MPRS networks. In an embodiment, if a particular path is experiencing delays, any alternative path can be used provided the alternative path has a round-trip time less than a predefined performance requirement time. Embodiments include collecting packet traffic data and generating routing tables that may indicate more efficient routes not available through the ISP routing procedures.

1 . A method for controlling data traffic in a data network, the method comprising:
 a data network processor monitoring data traffic, wherein data traffic comprises data traffic between enterprise nodes in an enterprise edge network, and wherein the data traffic may be routed among a plurality of core network processors that are controlled by an internet service provider to the enterprise;   the data network processor receiving routing information from the core network processors and analyzing the routing information to determine whether there are more efficient routes between enterprise nodes than would be available from the core network processors;   the data network processor adjusting data loads considering destinations for data traffic; and   the data network processor generating a routing table that uses any available core network routers.   
     
     
         2 . The method of  claim 1 , further comprising monitoring a latency to each core network router. 
     
     
         3 . The method of claim  42 , further comprising the data network processor obtaining and analyzing a routing table generated by the core network processors. 
     
     
         4 . The method of  claim 3 , wherein if the latency is not acceptable, the data network processor:
 determines whether the latency can be improved upon;   if the latency can be improved upon, adjusts the data load from any outgoing processor that belongs to a non-shortest path to a processor that is part of a shortest path, wherein any outgoing processor may be one or more of a core network processor and an enterprise edge network processor.   
     
     
         5 . The method of  claim 1 , comprising generating a routing plan including generating one or more new routing tables, comprising multiple data network processors exchanging probe data regarding link loads. 
     
     
         6 . The method of  claim 5 , wherein:
 according to the one or more new routing tables, a destination router may be a same router as a next hop router; and   if it is determined by the data network processor that it is not most efficient for the destination router and the next hop router to be the same, a more efficient next hop router is chosen.   
     
     
         7 . The method of  claim 6 , wherein generating the routing plan comprises employing a multipath routing scheme. 
     
     
         8 . A system for data network traffic optimization, the system comprising:
 a plurality of enterprise data routers comprising enterprise data network processors;   a plurality of data network processors in communication with the plurality of enterprise data network processors, wherein each of the data network processors executes a data traffic routing method comprising,   the data network processor monitoring data traffic, wherein data traffic comprises data traffic between enterprise nodes in an enterprise edge network, and wherein the data traffic may be routed among a plurality of core network processors that are controlled by an internet service provider to the enterprise;   the data network processor receiving routing information from the core network processors and analyzing the routing information to determine whether there are more efficient routes between enterprise nodes than would be available from the core network processors;   the data network processor adjusting data loads considering destinations for data traffic; and   the data network processor generating a routing table that uses any available core network routers.   
     
     
         9 . The method of  claim 8 , wherein the data traffic routing method further comprises monitoring a latency to each core network router. 
     
     
         10 . The method of  claim 9 , wherein the data traffic routing method further comprises the data network processor obtaining and analyzing a routing table generated by the core network processors. 
     
     
         11 . The method of  claim 10 , wherein if the latency is not acceptable, the data network processor:
 determines whether the latency can be improved upon;   if the latency can be improved upon, adjusts the data load from any outgoing processor that belongs to a non-shortest path to a processor that is part of a shortest path, wherein any outgoing processor may be one or more of a core network processor and an enterprise edge network processor.   
     
     
         12 . The method of  claim 8 , comprising generating a routing plan including generating one or more new routing tables, comprising multiple data network processors exchanging probe data regarding link loads. 
     
     
         13 . The method of  claim 12 , wherein:
 according to the one or more new routing tables, a destination router may be a same router as a next hop router; and   if it is determined by the data network processor that it is not most efficient for the destination router and the next hop router to be the same, a more efficient next hop router is chosen.   
     
     
         14 . The method of  claim 13 , wherein generating the routing plan comprises employing a multipath routing scheme. 
     
     
         15 . A non-transient computer-readable medium having stored thereon instructions for a data routing method, wherein when the instructions are executed in a processor the data routing method comprises:
 monitoring data traffic between enterprise nodes in an enterprise edge network of an enterprise, wherein the data traffic may be routed among a plurality of core network processors that are controlled by an internet service provider corresponding to the enterprise;   receiving routing information from the plurality of core network processors and analyzing the routing information to determine whether there are more efficient routes between enterprise nodes than would be available from the core network processors;   adjusting data loads considering destinations for data traffic; and   generating a routing table that uses any available core network routers.   
     
     
         16 . The non-transient computer-readable medium of  claim 15 , wherein the method further comprises monitoring a latency to each core network router. 
     
     
         17 . The non-transient computer-readable medium of  claim 16 , wherein the method further comprises the data network processor obtaining and analyzing a routing table generated by the core network processors. 
     
     
         18 . The non-transient computer-readable medium of  claim 17 , wherein if the latency is not acceptable, the data network processor:
 determines whether the latency can be improved upon;   if the latency can be improved upon, adjusts the data load from any outgoing processor that belongs to a non-shortest path to a processor that is part of a shortest path, wherein any outgoing processor may be one or more of a core network processor and an enterprise edge network processor.   
     
     
         19 . The non-transient computer-readable medium of  claim 15 , comprising generating a routing plan including generating one or more new routing tables, comprising multiple data network processors exchanging probe data regarding link loads. 
     
     
         20 . The non-transient computer-readable medium of  claim 19 , wherein:
 according to the one or more new routing tables, a destination router may be a same router as a next hop router; and   if it is determined by the data network processor that it is not most efficient for the destination router and the next hop router to be the same, a more efficient next hop router is chosen.   
     
     
         21 . The non-transient computer-readable medium of  claim 20 , wherein generating the routing plan comprises employing a multipath routing scheme.