The present disclosure relates to pack flow through a wireless controller and more specifically to a layer 2 fast re-switching approach which provides a process of transitioning from an active wireless controller to a standby wireless controller when the active wireless controller fails.
A WLC 110 can handle hundreds of thousands of wireless clients 102/104. The WLC 110 needs to be highly redundant with high availability. When the active WLC 110 goes down, a standby WLC 118 takes over. The wireless clients 102/104 and the AP 106 states are synced over from the active WLC 110 to the standby WLC 118. The AP 106 also needs to switch to the new active WLC 118 with a new CAPWAP tunnel end-point 120. After the WLC fail-over, the clients 102/104 to/from the WLC portion of the traffic is handled in a fast convergence fashion such that within one second, for example, the traffic from the clients 102/104 is communicated from the AP 106 through the new tunnel 120 to the new WLC 118. The AP 106 can represent multiple devices and even hundreds to thousands of devices.
However, there are additional challenges in the failover process. The portion of the network between the WLC 110 and the GW 114 is a L2 switch or switch domain 112, 113. For traffic from the GW 114 to the WLC 110, the MAC (Media Access Control) learning had the path from the GW 114 to the former active WLC device 110. The L2 switch network 112 will not know that the new active WLC 118 has taken over all the client MAC addresses. The challenge in the fail-over scenario is that it takes real traffic for each of the MAC addresses of the clients 102/104 to be relearned in order for GW 114 to reach the new active WLC device 118.
One way to handle relearning all of the MAC addresses after a fail-over to the new active WLC 118. The new active WLC 118 will send out gratuitous ARP (Address Resolution Protocol) signals for each of the clients 102/104 to advertise that the new WLC 118 now owns those MAC addresses. But to handle hundreds of thousands of wireless client MAC devices, at the moment right after switchover and the device is very busy, would take a while for all MAC addresses to be finally relearned in the L2 domain 113.
Thus, even if the system implements an efficient and speedy synchronization of the clients' information from the active WLC 110 to the standby WLC 118, if the system does not implement a scalable solution to deal with the re-convergence of hundreds of thousands of wireless clients on the L2 domain, there remains a need within the art for a faster convergence approach.
In order to describe the manner in which the above-recited and other advantages and features of the disclosure can be obtained, a more particular description of the principles briefly described above will be rendered by reference to specific embodiments thereof which are illustrated in the appended drawings. Understanding that these drawings depict only exemplary embodiments of the disclosure and are not therefore to be considered to be limiting of its scope, the principles herein are described and explained with additional specificity and detail through the use of the accompanying drawings in which:
Various embodiments of the disclosure are discussed in detail below. While specific implementations are discussed, it should be understood that this is done for illustration purposes only. A person skilled in the relevant art will recognize that other components and configurations may be used without parting from the spirit and scope of the disclosure.
Additional features and advantages of the disclosure will be set forth in the description which follows, and in part will be obvious from the description, or can be learned by practice of the herein disclosed principles. The features and advantages of the disclosure can be realized and obtained by means of the instruments and combinations particularly pointed out in the appended claims. These and other features of the disclosure will become more fully apparent from the following description and appended claims, or can be learned by the practice of the principles set forth herein.
Disclosed is a method that enables a transition from a primary active wireless controller to a standby wireless controller. The method includes establishing a fast re-switch tunnel between a L2 switch and the standby wireless controller. Once the tunnel is established, the system can switch from the active wireless controller to the standby wireless controller and data can be routed from the Internet through the layer to switching network to the standby wireless controller through the fast re-switch tunnel prior to updating MAC tables for wireless clients. The method from the standpoint of the L2 switch includes receiving, at the L2 switch, a first message to establish a fast re-switch tunnel between the L2 switch and a wireless controller and receiving, at the L2 switch, a second message to trigger use of the fast re-switch tunnel. The switch receives data and forwards the data to the standby wireless controller through the fast re-switch tunnel.
The standby wireless controller, once it becomes active, can transmit a gratuitous address resolution protocol request to the wireless clients such that all of the MAC entries for wireless clients in a table can be updated. Once all the MAC entries are updated, the fast re-switch tunnel can be removed. Embodiments of the concepts disclosed herein can be directed to different nodes within the environment. For example, aspects of the disclosure can be addressed from the standpoint of an L2 switch in layer 2, which can include any switch and including the switch closest to the active wireless controller. The disclosure can be addressed from the standpoint of the active wireless controller or the standby wireless controller. Furthermore, the disclosure can be directed from the standpoint of a gateway node, an access point, a wireless client, or any other component which is involved in the management of the pathways associated with data flow through the layer 2 network.
The present disclosure addresses the issues raised above. The disclosure provides a system, method and computer-readable storage device embodiments. First a general example system shall be disclosed in
First a general example system shall be disclosed in
To enable user interaction with the computing device 200, an input device 245 can represent any number of input mechanisms, such as a microphone for speech, a touch-sensitive screen for gesture or graphical input, keyboard, mouse, motion input, speech and so forth. An output device 235 can also be one or more of a number of output mechanisms known to those of skill in the art. In some instances, multimodal systems can enable a user to provide multiple types of input to communicate with the computing device 200. The communications interface 240 can generally govern and manage the user input and system output. There is no restriction on operating on any particular hardware arrangement and therefore the basic features here may easily be substituted for improved hardware or firmware arrangements as they are developed.
Storage device 230 is a non-volatile memory and can be a hard disk or other types of computer readable media which can store data that are accessible by a computer, such as magnetic cassettes, flash memory cards, solid state memory devices, digital versatile disks, cartridges, random access memories (RAMs) 225, read only memory (ROM) 220, and hybrids thereof.
The storage device 230 can include software services 232, 234, 236 for controlling the processor 210. Other hardware or software modules/services are contemplated. The storage device 230 can be connected to the system connector 205. In one aspect, a hardware module that performs a particular function can include the software component stored in a computer-readable medium in connection with the necessary hardware components, such as the processor 210, connector 205, display 235, and so forth, to carry out the function.
According to an aspect of this disclosure, the Active/Standby WLC interface 110 is with the Internet Gateway (GW) 114 in the layer 2 (L2) domain 112. This part is not an IP/IPv6 network. The GW 114 treats the WLC 110 as part of the switch domain. The virtual router redundancy protocol, which provides for automatic assignment of available Internet Protocol routers for participating hosts, does not apply in this case. The L2 domain switches 112 in this disclosure relate to the OSI L2 switch routing functionality. The basic idea is to use controller intelligence design routes through an Ethernet switched network that avoid the use of broadcast when the route to the destination is known. L2 is the data link layer that provides node-to-node data transfer. It is a link between two directly connected nodes, which, in this case, is the Gateway 114 and the WLC 110 or WLC 118. The data link L2, in one application, is divided into two sub layers, including the MAC layer which is responsible for controlling how devices in a network gain access to a medium and permission to transmit data and a logical link control layer, which is responsible for identifying and encapsulating network layer protocols, and controls error checking and frame synchronization.
In
As shown in
The signal or message can be a L2 packet, for example use the CMP (Cisco MetaData Protocol) in the similar way as a security group tag (SGT) tag is defined. The switch ‘S1’ 302 is the only L2 device that needs to support the functionality disclosed herein. When ‘S1’ 302 receives the signal/message from the WLC 110, the switch S1302 sets up the forwarding chain such that the normal traffic for all the WLC 110 related MAC addresses will go to the port towards the current active WLC 110, and the standby forwarding will have a MAC over MAC tunnel to reach the destination MAC of ‘M2’ (at the new WLC 118) for the fast re-switch later. In
Next the process includes switching over from the WLC 110 to the stand-by WLC 118 (406). The new active WLC 118 knows that it is now the master and will send a L2 signal/message 324 to switch ‘S1’ 302 (using MAC ‘M3’, for example) which instructs the switch S1302 to trigger the fast re-switch setup such that traffic flows 326 to ‘M2’ now (408). The pre-setup was established above, and this step involves activating or triggering the fast re-switch setup which causes the traffic to utilize the new path to the WLC 118. There can be any amount of time before the pre-setup and the actual triggering. Furthermore, the timing of the instruction to pre-set up the tunnel and the triggering can be determined based on a number of factors. For example, WLC 110 may predict that within one hour, there is a likelihood that it will fail. WLC 110 can, based on the prediction of the timing of when a failure is likely, or based on any other factor, can transmit the signal to S1302 to initiate the pre-set up. Other factors outside of the WLC 110 can be communicated to the WLC 110 such that it sends the instruction. The instruction can also come from another source and not the WLC 110. Another node in the network, and administrator, a network-based service, and so forth, could cause the instruction to be sent to S1302 to initiate the preset up process.
The ‘S1’ 302, based on the message from the new WLC 118, flips the forwarding active/standby path decision on the forwarding chain 326. The result of this operation is that all the traffic that was to be sent to the port for the previous WLC 110 is now encapsulated with another MAC tunnel 326 with destination address of MAC ‘M2’ 118. Since the new active WLC 118 sends a L2 signal 324 to ‘S1’ 302 for triggering, the MAC ‘M2’ is learned throughout the L2 domain from the new active WLC 118 to ‘S1’ 302.
All the traffic from the Internet 116 to respective wireless clients 102/104, if the traffic reaches the switch ‘S1’, will be fast re-switched 326 to the new active WLC 118. It will be further sent to the AP 106 and clients 102/104 by the WLC 118 via path 328.
In the meantime, the new active WLC 118 can send out gratuitous address resolution protocol (GARP) signals for all of its wireless clients 102/104 (410). This is shown in
The L2 fast re-switch approach works in a general L2 switch network and does not depend on the network topology. Even when the ‘S1’ and ‘S2’ switches represent a single combined switch, the mechanism works the same without change.
A more secure and reliable mechanism can add a ‘keepalive’ message (once every 5 minutes for example) between the ‘S1’ Switch 302 and the standby WLC 118 after step (402) above. This is to make sure the standby WLC 118 will accept the tunneled-over traffic after switch-over, and also to make sure the path between them is not broken before the switch-over happens.
Multicast traffic from the Internet 116 to the clients 102/104 will be handled the same way during the fast re-switch. Normally after switch-over to the new active WLC 118, multicast traffic needs to wait until the client sending out the periodical Internet group management protocol (IGMP) reports which is once a minute by default. With this L2 fast re-switching, the multicast packets received on ‘S1’ 302 will be MAC encapsulated to the new active WLC 118 to reach the wireless clients 102/104. The L2 fast re-switch can be applied to some use cases other than the WLC high availability. The mechanism can be standardized for multiple vendor support.
The fast re-switching approach disclosed herein is the industry's first L2 fast re-switch for the application of wireless controller high availability. It uses a MAC over MAC tunnel to achieve the fast convergence in a scalable way after the WLC switchover in the L2 switch domain between the WLC 110/118 and Internet gateway router 114.
The L2 solution is simple and effective, and can scale to a very large number of clients of a wireless controller with the same fast convergence time. Only one external device to the WLC 110 needs to support this mechanism and rest of the L2 domain does not need to understand this feature. In the example above, a directly connected L2 switch 302 is the supporting device, but other layer 2 switches or any other node could be used as well. It does not have the problem of long delay by only sending out gratuitous ARP for relearning of MAC addresses in L2 domain. The approach is not restricted to switches and topology as in using the Virtual Switching System (VSS) switches with dual active/standby links. The approach also does not need to run a border gateway protocol (BGP) Ethernet virtual private network/locator identify separation protocol (EVPN/LISP) complex overlay protocol mechanism. Further, the approach does not need to flushout the MAC addresses as in overlay transport virtualization (OTV) case then to relearn every one of them.
This disclosure realizes that the L2 switch domain cannot relearn a large of the MAC addresses very fast (e.g. <1 sec) and the system needs to use the concept of IP network's fast reroute (FRR) which is independent of number of route entries. The concept disclosed herein is an L2 fast re-switch approach which takes certain steps to more efficiently manage a switch over from one WLC 110 to another WLC 118.
Embodiments of the concepts disclosed herein can be claim from the standpoint of different nodes within the environment. For example, aspects of the disclosure can be addressed from the standpoint of an L2 switch in layer 2, which can include any switch and includes the L2 switch 302 as the closest switch to the active wireless controller 110. The disclosure can be addressed from the standpoint of the active wireless controller 110 or the standby wireless controller 118. Furthermore, the disclosure can be directed from the standpoint of a gateway node 114, an access point 106, a wireless client 102/104, or any other component which is involved in the management of the pathways associated with dataflow through the layer 2 network.
The L2 switch can receive the first message from a first wireless controller or from any other node within the network. The wireless controller can be a second wireless controller that is different from the first wireless controller. In one example, the second wireless controller is the standby or backup wireless controller 118 and the first wireless controller can be the active wireless controller 110. The method can further include receiving, at the L2 switch, a MAC address of the wireless controller. This of course enables the set up of the fast re-switch tunnel 326, which can occur prior to a switchover to the standby WLC 118.
The method can also include receiving, at the L2 switch 302, a third message instructing the L2 switch 302 to tear down the fast re-switch tunnel 326. This message can be received after a completion of a gratuitous address resolution protocol transmission process associated with the wireless controller. The GARP process involves the slower process of updating MAC tables for all of the wireless clients 102/104 being served by the standby WLC 118.
In some embodiments the computer-readable storage devices, mediums, and/or memories can include a cable or wireless signal containing a bit stream and the like. However, when mentioned, non-transitory computer-readable storage media expressly exclude media such as energy, carrier signals, electromagnetic waves, and signals per se.
Methods according to the above-described examples can be implemented using computer-executable instructions that are stored or otherwise available from computer readable media. Such instructions can include, for example, instructions and data which cause or otherwise configure a general purpose computer, special purpose computer, or special purpose processing device to perform a certain function or group of functions. Portions of computer resources used can be accessible over a network. The computer executable instructions may be, for example, binaries, intermediate format instructions such as assembly language, firmware, or source code. Examples of computer-readable media that may be used to store instructions, information used, and/or information created during methods according to described examples include magnetic or optical disks, flash memory, USB devices provided with non-volatile memory, networked storage devices, and so on.
Devices implementing methods according to these disclosures can include hardware, firmware and/or software, and can take any of a variety of form factors. Typical examples of such form factors include laptops, smart phones, small form factor personal computers, personal digital assistants, rackmount devices, standalone devices, and so on. Functionality described herein also can be embodied in peripherals or add-in cards. Such functionality can also be implemented on a circuit board among different chips or different processes executing in a single device, by way of further example.
The instructions, media for conveying such instructions, computing resources for executing them, and other structures for supporting such computing resources are means for providing the functions described in these disclosures.
Although a variety of examples and other information was used to explain aspects within the scope of the appended claims, no limitation of the claims should be implied based on particular features or arrangements in such examples, as one of ordinary skill would be able to use these examples to derive a wide variety of implementations. Further and although some subject matter may have been described in language specific to examples of structural features and/or method steps, it is to be understood that the subject matter defined in the appended claims is not necessarily limited to these described features or acts. For example, such functionality can be distributed differently or performed in components other than those identified herein. Rather, the described features and steps are disclosed as examples of components of systems and methods within the scope of the appended claims. Moreover, claim language reciting “at least one of” a set indicates that one member of the set or multiple members of the set satisfy the claim.
It should be understood that features or configurations herein with reference to one embodiment or example can be implemented in, or combined with, other embodiments or examples herein. That is, terms such as “embodiment”, “variation”, “aspect”, “example”, “configuration”, “implementation”, “case”, and any other terms which may connote an embodiment, as used herein to describe specific features or configurations, are not intended to limit any of the associated features or configurations to a specific or separate embodiment or embodiments, and should not be interpreted to suggest that such features or configurations cannot be combined with features or configurations described with reference to other embodiments, variations, aspects, examples, configurations, implementations, cases, and so forth. In other words, features described herein with reference to a specific example (e.g., embodiment, variation, aspect, configuration, implementation, case, etc.) can be combined with features described with reference to another example. Precisely, one of ordinary skill in the art will readily recognize that the various embodiments or examples described herein, and their associated features, can be combined with each other.
A phrase such as an “aspect” does not imply that such aspect is essential to the subject technology or that such aspect applies to all configurations of the subject technology. A disclosure relating to an aspect may apply to all configurations, or one or more configurations. A phrase such as an aspect may refer to one or more aspects and vice versa. A phrase such as a “configuration” does not imply that such configuration is essential to the subject technology or that such configuration applies to all configurations of the subject technology. A disclosure relating to a configuration may apply to all configurations, or one or more configurations. A phrase such as a configuration may refer to one or more configurations and vice versa. The word “exemplary” is used herein to mean “serving as an example or illustration.” Any aspect or design described herein as “exemplary” is not necessarily to be construed as preferred or advantageous over other aspects or designs.
Moreover, claim language reciting “at least one of” a set indicates that one member of the set or multiple members of the set satisfy the claim. For example, claim language reciting “at least one of A, B, and C” or “at least one of A, B, or C” means A alone, B alone, C alone, A and B together, A and C together, B and C together, or A, B and C together.
Number | Name | Date | Kind |
---|---|---|---|
4236068 | Walton | Nov 1980 | A |
5642303 | Small et al. | Jun 1997 | A |
5751223 | Turner | May 1998 | A |
6812824 | Goldinger et al. | Nov 2004 | B1 |
D552603 | Tierney | Oct 2007 | S |
7573862 | Chambers et al. | Aug 2009 | B2 |
D637569 | Desai et al. | May 2011 | S |
7975262 | Cozmei | Jul 2011 | B2 |
8010079 | Mia et al. | Aug 2011 | B2 |
8102814 | Rahman et al. | Jan 2012 | B2 |
8260320 | Herz | Sep 2012 | B2 |
8284748 | Borghei | Oct 2012 | B2 |
8300594 | Bernier et al. | Oct 2012 | B1 |
8325626 | Tóth et al. | Dec 2012 | B2 |
8396485 | Grainger et al. | Mar 2013 | B2 |
8446899 | Lei et al. | May 2013 | B2 |
8458184 | Dorogusker et al. | Jun 2013 | B2 |
D691636 | Bunton | Oct 2013 | S |
8549638 | Aziz | Oct 2013 | B2 |
8644301 | Tamhankar et al. | Feb 2014 | B2 |
8650279 | Mehta et al. | Feb 2014 | B2 |
8669902 | Pandey et al. | Mar 2014 | B2 |
8676182 | Bell et al. | Mar 2014 | B2 |
8682279 | Rudolf et al. | Mar 2014 | B2 |
8693367 | Chowdhury et al. | Apr 2014 | B2 |
8718644 | Thomas et al. | May 2014 | B2 |
8768389 | Nenner et al. | Jul 2014 | B2 |
8849283 | Rudolf et al. | Sep 2014 | B2 |
8909698 | Parmar et al. | Dec 2014 | B2 |
8958318 | Hastwell et al. | Feb 2015 | B1 |
9038151 | Chua | May 2015 | B1 |
9060352 | Chan et al. | Jun 2015 | B2 |
9130859 | Knappe | Sep 2015 | B1 |
9173084 | Foskett | Oct 2015 | B1 |
9173158 | Varma | Oct 2015 | B2 |
D744464 | Snyder et al. | Dec 2015 | S |
D757424 | Phillips et al. | May 2016 | S |
D759639 | Moon et al. | Jun 2016 | S |
9389992 | Gataullin et al. | Jul 2016 | B2 |
9426305 | De Foy et al. | Aug 2016 | B2 |
D767548 | Snyder et al. | Sep 2016 | S |
D776634 | Lee et al. | Jan 2017 | S |
9544337 | Eswara et al. | Jan 2017 | B2 |
9609504 | Karlqvist et al. | Mar 2017 | B2 |
9642167 | Snyder et al. | May 2017 | B1 |
9654344 | Chan et al. | May 2017 | B2 |
9713114 | Yu | Jul 2017 | B2 |
9772927 | Gounares et al. | Sep 2017 | B2 |
9820105 | Snyder et al. | Nov 2017 | B2 |
D804450 | Speil et al. | Dec 2017 | S |
9858559 | Raleigh et al. | Jan 2018 | B2 |
9860151 | Ganichev et al. | Jan 2018 | B2 |
9923780 | Rao et al. | Mar 2018 | B2 |
9933224 | Dorne et al. | Apr 2018 | B2 |
9967906 | Verkaik et al. | May 2018 | B2 |
9980220 | Snyder et al. | May 2018 | B2 |
9985837 | Rao et al. | May 2018 | B2 |
10110684 | Haltore | Oct 2018 | B1 |
20030087645 | Kim et al. | May 2003 | A1 |
20030116634 | Tanaka | Jun 2003 | A1 |
20040203572 | Aerrabotu et al. | Oct 2004 | A1 |
20050090225 | Muehleisen et al. | Apr 2005 | A1 |
20050169193 | Black et al. | Aug 2005 | A1 |
20050186904 | Kowalski et al. | Aug 2005 | A1 |
20060022815 | Fischer et al. | Feb 2006 | A1 |
20060030290 | Rudolf et al. | Feb 2006 | A1 |
20060092964 | Park et al. | May 2006 | A1 |
20060126882 | Deng et al. | Jun 2006 | A1 |
20060187866 | Werb et al. | Aug 2006 | A1 |
20070037605 | Logan | Feb 2007 | A1 |
20070206537 | Cam-Winget et al. | Sep 2007 | A1 |
20070239854 | Janakiraman et al. | Oct 2007 | A1 |
20080037715 | Prozeniuk et al. | Feb 2008 | A1 |
20080084888 | Yadav et al. | Apr 2008 | A1 |
20080101381 | Sun et al. | May 2008 | A1 |
20080163207 | Reumann et al. | Jul 2008 | A1 |
20080233969 | Mergen | Sep 2008 | A1 |
20090129389 | Halna DeFretay et al. | May 2009 | A1 |
20090203370 | Giles et al. | Aug 2009 | A1 |
20090282048 | Ransom et al. | Nov 2009 | A1 |
20090298511 | Paulson | Dec 2009 | A1 |
20090307485 | Weniger et al. | Dec 2009 | A1 |
20100039280 | Holm et al. | Feb 2010 | A1 |
20100097969 | De Kimpe et al. | Apr 2010 | A1 |
20110087799 | Padhye et al. | Apr 2011 | A1 |
20110142053 | Van Der Merwe et al. | Jun 2011 | A1 |
20110182295 | Singh et al. | Jul 2011 | A1 |
20110194553 | Sahin et al. | Aug 2011 | A1 |
20110228779 | Goergen | Sep 2011 | A1 |
20110274036 | Calhoun et al. | Nov 2011 | A1 |
20120023552 | Brown et al. | Jan 2012 | A1 |
20120054367 | Ramakrishnan et al. | Mar 2012 | A1 |
20120088476 | Greenfield | Apr 2012 | A1 |
20120115512 | Grainger et al. | May 2012 | A1 |
20120157126 | Rekimoto | Jun 2012 | A1 |
20120167207 | Beckley et al. | Jun 2012 | A1 |
20120182147 | Forster | Jul 2012 | A1 |
20120311127 | Kandula et al. | Dec 2012 | A1 |
20120324035 | Cantu et al. | Dec 2012 | A1 |
20130029685 | Moshfeghi | Jan 2013 | A1 |
20130039391 | Skarp | Feb 2013 | A1 |
20130057435 | Kim | Mar 2013 | A1 |
20130077612 | Khorami | Mar 2013 | A1 |
20130088983 | Pragada et al. | Apr 2013 | A1 |
20130107853 | Pettus et al. | May 2013 | A1 |
20130108263 | Srinivas et al. | May 2013 | A1 |
20130115916 | Herz | May 2013 | A1 |
20130145008 | Kannan et al. | Jun 2013 | A1 |
20130155906 | Nachum et al. | Jun 2013 | A1 |
20130191567 | Rofougaran et al. | Jul 2013 | A1 |
20130203445 | Grainger et al. | Aug 2013 | A1 |
20130217332 | Altman et al. | Aug 2013 | A1 |
20130232433 | Krajec et al. | Sep 2013 | A1 |
20130273938 | Ng et al. | Oct 2013 | A1 |
20130317944 | Huang et al. | Nov 2013 | A1 |
20130322438 | Gospodarek et al. | Dec 2013 | A1 |
20130343198 | Chhabra et al. | Dec 2013 | A1 |
20130347103 | Veteikis et al. | Dec 2013 | A1 |
20140007089 | Bosch et al. | Jan 2014 | A1 |
20140016926 | Soto et al. | Jan 2014 | A1 |
20140025770 | Warfield et al. | Jan 2014 | A1 |
20140052508 | Pandey et al. | Feb 2014 | A1 |
20140059655 | Beckley et al. | Feb 2014 | A1 |
20140087693 | Walby et al. | Mar 2014 | A1 |
20140105213 | Keshava et al. | Apr 2014 | A1 |
20140118113 | Kaushik et al. | May 2014 | A1 |
20140148196 | Bassan-Eskenazi et al. | May 2014 | A1 |
20140179352 | V.M. et al. | Jun 2014 | A1 |
20140191868 | Ortiz et al. | Jul 2014 | A1 |
20140198808 | Zhou | Jul 2014 | A1 |
20140233460 | Pettus et al. | Aug 2014 | A1 |
20140269321 | Kamble et al. | Sep 2014 | A1 |
20140269535 | Pazhyannur et al. | Sep 2014 | A1 |
20140302869 | Rosenbaum et al. | Oct 2014 | A1 |
20140337824 | St. John et al. | Nov 2014 | A1 |
20140341568 | Zhang et al. | Nov 2014 | A1 |
20150016286 | Ganichev et al. | Jan 2015 | A1 |
20150016469 | Ganichev et al. | Jan 2015 | A1 |
20150030024 | Venkataswami et al. | Jan 2015 | A1 |
20150043581 | Devireddy et al. | Feb 2015 | A1 |
20150063166 | Sif et al. | Mar 2015 | A1 |
20150065161 | Ganesh et al. | Mar 2015 | A1 |
20150087330 | Prechner et al. | Mar 2015 | A1 |
20150103818 | Kuhn et al. | Apr 2015 | A1 |
20150163192 | Jain et al. | Jun 2015 | A1 |
20150172391 | Kasslin et al. | Jun 2015 | A1 |
20150223337 | Steinmacher-Burow | Aug 2015 | A1 |
20150256972 | Markhovsky et al. | Sep 2015 | A1 |
20150264519 | Mirzaei et al. | Sep 2015 | A1 |
20150280827 | Adiletta et al. | Oct 2015 | A1 |
20150288410 | Adiletta et al. | Oct 2015 | A1 |
20150312140 | Yang | Oct 2015 | A1 |
20150326704 | Ko et al. | Nov 2015 | A1 |
20150358777 | Gupta | Dec 2015 | A1 |
20150362581 | Friedman et al. | Dec 2015 | A1 |
20160007315 | Lundgreen et al. | Jan 2016 | A1 |
20160044627 | Aggarwal et al. | Feb 2016 | A1 |
20160099847 | Melander et al. | Apr 2016 | A1 |
20160105408 | Cooper et al. | Apr 2016 | A1 |
20160127875 | Zampini, II | May 2016 | A1 |
20160146495 | Malve et al. | May 2016 | A1 |
20160165463 | Zhang | Jun 2016 | A1 |
20160344641 | Javidi et al. | Nov 2016 | A1 |
20170026974 | Dey et al. | Jan 2017 | A1 |
20170214551 | Chan et al. | Jul 2017 | A1 |
20180069311 | Pallas et al. | Mar 2018 | A1 |
20180084389 | Snyder et al. | Mar 2018 | A1 |
Number | Date | Country |
---|---|---|
WO 2013020126 | Feb 2013 | WO |
WO 2014098556 | Jun 2014 | WO |
WO 2018009340 | Jan 2018 | WO |
Entry |
---|
International Search Report and Written Opinion from the International Searching Authority, dated Jan. 29, 2019, 11 pages, for corresponding International Patent Application No. PCT/US2018/055175. |
Afolabi, Ibrahim, et al., “Network Slicing & Softwarization: A Survey on Principles, Enabling Technologies & Solutions,” Mar. 21, 2018, pp. 1-24. |
Antonioli, Roberto, et al., “Dual Connectivity for LTE-NR Cellular Networks,” Research Gate, Sep. 3-6, 2017, pp. 171-175. |
Cisco ASR 5x00 Mobility Management Entity Administration Guide, Version 15.0, Last updated Jun. 13, 2014, Cisco, 1-266. |
Cox, Jacob H. Jr., et al., “Advancing Software-Defined Networks: A Survey,” IEEE, Oct. 12, 2017, pp. 25487-25526. |
Saraiva de Sousa, Nathan F., et al., “Network Service Orchestration: A Survey,” IEEE Communications Surveys & Tutorials, Mar. 23, 2018, pp. 1-30. |
Geller, Michael, et al. , “5G Security Innovation with Cisco,” Whitepaper Cisco Public, Jun. 8, 2018, pp. 1-29. |
Ventre, Pier Luigi, et al., “Performance Evaluation and Tuning of Virtual Infrastructure Managers for (Micro) Virtual Network Functions,” ieee.org, Nov. 7-10, 2016, pp. 1-7. |
“I Love WiFi, The difference between L2 and L3 Roaming Events,” Apr. 1, 2010, 6 pages. |
Carter, Steve Sr., “E911 VoIP Essentials for Enterprise Deployments,” XO Communications, LLC, 2012, 9 pages. |
Chalise, Batu K., et al., “MIMO Relaying for Multiaccess Communication in Cellular Networks,” Sensor Array and MultiChannel Signal Processing Workshop, 2008, SAM 2008, 5th IEEE, Jul. 21, 2008, pp. 146-150. |
Cisco Systems, Inc., “Wi-Fl Location-Based Services 4.1 Design Guide,” May 20, 2008, 206 pages. |
Cui, Wenzhi et al., “DiFS: Distributed Flow Scheduling for Data Center Networks,” Nanjing University, China, Jul. 28, 2013, 10 pages. |
Galvan T., Carlos E., et al., “Wifi bluetooth based combined positioning algorithm,” International Meeting of Electrical Engineering Research ENIINVIE 2012, Procedia Engineering 35 (2012 ), pp. 101-108. |
Gesbert, David, “Advances in Multiuser MIMO Systems (Tutorial Part II) Emerging Topics in Multiuser MIMO Networks,” IEEE PIMRC Conference, Sep. 2007, 107 pages. |
Halperin, Daniel, et al., “Augmenting Data Center Networks with Multi-Gigabit Wireless Links,” Aug. 15-19, 2011, SIGCOMM'11, ACM 978-1-4503-0797-0/11/08, pp. 38-49. |
Ji, Philip N., et al., “Demonstration of High-Speed MIMO OFDM Flexible Bandwidth Data Center Network,” Optical Society of America, 2012, 2 pages. |
Kandula, Srikanth, et al., “Flyways to De-Congest Data Center Networks,” Microsoft Research, Oct. 23, 2009, 6 pages. |
Katayama, Y. et al., “MIMO Link Design Strategy for Wireless Data Center Applications,” IEEE Wireless Communications and Networking Conference: Services, Applications, and Business, 2012, 5 pages. |
Leary, Jonathan, et al., “Wireless LAN Fundamentals: Mobility,” Jan. 9, 2004, Cisco Press, 15 pages. |
Network Heresy, “NVGRE, VXLAN and What Microsoft is Doing Right,” Oct. 3, 2011, 5 pages. |
Savvides, Andreas, et al., “Dynamic Fine-Grained Localization in Ad-Hoc Networks of Sensors”, Proceeding MobiCom '01 Proceedings of the 7th annual international conference on Mobile computing and networking, Jul. 2001, pp. 166-179. |
Number | Date | Country | |
---|---|---|---|
20190110214 A1 | Apr 2019 | US |