Abstract: A system and method for treating migraine and headache through a digital therapeutic. The systems and methods described herein allow a migraine patient to manage symptoms, triggers, and therapeutic lifestyle interventions through an interconnected system, facilitated by a care team, to treat the root causes of migraine, and improve patient quality of life. The method includes collecting datasets associated with migraine, headache, migraine-related comorbidities, and lifestyle behavior at the mobile device to analyze neurological trigger patterns. Using the digital therapeutic application allows a patient to monitor and track lifestyle habits, to receive real time interventions, otherwise missed in traditional care settings, helping the patient learn lifestyle interventions that may mitigate future attacks. Given the complex nature of treating migraine, therapeutic lifestyle interventions are tailored to a patient's Neuroindividuality and facilitated by a care team.

Abstract: Various techniques for partitioning a computer network is disclosed herein. In certain embodiments, control plane functions (e.g., computation of network routes) and/or forwarding plane functions (e.g., routing, forwarding, switching) may be partitioned and performed individually on per domain basis based on (1) a network configuration of a particular domain (e.g., end points and/or lower-level domains in the particular domain); and (2) one or more higher-level domains connected to the particular domain in the hierarchy. Thus, a particular domain can manage various network operations of the domain without concerns regarding end points or network nodes in other domains of the hierarchy. Thus, network configuration and operation may be partitioned to reduce hardware costs and operational complexity even as the size of the overall computer networks increases.

Abstract: Various techniques for partitioning a computer network is disclosed herein. In certain embodiments, control plane functions (e.g., computation of network routes) and/or forwarding plane functions (e.g., routing, forwarding, switching) may be partitioned and performed individually on per domain basis based on (1) a network configuration of a particular domain (e.g., end points and/or lower-level domains in the particular domain); and (2) one or more higher-level domains connected to the particular domain in the hierarchy. Thus, a particular domain can manage various network operations of the domain without concerns regarding end points or network nodes in other domains of the hierarchy. Thus, network configuration and operation may be partitioned to reduce hardware costs and operational complexity even as the size of the overall computer networks increases.

Abstract: Various techniques for partitioning a computer network is disclosed herein. In certain embodiments, control plane functions (e.g., computation of network routes) and/or forwarding plane functions (e.g., routing, forwarding, switching) may be partitioned and performed individually on per domain basis based on (1) a network configuration of a particular domain (e.g., end points and/or lower-level domains in the particular domain); and (2) one or more higher-level domains connected to the particular domain in the hierarchy. Thus, a particular domain can manage various network operations of the domain without concerns regarding end points or network nodes in other domains of the hierarchy. Thus, network configuration and operation may be partitioned to reduce hardware costs and operational complexity even as the size of the overall computer networks increases.

Abstract: Various techniques for migrating virtual entities via a label based underlay network is disclosed herein. In one embodiment, a method includes receiving packets associated with migrating a virtual machine from an originating network node of the underlay network to a target network node of the underlay network. The received packets individually include a label associated with a network path from the originating network node to the target network node in the underlay network. In response to receiving the packets, the method includes examining the labels of the packets to determine the network paths associated the labels and forwarding the packets following the determined network paths in the underlay network.

Abstract: Various techniques for partitioning a computer network is disclosed herein. In certain embodiments, control plane functions (e.g., computation of network routes) and/or forwarding plane functions (e.g., routing, forwarding, switching) may be partitioned and performed individually on per domain basis based on (1) a network configuration of a particular domain (e.g., end points and/or lower-level domains in the particular domain); and (2) one or more higher-level domains connected to the particular domain in the hierarchy. Thus, a particular domain can manage various network operations of the domain without concerns regarding end points or network nodes in other domains of the hierarchy. Thus, network configuration and operation may be partitioned to reduce hardware costs and operational complexity even as the size of the overall computer networks increases.

Abstract: Various techniques for virtual entity migration in a computer network is disclosed herein. In one embodiment, a method includes receiving an indication to migrate a virtual machine in a virtual network from an originating network node of the underlay network to a target network node of the underlay network. The method also includes establishing a network tunnel in the underlay network from the originating network node to the target network node in response to receiving the indication to migrate the virtual machine. The method further includes migrating the virtual machine from the originating network node to the target network node following the established network tunnel in the underlay network while maintaining an address of the migrated virtual machine in the virtual network.

Abstract: Various techniques for partitioning an overlay network is disclosed herein. In certain embodiments, an overlay network can be partitioned into overlay partitions with manageable sizes. Each overlay partition can independently manage and update reachability information only for end points that belong to a virtual network with at least one end point in the overlay partition. Thus, each overlay partition can operate independently from others to achieve fast reachability updating for relocated virtual machines or other end points.

Abstract: Various techniques for partitioning a computer network is disclosed herein. In certain embodiments, control plane functions (e.g., computation of network routes) and/or forwarding plane functions (e.g., routing, forwarding, switching) may be partitioned and performed individually on per domain basis based on (1) a network configuration of a particular domain (e.g., end points and/or lower-level domains in the particular domain); and (2) one or more higher-level domains connected to the particular domain in the hierarchy. Thus, a particular domain can manage various network operations of the domain without concerns regarding end points or network nodes in other domains of the hierarchy. Thus, network configuration and operation may be partitioned to reduce hardware costs and operational complexity even as the size of the overall computer networks increases.

