H04L12/725

RESILIENT PEER-TO-PEER APPLICATION MESSAGE ROUTING
20180006941 · 2018-01-04 ·

A network routing table includes destination addresses of destination applications hosted on peer nodes of a network. A primary processor registers a first destination application and a second destination application, where the first destination application is the same as the second destination application and both the first destination application and the second destination application have the same destination address. That processor also provides the peer nodes and a secondary processor with a copy of the table. When the first destination application is inactivated, all peer nodes and the secondary processor are provided with a copy of an updated routing table indicating inactivation of the first destination application and routing of the application message to the second destination application. A further application message addressed from any of the peer nodes to the destination address associated with the inactivated first destination application will be routed, via the updated routing table, to the second destination application having the same destination address as the inactivated first destination application. The secondary processor provides the copy of the routing table and the copy of the updated routing table in case of failure of the primary processor in response to a request from the querying peer node.

METHODS AND APPARATUS TO PROVIDE A CONSUMER SERVICES CLOUD IN A COMMUNICATIONS NETWORK

Methods and apparatus to provide a consumer services cloud in a communications network are disclosed. An example apparatus includes a processor; and a computer readable storage medium including computer readable instructions which, when executed, cause the processor to perform operations. The operations include identifying which of multiple possible users associated with a communications network customer is a current user of a client device based on authentication information included in a request for access from the client device to a communication network. The network communication containing the request is diverted to the apparatus by a software-defined networking switch. The operations also include, in response to identifying the current user, accessing a first profile corresponding to the identified current user to determine a rule to be used to handle network communications within the communications network. Further operations include configuring the software-defined networking switch.

NETWORK TRAFFIC CLASSIFICATION
20180013664 · 2018-01-11 ·

A computer implemented method and system comprising receiving a data packet from a network source, extracting source and destination data from the received data packet, determining a user from the extracted source and destination data from the received data packet. If a label does not exist for the extracted source and destination data from the received data packet, creating a label for the data packet, the label comprising the extracted source data and historic source data for the determined user, calling a chaotic function with the label for the received data packet. If the chaotic function returns false, calling an alternative function for an output with the label for the received data packet. If the chaotic function returns true, capturing the output of the chaotic function, and updating the label with the output of the chaotic function or with the output of the alternative function.

METHOD AND SYSTEM FOR REFERENCE COUNTED PENDING INTEREST TABLES IN A CONTENT CENTRIC NETWORK
20180013666 · 2018-01-11 · ·

One embodiment provides a system for facilitating efficient communication of a collection of interests. During operation, the system receives, by an intermediate node, a first packet which has a name and a first nonce, wherein the first packet indicates a set of member interests, wherein a member interest has a name. In response to not obtaining a matching entry in a pending interest table based on the name for the first packet, the system creates a new entry in the pending interest table, wherein an entry includes a second nonce, a reference count, and a set of arrival nonces and corresponding arrival interfaces. The system sets the new entry's second nonce to a new nonce, and sets the new entry's reference count to a number of member interests indicated in the first packet. The system forwards the first packet, wherein the first nonce is replaced with the new nonce.

COMMUNICATION METHOD, COMMUNICATION SYSTEM, AND COMMUNICATION APPARATUS
20180013663 · 2018-01-11 · ·

A communication method executed by a communication system, the communication method includes determining, by a first node that requests to execute an application, a policy for selecting a node to execute the application from the plurality of relay nodes based on an amount of an output data which is an execution result of the application and an amount of an input data for executing the application; transmitting a request message including identification information indicating the policy and requesting to execute the application via the path; receiving, by a third node, the request message; acquiring data for executing the application from a second node, when it is determined that the third node is able to execute the application based on the identification information; executing the application using at least the acquired data; and transmitting a response message including the execution result of the application to the first node.

APPLICATION-AWARE BGP PATH SELECTION AND FORWARDING
20230144568 · 2023-05-11 ·

A routing structure is defined for provider edge (PE) routers that will create the ability to recompute best paths based on application criteria. The routing structure may include the use of a network controller which is connected with the internet to receive requests from applications to trigger path re-computation. The controller will peer with PEs to send re-computation information used by the PE to construct an application-aware BGP table and forwarding instance. The PE also defines a new BGP and packet filter to replicate specific BGP paths into the application-aware table. The application-aware BGP and forwarding instance is unique to the requesting application. Thus, each request with a different source/destination combination obtains a discrete table providing separation. When a packet enters the PE from customer edge (CE) or core interface the packet traverses a packet filter that when matched against source/destination is redirected to the appropriate application-aware forwarding table. Once in the application-aware table the packet is then forwarded along the application-aware path achieving the objective. The instantiation of the application-aware BGP and forwarding table is be done based on BGP updates learned from the controller.

INITIATING AN ACTION BASED ON A DETERMINED NAVIGATION PATH DATA STRUCTURE
20170373967 · 2017-12-28 ·

A current sharing, in a system by a first user, of first content with at least one other user can be detected. A navigation path data structure indicating at least one navigation path from a second content to the first content within a network environment can be automatically determined. Responsive to determining the navigation path data structure indicating the at least one navigation path from the second content to the first content within the network environment, performance of at least one action can be automatically initiated based on the determined navigation path data structure.

Packet format of network abstraction layer unit, and algorithm and apparatus for video encoding and decoding using the format, QoS control algorithm and apparatus for IPv6 label switching using the format

The construction method of NALU (Network Abstraction Layer Unit) for IPv6 label switching and its using algorithms of video encoding, QoS control, and decoding are provided. According to an embodiment of the present invention, the NALU format is composed of the NALH (Network Abstraction Layer Header) including the label and the NAL (Network Abstraction Layer) payload. Here, the label is determined based on layer information which is combination of a spatial scalable level, a temporal scalable level, and a quality scalable level of the encoded data. The decoder uses the label to decide which one of multiple decoding modules is used to decode the current NAL payload. Moreover, the label can be included in the packet header so that the MANE (Media Aware Network Element) can use the label to decide whether to forward the packet or drop it. For example, the label in the packet header can be used for QoS control of video service by using the flow label field in IPv6 packet header. The IPv6 router can identify priority of the video packet by using the 20 bit long flow label, into which the label in NALH can be inserted. According to the embodiment, the MANE assumed in the MPEG and JVT (Joint Video Team) can be implemented effectively.

Method and arrangements for QoS-aware routing in a LI system

A method and arrangements providing QoS-aware routing of received session flows of separate communication sessions comprising Communication Content achieved and received from Lawful Interception of target sessions. The method comprises sorting each separate communication session into one of two groups, a first routing group and a second routing group, according to certain criteria wherein QoS is at least one of the criteria. Further, the method comprises routing communication sessions sorted into the first routing group via a regular handover interface and routing communication sessions sorted into the second routing group via an additional handover interface to a Law Enforcement Agency.

Efficient steering for user equipments in either an idle state or a connected state

For use in offloading traffic to a wireless local area network (WLAN) a user equipment (UE) receives from a wireless wide area network at least a first set of thresholds having different thresholds corresponding to different types of data to be offloaded. The UE utilizes the threshold corresponding to a given type of data to evaluate whether an access node operating in the WLAN is suitable for offloading data of the given type. Only if the evaluated access node is determined to be suitable will the UE use it for offloading, and only for data of the given type. In other non-limiting embodiments the first set of thresholds has different thresholds corresponding to different data-types for different categories (e.g., subscription levels) of the UE; and there may be a second set of thresholds with different thresholds corresponding to different classifications of different WLAN access nodes.