Abstract: This disclosure generally discloses an anchor mobility mechanism. The anchor mobility mechanism is configured to support migration of flows between mobility anchors within a wireless communication system. The anchor mobility mechanism may be configured to support migration of flows between mobility anchors within a wireless communication system in a highly seamless manner. The anchor mobility mechanism may be configured to support migration of a flow of a wireless device between mobility anchors within a wireless communication system using functions performed by a control element (CE) and one or more forwarding elements (FEs) within the data plane of the flow of the wireless device. The functions may include identifying a time at which to initiate migration of the flow, initiating migration of the flow based on identification of the time at which to initiate migration of the flow, or the like, as well as various combinations thereof.

Abstract: A plurality of agents is instantiated on a corresponding plurality of servers that are running concurrent instances of a control plane application. A first agent is selected from the plurality of agents to mediate communication between a client and the concurrent instances of the control plane application running on the plurality of servers. The first agent replicates uplink packets received from the client for transmission to the plurality of agents. A first connection is used to convey the uplink packets. The first agent transmits a single copy of redundant downlink packets received from the plurality of agents to the client via the first connection. In some cases, the first connection is a stateful transmission control protocol (TCP) connection and the first agent replicates the uplink packets received in a single TCP stream. The first agent merges the redundant downlink packets into the single TCP stream.

Abstract: A packet splicer receives, from a first server of a plurality of servers, a first request for retransmission of an uplink packet that was received from a client and replicated to the plurality of servers. The plurality of servers is running concurrent instances of a control plane application configured to process information in the uplink packet. The packet splicer transmits the first request for retransmission of the uplink packet to the client. The packet splicer bypasses transmission of a second request for retransmission of the uplink packet received from a second server of the plurality of servers. In some cases, the packet splicer receives, from the client, a request for retransmission of a downlink packet that was redundantly transmitted by the plurality of servers. The packet splicer replicates the request for retransmission of the downlink packet to the plurality of servers.

Abstract: A wearable medical device comprising an annular housing configured to attach to a wrist of a patient. The wearable medical device having a first receptacle attached to the annular housing for receiving a first portion of a tube of an intravenous delivery system. The wearable medical device comprising a flow regulator attached to the annular housing and in contact with the first portion of the tube, where the flow regulator is configured to modify a geometric characteristic of the first portion of the tube. The wearable medical device further comprising a wireless transmitter for communicating with a user console.

Abstract: A method of determining a maximum flow on a network path using segment routing, the method including establishing a segment graph, establishing underlying dual weights on the segment graph, computing the dual weights from the segment graph, finding a minimum dual weight path not having more than a predetermined number of hops, augmenting a flow on the dual weight path, and updating the dual weights on the underlying segment graph.

Abstract: Various embodiments relate to a non-transitory computer readable medium and method thereof for finding a minimum hop path in a segment graph traversing the least number of links in a physical topology, the method including receiving a connection request for a connection between a source node and a destination node, computing the segment graph, the segment graph having a plurality of links, computing a bandwidth for each of the plurality of links in the segment graph, computing the number of links for a shortest path (“N(q)”) for each of the plurality of links, eliminating each of the plurality of link with a bandwidth less than the minimum bandwidth and selecting the shortest path in the physical topology between the plurality of links.

Abstract: Various embodiments relate to a method and apparatus for computing a minimum segment labeling of a given path on a segment cover graph, the method including receiving a connection request for a connection between a source node and a destination node, generating a Shortest Path Directed Acyclic Graph (“SPDAG”) from the source node to the destination node by running a shortest path algorithm from the source node, determining an end node, between the source node and the destination node, at which the SPDAG deviates from the given path, determining whether the end node is the end of an Equal Cost Multipath (“ECMP”) and terminating the shortest path algorithm at a predecessor node to the end node if the end node is the end of an ECMP and making the predecessor node to the end node the source node.

Abstract: A network search method is provided. The network search method includes: keeping a terminal residing in a second network when the terminal is disconnected from a first network or has not registered to the first network; and performing a search operation for the first network by the terminal, when a serving cell and/or an adjacent cell corresponding to the terminal in the second network change. A network search device and a terminal are also provided. By utilizing the network search method, the network search device and the terminal, according to location change of the terminal, not only the network search frequency or search times for the first network can be reduced, to avoid a blind network search which may result in wasting power consumption of the terminal, but also the terminal can be connected to a specific network as soon as possible, and user experience is improved.

