Abstract: A method and apparatus are for receiving a set of individual congestion reports, wherein each individual congestion report comprises a set of congestion values and an associated location. Each individual congestion report has been generated by one of a plurality of user devices operating in a wireless communication system and is based on at least one of a downlink congestion value, an uplink congestion value, and a core congestion value. The set of individual congestion reports is correlated to form one or more local congestion reports. One or more local congestion reports are transmitted to a user device. Additionally or alternatively, user device application interactions with a user device are altered based on the one or more local congestion reports. Additionally or alternatively, network performance parameters are altered to reduce congestion in at least on region based on one or more local congestion reports.

Abstract: A method and apparatus are for receiving a set of individual congestion reports, wherein each individual congestion report comprises a set of congestion values and an associated location. Each individual congestion report has been generated by one of a plurality of user devices operating in a wireless communication system and is based on at least one of a downlink congestion value, an uplink congestion value, and a core congestion value. The set of individual congestion reports is correlated to form one or more local congestion reports. One or more local congestion reports are transmitted to a user device. Additionally or alternatively, user device application interactions with a user device are altered based on the one or more local congestion reports. Additionally or alternatively, network performance parameters are altered to reduce congestion in at least on region based on one or more local congestion reports.

Abstract: A flow control method and system including an algorithm for deciding to transmit an arriving packet into a processing queue or to discard it, or, in the case of instructions or packets that must not be discarded, a similar method and system for deciding at a service event to transmit an instruction or packet into a processing queue or to skip the service event. The transmit probability is increased or decreased in consideration of minimum and maximum limits for each flow, aggregate limits for sets of flows, relative priority among flows, queue occupancy, and rate of change of queue occupancy. The effects include protection of flows below their minimum rates, correction of flows above their maximum rates, and, for flows between minimum and maximum rates, reduction of constituent flows of an aggregate that is above its aggregate maximum. Practice of the invention results in low queue occupancy during steady congestion.

Abstract: A flow control method and system including an algorithm for deciding to transmit an arriving packet into a processing queue or to discard it, or, in the case of instructions or packets that must not be discarded, a similar method and system for deciding at a service event to transmit an instruction or packet into a processing queue or to skip the service event. The transmit probability is increased or decreased in consideration of minimum and maximum limits for each flow, aggregate limits for sets of flows, relative priority among flows, queue occupancy, and rate of change of queue occupancy. The effects include protection of flows below their minimum rates, correction of flows above their maximum rates, and, for flows between minimum and maximum rates, reduction of constituent flows of an aggregate that is above its aggregate maximum. Practice of the invention results in low queue occupancy during steady congestion.

Abstract: A flow control method and system including an algorithm for deciding to transmit an arriving packet into a processing queue or to discard it, or, in the case of instructions or packets that must not be discarded, a similar method and system for deciding at a service event to transmit an instruction or packet into a processing queue or to skip the service event. The transmit probability is increased or decreased in consideration of minimum and maximum limits for each flow, aggregate limits for sets of flows, relative priority among flows, queue occupancy, and rate of change of queue occupancy. The effects include protection of flows below their minimum rates, correction of flows above their maximum rates, and, for flows between minimum and maximum rates, reduction of constituent flows of an aggregate that is above its aggregate maximum. Practice of the invention results in low queue occupancy during steady congestion.