Voice data transmission with adaptive redundancy creates a voice data packet by packetizing the voice data payload and a number of redundant payloads selected from a set of previous voice data payloads. The voice data from the voice data payload is analysed to determine whether it is a critical or non-critical payload by classifying the received voice data as voiced or unvoiced. If at least a portion of the voice data is classified as unvoiced, the voice data payload is determined to be a critical payload. If it is a critical payload, then the voice data payload is added to the set of previous voice data payloads for inclusion as a redundant payload in subsequent voice data packets. The voice data packet is then forwarded for transmission over the network.

Voice data transmission with adaptive redundancy creates a voice data packet by packetizing the voice data payload and a number of redundant payloads selected from a set of previous voice data payloads. The voice data from the voice data payload is analysed to determine whether it is a critical or non-critical payload by classifying the received voice data as voiced or unvoiced. If at least a portion of the voice data is classified as unvoiced, the voice data payload is determined to be a critical payload. If it is a critical payload, then the voice data payload is added to the set of previous voice data payloads for inclusion as a redundant payload in subsequent voice data packets. The voice data packet is then forwarded for transmission over the network.

Methods, apparatuses and systems for user-plane congestion management are provided. Among these method, apparatuses and systems is a method, implementable by a base station (and/or a serving gateway), for mitigating user plane congestion. The method may include sending a congestion indication to a core network; receiving a general packet radio system (GPRS) tunneling protocol (GTP) packet including an first internet protocol (IP) packet associated with a first flow within a bearer; obtaining, from a header of the GTP packet, an indicator indicative of a priority of the IP packet, wherein the indicator was inserted into the header of the GTP packet by the core network responsive to the congestion indication; and dropping any of the GTP packet and the first IP packet on condition that a priority of a second IP packet associated with second flow within the bearer takes precedence over the priority of the first IP packet.

Methods, apparatuses and systems for user-plane congestion management are provided. Among these method, apparatuses and systems is a method, implementable by a base station (and/or a serving gateway), for mitigating user plane congestion. The method may include sending a congestion indication to a core network; receiving a general packet radio system (GPRS) tunneling protocol (GTP) packet including an first internet protocol (IP) packet associated with a first flow within a bearer; obtaining, from a header of the GTP packet, an indicator indicative of a priority of the IP packet, wherein the indicator was inserted into the header of the GTP packet by the core network responsive to the congestion indication; and dropping any of the GTP packet and the first IP packet on condition that a priority of a second IP packet associated with second flow within the bearer takes precedence over the priority of the first IP packet.

Various embodiments are directed to techniques for dynamically adjusting a maximum rate of throughput for accessing data stored within a volume of storage space of a storage cluster system based on the amount of that data that is stored within that volume. An apparatus includes an access component to monitor an amount of client data stored within a volume defined within a storage device coupled to a first node, and to perform a data access command received from a client device via a network to alter the client data stored within the volume; and a policy component to limit a rate of throughput at which at least the client data within the volume is exchanged as part of performance of the data access command to a maximum rate of throughput, and to calculate the maximum rate of throughput based on the stored amount.

Methods and systems are provided for performing lossy dropping and ECN marking in a flow-based network. The system can maintain state information of individual packet flows, which can be set up or released dynamically based on injected data. Each flow can be provided with a flow-specific input queue upon arriving at a switch. Packets of a respective flow are acknowledged after reaching the egress point of the network, and the acknowledgement packets are sent back to the ingress point of the flow along the same data path. As a result, each switch can obtain state information of each flow and perform per-flow packet dropping and ECN marking.

Provided is a relay device including: a relay unit configured to perform a relay process for a frame transmitted and received between a plurality of function units; and a relay management unit. The relay unit receives, from a function unit, a target frame which is transmitted and received according to a predetermined communication protocol and includes information with which a request source of a service is identifiable and information with which a content of the requested service is identifiable, and the relay unit outputs the received target frame to the relay management unit. The relay management unit performs determination regarding setting change in the relay process of the relay unit, on the basis of the information included in the target frame received from the relay unit, and outputs the target frame to the relay unit or discards the target frame, according to a result of the determination.

A reception unit (210) receives an addition requesting frame for requesting addition of a new flow. A first search unit (241) performs, using a network-information database (280), a first search for searching for a schedule and a path assignable to the new flow without the schedule and the path of each existing flow being changed, when the addition requesting frame is received. A second search unit (242) performs a second search for changing the schedule and the path of each existing flow and searching for the schedule and the path assignable to the new flow, using the network-information database, when the schedule and the path assignable to the new flow have not been found by the first search. A response unit (260) transmits an addition responding frame.

A device determines traffic and costs associated with a network that includes network devices interconnected by links, and determines traffic assignments for the network based on the traffic and the costs associated with the network. The device determines tunnel use for the network based on the traffic assignments, and determines peer link use for the network based on the tunnel use. The device determines costs associated with the traffic assignments, the tunnel use, and the peer link use for the network, and generates traffic plans based on the traffic assignments, the tunnel use, the peer link use, and the costs associated with the traffic assignments, the tunnel use, and the peer link use. The device causes one of the traffic plans to be implemented in the network by the network devices and the links.

A device determines traffic and costs associated with a network that includes network devices interconnected by links, and determines traffic assignments for the network based on the traffic and the costs associated with the network. The device determines tunnel use for the network based on the traffic assignments, and determines peer link use for the network based on the tunnel use. The device determines costs associated with the traffic assignments, the tunnel use, and the peer link use for the network, and generates traffic plans based on the traffic assignments, the tunnel use, the peer link use, and the costs associated with the traffic assignments, the tunnel use, and the peer link use. The device causes one of the traffic plans to be implemented in the network by the network devices and the links.