Patent classifications
H04L12/701
PACKET RETRANSMISSION
Through the identification of different packet-types, packets can be handled based on an assigned packet handling identifier. This identifier can, for example, enable forwarding of latency-sensitive packets without delay and allow error-sensitive packets to be stored for possible retransmission. In another embodiment, and optionally in conjunction with retransmission protocols including a packet handling identifier, a memory used for retransmission of packets can be shared with other transceiver functionality such as, coding, decoding, interleaving, deinterleaving, error correction, and the like.
Calculating trust scores based on social graph statistics
Systems and methods for calculating trust scores (trustworthiness) based on social graph statistics are described herein. The trust scores (trustworthiness) may be determined within or between individuals, groups, and/or entities represented by nodes in a social graph or other network. Social graph analytics may be used to determine connectivity statistics for each node in the social graph or network. The trust score may then be calculated by analyzing a number of paths connecting nodes in the network and the connectivity statistics associated with the nodes of the network. This trust score may then be used to make prospective real-world decisions, such as a request for credit or initiating a transaction.
Traffic splitter for user plane in mobile networks
The application relates to a method for operating a traffic splitter provided for a data packet flow flowing through the data plane. The data packet flow is received and it is determined whether the data packet flow should be transmitted through an Evolved Packet Core, EPC, processing path or through a Software Defined Network, SDN, processing path based on information provided in the data packets of the data packet flow and it is transmitted either through the EPC processing path or the SDN processing path based on the determination.
Accessing and routing over a peer-to-peer network
ISP-free methods, systems and products may include requesting, by a requester, the information from a source, and then passing, such as pushing or pulling, the information from the requester to a controller comprising a director and an optimizer. Further, the method may include receiving instructions from at least one directory, wherein each of the at least one directory is associated with at least one router in a plurality of routers. Further still, the method may include creating, by the optimizer in communication with the at least one directory, a routing plan for routing the information over at least a portion of the plurality of routers. And, yet further, the method may include directing, based on the creating and by the director in communication with the optimizer, placement of the information on one or more of the plurality of routers. Thereafter, routing may commence without connectivity from an ISP.
Dynamic allocation of hash table resources
Examples relate to dynamic allocation of hash table resources. In one example, a computing device may: receive, from a particular lookup function of a plurality of lookup functions, a lookup request; identify, based on the particular lookup function, a logical hash table that corresponds to the particular lookup function, the logical hash table mapping to at least one physical hash table resource; obtain, from one of the at least one physical hash table resource, response data that is responsive to the lookup request; and provide the response data to the particular lookup function.
Service routing packet processing method and apparatus, and network system
A service routing packet processing method and apparatus. The method includes a service node (SN) receives a first service routing packet from a first service router (SR), where the first service routing packet comprises path identification information and identification information of a destination SN, the SN performing service processing on the first service routing packet to obtain a second service routing packet, where the second service routing packet includes the path identification information and identification information of a source SN, and where the value of the identification information of a source SN is the identification information of the destination SN comprised in the first service routing packet, and the SN sending the second service routing packet to the first SR.
MANAGED SWITCH ARCHITECTURES: SOFTWARE MANAGED SWITCHES, HARDWARE MANAGED SWITCHES, AND HETEROGENEOUS MANAGED SWITCHES
Some embodiments provide a system that includes a set of network controllers for receiving definitions of first and second logical switching elements. The system includes several managed switching elements. The set of network controllers configure the several managed switching elements to implement the defined first and second logical switching elements. The system includes several network hosts that are each (1) communicatively coupled to one of the several managed switching elements and (2) associated with one of the first and second logical switching elements. Network data communicated between network hosts associated with the first logical switching element are isolated from network data communicated between network hosts associated with the second logical switching element.
PATH SELECTION FOR AN APPLICATION BASED ON A PERFORMANCE SCORE IN A SOFTWARE-DEFINED NETWORK
A method may include receiving a data flow of an application directed to the destination in a software-defined network (SDN). The method may also include identifying a classification of the application. The method may additionally include identifying a set of performance thresholds associated with the classification of the application. The method may also include determining a current performance of the data flow of the application in the SDN. The method may also include generating a performance score for the application based on the set of performance thresholds and the current performance of the data flow of the application in the SDN. The method may further include causing the performance score for the application to be presented via an interface.
Optimization of packet transmission paths
A method is disclosed for optimizing packet transmission paths in a mobile communication network (400) in which packets are transmitted and received between mobile stations (10-14) or between a mobile station and a fixed network (120) by way of a plurality of packet transmission device (60-64, 70-72, 80, and 81) and radio base stations (50-57). When a mobile station uses a service that is provided by a fixed network (300), imposed are applied on the packet transmission path such that packets pass by way of specific packet transmission devices (80 and 81) depending on the fixed network (external network) 300. When the mobile station uses a service that is provided by the mobile communication network (400), on the other hand, no restrictions are imposed on the packet transmission path, and the packet transmission path is thus set such that the link costs are a minimum.
METHOD FOR MANAGING SESSION AND SMF NODE
The one disclosure of the present specification proposes a method for managing session. The method may be performed by a session management function, SMF, node and comprise: generating a packet data unit, PDU, session for a user equipment, UE; receiving, from an access and mobility management function, AMF, node, information about the UE; and determining, based on the information, whether to transmit an indication for notifying a user plane function, UPF, node to discard a downlink data for the PDU session of the UE. The determination may be dependent on whether the PDU session corresponds to a first service provided to the UE.