Patent classifications
H04L12/801
Dynamic indication map for multicast group and traffic indication
This disclosure describes methods, apparatus, and systems related to: identifying, at a first wireless communication station, one or more second wireless communication stations within a predetermined proximity of the first wireless communication station; determining, at the first wireless communication station, one or more second wireless communication stations identified within the predetermined proximity of the first wireless communication station for which a multicast frame is intended; generating, at the first wireless communication station, a bit map comprising a hashed identifier of each of the one or more second wireless communication stations for which the multicast frame is intended, wherein the bit map is included in the multicast frame; and causing to transmit, by the first wireless communication station, the multicast frame from the first wireless communication station to the one or more second wireless communication stations for which the multicast frame is intended.
Congestion notification system
A congestion notification system includes a networking device coupling a sender device to a receiver device. The networking device is configured to detect a congestion situation. When the networking device will provide a first congestion notification in a first packet received from the sender device in response to detecting the congestion situation, as well as retrieve sender device information from the first packet and store that sender device information in a database. Following the sending of the first packet to the receiver device, the networking device receives a second packet that was sent from the receiver device prior to the receiver device receiving the first packet. In response to determining that the second packet includes the sender device information that is stored in the database, the networking device provides a second congestion notification in the second packet. The networking device then sends the second packet to the sender device.
Reduction in network congestion
A system, method and non-transitory computer readable storage medium comprising instructions that when read by a processor perform receiving a list including a plurality of possible recipients of telephony network connections, the recipients identified by a telephony number, determining a status characteristic of the intended recipient based on the addressing information, based on the status characteristic, determining whether the intended recipient would successfully receive a telephony connection request if the telephony connection request was forwarded to the intended recipient, and indicating the determination of whether the intended recipient would successfully receive the telephony connection request on the list.
Reducing reauthorization request messages in communications networks
A method is provided in one example embodiment and includes evaluating by a first network node a current level of congestion experienced by a session in a communications network; predicting a level of congestion that will be experienced by the session beginning at a next time boundary; sending a request message to a second network node, the request message comprising at least one rule corresponding to the current level of congestion and the predicted level of congestion, in which the rule has associated therewith an activation time and a deactivation time; and refraining from sending an additional request message to the second network node at the next time boundary.
Provisioning system and method for a distributed computing environment using a map reduce process
A provisioning system for a distributed computing environment includes a map reduce framework that includes a splitter process, a mapper process, and a reduce process. The splitter process receives a task associated with a distributed application to be deployed on the distributed computing environment, and selects which of the resources are to be provisioned for executing the distributed application. The mapper process converts at least one abstract address included in the task to an absolute address, and executes the task for provisioning the selected resources, while the reduce process consolidates results of the executed task.
APPARATUS AND METHOD FOR ROUTING DATA IN A SWITCH
Apparatuses, methods and storage medium associated with routing data in a switch are provided. In embodiments, the switch may include route lookup circuitry determine a first set of output ports that are available to send a data packet to a destination node. The lookup circuitry may further select, based on respective congestion levels associated with the first set of output ports, a plurality of output ports for a second set of output ports from the first set of output ports. An input queue of the switch may buffer the data packet and route information associated with the second set of output ports. The switch may further include route selection circuitry to select a destination output port from the second set of output ports, based on updated congestion levels associated with the output ports of the second set of output ports. Other embodiments may be described and/or claimed.
Supervising Method for Dynamic and Large Data Loads in Automotive Systems
The disclosure includes implementations for supervising a data load for a vehicle. Some implementations of a method may include receiving report data from a communicative coupling shared with a supervised component that includes a report module that transmits a message including the report data. The report data may describe a data load for the supervised component. The method may include retrieving specification data for the supervised component that describes a threshold for the data load. The method may include performing an analysis of the data load to determine whether the data load exceeds the threshold. The method may include providing graphical data to an electronic display panel to cause the electronic display panel to display a message responsive to the analysis indicating that the data load exceeds the threshold. The method may include providing an accommodation to the supervised component so that the data load does not exceed the threshold.
WEIGHTED FAIR QUEUEING USING SEVERITY-BASED WINDOW IN RELIABLE PACKET DELIVERY NETWORK
In one embodiment, a method comprises a network device detecting an event severity encountered by the network device; the network device selectively changing a window size, for a maximum number of unacknowledged data packets that can be sent by the network device to a receiver device, to correspond to the event severity encountered by the network device; and the network device transmitting, to the receiver device, a number of data packets up to the window size, enabling the receiver device to detect the corresponding event severity encountered by the network device based on the number of unacknowledged data packets received by the receiver device from the network device.
Method and system for flow control between a base station controller and a base transceiver station
According to a disclosed embodiment, a flow indication counter is incremented each time a data packet is transmitted from a buffer. When the number of data packets transmitted equals or exceeds a threshold number, a flow indication message comprising the buffer window size is generated and transmitted to the base station controller. Further, flow indication messages can be generated and transmitted every threshold time interval, independently of the number of data packets transmitted to ensure that flow indication messages are sent at least every preset time interval. Moreover, a system for flow control can be constructed comprising a flow indication counter module configured to provide an updated number of data packets transmitted. The system further comprises a window size monitoring module which determines the buffer window size and a message generating module which generates a flow indication message comprising the buffer window size.
Buffer control for multi-transport architectures
A system and method for automating connection management in a manner that may be transparent to any actively communicating applications operating in a Network on Terminal Architecture (NoTA). An application level entity may access another node by making a request to a high level communication structure via an interface. The high level structure may interact with a lower level structure configured to manage communication by establishing communication with another device via one or more transports. In at least one embodiment, provisions may be made to guard against data being lost when a transport fails, including storing data that is passed from a transport-independent buffer to a transport-specific buffer in case the transport fails. When a failure occurs, the stored data may readily be forwarded for sending using another transport.