U.S. patent application number 15/421409 was filed with the patent office on 2018-08-02 for method and apparatus for network traffic control optimization.
The applicant listed for this patent is Waltz Networks. Invention is credited to Nithin Michael, Ao TANG.
Application Number | 20180219765 15/421409 |
Document ID | / |
Family ID | 62980897 |
Filed Date | 2018-08-02 |
United States Patent
Application |
20180219765 |
Kind Code |
A1 |
Michael; Nithin ; et
al. |
August 2, 2018 |
Method and Apparatus for 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.
Inventors: |
Michael; Nithin; (San
Francisco, CA) ; TANG; Ao; (San Francisco,
CA) |
|
Applicant: |
Name |
City |
State |
Country |
Type |
Waltz Networks |
San Francisco |
CA |
US |
|
|
Family ID: |
62980897 |
Appl. No.: |
15/421409 |
Filed: |
January 31, 2017 |
Current U.S.
Class: |
1/1 |
Current CPC
Class: |
H04L 45/121 20130101;
H04L 43/0864 20130101; H04L 43/0876 20130101; H04L 45/24 20130101;
H04L 45/22 20130101; H04L 45/745 20130101 |
International
Class: |
H04L 12/707 20060101
H04L012/707; H04L 12/741 20060101 H04L012/741; H04L 12/26 20060101
H04L012/26 |
Claims
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 1, 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, wherein generating a routing plan
comprises 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 1, wherein generating a routing plan
comprises employing a multipath routing scheme.
9. 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
10. The method of claim 9, wherein the data traffic routing method
further comprises monitoring a latency to each core network
router.
11. 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.
12. The method of claim 11, 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
13. The method of claim 9, wherein generating a routing plan
comprises generating one or more new routing tables, comprising
multiple data network processors exchanging probe data regarding
link loads.
14. The method of claim 13, 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.
15. The method of claim 9, wherein generating a routing plan
comprises employing a multipath routing scheme.
16. 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 method comprises:
17. The non-transient computer-readable medium of claim 16, wherein
the method further comprises monitoring a latency to each core
network router.
18. 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.
19. The non-transient computer-readable medium of claim 18, 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.
20. The non-transient computer-readable medium of claim 16, wherein
generating a routing plan comprises generating one or more new
routing tables, comprising multiple data network processors
exchanging probe data regarding link loads.
21. The non-transient computer-readable medium of claim 20,
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.
22. The non-transient computer-readable medium of claim 16, wherein
generating a routing plan comprises employing a multipath routing
scheme.
Description
BACKGROUND
[0001] Business enterprises rely on electronic communications to
communicate within the enterprise and also to provide a reliable
electronic business portal to customers and partner businesses. The
expectation of fast and available communication is increasingly the
norm among those inside the enterprise as well as enterprise
customers. Currently, businesses with enterprise networks purchase
dedicated bandwidth from an internet service provider (ISP) to
carry data traffic between and among enterprise physical sites.
These enterprise networks are referred to as private networks, and
also as MPRS networks (after the network protocol used). In fact,
ISPs usually offer different levels of service that are priced
largely based on the performance guarantee factor. ISPs typically
set up an enterprise network for an enterprise client. This
enterprise network defines physical enterprise locations and
network nodes sometimes referred to as an overlay network, meaning
a network maintained by the service provider that connects the
enterprise sites with possible physical router stops between
enterprise sites. The performance guaranteed by the ISP and paid
for by the enterprise is typically greater than can be relied upon
when exclusively using the public internet.
[0002] In many conditions, even the internet service provider for
an enterprise network (ATT as an example) may not be able to route
data traffic optimally.
BRIEF DESCRIPTION OF THE FIGURES
[0003] FIG. 1 is a block diagram of an enterprise data network
according to an embodiment.
[0004] FIG. 2 is a flow diagram of a routing method according to an
embodiment.
[0005] FIG. 3 is a diagram illustrating WALTZ overlay routing
according to an embodiment.
[0006] FIG. 4A is an example of a routing overlay table according
to an embodiment.
[0007] FIG. 4B is an example of a routing overlay table according
to an embodiment.
[0008] FIG. 5 is a block diagram of a WALTZ router according to an
embodiment.
DETAILED DESCRIPTION
[0009] Embodiments disclosed include a method and apparatus for
global traffic control and optimization for software-defined
networks. In an embodiment, data traffic in an enterprise wide area
network (WAN) is optimized by providing alternate routing in
addition to internet protocol routing supplied by an internet
service provider (ISP). Alternate routing includes defining a new
overlay network that leverages any available routers between data
origination and destination points. Data over the new overlay
network (also referred to as the WALTZ overlay network herein) is
optimally routed using multipath routing algorithms, rather than
traditional single path routing. 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
[0010] The alternate routing includes using embodiments of a data
network processor or router (referred to herein for convenience as
a Waltz router, but generally to be understood as a data network
processor) collocated with an ISP router (or ISP processor). Other
embodiments include an ISP router running embodiments of routing
software (referred to herein for convenience as Waltz routing
software) that implement an alternate routing method in addition to
the ISP routing method. The Waltz routing software may be resident
anywhere. That is, the Waltz routing software may be resident on a
Waltz router, or an enterprise router, or an ISP router or accessed
from the cloud.
[0011] FIG. 1 is a block diagram of an enterprise network 200
according to an embodiment. In this example embodiment, there are
four enterprise nodes 202A-202D. The nodes 202 can be referred to
as the edge network. Nodes 202 typically include ISP routers/and or
ISP routing software (not shown). The ISP also has multiple ISP
network routers or nodes, labeled as nodes 204A, 204B, 204C, 204D,
and 204E. These nodes 204 can be referred to as the core network.
The enterprise contracts with an ISP (such as ATT for example) for
a guaranteed level of data transmission service between and among
its enterprise edge network nodes. Waltz routers 210A-210D are (in
this example) also present at respective enterprise edge network
nodes. Waltz routers 210A-210D have access to network traffic data
and to the ISP routing tables used to optimize the enterprise
traffic.
[0012] According to embodiments of the invention, Waltz router 210
optimize traffic for the network by determining alternate routes
that would not otherwise be detected or chosen by the ISP. As shown
in the figure, heavier lines 208 represent the overlay network as
provisioned by the ISP for the enterprise. The ISP routes data
traffic according to MPRS protocols and available overlay network
routers. However, there may be more efficient routes for data at
any given time that are not detectable using MPRS. Routes 206
represent alternative routes that are more efficient at any given
time as determined by the methods disclosed herein.
[0013] FIG. 2 is a flow diagram of a data routing method 300
according to an embodiment. At 302, the data traffic is monitored
to determine whether the current routing is optimum. This includes
monitoring the latency to each enterprise node. Concurrently, at
306, the traffic destination is determined for particular packets
of data. At 304, routing information (for example, the routing
table that is generated by the ISP) is obtained and analyzed. If
latency is not acceptable and can be improved upon, a load
adjustment is made at 308. This includes adaptively adjusting the
load from any outgoing link that belongs to a non-shortest path to
a link that is part of a shortest path. Output traffic 310 is a
result of the process. Output traffic 310 is a routing plan that
can use any combination core network routers to get traffic between
edge network routers in the most efficient manner. In an
embodiment, the process illustrated by FIG. 3 uses algorithms
described in the document "HALO: Hop-by-Hop Adaptive Link-State
Optimal Routing" (Nithin Michael et al., IEEE 2014) which is hereby
incorporated by reference in its entirety. The algorithms disclosed
in the previous reference are just one example of algorithms that
may be employed to carry out the claimed invention.
[0014] FIG. 3 is a representation of WALTZ overlay routing
according to an embodiment. A core network 406 is similar to core
network 204 as illustrated and described FIG. 1. A WALTZ overlay
network 408 shows for purposes of example, three WALTZ routers W1,
W2, and W3. Still with reference to FIG. 3, FIGS. 4A and 4B are
diagrams of overlay routing tables for router W1 and router W2,
respectively. In order to generate these tables, at any time, Waltz
router exchange probes to keep track of the link load, where "link"
in this context implies a link of the overlay network which
connects Waltz router, which may well correspond to a path of the
underlying core network.
[0015] In effect, an overlay IP network is formed among Waltz
routers. The overlay IP network is an all-to-all mesh network. When
a packet arrives at a Waltz router the Waltz router forms a routing
table which decides to which next hop router (another Waltz router)
to which this packet should go based on link cost, which depends on
link load,. The next hop Waltz router may sit in the destination
site in which case, it will route the packet to that site. In the
case when the next hop Waltz router does not sit in the destination
site for that packet, it will again look up its routing table and
forward that packet to another Waltz router In each transmission
between two Waltz routers, the packet typically transitions through
the core network, whose routing is determined by the service
provider (ISP). However, the WALTZ routers use all routers in both
the core network and the overlay network to find an optimum route
for a packet.
[0016] FIG. 4A is a diagram of a routing table for router W1. The
destination router is listed in the left column and the next hop
router is listed in the right column. In some instances, as shown,
the destination router may be the same as the next hop router, as
in the first and second rows. The third row shows that even though
W3 router is the destination router, W2 is a better next hop router
(60%) as compared to row two (W3 as the destination router and next
hop router--40%).
[0017] FIG. 4B is a diagram of a routing table for router W2. In
this example, the destination routers and next hop routers are the
same.
[0018] FIG. 5 is a block diagram of a WALTZ router 600 according to
an embodiment. Router 600 includes processing equipment 602 which
is one or more processors for executing routing software 606.
Routing software 606 embodies the routing methods as described
herein by executing instructions to carry out the methods. WALTZ
router 600 also includes data storage 604 for storing data and
instruction required to implement the claimed methods. Storage of
data by data storage 604 as well as execution of instructions by
processors 602 may be distributed in any logical or geographic
manner among different WALTZ routers 600 or any other processors or
data storage facilities.
[0019] Aspects of the systems and methods described herein may be
implemented as functionality programmed into any of a variety of
circuitry, including programmable logic devices (PLDs), such as
field programmable gate arrays (FPGAs), programmable array logic
(PAL) devices, electrically programmable logic and memory devices
and standard cell-based devices, as well as application specific
integrated circuits (ASICs). Some other possibilities for
implementing aspects of the system include: microcontrollers with
memory (such as electronically erasable programmable read only
memory (EEPROM)), embedded microprocessors, firmware, software,
etc. Furthermore, aspects of the system may be embodied in
microprocessors having software-based circuit emulation, discrete
logic (sequential and combinatorial), custom devices, fuzzy
(neural) logic, quantum devices, and hybrids of any of the above
device types. Of course the underlying device technologies may be
provided in a variety of component types, e.g., metal-oxide
semiconductor field-effect transistor (MOSFET) technologies like
complementary metal-oxide semiconductor (CMOS), bipolar
technologies like emitter-coupled logic (ECL), polymer technologies
(e.g., silicon-conjugated polymer and metal-conjugated
polymer-metal structures), mixed analog and digital, etc.
[0020] It should be noted that the various functions or processes
disclosed herein may be described as data and/or instructions
embodied in various computer-readable media, in teinis of their
behavioral, register transfer, logic component, transistor, layout
geometries, and/or other characteristics. Computer-readable media
in which such formatted data and/or instructions may be embodied
include, but are not limited to, non-volatile storage media in
various forms (e.g., optical, magnetic or semiconductor storage
media) and carrier waves that may be used to transfer such
formatted data and/or instructions through wireless, optical, or
wired signaling media or any combination thereof. Examples of
transfers of such formatted data and/or instructions by carrier
waves include, but are not limited to, transfers (uploads,
downloads, e-mail, etc.) over the internet and/or other computer
networks via one or more data transfer protocols (e.g., HTTP, FTP,
SMTP, etc.). When received within a computer system via one or more
computer-readable media, such data and/or instruction-based
expressions of components and/or processes under the system
described may be processed by a processing entity (e.g., one or
more processors) within the computer system in conjunction with
execution of one or more other computer programs.
[0021] Unless the context clearly requires otherwise, throughout
the description and the claims, the words "comprise," "comprising,"
and the like are to be construed in an inclusive sense as opposed
to an exclusive or exhaustive sense; that is to say, in a sense of
"including, but not limited to." Words using the singular or plural
number also include the plural or singular number respectively.
Additionally, the words "herein," "hereunder," "above," "below,"
and words of similar import refer to this application as a whole
and not to any particular portions of this application. When the
word "or" is used in reference to a list of two or more items, that
word covers all of the following interpretations of the word: any
of the items in the list, all of the items in the list and any
combination of the items in the list.
[0022] The above description of illustrated embodiments of the
systems and methods is not intended to be exhaustive or to limit
the systems and methods to the precise forms disclosed. While
specific embodiments of, and examples for, the systems components
and methods are described herein for illustrative purposes, various
equivalent modifications are possible within the scope of the
systems, components and methods, as those skilled in the relevant
art will recognize. The teachings of the systems and methods
provided herein can be applied to other processing systems and
methods, not only for the systems and methods described above.
[0023] The elements and acts of the various embodiments described
above can be combined to provide further embodiments. These and
other changes can be made to the systems and methods in light of
the above detailed description.
[0024] In general, in the following claims, the terms used should
not be construed to limit the systems and methods to the specific
embodiments disclosed in the specification and the claims, but
should be construed to include all processing systems that operate
under the claims. Accordingly, the systems and methods are not
limited by the disclosure, but instead the scope of the systems and
methods is to be determined entirely by the claims.
[0025] While certain aspects of the systems and methods are
presented below in certain claim forms, the inventors contemplate
the various aspects of the systems and methods in any number of
claim forms. For example, while only one aspect of the systems and
methods may be recited as embodied in machine-readable medium,
other aspects may likewise be embodied in machine-readable medium.
Accordingly, the inventors reserve the right to add additional
claims after filing the application to pursue such additional claim
forms for other aspects of the systems and methods.
* * * * *