The following commonly owned and assigned patent applications are hereby incorporated by reference in their entirety:
1) Copending patent application Ser. No. 09/730,864, entitled System and Method for Configuration, Management and Monitoring of Network Resources, filed on Dec. 6, 2000:
2) Copending patent application Ser. No. 09/730,680, entitled System and Method for Redirecting Data Generated by Network Devices, filed on Dec. 6, 2000;
3) Copending patent application Ser. No. 09/730,683, entitled Event Manager for Network Operating System, filed on Dec. 6, 2000;
4) Copending patent application Ser. No. 10/213,949, entitled Network Component Configuration and Management Method, filed on Dec. 6, 2000; and
5) Copending patent application Ser. No. 09/730,682, entitled Network Operating System Data Directory, filed on Dec. 6, 2000.
The present invention relates generally to network systems. More particularly, but not by way of limitation, the present invention relates to systems and methods for dynamic configuration of network devices to thereby enable efficient data transfers.
Data and the effective, timely movement of data has become the lifeblood of many modern enterprises. Unfortunately, network infrastructure limitations are impinging upon the ability of enterprises to timely move data. Enterprises that require data to be delivered within very strict time requirements are being most severely impacted by these network infrastructure limitations. To guarantee the timely delivery of their data, these enterprise often are forced to pay steep prices. Moreover, network providers are being forced continually to upgrade their infrastructure to supply even the basic services to their customers. Accordingly, the networking community is searching for a method and system to better and more economically utilize the existing network infrastructure, thereby improving the transfer of data and reducing the associated cost.
With regard to the actual transmission of data, enterprises are searching for a way to pay only for the bandwidth that they use. In essence, they are looking to optimize the use of bandwidth. Presently, an enterprise that requires the bandwidth provided, for example, by a T1 line may be forced to rent a dedicated T1 line for an entire month even though the enterprise may only need the T1 line for a few days within that month. Renting the T1 line for such an extended period is wasteful on two fronts. First, the enterprise is paying for many days of service that it does not use. Preferably, an enterprise should only pay for the service that it actually uses. Second, the bandwidth available on the T1 line for those unused days is wasted because other enterprises do not have access to it. If this unused bandwidth can be captured and made available to other enterprises, the existing network infrastructure can be better utilized to meet the demands of more enterprises. Unfortunately, no device or method exists to effectively optimize the provisioning of bandwidth. Thus, even though dedicated lines are expensive and cumbersome, companies requiring rapid, predictable transfer of data presently have no other acceptable option.
With regard to the actual routing of data, enterprises are searching for an efficient way to route data based upon priority. Several methods have been developed to aid in routing data based upon priority. These present methods, however, are not completely satisfactory. For example, a feature called weighted fair queuing can be enabled on modern routers. This feature requires that the router read a precedence bit from each packet being passed through the router and then queue lower priority packets while routing higher priority packets. Although weighted fair queuing can be effective, it requires a great deal of processing power and memory within each router, and when enabled for a long period of time, weighted fair queuing can cause a router to crash. Additionally, because weighted fair queuing requires a router to analyze each packet that it receives, it slows the overall operation of the router and, thus, the network.
Because router configuration is a somewhat complicated and time consuming process, especially if numerous routers are involved, network administrators tend to configure routers in the network either to use weighted fair queuing at all times or not to use weighted fair queuing at all. In reality, most network administrators would like to use weighted fair queuing some of the time and disable it the rest of the time. Unfortunately, selectively enabling and disabling weighted fair queuing is so cumbersome that it cannot be effectively implemented. Accordingly, a device and method are needed to selectively enable router optimization techniques such as weighted fair queuing.
Because the present network technology suffers from significant drawbacks, a solution is needed that can efficiently and effectively optimize a network to enable a more efficient transfer of data. In particular, a system and method are needed in which both the bandwidth usage and/or the router performance can be easily optimized. Such a system and method would not only address the needs of the network community, but also provide new advantages such as content transfer optimization.
To address the problems and limitations of present network technology, the present invention provides for an efficient, effective optimization of a network to enable data transfers. In particular, but not by way of limitation, the present invention provides a method and apparatus to optimize bandwidth usage, routing performance and content delivery.
In one embodiment, for example, a network provider (or manager) can receive a request to transfer a block of data between two points. Such a request could indicate the identity of the party requesting the transfer and the volume of data to be transferred. The network provider could then identify the services to which the requesting party is entitled. For example, the network provider could determine whether the data block should be transferred with a high priority, a medium priority, or a low priority.
After the network provider has determined the appropriate level of service to assign to the data transfer, it can identify the path and associated network devices for transferring the data. Next, using a system in accordance with the present invention, the network devices along that path can be dynamically configured to handle the data transfer within the appropriate service level. For example, priority data handling features (such as weighted fair queuing) can be enabled on the appropriate routers. Additionally, or even alternatively, a virtual, dedicated line between the two transfer points can be established by reconfiguring the appropriate optical devices. Once the data transfer has been completed, the priority data handling features can be disabled and/or the virtual dedicated line between the two points can be torn down.
Accordingly, in the above-described embodiment, network resources can be provisioned “just-in-time.” Moreover, when network resources are not being used, they can be returned to the pool of available resources, and when special data handling features such as weighted fair queuing are not needed, they can be turned off.
Various objects and advantages and a more complete understanding of the present invention are apparent and more readily appreciated by reference to the following Detailed Description and to the appended claims when taken in conjunction with the accompanying Drawings wherein:
Although the present invention is open to various modifications and alternate constructions, a preferred exemplary embodiment that is shown in the drawings is described herein in detail. It is to be understood, however, that there is no intention to limit the invention to the particular forms disclosed. One skilled in the art can recognize that there are numerous modifications, equivalents and alternative constructions that fall within the spirit and scope of the invention as expressed in the claims.
Referring now to
Referring now to
Using the present invention, however, the network provider could perform just-in-time provisioning and provide enterprises with the requested bandwidth for the requested time frame. Network providers can perform this just-in-time provisioning through a dynamic configuration of the relevant network devices. Assume, for example, that optical device 125b and its associated lines could provide the bandwidth requested by the enterprise. This optical device could be dynamically identified and dynamically configured to reserve the requested bandwidth for the requested timeframe. Moreover, router 120a and router 120f could be dynamically configured to route data from the enterprise to optical device 125b rather than to any other network device and associated path.
In one embodiment of the present invention, the dynamic configuration of network devices is achieved through directory-based networking. One example of directory-based networking is described in commonly owned and assigned patent application Ser. No. 09/730,864 entitled System and Method for Configuration, Management and Monitoring of Network Resources, filed on Dec. 6, 2000. Briefly, directory-based networking involves storing a configuration record for each network device in a central repository. When a network device needs to be reconfigured, the centrally-stored configuration record for that device can be retrieved and altered. The altered configuration record can then be used to generate the device-specific code needed to reconfigure the relevant network devices. Finally, once the device-specific code has been generated, that code is provided (either through a push or get) to the appropriate network device(s). Thus, by using directory-based networking, network devices can be dynamically configured with a minimal amount of actual human intervention, thereby allowing for just-in-time provisioning of network resources.
Referring now to
Accordingly, one embodiment of the present invention provides a method for just-in-time provisioning of network resources. In particular, this embodiment provides a method for easily and dynamically establishing and tearing down a virtual, dedicated transmission path. With the present invention, enterprises can request and pay for only those network services that they need. Moreover, through the present invention, network providers can better utilize network resources by returning unused network resources to a pool of generally available resources. In prior art systems, these unused network resources could have remained dedicated to a single enterprise whether or not they were actually being used.
Referring now to
Initially, an enterprise may request that data be routed with a high priority or that the enterprise be given a certain routing priority for a particular timeframe 405. In either case, the network provider can determine the enterprise's service level and link that service level to a priority 410. For example, if the enterprise has a top level service agreement, that enterprise may have access to the highest level of priority that the network provider can give. Alternatively, if the enterprise has a lower level service agreement, that enterprise may only have access to a mid-level priority. By tiering priority in this fashion, enterprises can select and pay for the level of service that they need. Moreover, network providers can maximize network resources and revenue by providing higher priority service(s) to those customers that need it and that are willing to pay for it.
Responsive to an enterprise requesting that data be routed with a certain priority, a pathway can be identified 415 and routers along that pathway can be dynamically reconfigured to enable priority data handling features such as weighted fair queuing 420. With these priority data handling features enabled, higher priority data can be routed before lower priority data.
As previously described, weighted fair queuing is effective for routing data based upon priority but can cause network congestion and router failure when used unnecessarily. The present invention addresses this problem by allowing for weighted fair queuing and similar priority data handling features to be dynamically disabled 425. In other words, weighted fair queuing can be turned off when not needed without significant difficulty.
Notably, the present invention allows for the concurrent operation of bandwidth optimization and routing optimization. For example, an enterprise could request a virtual dedicated line and also request routing priority to that line. The network provider could provision these services based upon a service level agreement with the enterprise.
Referring now to
After the request for content transfer has been made and the importance of that transfer has been determined 515, the path for transferring that content can be identified 520. If the requesting enterprise is utilizing a virtual dedicated line, the content transfer can be made using that line. Additionally, the routers connected to that line can be configured such that weighted fair queuing is enabled 525 for this content transfer and disabled when the transfer is complete 530. Alternate embodiments involve differing combinations of bandwidth optimization and content optimization. As with bandwidth optimization and routing optimization, content-delivery optimization can be achieved, in a variety of ways, including through the use of directory-enabled networking.
In conclusion, the present system provides, among other things, a system and method for optimizing the utilization of network resources. Those skilled in the art, however, can readily recognize that numerous variations and substitutions may be made in the invention, its use and its configuration to achieve substantially the same results as achieved by the embodiments described herein. Accordingly, there is no intention to limit the invention to the disclosed exemplary forms. May variations, modifications and alternative constructions fall within the scope and spirit of the disclosed invention as expressed in the claims.
| Number | Name | Date | Kind |
|---|---|---|---|
| 4991089 | Shorter | Feb 1991 | A |
| 5109486 | Seymour | Apr 1992 | A |
| 5159685 | Kung | Oct 1992 | A |
| 5442791 | Wrabetz et al. | Aug 1995 | A |
| 5475819 | Miller et al. | Dec 1995 | A |
| 5491820 | Belove et al. | Feb 1996 | A |
| 5519704 | Farinacci et al. | May 1996 | A |
| 5557748 | Norris | Sep 1996 | A |
| 5581764 | Fitzgerald et al. | Dec 1996 | A |
| 5724509 | Starkweather et al. | Mar 1998 | A |
| 5726883 | Levine et al. | Mar 1998 | A |
| 5751967 | Raab et al. | May 1998 | A |
| 5764955 | Doolan | Jun 1998 | A |
| 5784702 | Greenstein et al. | Jul 1998 | A |
| 5787246 | Lichtman et al. | Jul 1998 | A |
| 5796732 | Mazzola et al. | Aug 1998 | A |
| 5819028 | Manghirmalani et al. | Oct 1998 | A |
| 5832503 | Malik et al. | Nov 1998 | A |
| 5838918 | Prager et al. | Nov 1998 | A |
| 5842040 | Hughes et al. | Nov 1998 | A |
| 5852740 | Estes | Dec 1998 | A |
| 5872928 | Lewis et al. | Feb 1999 | A |
| 5884028 | Kindell et al. | Mar 1999 | A |
| 5889953 | Thebaut et al. | Mar 1999 | A |
| 5920701 | Miller et al. | Jul 1999 | A |
| 5944782 | Noble et al. | Aug 1999 | A |
| 5948065 | Eilert et al. | Sep 1999 | A |
| 5956341 | Galand et al. | Sep 1999 | A |
| 5961594 | Bouvier et al. | Oct 1999 | A |
| 5968122 | Schlosser et al. | Oct 1999 | A |
| 5968176 | Nessett et al. | Oct 1999 | A |
| 5974236 | Sherman | Oct 1999 | A |
| 5980078 | Krivoshein et al. | Nov 1999 | A |
| 6006035 | Nabahi | Dec 1999 | A |
| 6016306 | Le Boudec et al. | Jan 2000 | A |
| 6023586 | Gaisford et al. | Feb 2000 | A |
| 6028846 | Cain | Feb 2000 | A |
| 6041347 | Harsham et al. | Mar 2000 | A |
| 6049828 | Dev et al. | Apr 2000 | A |
| 6055568 | Adams | Apr 2000 | A |
| 6097697 | Yao et al. | Aug 2000 | A |
| 6098094 | Barnhouse et al. | Aug 2000 | A |
| 6098101 | Sears | Aug 2000 | A |
| 6098108 | Sridhar et al. | Aug 2000 | A |
| 6101508 | Wolff | Aug 2000 | A |
| 6104700 | Haddock et al. | Aug 2000 | A |
| 6105069 | Franklin et al. | Aug 2000 | A |
| 6108699 | Moiin | Aug 2000 | A |
| 6108703 | Leighton et al. | Aug 2000 | A |
| 6122664 | Boukobza et al. | Sep 2000 | A |
| 6128729 | Kimball et al. | Oct 2000 | A |
| 6131118 | Stupek, Jr. et al. | Oct 2000 | A |
| 6131119 | Fukui | Oct 2000 | A |
| 6154776 | Martin | Nov 2000 | A |
| 6167445 | Gai et al. | Dec 2000 | A |
| 6170009 | Mandal et al. | Jan 2001 | B1 |
| 6170011 | Macleod Beck et al. | Jan 2001 | B1 |
| 6182094 | Humpleman et al. | Jan 2001 | B1 |
| 6198479 | Humpleman et al. | Mar 2001 | B1 |
| 6202090 | Simone | Mar 2001 | B1 |
| 6243747 | Lewis et al. | Jun 2001 | B1 |
| 6260072 | Rodriguez-Moral | Jul 2001 | B1 |
| 6269398 | Leong et al. | Jul 2001 | B1 |
| 6292889 | Fitzgerald et al. | Sep 2001 | B1 |
| 6349306 | Malik et al. | Feb 2002 | B1 |
| 6356955 | Hollberg et al. | Mar 2002 | B1 |
| 6363411 | Dugan et al. | Mar 2002 | B1 |
| 6370119 | Basso et al. | Apr 2002 | B1 |
| 6381631 | Van Hoff | Apr 2002 | B1 |
| 6393425 | Kelly | May 2002 | B1 |
| 6418468 | Ahlstrom et al. | Jul 2002 | B1 |
| 6438594 | Bowman-Amuah | Aug 2002 | B1 |
| 6442608 | Knight et al. | Aug 2002 | B1 |
| 6449638 | Wecker et al. | Sep 2002 | B1 |
| 6463583 | Hammond | Oct 2002 | B1 |
| 6496843 | Getchius et al. | Dec 2002 | B1 |
| 6539425 | Stevens et al. | Mar 2003 | B1 |
| 6550060 | Hammond | Apr 2003 | B1 |
| 6567406 | Skemer | May 2003 | B1 |
| 6609108 | Pulliam et al. | Aug 2003 | B1 |
| 6615166 | Guheen et al. | Sep 2003 | B1 |
| 6625590 | Chen et al. | Sep 2003 | B1 |
| 6636877 | Doleac et al. | Oct 2003 | B1 |
| 6643640 | Getchius et al. | Nov 2003 | B1 |
| 6654799 | Tanaka | Nov 2003 | B1 |
| 6658526 | Nguyen et al. | Dec 2003 | B1 |
| 6678827 | Rothermel et al. | Jan 2004 | B1 |
| 6684244 | Goldman et al. | Jan 2004 | B1 |
| 6697967 | Robertson | Feb 2004 | B1 |
| 6725233 | Froyd et al. | Apr 2004 | B1 |
| 6769116 | Sexton | Jul 2004 | B1 |
| 6775698 | Simone | Aug 2004 | B1 |
| 6826597 | Lonnroth et al. | Nov 2004 | B1 |
| 20020032769 | Barkai et al. | Mar 2002 | A1 |
| 20020038320 | Brook | Mar 2002 | A1 |
| 20020051080 | Tanaka | May 2002 | A1 |
| 20020171762 | Maxson | Nov 2002 | A1 |
| 20020174091 | Froyd et al. | Nov 2002 | A1 |
| 20020191619 | Shafer | Dec 2002 | A1 |
| 20020198974 | Shafer | Dec 2002 | A1 |
| 20030033589 | Reyna et al. | Feb 2003 | A1 |
| 20030037040 | Beadles et al. | Feb 2003 | A1 |
| 20030048287 | Little et al. | Mar 2003 | A1 |
| 20030135508 | Chorafakis et al. | Jul 2003 | A1 |
| 20040078695 | Bowers et al. | Apr 2004 | A1 |
| 20040225865 | Cox et al. | Nov 2004 | A1 |
| Number | Date | Country |
|---|---|---|
| 0 384 339 | Aug 1990 | EP |
| 0 762 281 | Mar 1997 | EP |
| 0 810 755 | Dec 1997 | EP |
| 0 762 281 | Mar 1999 | EP |
| 0 973 296 | Jan 2000 | EP |
| 0 993 725 | Apr 2000 | EP |
| 1 011 230 | Jun 2000 | EP |
| 1 011 230 | Jun 2000 | EP |
| 1 012 726 | Jun 2000 | EP |
| 1 026 867 | Aug 2000 | EP |
| 1 047 226 | Oct 2000 | EP |
| 1 090 492 | Apr 2001 | EP |
| 1 091 526 | Apr 2001 | EP |
| 2 368 692 | May 2002 | GB |
| WO 9508794 | Mar 1995 | WO |
| WO 9524802 | Sep 1995 | WO |
| WO 95 24802 | Sep 1995 | WO |
| WO 9749214 | Dec 1997 | WO |
| WO 98 18235 | Apr 1998 | WO |
| WO 9818235 | Apr 1998 | WO |
| WO 9824208 | Jun 1998 | WO |
| WO 9901968 | Jan 1999 | WO |
| WO 9911003 | Mar 1999 | WO |
| WO 9967931 | Dec 1999 | WO |
| WO 0004665 | Jan 2000 | WO |
| WO 0041091 | Jul 2000 | WO |
| WO 0101293 | Jan 2001 | WO |
| WO 0119031 | Mar 2001 | WO |
| WO 0119031 | Mar 2001 | WO |
| WO 0147185 | Jun 2001 | WO |
| WO 0147186 | Jun 2001 | WO |
| WO 0247332 | Jun 2002 | WO |
| Number | Date | Country | |
|---|---|---|---|
| 20020069291 A1 | Jun 2002 | US |