The present technology pertains to in-situ collection of operational and telemetry information in a data network. More specifically it is directed to a scalable implementation of in-situ Operation, Administration and Maintenance data probing and collection in a Segment Routing domain.
The ever increasing complexity and diversity of application traffic having a diverse range of performance requirements has meant that Service Level Agreement (SLA) may now require routine verification of services provided, for example, by providing a proof of transit showing that the traffic indeed follows the suggested application-specific path. Operation, Administration, and Maintenance (OAM) operations can be implemented to obtain telemetry for all user traffic. However, this approach does not provide real-time results and significantly increases the number of messages or traffic propagating in a network, which may already be highly loaded or suffering performance issues.
In-situ Operation, Administration, and Maintenance (iOAM) records operational and telemetry information in the packet while the packet traverses a path between two points in the network. One of the challenges associated with the “In-situ OAM” mechanisms is the difficulty to implement it in hardware without performance penalties. Enabling “In-situ OAM” probes on all transit nodes can potentially affect the timing of the very stream targeted for monitoring and troubleshooting. Furthermore, the nodes need to have an indication somewhere in the packet header that hardware needs to check for each packet in the network, regardless of whether “In-situ OAM” operation is enabled or not, thus causing additional hardware performance penalties.
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:
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.
Overview
Systems, methods and computer-readable storage media are disclosed for scalable and targeted collection of in-situ Operation, Administration, and Maintenance (iOAM) data in a programmable way in a Segment Routing context. In some examples, a method can involve encoding an iOAM instruction as a local argument in the function field of one or more Segment Identifiers (SID) selected from a listing of Segment Identifiers (SID list) specified in the segment routing header of a packet. The one or more SIDs in the SID list of the segment routing header, which feature an iOAM argument bit in their respective function fields, can correspond to one or more Segment Routing nodes selected for iOAM data collection. In some examples, this may be achieved by setting an iOAM bit in the function argument field of one or more Segment Identifier in the Segment Identifier list.
The method can further involve sending the packet to the one or more segment routing nodes based on the segment routing header, receiving a packet containing the iOAM data from the one or more Segment Routing nodes selected for iOAM data collection, and processing the iOAM data from the one or more Segment Routing nodes selected for iOAM data collection. According to some examples, the iOAM data from the one or more targeted Segment Routing nodes can be inserted into one or more Type, Length, Value (TLV) fields of the segment routing header of the packet. An egress Segment Routing node can extract the Segment Routing header, which includes the collected iOAM data from the selected Segment Routing nodes, and send the information to a controller entity for further processing, analysis and/or monitoring. The egress segment routing node may forward the user data packet (e.g., a remaining portion of the Segment Routing encapsulated packet) towards its intended destination. Alternatively the one or more Segment Routing nodes selected for iOAM data collection may insert the generated iOAM data into a duplicate copy of the Segment Routing header. The duplicate copy with the iOAM information included therein is sent to a controller entity using a collector mechanism. The targeted/tapped Segment Routing nodes may then forward the Segment Routing packet with the header-embedded iOAM probes onto the next hop along the Segment Routing Path specified in the SID list.
In some examples, a Segment Routing ingress router that encapsulates the incoming packet with the segment routing header may be used to encode iOAM probe(s) in the function field (or the local SID) of one or more Segment Identifiers selected from the entries in the SID list of the segment routing header. In other examples, selecting target segment routing nodes for iOAM data collection may be performed by a Segment Routing Policy Headend router serving as a controller entity for both selective iOAM probing and iOAM data collection from probed Segment Routing nodes. The encapsulating Segment Routing ingress router and/or the controller entity may programmably change, for example in a round robin fashion, the one or more Segment Routing nodes selected from the SID list of the segment routing header for iOAM probing.
Disclosed are systems, methods, and non-transitory computer-readable storage media for scalable programmable in-situ OAM implementation in a Segment Routing context. 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.
Operations, administration and management (OAM) refer to a set of processes, activities, tools and standards involved with operating, administering, managing and maintaining telecommunication systems and computer networks/hardware. It is often involved with fault management and performance monitoring and may include measurements such as frame loss ratio, frame delay, frame delay variation, continuity checks to assist with Service Level Agreement (SLA) and capacity planning.
OAM functionality generally involves a set of network management tools and functions that provide network fault indication, fault localization, performance information, and data and diagnostic functions. These operations may involve automatic monitoring of environment, detecting and determining faults and alerting administrators, collecting performance statistics, accounting data for the purpose of billing, capacity planning based on usage data and maintaining system reliability. As such, OAM functionality enables effective fault detection, verification, isolation and notification in carrier networks.
In-situ OAM (iOAM) can provide real-time telemetry for individual data packets and flows. iOAM can include operational and telemetry data and metadata embedded within live user traffic (packets that originate and terminate at the application layer). In iOAM, operational information may be recorded in the packet as it traverses a path between two points in the network. As described herein, “In-situ OAM” can be implemented in a IPv6 Segment Routed (SRv6) network by carrying appropriate data fields in the Type Length Value (TLV) fields of a segment routing header (SRH). A bit may be defined in the segment routing header that when set enables in-situ OAM data collection.
The present technology describes methods, systems, for selective probing and collection of iOAM data from programmably selected target nodes in a scalable fashion. The present technology obviates the need to monitor a bit in each incoming packet, as the instruction to perform iOAM function is encoded in the argument field of the SRv6 SID function. This way only nodes for which the local SID has the iOAM argument set will insert the iOAM data. A controller entity (SR policy headend) or a SR encapsulating ingress node may programmably change the iOAM target nodes or iOAM tapping points in order to construct the entire picture or model of how data is traveling in the network, thus providing scalable and programmable in-situ OAM data collection.
Segment Routing (SR) allows a node to steer a packet through a controlled set of instructions, called segments, by prepending a segment routing header (SRH) to the packet. A segment can represent any (forwarding) instruction, topological or service-based. Segment Routing allows for steering of a flow through any path (topological or service/application based) while maintaining per-flow state only at the ingress node of the SR domain. Segments can be derived from different components: IGP, BGP, Services, Contexts, Locators, etc. The list of segment defining an end-to-end forwarding path of the flow packets is called the Segment List and is encoded in the SRH of the packet.
In the IPv6 Segment Routing architecture, a Segment Identifier (SID) may be represented as an IPv6 address modeled as a Locator and a Function. The Locator, as represented by the most significant bits of the address, is used to route the packet to the associated segment (i.e., the node corresponding to the segment). The Function, as represented by the least significant bits of the address, may be used to identify the action to be performed by the segment (i.e., the node corresponding to the segment). Optionally, the function bits may include local arguments, which are encoded in the last bits of the address. The specific address format (i.e., number of bits allocated to each field) is entirely flexible as it may be defined locally by the parent node. SID reachability is made possible by advertising the locator prefix within the routing protocol domain.
Treatment of OAM operation as a SID function, as disclosed by some embodiments of the present technology, enables the implementation of a programmable in-situ OAM. Consequently, instead of only providing a global end-to-end behavior, service providers may control OAM features on a node-by-node basis, enabling specific OAM operations to be performed on selected node(s). The iOAM enabled Segment Identifier includes an iOAM argument bit(s) in the Function field of the Segment Identifier. This may include flipping a bit in the appropriate argument portion of the Segment Identifier's Function field.
Segment Routing deployments can be used to deliver customized services with stringent performance requirements, details of which may be explicitly set forth in a service level agreements (SLA). Ensuring that such service-level guarantees are met may require routine monitoring to verify that a forwarding path across the network is in compliance with the implemented Segment Routing policy and the provisions of the associated Service Level Agreement. To address this requirement, iOAM probing may be implemented to verify a particular Segment Routing policy by monitoring the live data as it is steered across the Segment Routing path. However, implementing this in hardware amount to enabling in-situ OAM probe on all transit nodes which may potentially affect the timing of the actual traffic stream being probed. Therefore some performance penalties may result from the performance measurement operation itself. Additionally, the aforementioned Hardware implemented iOAM probing scheme may further incur additional hardware performance penalties as the examination of header information is performed for all incoming packets, regardless of whether the in-situ OAM is enabled or not.
In the context of Segment Routing based IPv6 (SRv6) networks, iOAM data probing and collection may involve provisioning iOAM data-fields in the Type Length Value (TLV) field of the segment routing header. Moreover iOAM probing operation may involve setting a bit (i.e., O-flag) defined in the segment routing header, which when set indicates that iOAM data collection is enabled. This approach, however, is also susceptible to performance constraints discussed above.
Generally, in-situ OAM (iOAM) data collection is expected to be deployed in a specific domain rather than on the overall Internet. The part of the network which employs iOAM is referred to as the iOAM domain. In-situ OAM data is added to a packet upon entering the iOAM-domain and is removed from the packet when exiting the domain. Within the iOAM-domain, the iOAM data may be updated by network nodes that the packet traverses. The device which adds an iOAM data container to the packet to capture iOAM data is called the iOAM encapsulating node whereas the device which removes the iOAM data container is referred to as the iOAM decapsulating node. Nodes within the domain which are aware of iOAM data and read and/or write or process the iOAM data are called iOAM transit nodes. Restricting the proliferation boundary of iOAM in this way serves to contain the iOAM signaling and data transport traffic along with the resulting processing load within the iOAM domain thus keeping it away from the rest of the network.
The present technology enables selective collection of iOAM data from target nodes in a programmable fashion. Embodiments of the present technology obviate the need to monitor “a” bit (iOAM flag) in each incoming packet, as the instruction to perform iOAM function is encoded in the argument field of the SRv6 SID function. This way only nodes for which the local SID has the iOAM argument set will insert iOAM data. According to some embodiments an SRv6 Policy headend/controller entity may programmably change the iOAM tapping points (devices/nodes selected for iOAM collection) to construct a comprehensive picture of how data is traveling in the network.
Some aspects involve a programmable iOAM implementation that enables a user/operator to specifically select the node from which to collect the desired iOAM data. The iOAM data may be injected into the header of the data packet by the specified node as it forwards the packet onto its next hop. Alternatively a duplicate copy of the packet with the iOAM information inserted therein may be sent to a device, such as a controller entity, using appropriate collector mechanism such as Netflow/IPFIX. An example implementation of programmable iOAM is illustrated in
With reference to notations included in the segment routing header in
The segment routing header (SRH) 208 includes a Segment Identifier (SID) list which corresponds to a list of segments that define the steering path of the packets (i.e., Segment Routing Path 202 in
Segments Left (SL) parameter encoded in the segment routing header 208 represents a pointer of the active segment in the Segment List, and is decremented at each segment. Therefore, the encapsulating node (Node 1) sets the numerical value of the SL parameter, in the Segment Routing header 208, to 2. This identifies Node 2 as the next segment along the Segment Routing path. The O-bit in the segment routing header 208 represents an OAM flag which when set indicates that the present packet is an operations and management (OAM) packet.
According to embodiments of the present technology any nodes across the Segment Routing path may be tapped for iOAM data collection. The Segment Routing (SRv6) packet 212 in
An example for enabling iOAM data tapping only at the Traffic Engineering or service Node 3 is illustrated in
According to some embodiment of the present technology, the modified SID with local iOAM probe functionality results from insertion of iOAM probe in the argument field of the locally significant portion (i.e. SID Function field) of a Segment Identifier. In some embodiments, the ingress Segment Routing node may implement iOAM data collection from multiple nodes by performing a round robin targeting of the nodes across the SID list to collect data in a scalable fashion. A controller entity may then run analytics routine and operations on the iOAM partial data to build a holistic view. The procedure is applicable for all underlay and overlay SRv6 SID types.
Due to the programmable nature of iOAM SID, as described by some embodiments, iOAM data collection may also be specified and implemented based on a local decision at a node. Specifically, an iOAM SID may implement iOAM data transport using “forward and punt” technique used by Netflow collector. In this case a copy of the packet is exported from the “tapping” node (iOAM collection node) to a controller entity with the requested iOAM information inserted therein. This case is depicted in
With reference to
As described above, a segment routing header (SRH) can be used to steer packets through paths with given properties (e.g., bandwidth or latency) and through various network functions (e.g., firewalling). The list of segments present in the segment routing header thus specifies the network policy that applies to the packet. Each segment routing header contains at least a list of segments and a Segments Left pointer that references the current active segment (a value of 0 refers to the last segment). In addition, an segment routing header can optionally include extended information encoded as Type-Length-Value (TLV) fields. Another use of TLV is as a global argument field for passing additional information between locally executed SID Functions. An iOAM augmented SID may implement iOAM data transport inside of the data packet by using the TLV fields of the segment routing header. As such iOAM data records may be transported in the respective Type Length Value (TLV) data fields of the segment routing header until the flow is terminated at a Segment Routing egress router. The egress router will decapsulated the user data and send the segment routing header including the iOAM data inserted into TLV fields to a controller entity. This case is illustrated in
For clarity of explanation, in some instances the present technology may be presented as including individual functional blocks including functional blocks comprising devices, device components, steps or routines in a method embodied in software, or combinations of hardware and software.
An example flow chart 100, as presented in
Each SR capable node maintains a “My Local SID Table”. The table contains all the local segments explicitly instantiated at the node. Each entry of the “My Local SID Table” indicates the function associated with the local SID. As the SR packet travels the network, the Locator and Function are copied by each SR node to the destination address field of the SR header. When the SID inside of the SR header matches Local SID table of the SR capable node, the node executes a function encoded in the right part (Function field) of the SID. The next SID is placed into the SR Header destination field and the Segment Left Value is decreased by 1 accordingly.
Referring back to the Flowchart 100 in
At step 610 the operation verifies whether the current SR node is the SR Egress node. If the SR node does not correspond to the SR Egress node, the operation moves back to step 607 and the packet is forwarded to the next hop along the SR path and the process is repeated. However, if the comparison at step 610 reveals that the current SR node is the SR Egress router, the operation moves to 612 whereby the egress router decapsulates the header information and sends the header information along with the iOAM data embedded therein to a controller entity for further analysis and/or monitoring.
According to some embodiments of the present invention, after verifying a match at step 606, a duplicate copy of the packet including the requested iOAM data is generated by the SR node and sent to the controller entity for further analysis and/or monitoring. The operation is then moved to step 607, whereby the original packet is forwarded to the next hop along the SR path.
The disclosure now turns to
To enable user interaction with the computing device 900, an input device 945 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 935 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 900. The communications interface 940 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 930 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) 925, read only memory (ROM) 920, and hybrids thereof.
The storage device 930 can include services 932, 934, 936 for controlling the processor 910. Other hardware or software modules are contemplated. The storage device 930 can be connected to the system connection 905. 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 910, connection 905, output device 935, and so forth, to carry out the function.
The interfaces 1002 are typically provided as modular interface cards (sometimes referred to as “line cards”). Generally, they control the sending and receiving of data packets over the network and sometimes support other peripherals used with the network device 1000. Among the interfaces that may be provided are Ethernet interfaces, frame relay interfaces, cable interfaces, DSL interfaces, token ring interfaces, and the like. In addition, various very high-speed interfaces may be provided such as fast token ring interfaces, wireless interfaces, Ethernet interfaces, Gigabit Ethernet interfaces, ATM interfaces, HSSI interfaces, POS interfaces, FDDI interfaces, WIFI interfaces, 3G/4G/5G cellular interfaces, CAN BUS, LoRA, and the like. Generally, these interfaces may include ports appropriate for communication with the appropriate media. In some cases, they may also include an independent processor and, in some instances, volatile RAM. The independent processors may control such communications intensive tasks as packet switching, media control, signal processing, crypto processing, and management. By providing separate processors for the communications intensive tasks, these interfaces allow the master microprocessor 1004 to efficiently perform routing computations, network diagnostics, security functions, etc.
Although the system shown in
Regardless of the network device's configuration, it may employ one or more memories or memory modules (including memory 1006) configured to store program instructions for the general-purpose network operations and mechanisms for roaming, route optimization and routing functions described herein. The program instructions may control the operation of an operating system and/or one or more applications, for example. The memory or memories may also be configured to store tables such as mobility binding, registration, and association tables, etc. Memory 1006 could also hold various software containers and virtualized execution environments and data.
The network device 1000 can also include an application-specific integrated circuit (ASIC), which can be configured to perform routing, switching, and/or other operations. The ASIC can communicate with other components in the network device 1000 via the connection 1010, to exchange data and signals and coordinate various types of operations by the network device 1000, such as routing, switching, and/or data storage operations, for example.
In some embodiments the computer-readable storage devices, mediums, and 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 comprise, 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 comprise 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, 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.
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 |
8457145 | Zimmerman et al. | Jun 2013 | B2 |
8458184 | Dorogusker et al. | Jun 2013 | B2 |
D691636 | Bunton | Oct 2013 | S |
8549638 | Aziz | Oct 2013 | B2 |
8553634 | Chun et al. | 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 |
8761174 | Jing et al. | Jun 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 |
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 |
9270709 | Shatzkamer et al. | Feb 2016 | B2 |
9271216 | Friman et al. | Feb 2016 | B2 |
9281955 | Moreno et al. | Mar 2016 | B2 |
D757424 | Phillips et al. | May 2016 | S |
D759639 | Moon et al. | Jun 2016 | S |
9369387 | Filsfils et al. | Jun 2016 | B2 |
9389992 | Gataullin et al. | Jul 2016 | B2 |
9426305 | De Foy et al. | Aug 2016 | B2 |
D767548 | Snyder et al. | Sep 2016 | S |
9467918 | Kwan | Oct 2016 | B1 |
D776634 | Lee et al. | Jan 2017 | S |
9544337 | Eswara et al. | Jan 2017 | B2 |
9569771 | Lesavich et al. | Feb 2017 | B2 |
9609504 | Karlqvist et al. | Mar 2017 | B2 |
9615268 | Navarro et al. | Apr 2017 | B2 |
9634952 | Gopinathan et al. | Apr 2017 | B2 |
9642167 | Snyder et al. | May 2017 | B1 |
9654344 | Chan et al. | May 2017 | B2 |
9712444 | Bolshinsky et al. | Jul 2017 | B1 |
9713114 | Yu | Jul 2017 | B2 |
9736056 | Vasseur et al. | Aug 2017 | B2 |
9762683 | Karampurwala et al. | Sep 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 |
9933224 | Dumitriu et al. | Feb 2018 | B2 |
9923780 | Rao et al. | Mar 2018 | B2 |
9961560 | Farkas et al. | May 2018 | B2 |
9967191 | Frost | May 2018 | B2 |
9967906 | Verkaik et al. | May 2018 | B2 |
9980220 | Snyder et al. | May 2018 | B2 |
9985837 | Rao et al. | May 2018 | B2 |
9998368 | Chen et al. | Jun 2018 | B2 |
20020026525 | Armitage | Feb 2002 | A1 |
20030037159 | Zhao | Feb 2003 | A1 |
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 |
20050147050 | Klink | Jul 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 |
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 |
20080138084 | Youn | Jun 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 |
20110222412 | Kompella | Sep 2011 | A1 |
20110228779 | Goergen | Sep 2011 | A1 |
20120023552 | Brown et al. | Jan 2012 | A1 |
20120051229 | Feldmann | Mar 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 |
20130010600 | Jocha | Jan 2013 | 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 |
20130128749 | Krzanowski | 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 |
20140031031 | Gauvreau et al. | Jan 2014 | A1 |
20140052508 | Pandey et al. | Feb 2014 | A1 |
20140059655 | Beckley et al. | Feb 2014 | A1 |
20140086253 | Yong | Mar 2014 | A1 |
20140087693 | Walby et al. | Mar 2014 | A1 |
20140101445 | Giladi | Apr 2014 | A1 |
20140105213 | A K et al. | Apr 2014 | A1 |
20140118113 | Kaushik et al. | May 2014 | A1 |
20140148196 | Bassan-Eskenazi et al. | May 2014 | A1 |
20140177638 | Bragg | Jun 2014 | A1 |
20140179352 | V.M. et al. | Jun 2014 | A1 |
20140191868 | Ortiz et al. | Jul 2014 | A1 |
20140198808 | Zhou | Jul 2014 | A1 |
20140222997 | Mermoud et al. | Aug 2014 | A1 |
20140233460 | Pettus et al. | Aug 2014 | A1 |
20140269321 | Kamble et al. | Sep 2014 | A1 |
20140280834 | Medved | 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 |
20150016245 | Ra | Jan 2015 | A1 |
20150016286 | Ganichev et al. | Jan 2015 | A1 |
20150016469 | Ganichev et al. | Jan 2015 | A1 |
20150023176 | Korja 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 |
20150326469 | Kern | Nov 2015 | A1 |
20150326704 | Ko et al. | Nov 2015 | A1 |
20150358777 | Gupta | Dec 2015 | A1 |
20150362581 | Friedman et al. | Dec 2015 | A1 |
20150365288 | Van Der Merwe | Dec 2015 | A1 |
20160007315 | Lundgreen et al. | Jan 2016 | A1 |
20160021597 | Hart | Jan 2016 | A1 |
20160044627 | Aggarwal et al. | Feb 2016 | A1 |
20160099847 | Melander et al. | Apr 2016 | A1 |
20160100395 | Xu 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 |
20160254991 | Eckert | Sep 2016 | A1 |
20160330045 | Tang et al. | Nov 2016 | A1 |
20160344641 | Javidi et al. | Nov 2016 | A1 |
20170026974 | Dey et al. | Jan 2017 | A1 |
20170078896 | Kephart, Jr | Mar 2017 | A1 |
20170104660 | Wexler | Apr 2017 | A1 |
20170111209 | Ward | Apr 2017 | A1 |
20170180999 | Alderfer et al. | Jun 2017 | A1 |
20170181136 | Bharadwaj et al. | Jun 2017 | A1 |
20170195205 | Li et al. | Jul 2017 | A1 |
20170202000 | Fu et al. | Jul 2017 | A1 |
20170214551 | Chan et al. | Jul 2017 | A1 |
20170250907 | Pignataro | Aug 2017 | A1 |
20170273083 | Chen et al. | Sep 2017 | A1 |
20170317997 | Smith et al. | Nov 2017 | A1 |
20170324622 | Ubaldi | Nov 2017 | A1 |
20170324651 | Penno | Nov 2017 | A1 |
20170332421 | Sternberg et al. | Nov 2017 | A1 |
20170339706 | Andreoli-Fang et al. | Nov 2017 | A1 |
20170366456 | Dara | Dec 2017 | A1 |
20180013669 | Bardhan | Jan 2018 | A1 |
20180062991 | Nainar | Mar 2018 | A1 |
20180063018 | Bosch et al. | Mar 2018 | A1 |
20180069311 | Pallas et al. | Mar 2018 | A1 |
20180084389 | Snyder et al. | Mar 2018 | A1 |
20180176134 | Pignataro | Jun 2018 | A1 |
20180278510 | Iqbal | Sep 2018 | A1 |
20180278548 | Pignataro | Sep 2018 | A1 |
Number | Date | Country |
---|---|---|
WO 2013020126 | Feb 2013 | WO |
WO 2014098556 | Jun 2014 | WO |
WO 2015131920 | Sep 2015 | WO |
WO 2017078657 | May 2017 | WO |
WO 2017187011 | Nov 2017 | WO |
WO 2018009340 | Jan 2018 | WO |
WO 2018028777 | Feb 2018 | WO |
WO 2018053271 | Mar 2018 | WO |
WO 2018066362 | Apr 2018 | WO |
Entry |
---|
“Cisco ASR 5x00 Mobility Management Entity Administration Guide,” Version 15.0, Cisco Systems, Inc., Last updated Jun. 13, 2014, pp. 1-266. |
“Cisco 10000 Series Router Quality of Service Configuration Guide, Chapter 20: Configuring Quality of Service for MPLS Traffic,” Cisco Systems, Inc., Updated Nov. 17, 2013, pp. 1-34. |
“Enterprise Mobility 7.3 Design Guide, Chapter 11: CISCO Mobility Services Engine,” Cisco Systems, Inc., Updated Apr. 20, 2015, 8 pages. |
“I Love WiFi, The difference between L2 and L3 Roaming Events,” Apr. 1, 2010, 6 pages. |
“Quality of Service Regulation Manual,” ITU 2017, pp. 1-174. |
“Wi-FI Location-Based Services 4.1 Design Guide,” May 20, 2008, 206 pages. |
Afolabi, Ibrahim, et al., “Network Slicing & Softwarization: A Survey on Principles, Enabling Technologies & Solutions,” Mar. 21, 2018, pp. 1-24. |
Ali, Z., et al., “Performance Measurement in Segment Routing Networks with IPv6 Data Plane (SRv6),” Spring Working Group, Feb. 26, 2018, pp. 1-17. |
An, Xueli, et al., “Virtualization of Cellular Network EPC Gateways based on a Scalable SDN Architecture,” IEEE, Feb. 12, 2015, pp. 1-7. |
Antonioli, Roberto, et al., “Dual Connectivity for LTE-NR Cellular Networks,” Research Gate, Sep. 3-6, 2017, pp. 171-175. |
Bekan, Adnan, et al., “D5.1: Machine Learning Algorithms Development and Implementation,” 2016-2018 eWINE Consortium, 23, 2016, pp. 1-72. |
Bogale, Tadilo Endeshaw, et al., “Machine Intelligence Techniques for Next-Generation Context-Aware Wireless Networks,” arxiv.org, Jan. 12, 2018, pp. 1-10. |
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. |
Cheng, W., et al., “Path Segment in MPLS Based Sement Routing Network,” Network Working Group, Oct. 2017, pp. 1-10. |
Christidis, Konstantinos, et al., “Blockchains and Smart Contracts forthe Internet of Things,” IEEE Access, Special Section on the of Research in Internet of Things (IoT), vol. 4, May 10, 2016, pp. 1-12. |
Cox, Jacob H. Jr., et al., “Advancing Software-Defined Networks: A Survey,” IEEE, Oct. 12, 2017, pp. 25487-25526. |
Cui, Wenzhi et al., “DiFS: Distributed Flow Scheduling for Data Center Networks,” Nanjing University, China, Jul. 28, 2013, 10 pages. |
Doyle, Matthew G., “An IP Address Management Solution for a Server Solution Provider,” A Dissertation Submitted to The University of Liverpool, Sep. 28, 2005, 116 pages. |
Galvan T., Carlos E., et al., “Wifi bluetooth based combined positioning algorithm,” International Meeting of Electrical Engineering Research ENIINVIE2012, Procedia Engineering 35 (2012), pp. 101-108. |
Geller, Michael, et al. , “5G Security Innovation with Cisco,” Whitepaper Cisco Public, Jun. 8, 2018, pp. 1-29. |
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. |
Herb, Daniel, et al., “ROAUM: How to Unblock ROAMING IoT Using BLockchain,” available at https://uploads-ssl.webflow.com/5987a08baeea4300016b7bd9/5a7a6d6cee5bc400010a08f2_Roaum_Roaming_IoT_Whitepaper.pdf, pp. 1-14. |
Hsieh, Cynthia, “Location Awareness in VMware View 4.5 and Above,” VMware, 2011, 8 pages. |
Husain, Syed, et al., “Mobile Edge Computing with Network Resource Slicing for Internet-of-Things,” IEEE 2017, pp. 1-7. |
Jero, Samuel, et al., “Identifier Binding Attacks and Defenses in Software-Defined Networks,” USENIX, The Advanced Computing Systems Association, Aug. 16-18-2017, 19 pages. |
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. |
Leonhardt, Ulf, “Supporting Location-Awareness in Open Distributed Systems,” May 1998, 186 pages. |
Morozov, Yury, “Blockchain Telecom: Bubbletone Blockchain,” Dec. 29, 2017, pp. 1-33. |
Network Heresy, “NVGRE, VXLAN and What Microsoft is Doing Right,” Oct. 3, 2011, 5 pages. |
Norwegian National Security Authority, “N-03 Security guidance for switches and routers,” Sep. 26, 2012, pp. 1-24. |
Saraiva de Sousa, Nathan F., et al., “Network Service Orchestration: A Survey,” IEEE Communications Surveys & Tutorials, Mar. 23, 2018, pp. 1-30. |
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. |
Shwetha, D., et al., “A Bandwidth Request Mechanism for QoS Enhancement in Mobile WiMAX Networks,” International Journal of Advanced Research in Electrical Electronics and Instrumentation Engineering, vol. 3, Issue 1, Jan. 2014, pp. 1-8. |
Sun, et al., “The future of Wi-Fi,” IEEE Communications Magazine, vol. 52, No. 11, Nov. 21, 2014, 166 pages. |
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. |
Wright, Joshua, “Detecting Wireless LAN MAC Address Spoofing,” Jan. 21, 2003, pp. 1-20. |
Zickau, Sebastian, et al., “Enabling Location-based Policies in a Healthcare Cloud Computing Environment,” 2014 IEEE 3rd International Conference on Cloud Networking (Cloudnet), Oct. 2014, pp. 353-358. |
International Search Report and Written Opinion for PCT application No. PCT/US2019/052168 dated Dec. 4, 2019, 12 pages. |
S. Bhandari, et al.; “Encapsulations for In-situ OAM Data; draft-brockners-inband-oam-transport-05.txt”; Internet-Drafts, IPPM, Internet Engineering Task Force (IETF); Standard Working Draft, Internet Society (ISOC) 4, Geneva, Switzerland; No. 5, Jul. 3, 2017; 30 pages; XP015120710. [retrieved on Jul. 3, 2017]. |
S. Bhandari, et al.; “Data Fields for In-situ OAM; draft-ietf-ippm-ioam-data-03.txt”; Internet-Drafts, IPPM, Internet Engineering Task Force (IETF); Standard Working Draft, Internet Society (ISOC) 4, Geneva, Switzerland; No. 3, Jun. 2018; 36 pages; XP01512115. [retrieved on Jun. 27, 2018]. |
Number | Date | Country | |
---|---|---|---|
20200099611 A1 | Mar 2020 | US |