Methods and apparatus for multiple user uplink are provided. In one aspect, a method for wireless communication is provided. The method includes transmitting a clear to transmit (CTX) message to two or more stations, the CTX indicating an uplink transmission opportunity, the CTX message further comprising a request that the two or more stations concurrently transmit uplink data at a specific time. The method further includes receiving a plurality of uplink data from at least two stations at the specific time.

Methods and apparatus for multiple user uplink

A master electronic circuit (300) includes a storage (324) representing a wireless collision avoidance networking process (332) involving collision avoidance overhead and combined with a schedulable process (345) including a serial data transfer process and a scheduler, a wireless modem (350) operable to transmit and receive wireless signals for the networking process (332), and a processor (320) coupled with the storage (324) and with the wireless modem (350) and operable to execute the scheduler to establish and transmit a schedule (110) for plural serial data transfers involving the processor (320) and distinct station identifications, and to execute the serial data transfers inside the wireless networking process and according to the schedule so as to avoid at least some of the collision avoidance overhead. Other electronic circuits, processes of making and using, and systems are disclosed.

Interrelated WiFi and USB Protocols and Other Application Framework Processes, Circuits and Systems

Methods, devices, and computer program products for synchronization of wireless devices in a peer-to-peer network are described herein. In one aspect, a method for synchronizing a wireless communication apparatus is provided. The method includes receiving one or more synchronization messages, each synchronization message having timing information and a cluster identifier, the timing information comprising anchor timing information, the cluster identifier being the same value as a cluster identifier of the apparatus. The method further includes determining whether a difference between a time value when a received synchronization message last received anchor timing information and a time value maintained for the apparatus is greater than a threshold. The method further includes discarding the received synchronization message if the difference exceeds the threshold.

Systems and methods for synchronization within a neighborhood aware network

A plurality of servers configured to receive a plurality of requests associated with a plurality of byte sequences are described herein. The requests for each byte sequence are received by a single one of the servers. Each server is further configured to serially process the requests it receives while the other servers also perform serial processing of requests in parallel with the server. Also, the requests for each byte sequence are transmitted to the single one of the servers by a plurality of clients, each client independently identifying the single one of the servers for the byte sequence based on system metadata.

Parallel Serialization of Request Processing

Method and system for transmitting a multicast message with one or more packets to a plurality of destinations is provided. The system includes an adapter including an entry port to receive the multicast message from a source for transmission to the plurality of destinations; one or more egress ports of the adapter that transmit one or more packets of the multicast message to the plurality of destinations and receives acknowledgement for the one or more packets from the one or more destinations; and a message manager that monitors the delivery status for one or more packets to the plurality of destinations without using a plurality of dedicated individual connections between each of the plurality of destinations and the source.

Method and System for Reliable Multicast

Aspects disclosed herein address the need in the art for memory management for high speed media access control. A packet buffer may store packets with a first data structure, comprising the packet length, sequence number, and a pointer to a second data structure. Packet data may be stored in a linked list of one or more second data structures. Transmit and receive queues may be formed using linked lists or arrays of the first data structures. Memory locations for storing first and second data structures may be kept in lists indicating free locations for the respective data structure types. A flexible memory architecture is disclosed in which two configurations may be selected. In a first configuration, a first memory comprises per-flow parameters for multiple flows, and a second memory comprises a packet buffer. In a second configuration, the first memory comprises per-flow pointers to per-flow parameters in the second memory. The packet buffer resides in a third memory. Various other aspects are also presented.

Subrahmanyam Dravida

Papers

Memory management for high speed media access control