A system for transmitting concurrent data flows on a network, includes a memory containing data of data flows; a plurality of queues assigned respectively to the data flows, organized to receive the data as atomic transmission units; a flow regulator to poll the queues in sequence and, if the polled queue contains a full transmission unit, transmitting the unit on the network at a nominal flow-rate of the network; a sequencer to poll the queues in a round-robin manner and enable a data request signal when the filling level of the polled queue is below a threshold common to all queues, which threshold is greater than the size of the largest transmission unit; and a direct memory access configured to receive the data request signal and respond thereto by transferring data from the memory to the corresponding queue at a nominal speed of the system, up to the common threshold.

The present invention relates to a data buffer memory (104) and method for storing data in a data communications network, and to a data buffer system (100) comprising such a data buffer memory. The data buffer memory comprising a data section (104a′) comprising a number of memory pages (104a); and a package descriptor section (104b′) comprising a 5 number of package descriptors (104b); wherein at least one queue (103) of packets is stored in the data section (104a′) as an ordered set of packages, and wherein a package is an ordered set of packets.

In one embodiment, a next set of packets in a first flow may be identified. A counter may be incremented, where the counter indicates a first number of initial sets of packets in first flow that have been identified. The identified next set of packets may be prioritized such that the first number of initial sets of packets in the first flow are prioritized and a sequential order of all packets in the first flow is maintained. The identifying, incrementing, and prioritizing may be repeated until no further sets of packets in the first flow remain to be identified or the first number of initial sets of packets is equal to a first predefined number.

The present invention addresses method, apparatus and computer program product for resource management within a distributed system in a core network element, comprising organizing computing resources of the core network element into sets, wherein a first set is always active, setting an upper threshold and a lower threshold for the load of the sets, wherein the sets in operation are loaded as long as the average load of the sets in operation reaches the upper threshold, and when the upper threshold is exceeded, a new set is activated, whereas, when the load thereof falls below the lower threshold, the last activated set is deactivated, assigning a priority number to each set, segmenting an interval of random numbers for randomizing a request distribution in subintervals which are allocated to the computing resources of the active sets, wherein the length of each subinterval is determined based on the priority number of the set of the respective computing resource, and allotting a random number out of the interval to an incoming request, and forwarding the request to such computing resource which belongs to the subinterval that contains the allotted random number.

A memory access method includes: receiving, by the switch, a data packet; matching a flow table on the data packet, where the flow table includes at least one flow entry, where the flow entry includes a matching field and an action field, and the at least one flow entry includes a first flow entry, where a matching field of the first flow entry is used to match source node information, destination node information, and a protocol type in the data packet, and an action field of the first flow entry is used to indicate an operation command for a storage device embedded in the switch; and when the data packet successfully matches the first flow entry, performing an operation on the storage device according to the operation command in the action field of the successfully matched first flow entry.

Systems and methods are described that facilitate multiple registrations and flow based mobility in a wireless communication network. A flow routing component can be included in a mobile device, home agent/p-gateway, or a policy and charging rules function server that determines the manner in which to route one or more IP flows through a set of network access entry points. The flow routing component can determine the routing based on a set of policies and/or network data, such as quality of service requirements, bandwidth requirements, network congestion, currently active IP flows, and so forth.

A transmitting/receiving system and a data processing method of the same are disclosed herein. The receiving system may include a receiving unit, a first processing unit, and a second processing unit. The receiving unit receives a broadcast signal including mobile service data from at least one slot. The first processing unit acquires FIC segments divided from an FIC chunk of at least one sub-frame. Herein, each FIC segment comprises a 2-byte segment header and a 35-byte segment payload. The segment header includes an FIC type information, a number of a corresponding FIC segment, and a number of a last FIC segment among the FIC segments divided from the FIC chunk. The second processing unit obtains the FIC chunk including signaling information between at least one ensemble and at least one mobile service from respective payloads of the FIC segments, based upon the acquired FIC type information, number of the corresponding FIC segment, and number of the last FIC segment of each FIC segment.

Method and communication system for distributing information relating to a set of networks from a first node to a second node of the communication system, wherein a set of identifiers of respective networks which belong to the set of networks is stored at the first node. Hash values are generated at the first node for the identifiers in the set of identifiers using a hash function. The generated hash values are transmitted from the first node to the second node. The second node determines an identifier of a particular network which is available for communicating with the second node. The second node generates a hash value for the identifier of the particular network using the hash function. The second node then compares the hash value of the identifier of the particular network generated at the second node with the hash values received at the second node from the first node to thereby determine whether the particular network belongs to said set of networks.

Described is a technology by which network connections are unified into a single user interface for user interaction with those networks. Upon receiving information identifying available networks that correspond to different types of media, a user interface component aggregates the available network connections and displays representations of the available network connections on the user interface. The result is a single user interface page on which the available networks are represented as available network connections that may correspond to destinations, for example by displaying a network name and/or a user-friendly name maintained in a network profile. Also displayable is connectivity status, security-related information, signal strength information for wireless network connections, and other information. The user may choose to show all available network connections, or only subset of the available network connections (e.g., only wireless, or only dial-up and VPN).

A method for obtaining previously stored session state data for a session between a system having a plurality of nodes and a client device includes obtaining a session identifier specifying the session and hashing the session identifier. A currently valid hash map is searched. The hash map maps a hash of the session identifier to the nodes for a current system configuration. The search is performed to identify a system node on which the session state data for the session is stored. If the session state data is not located using the currently valid hash map, at least one earlier generation hash map that is valid for a previous configuration of the system is searched. Upon identifying the system node on which the session state data is stored, the session state data from the system node is retrieved. The session state data is used to establish the session.