Abstract: Various embodiments relate to a method and apparatus for computing a minimum segment labeling of a given path on a segment cover graph, the method including receiving a connection request for a connection between a source node and a destination node, generating a Shortest Path Directed Acyclic Graph (“SPDAG”) from the source node to the destination node by running a shortest path algorithm from the source node, determining an end node, between the source node and the destination node, at which the SPDAG deviates from the given path, determining whether the end node is the end of an Equal Cost Multipath (“ECMP”) and terminating the shortest path algorithm at a predecessor node to the end node if the end node is the end of an ECMP and making the predecessor node to the end node the source node.

Abstract: A method of determining a maximum flow on a network path using segment routing, the method including establishing a segment graph, establishing underlying dual weights on the segment graph, computing the dual weights from the segment graph, finding a minimum dual weight path not having more than a predetermined number of hops, augmenting a flow on the dual weight path, and updating the dual weights on the underlying segment graph.

Abstract: Various embodiments relate to a non-transitory computer readable medium and method thereof for finding a minimum hop path in a segment graph traversing the least number of links in a physical topology, the method including receiving a connection request for a connection between a source node and a destination node, computing the segment graph, the segment graph having a plurality of links, computing a bandwidth for each of the plurality of links in the segment graph, computing the number of links for a shortest path (“N(q)”) for each of the plurality of links, eliminating each of the plurality of link with a bandwidth less than the minimum bandwidth and selecting the shortest path in the physical topology between the plurality of links.

Abstract: A method of determining a maximum flow network path between a source node and a destination node using segment routing when constrained by a maximum number of hops, the method including establishing a segment graph, calculating the bandwidth capacity of each link in the segment graph, calculating the multiplicity for each link in the segment graph, initializing a predecessor array indicating the predecessor node for each node and hop value, for each link in the segment graph and for each hop value up to the maximum number of hops: determining the maximum bandwidth path to the end of each segment and the associated number of hops based upon the bandwidth capacity, and updating a value of the predecessor array when the maximum bandwidth path to the end of segment is determined, and determining the maximum flow network path based upon the predecessor array.

Abstract: The present disclosure generally discloses improvements in computer performance for supporting use of shortest path routing in a communication network. The shortest path routing capability may be configured to support setting of link weights for use in shortest path routing. The shortest path routing capability may be configured to support setting of link weights for use in shortest path routing based on inverse optimization. The shortest path routing capability may be configured to support setting of link weights for use in shortest path routing based on distance between traffic matrices (e.g., distance between a requested traffic matrix and a routed traffic matrix). The shortest path routing capability may be configured to determine, based on the distance between a requested traffic matrix and a routed traffic matrix, whether to accept or reject a set of link weights for a network.

Abstract: Various embodiments provide a method and apparatus for providing adaptive self-tuned routing within a network. In particular, one or more path selection values are adaptable to the changing network utilization and are configured to balance the influence of a first objective and a second objective on the path selection. Advantageously, balancing the influence of the first and second objectives on path selection provides improved efficiency and improved revenue generating capacity when compared to conventional routing methods.

Abstract: The invention is directed to providing cloud-based services using dynamic network virtualization. Embodiments of the invention provide a cloud-based service over a system that has a dynamic network virtualization architecture. The architecture includes a set of distributed forwarding elements with centralized control, and at least one virtual machine that is bound to one of the forwarding elements. These features enable the virtual machine to be migrated across a wide area network while maintaining its original IP address and service continuity.

Abstract: The present disclosure generally discloses a data plane configured for processing function scalability. The processing functions for which scalability is supported may include charging functions, monitoring functions, security functions, or the like.

Abstract: The present disclosure generally discloses a data plane configured for processing function scalability. The processing functions for which scalability is supported may include charging functions, monitoring functions, security functions, or the like.

Abstract: Various exemplary embodiments relate to a method for processing data packets by a first-hop switch in a data network, including: receiving a first data packet associated with a flow; determining whether the flow associated with the first data packet is found in a flow table in the first-hop switch; modifying the first data packet by replacing a packet header field with flow definition information; and transmitting the modified first data packet based upon the flow definition information.

Abstract: Various exemplary embodiments relate to a method of offline traffic matrix aware segment routing. The method may include receiving a traffic matrix based upon all the traffic between nodes i and j that is routed in the network; and determining the amount of traffic between nodes i and j will be routed through node k, based on minimizing a maximum link utilization for the traffic matrix by determining that the total amount of flow on a link e in the network is less than the link's capacity.