This invention relates generally to data communications, and more specifically, to a virtual application delivery chassis system.
Web services and cloud computing are deployed in an unprecedented pace. New servers are unloaded and installed at data centers every day. Demands of web services and corporate computing come from all directions. Consumer oriented services include iPhone™ apps, mobile applications such as location based services, turn-by-turn navigation services, e-book services such as Kindle™, video applications such as YouTube™ or Hulu™, music applications such as Pandora™ or iTunes™, Internet television services such as Netflix™, and many other fast-growing consumer Web services. On the corporate front, cloud computing based services such as Google™ docs, Microsoft™ Office Live and Sharepoint™ software, Salesforce.com™'s on-line software services, tele-presence and web conferencing services, and many other corporate cloud computing services.
As a result, more and more servers are deployed to accommodate the increasing computing needs. These servers are typically managed by server load balancers (SLB) or application delivery controllers (ADC). ADC is typically a network appliance, such as A10 Network's AX-Series traffic manager. ADC manages the load balancing and delivery of service sessions from client host computers to servers based on incoming service requests. As more servers are deployed, more ADC's are deployed accordingly. Similarly, as more servers are pooled together within a data center or spread across multiple data centers to provide a scalable solution for services, ADC's become a bottleneck.
In one embodiment of the present invention, a method for electing a master blade in a virtual application distribution chassis, the virtual application distribution chassis comprising a plurality of blades, comprises: (a) sending by each blade of the plurality of blades a virtual application distribution chassis message to each of the other blades in the virtual application distribution chassis; (b) determining by each blade whether the virtual application distribution chassis message was received from the master blade within a predetermined period of time; (c) in response to determining that the virtual application distribution message was not received from the master blade within the predetermined period of time, sending a master claim message by each blade to each of the other blades in the virtual application distribution chassis, each master claim message comprising a blade priority for the sending blade; (d) determining by each blade receiving the master claim messages whether any of the blade priorities obtained from the received master claim messages is higher than the blade priority of the receiving blade; (e) in response to determining that by a given receiving blade that none of the blade priorities obtained from the received master claim messages is higher than the blade priority of the given receiving blade, setting a status of the given receiving blade to a new master blade; and (f) sending by the given receiving blade a second virtual application distribution chassis message to the other blades in the virtual application distribution chassis, the second virtual application distribution chassis message indicating the status of the new master blade of the given receiving blade.
In one aspect of the present invention, the plurality of blades comprises a master slave and one or more slave blades, wherein if the at least one slave blade is operating properly, the at least one slave blade sends the virtual application distribution chassis message to each of the other blades in the virtual application distribution chassis, and wherein if the master blade is operating properly, the master blade sends the virtual application distribution chassis message to each of the other blades in the virtual application distribution chassis.
In one aspect of the present invention, the plurality of blades comprises a master blade and one or more slave blades, where the determining (b) further comprises: (b1) determining by each blade whether the virtual application distribution chassis message was received from each slave blade of the virtual application distribution chassis within the predetermined period of time; (b2) in response to determining that the virtual application distribution chassis message was not received from a given slave blade within the predetermined period of time, marking the given slave blade as “failed” by each blade receiving the virtual application distribution messages; and (b3) in response to determining that the virtual application distribution chassis message was received from the given slave blade within the predetermined period of time, marking the given slave blade as properly operating by each blade receiving the virtual application distribution chassis messages.
In one aspect of the present invention, the determining (d) and the setting (e) comprises: (d1) comparing, by the given receiving blade, the blade priority obtained from a given master claim message with the blade priority of the given receiving blade; (e1) in response to determining that the blade priority of the given receiving blade is higher than the blade priority obtained from the given master claim message, repeating the comparing (d1) with another received master claim message; and (e2) in response to determining that the blade priority of the given receiving blade is higher than the blade priorities obtained from each of the other received master claim messages, setting the status of the given receiving blade to the new master blade.
In one aspect of the present invention, the determining (d) and the setting (e) comprise: (d1) comparing, by the given receiving blade, the blade priority obtained from a given master claim message with the blade priority of the given receiving blade; and (e1) in response to determining that the blade priority obtained from the given master claim message is higher than the blade priority of the given receiving blade, maintaining a slave status of the given receiving blade.
In one aspect of the present invention, each master claim message further comprises a blade identity of the sending blade, wherein the comparing (d1), the repeating (e1), and the setting (e2) comprises: (d1i) determining by the given receiving blade that the blade priority obtained from the given master claim message is equal to the blade priority of the given receiving blade; (d1ii) in response to determining that the blade priority obtained from the given master claim message is equal to the blade priority of the given receiving blade, determining whether the blade priority obtained from the given master claim message is numerically smaller than the blade priority of the given receiving blade; (e1i) in response to determining that the blade priority obtained from the given master claim message is numerically smaller than the blade priority of the given receiving blade, repeating the comparing (d1) with another received claim message; and (e2i) in response to determining that the blade priority of the given receiving blade is either higher than, or equal to and numerically smaller than, the blade priorities obtained from each of the other received master claim messages, setting the status of the given receiving blade to the new master blade.
In one aspect of the present invention, the sending (f) comprises: (f1) determining by a given slave blade of the plurality of blades whether the second virtual application distribution chassis message was received within a second predetermined period of time; and (f2) in response to determining by the given slave blade that the second virtual application distribution chassis message was not received within the second predetermined period of time, setting a status of the given slave blade to the new master blade and sending the second virtual application distribution message by the given slave blade to the other blades in the virtual application distribution chassis.
In one aspect of the present invention, the method further comprises: (g) adding a new blade to the virtual application distribution chassis; (h) sending a second master claim message by the new blade to each of the other blades in the virtual application distribution chassis; (i) in response to receiving the second master claim message from the new blade, determining by each of the other blades whether the master blade is marked as properly operating; and (j) in response to determining by each of the other blades that the master blade is marked as properly operating, ignoring the second master claim message, wherein otherwise, performing the sending (c), the determining (d), the setting (e), and the sending (f).
In one aspect of the present invention, the plurality of blades are operatively coupled as the virtual application distribution chassis within a data network, the data network comprising a network switch wherein the method further comprises: (g) assigning a first blade of the plurality of blades as an active blade to a virtual address, and assigning a second blade of the plurality of blades as a backup blade to the virtual address, wherein service requests destined for the virtual address are sent to the first blade by the network switch.
In one aspect of the present invention, the method further comprises: (h) determining by each blade that the virtual application distribution chassis message was not received from the first blade within the predetermined period of time; (i) in response to determining that the virtual application distribution chassis message was not received from the first blade within the predetermined period of time, changing a status of the second blade to the active blade for the virtual address; and (j) sending a virtual address change message to the network switch to inform the network switch to send future service requests destined for the virtual address to the second blade.
System and computer program products corresponding to the above-summarized methods are also described and claimed herein.
The following description is presented to enable one of ordinary skill in the art to make and use the invention and is provided in the context of a patent application and its requirements. Various modifications to the embodiment will be readily apparent to those skilled in the art and the generic principles herein may be applied to other embodiments. Thus, the present invention is not intended to be limited to the embodiment shown but is to be accorded the widest scope consistent with the principles and features described herein.
The invention can take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment containing both hardware and software elements. In a preferred embodiment, the invention is implemented in software, which includes but is not limited to firmware, resident software, microcode, etc.
Furthermore, the invention can take the form of a computer program product accessible from a computer-usable or computer-readable medium providing program code for use by or in connection with a computer or any instruction execution system. For the purposes of this description, a computer-usable or computer readable medium can be any apparatus that can contain, store, communicate, propagate, or transport eh program for use by or in connection with the instruction execution system, apparatus, or device.
The medium can be an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system (or apparatus or device) or a propagation medium. Examples of a computer-readable medium include a semiconductor or solid-state memory, magnetic tape, a removable computer diskette, a random-access memory (RAM), a read-only memory (ROM), a rigid magnetic disk and an optical disk. Current examples of optical disks include compact disk—read only memory (CD-ROM), compact disk—read/write (CD-R/W) and DVD.
A data processing system suitable for storing and/or executing program code will include at least one processor coupled directly or indirectly to memory elements through a system bus. The memory elements can include local memory employed during actual execution of the program code, bulk storage, and cache memories which provide temporary storage of at least some program code in order to reduce the number of times code must be retrieved from bulk storage during execution.
Input/output or I/O devices (including but not limited to keyboards, displays, point devices, etc.) can be coupled to the system either directly or through intervening I/O controllers.
Network adapters may also be coupled to the system to enable the data processing system to become coupled to other data processing systems or remote printers or storage devices through intervening private or public networks. Modems, cable modem and Ethernet cards are just a few of the currently available types of network adapters.
The block diagrams in the Figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present invention. In this regard, each block in the block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified local function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams, and combinations of blocks in the block diagrams, can be implemented by special purpose hardware-based systems that perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
The terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the invention. As used herein, the singular forms “a”, “an” and “the” are intended to include the plural forms as well, unless the context clearly indicates otherwise. It will be further understood that the terms “comprises” and/or “comprising,” when used in this specification, specify the presence of stated features, integers, steps, operations, elements, and/or components, but do not preclude the presence or addition of one or more other features, integers, steps, operations, elements, components, and/or groups thereof.
In one embodiment, service session 401 is a session for a non-Web service such as a remote access service, a file and print service, a name or directory service, an enterprise application service, a database application service or a messaging service. Service request 403 is a corresponding request of service session 401.
In
Illustrated in
Back to
Data network 151 connects virtual application delivery chassis 300 to data network 153. In one embodiment, data network 151 includes various embodiments of data network 153. In one embodiment, data network 151 resides in a data center, spans across multiple data centers over a wide area network such as optical network, or spreads over multiple buildings in a campus area network.
Data network 155 connects the server 200 to data network 151. In one embodiment, data network 155 is a sub-network of data network 151. In one embodiment, data network 155 includes various embodiments of data network 151. In one embodiment, data network 151 is a different network from data network 155.
In an embodiment, the host 100 initiates an application service session 401 with the server 200. The host 100 sends a service request 403 to virtual application delivery chassis 300. After virtual application delivery chassis 300 receives service request 403, virtual application delivery chassis 300 establishes a server session 405 and relays service request 403 to the server 200. Virtual application delivery chassis 300 receives response through server session 405 from the server 200. Virtual application delivery chassis 300 subsequently relays the response through server session 405 as a response to service request 403.
In one embodiment, switch 412, switch 414, and switch 416 are located in the same geographic location, such as a data center. In one embodiment, switch 412, switch 414, and switch 416 are located in different geographic locations, such as two or more data centers. In this embodiment, blades 310, 312, 314, and 316 are geographically located in different data centers.
Blade 310 communicates with other blades in the virtual application distribution chassis 300 by sending and receiving a virtual application delivery chassis message (VCS) 500. In one embodiment, blade 310 sends virtual application delivery chassis message 500 using a broadcast network address such as an Ethernet broadcast address. In one embodiment, the virtual application delivery chassis message 500 is sent using a multicast address such as an Ethernet multicast address, an IP multicast address, or other multicast network address. In one embodiment, blade 310 establishes a communication session (not shown) with blade 312 and sends virtual application delivery chassis message 500 to blade 312 using the communication session. Blade 310 also establishes separate communication sessions with the other blades in the virtual application distribution chassis 300 and sends virtual application delivery chassis message 500 to the other blades over their respective communication sessions. Examples of the communication session can be an UDP session, a TCP session, an IP-based communication session, a peer-to-peer communication session, a unicast communication session or other form of data communication session. In one embodiment, blade 310 receives virtual application delivery chassis message 500 using a broadcast, a multicast address, or a communication session with blade 312 or other blades in the virtual application distribution chassis 300.
In an example illustrated in
Master blade 312 sends out master advertisement message 504, another form of virtual application delivery chassis message 500, to inform the slave blades in the virtual application delivery chassis 300 that master blade 312 is running properly. In one embodiment, master blade 312 includes a timer 322 configured to measure a predetermined period of time, and sends master advertisement message 504 when the timer 322 expires. In one embodiment, master blade 312 sends master advertisement message 504 periodically, every half a second, 5 seconds, 30 seconds or 1 minute. In an embodiment, master blade 312 sends advertisement message 504 whenever there is a change of information of master blade 312, such as changes to a software version due to an upgrade.
In one embodiment, each slave blade, including slave blade 314, receives master advertisement message 504 from master blade 312. Contrary to including status indication within the master advertisement message 504, the receipt of the master advertisement message 504 itself indicates to the slave blades that master blade 312 is in proper running status. In the example illustrated in
After the failure of master blade 312 is recognized by slave blades 310, 314, and 316, the slave blades will elect a new master blade.
For example, in
Slave blade 310 receives master claim message 524 from slave blade 314 and obtains blade priority 534 from the master claim message 524. Slave blade 310 compares its own blade priority 530 with the blade priority 534 from the master claim message 524 and determines that blade priority 530 is higher than blade priority 534. Slave blade 310 also receives master claim message 526 from slave blade 316 and obtains blade priority 536 from the master claim message 526. Slave blade 310 compares its own blade priority 530 with the blade priority 536 and determines that blade priority 530 is higher than blade priority 536. In one embodiment, in response, slave blade 310 changes its role to master blade. In one embodiment, slave blade 310 includes the timer 320 and does not receive any master claim messages containing a blade priority higher than blade priority 530 before the timer 320 expires. In response, slave blade 310 changes its role to master blade. The new master blade 310 then informs the other blades in the virtual application distribution chassis 300 of its new master role by sending master advertisement message 515 to each of the other blades.
In one embodiment, slave blade 310 determines blade priority 530 equals blade priority 534. In response, slave blade 310 uses a pre-determined arbitration process to determine if slave blade 310 or slave blade 314 has a higher priority. For example, in one embodiment, slave blade 310 is assigned a blade identity 330. Slave blade 310 includes blade identity 330 in master claim message 520. Similarly slave blade 314 is assigned blade identity 334 and includes blade identity 334 in master claim message 524. Upon receiving master claim message 524, slave blade 310 compares the blade identity 334 from the master claim message 524 with its own blade identity 330 and determines that blade identity 334 is numerically smaller than blade identity 330. In response, slave blade 310 determines itself to have a higher priority than blade 314. Assuming slave blade 310 does not receive any other master claim messages with either a higher blade priority or an equal blade priority and a higher blade identity, slave blade 310 changes its role to master blade. In one embodiment, the pre-determined arbitration process prefers numerically smaller blade identities instead of higher blade identities. The pre-determined arbitration process may use information other than blade identity without departing from the spirit and scope of the present invention.
When the blade 310 changes its role to master blade, blade 310 sends a master advertisement message 515 to each of the other blades in the virtual application distribution chassis 300. The receipt of a master advertisement message 515 itself from blade 310 indicates to each of the other blades that blade 310 is a master blade. For example, when slave blade 314 receives master advertisement message 515 from master blade 310, slave blade 314 records that master blade 310 is the master blade of the virtual application delivery chassis 300.
In one embodiment, slave blade 314 includes a timer 324 and does not receive any master advertisement messages before the timer 324 expires. Slave blade 314 determines that a master blade has not been determined. In response, slave blade 314 elects itself to be the master blade and sends a master advertisement message to the other blades in the virtual application distribution chassis 300.
Revisiting the connectivity between virtual application delivery chassis 300 and the host 100,
In one embodiment, active blade 310 fails and does not send slave report message 510, or master advertisement message if active blade 310 is a master blade, upon expiration of timer 320. Backup blade 314 does not receive slave report message 510 from active blade 310 before timer 324 expires. In response, backup blade 314 determines that active blade 310 has failed. Backup blade 314 changes its role to the active blade for virtual address 423. Active blade 314 sends a virtual address change message 446 to inform network switch 418 that future packets for virtual address 423 should be sent to active blade 314. In one embodiment, virtual address 423 is an IP address and network switch 418 is an Ethernet switch. Active blade 314 informs network switch 418 using an Address Resolution Protocol (ARP) message, which includes virtual address 423 and a MAC address of the network interface of active blade 314. Upon receiving the virtual address change message 446, network switch 418 changes state such that future packets destined for virtual address 423 will be sent to active blade 314.
In one embodiment, service session between the host 100 and the server 200 based on service request 403 fails when active blade 310 fails. In an embodiment, the host 100 subsequently sends service request 407 for another service session 409 using virtual address 423. Network switch 418 receives service request 407 and sends service request 407 with virtual address 423 to active blade 314. Active blade 314 processes service request 407 and sends the request to the server 200.
Although the present invention has been described in accordance with the embodiments shown, one of ordinary skill in the art will readily recognize that there could be variations to the embodiments and those variations would be within the spirit and scope of the present invention. Accordingly, many modifications may be made by one of ordinary skill in the art without departing from the spirit and scope of the appended claims.
The present application is a continuation of and claims the benefit of U.S. patent application Ser. No. 15/272,245, filed Sep. 21, 2016, entitled “Virtual Application Delivery Chassis System,” which in turn is a continuation and claims the benefit of U.S. patent application Ser. No. 14/492,360, filed Sep. 22, 2014, entitled “Virtual Application Delivery Chassis System,”, now issued as U.S. Pat. No. 9,477,563 which in turn is a continuation of U.S. patent application Ser. No. 13/558,350, filed Jul. 26, 2012, entitled “Virtual Application Delivery Chassis System,” now issued as U.S. Pat. No. 8,849,938, which in turn is a continuation of U.S. patent application Ser. No. 13/363,055, filed on Jan. 31, 2012, entitled “Virtual Application Delivery Chassis System,” now issued as U.S. Pat. No. 8,266,235, which in turn is a continuation of U.S. patent application Ser. No. 13/004,861, filed on Jan. 11, 2011, entitled “Virtual Application Delivery Chassis System,” now abandoned. All of the above applications are incorporated herein by reference for all purposes.
Number | Name | Date | Kind |
---|---|---|---|
4475192 | Fernow et al. | Oct 1984 | A |
5042032 | Dighe et al. | Aug 1991 | A |
5732041 | Joffe | Mar 1998 | A |
5822512 | Goodrum et al. | Oct 1998 | A |
5859835 | Varma et al. | Jan 1999 | A |
5909686 | Muller et al. | Jun 1999 | A |
5935207 | Logue et al. | Aug 1999 | A |
5960174 | Dew | Sep 1999 | A |
6047000 | Tsang et al. | Apr 2000 | A |
6058116 | Hiscock et al. | May 2000 | A |
6118768 | Bhatia et al. | Sep 2000 | A |
6134217 | Stiliadis et al. | Oct 2000 | A |
6314501 | Gulick et al. | Nov 2001 | B1 |
6359861 | Sui et al. | Mar 2002 | B1 |
6430156 | Park et al. | Aug 2002 | B1 |
6438134 | Chow et al. | Aug 2002 | B1 |
6470016 | Kalkunte et al. | Oct 2002 | B1 |
6532213 | Chiussi et al. | Mar 2003 | B1 |
6532501 | McCracken | Mar 2003 | B1 |
6560230 | Li et al. | May 2003 | B1 |
6577596 | Olsson et al. | Jun 2003 | B1 |
6594701 | Forin | Jul 2003 | B1 |
6650641 | Albert et al. | Nov 2003 | B1 |
6654374 | Fawaz et al. | Nov 2003 | B1 |
6674721 | Dittia et al. | Jan 2004 | B1 |
6714517 | Fawaz et al. | Mar 2004 | B1 |
6735206 | Oki et al. | May 2004 | B1 |
6735210 | Lindeborg et al. | May 2004 | B1 |
6765915 | Metzger et al. | Jul 2004 | B1 |
6785232 | Kotser et al. | Aug 2004 | B1 |
6813268 | Kalkunte et al. | Nov 2004 | B1 |
6888806 | Miller et al. | May 2005 | B1 |
6891835 | Kalkunte et al. | May 2005 | B2 |
6892309 | Richmond et al. | May 2005 | B2 |
6920109 | Yazaki et al. | Jul 2005 | B2 |
6940861 | Liu et al. | Sep 2005 | B2 |
7139267 | Lu et al. | Nov 2006 | B2 |
7236491 | Tsao et al. | Jun 2007 | B2 |
7353259 | Bakke et al. | Apr 2008 | B1 |
7421478 | Muchow | Sep 2008 | B1 |
7451221 | Basani et al. | Nov 2008 | B2 |
7606867 | Singhal | Oct 2009 | B1 |
7627672 | Lai et al. | Dec 2009 | B2 |
7660824 | Halpern et al. | Feb 2010 | B2 |
7673008 | Kojima | Mar 2010 | B2 |
7738504 | Deaner et al. | Jun 2010 | B1 |
7849178 | Shen et al. | Dec 2010 | B2 |
7949893 | Knaus et al. | May 2011 | B1 |
8122289 | Sargor et al. | Feb 2012 | B2 |
8266235 | Jalan | Sep 2012 | B2 |
8849938 | Jalan | Sep 2014 | B2 |
8897154 | Jalan et al. | Nov 2014 | B2 |
9154577 | Jalan et al. | Oct 2015 | B2 |
9477563 | Jalan | Oct 2016 | B2 |
9596134 | Jalan et al. | Mar 2017 | B2 |
9838472 | Jalan | Dec 2017 | B2 |
20010043564 | Bloch et al. | Nov 2001 | A1 |
20020012348 | Mizuhara et al. | Jan 2002 | A1 |
20020071387 | Horiguchi et al. | Jun 2002 | A1 |
20020075875 | Dravida et al. | Jun 2002 | A1 |
20020131413 | Tsao et al. | Sep 2002 | A1 |
20020188718 | McGraw | Dec 2002 | A1 |
20030023898 | Jacobs et al. | Jan 2003 | A1 |
20030133406 | Fawaz et al. | Jul 2003 | A1 |
20030135767 | Chu et al. | Jul 2003 | A1 |
20030140132 | Champagne et al. | Jul 2003 | A1 |
20030158886 | Walls et al. | Aug 2003 | A1 |
20030169734 | Lu et al. | Sep 2003 | A1 |
20030189947 | Beshai | Oct 2003 | A1 |
20040013125 | Betker | Jan 2004 | A1 |
20040024831 | Yang et al. | Feb 2004 | A1 |
20040054780 | Romero | Mar 2004 | A1 |
20040059813 | Bolder et al. | Mar 2004 | A1 |
20040228274 | Yazaki et al. | Nov 2004 | A1 |
20040246980 | Balakrishnan | Dec 2004 | A1 |
20040264481 | Darling et al. | Dec 2004 | A1 |
20040268358 | Darling et al. | Dec 2004 | A1 |
20050010709 | Davies et al. | Jan 2005 | A1 |
20050163049 | Yazaki et al. | Jul 2005 | A1 |
20050198359 | Basani et al. | Sep 2005 | A1 |
20050243856 | Mishra et al. | Nov 2005 | A1 |
20060031506 | Redgate | Feb 2006 | A1 |
20060101372 | Zhuo et al. | May 2006 | A1 |
20060104230 | Gidwani | May 2006 | A1 |
20060123479 | Kumar et al. | Jun 2006 | A1 |
20060164987 | Ruiz Floriach et al. | Jul 2006 | A1 |
20060206594 | Brown et al. | Sep 2006 | A1 |
20070081527 | Betker et al. | Apr 2007 | A1 |
20070086428 | Lai et al. | Apr 2007 | A1 |
20080104215 | Excoffier et al. | May 2008 | A1 |
20090158081 | Dake et al. | Jun 2009 | A1 |
20090204699 | Kortright | Aug 2009 | A1 |
20100049836 | Kramer | Feb 2010 | A1 |
20100094967 | Zuckerman et al. | Apr 2010 | A1 |
20100162036 | Linden | Jun 2010 | A1 |
20100180025 | Kern | Jul 2010 | A1 |
20100180161 | Kern et al. | Jul 2010 | A1 |
20100287303 | Smith | Nov 2010 | A1 |
20110066672 | Zamarreno et al. | Mar 2011 | A1 |
20110075571 | Hao | Mar 2011 | A1 |
20110161405 | He | Jun 2011 | A1 |
20110307570 | Speks | Dec 2011 | A1 |
20120281540 | Khan et al. | Nov 2012 | A1 |
20130151686 | Takaoka et al. | Jun 2013 | A1 |
20150039674 | Agarwal et al. | Feb 2015 | A1 |
20150195182 | Mathur et al. | Jul 2015 | A1 |
20150312322 | Kamat et al. | Oct 2015 | A1 |
20170013051 | Jalan et al. | Jan 2017 | A1 |
Number | Date | Country |
---|---|---|
1554055 | Dec 2004 | CN |
101019387 | Aug 2007 | CN |
101252506 | Aug 2008 | CN |
101519078 | Sep 2009 | CN |
102708004 | Oct 2012 | CN |
102984194 | Mar 2013 | CN |
2663919 | Nov 2013 | EP |
1183571 | Dec 2013 | HK |
1186802 | Mar 2014 | HK |
H06044090 | Feb 1994 | JP |
2002278787 | Sep 2002 | JP |
2003345640 | Dec 2003 | JP |
2007257023 | Oct 2007 | JP |
2009003923 | Jan 2009 | JP |
5948345 | Jul 2016 | JP |
542960 | Jul 2003 | TW |
I233734 | Jun 2005 | TW |
I277324 | Mar 2007 | TW |
WO2010077222 | Jul 2010 | WO |
WO2012097015 | Jul 2012 | WO |
WO2012170226 | Dec 2012 | WO |
WO2015164027 | Oct 2015 | WO |
Entry |
---|
Bennett, et al., “High Speed, Scalable, and Accurate Implementation of Packet Fair Queueing Algorithms in ATM Networks,” Proceedings ICNP, 1997, pp. 7-14. |
Bennett, et al., “WF2Q: Worst-Case Fair Weighted Fair Queueing,” Proceedings IEEE INFOCOM, 1996, vol. 1, pp. 120-128. |
Chaskar, et al., “Fair Scheduling with Tunable Latency: A Round Robin Approach,” Global Telecommunications Conference, 1999, pp. 1328-1333. |
Golestani, “A Self-Clocked Fair Queueing Scheme for Broadband Applications,” Proceedings of IEEE INFOCOM, 1994, pp. 636-646. |
Katevenis, et al., “Weighted Round-Robin Cell Multiplexing in a General-Purpose ATM Switch Chip,” IEEE Journal on Selected Areas in Communications, 1991, vol. 9 (8), pp. 1265-1279. |
Matsurfuru, et al., “Efficient Fair Queueing for ATM Networks Using Uniform Round Robin,” Proceedings INFOCOM, 1999, pp. 389-397. |
Nagashwara, et al., “Concurrent Access of Priority Queues,” IEEE Transactions on Computers, 1988, vol. 37 (12), pp. 1657-1665. |
Parekh, et al., “A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks: The Single-Node Case,” IEEE/ACM Transactions on Networking, 1993, vol. 1 (3), pp. 344-357. |
Rexford, et al., “Hardware-Efficient Fair Queueing Architectures for High-Speed Networks,” Proceedings INFOCOM, 1996, pp. 638-646. |
Shreedhar, et al., “Efficient Fair Queuing Using Deficit Round-Robin,” IEEE/ACM Transactions on Networking, 1996, vol. 4 (3), pp. 375-385. |
Stiliadis, et al., “Efficient Fair Queueing Algorithms for Packet-Switched Networks,” IEEE/ACM Transactions on Networking, 1998, vol. 6 (2), pp. 175-185. |
Stiliadis, et al., “Latency-Rate Servers: A General Model for Analysis of Traffic Scheduling Algorithms,” IEEE/ACM Transactions on Networking, 1998, vol. 6 (5), pp. 611-624. |
Suri, et al., “Leap Forward Virtual Clock: A New Fair Queuing Scheme with Guaranteed Delays and Throughput Fairness,” Proceedings INFOCOM, 1997, pp. 557-565. |
Zhang, “VirtualClock: A New Traffic Control Algorithm for Packet-Switched Networks,” ACM Transactions on Computer Systems, 1991, vol. 9 (2), pp. 101-124. |
Number | Date | Country | |
---|---|---|---|
20180054478 A1 | Feb 2018 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 15272245 | Sep 2016 | US |
Child | 15796430 | US | |
Parent | 14492360 | Sep 2014 | US |
Child | 15272245 | US | |
Parent | 13558350 | Jul 2012 | US |
Child | 14492360 | US | |
Parent | 13363055 | Jan 2012 | US |
Child | 13558350 | US | |
Parent | 13004861 | Jan 2011 | US |
Child | 13363055 | US |