Abstract: Various techniques for partitioning a computer network is disclosed herein. In certain embodiments, control plane functions (e.g., computation of network routes) and/or forwarding plane functions (e.g., routing, forwarding, switching) may be partitioned and performed individually on per domain basis based on (1) a network configuration of a particular domain (e.g., end points and/or lower-level domains in the particular domain); and (2) one or more higher-level domains connected to the particular domain in the hierarchy. Thus, a particular domain can manage various network operations of the domain without concerns regarding end points or network nodes in other domains of the hierarchy. Thus, network configuration and operation may be partitioned to reduce hardware costs and operational complexity even as the size of the overall computer networks increases.

Abstract: Various techniques for partitioning an overlay network is disclosed herein. In certain embodiments, an overlay network can be partitioned into overlay partitions with manageable sizes. Each overlay partition can independently manage and update reachability information only for end points that belong to a virtual network with at least one end point in the overlay partition. Thus, each overlay partition can operate independently from others to achieve fast reachability updating for relocated virtual machines or other end points.

Abstract: Various techniques for virtual entity migration in a computer network is disclosed herein. In one embodiment, a method includes receiving an indication to migrate a virtual machine in a virtual network from an originating network node of the underlay network to a target network node of the underlay network. The method also includes establishing a network tunnel in the underlay network from the originating network node to the target network node in response to receiving the indication to migrate the virtual machine. The method further includes migrating the virtual machine from the originating network node to the target network node following the established network tunnel in the underlay network while maintaining an address of the migrated virtual machine in the virtual network.

Abstract: Various techniques for migrating virtual entities via a label based underlay network is disclosed herein. In one embodiment, a method includes receiving packets associated with migrating a virtual machine from an originating network node of the underlay network to a target network node of the underlay network. The received packets individually include a label associated with a network path from the originating network node to the target network node in the underlay network. In response to receiving the packets, the method includes examining the labels of the packets to determine the network paths associated the labels and forwarding the packets following the determined network paths in the underlay network.

Abstract: Various techniques for partitioning a computer network is disclosed herein. In certain embodiments, control plane functions (e.g., computation of network routes) and/or forwarding plane functions (e.g., routing, forwarding, switching) may be partitioned and performed individually on per domain basis based on (1) a network configuration of a particular domain (e.g., end points and/or lower-level domains in the particular domain); and (2) one or more higher-level domains connected to the particular domain in the hierarchy. Thus, a particular domain can manage various network operations of the domain without concerns regarding end points or network nodes in other domains of the hierarchy. Thus, network configuration and operation may be partitioned to reduce hardware costs and operational complexity even as the size of the overall computer networks increases.

Abstract: Various techniques for partitioning a computer network is disclosed herein. In certain embodiments, control plane functions (e.g., computation of network routes) and/or forwarding plane functions (e.g., routing, forwarding, switching) may be partitioned and performed individually on per domain basis based on (1) a network configuration of a particular domain (e.g., end points and/or lower-level domains in the particular domain); and (2) one or more higher-level domains connected to the particular domain in the hierarchy. Thus, a particular domain can manage various network operations of the domain without concerns regarding end points or network nodes in other domains of the hierarchy. Thus, network configuration and operation may be partitioned to reduce hardware costs and operational complexity even as the size of the overall computer networks increases.

Abstract: A System Solution offers a Business Entity a way to update a Native Application Client by directly downloading a new version of the Application Client from an Application Server bypassing the Application Store. A Native Application Client is updated while the current Native Application Client is running on the Client Device. A Native Application Client is divided into a Native Layer which runs directly on the Operating System of the Client Device and a Dynamic Layer that runs on the Native Layer. The System Solution automatically generates Application Clients, Application Servers, and Dashboards. The Business Entity uses the generated Dashboards to modify the Dynamic Layer by generating a new Dynamic Layer and making it available for download to the Client Device. The Navigation Parameters can be set in the Dynamic Layer allowing the Business Entity to change the application flow of the Native Application Client.

Abstract: A network entity controls delivery of information to user devices over bearer paths including unicast channels and multicast channels. The network entity may interoperate in any of a number of network architectures, including 3GPP Internet Protocol Multimedia Subsystem (IMS) and 3GPP2 Multimedia Domain (MMD). The network entity may provide functionality of a modified 3GPP2 Broadcast and Multicast Service (BCMCS) controller component configured to enable BCMCS signaling protocol transactions to occur over 3GPP IMS interfaces and/or 3GPP2 MMD interfaces. A network entity configured to interoperate in a 3GPP IMS and/or 3GPP2 MMD network architecture may provide network-mobile multimedia services to user devices. Content associated with the multimedia services may be stored in storage devices in the network. A common interface through which a network operator defines service-specific parameters of a number of unicast and multicast multimedia services deployed in a distribution network may be provided.

Abstract: A monolithic shaper-scheduler is used for the efficient integration of scheduling and dual-leaky-bucket shaping in a single structure. By making the evolution of the timestamps of the backlogged flows independent of their shaping parameters, the performance drawbacks of prior-art shaping architectures are overcome. The monolithic shaper-scheduler tests each packet flow as being either “virtually compliant” or “virtually incompliant” when a new packet arrives to the head of its queue. The test for “virtual compliance” is based on traffic profiles associated with the flows. The result of the test is used in conjunction with the timestamp and eligibility flag of each packet flow to efficiently schedule the transmission of packets.