Abstract: Communication methods, buffer management methods, communication systems, and communication devices for mobile communications using acknowledgement-based protocols, such as TCP. Communication buffer memory includes free and committed memory, with copies of transmitted messages awaiting acknowledgement stored in committed memory of transmit buffer. Memory controller monitors communication buffer state and, if free memory is less than a memory threshold, controller extracts TCP ACKNUM from a received host message. The TCP ACKNUM acknowledges transmitted message copies having ACKNUMs of lesser ordinality, and memory controller identifies and denominates the committed memory storing acknowledged messages as free memory, potentially avoiding deadlock.

Abstract: Method for communication buffer management communicates messages between local and remote hosts. Socket, process buffer and reserve buffers allocated. Process and reserve buffers differentiated for transmit and receive. Global memory pool partitioned into process and reserve buffer pools; reserve buffer pool partitioned into transmit and receive pools. Messages stored in process buffer, but reserve buffer stores messages if low memory (POS). Communication system and mobile device include communication manager storing messages in process buffers; if POS exists, in reserve buffers. Communication buffer manager used for memory management, allocation, reclamation. Both adapt for static and dynamic memory management.

Abstract: Methods and apparatus are presented to reduce the number of registration requests transmitted by a mobile node to a foreign agent. Rather than always sending the re-registration request at pre-determined times before the expiry of registration lifetime, re-registration requests are transmitted only if some data transfer takes place after a time period demarcated by the previous successful registration.

Abstract: To avoid lost packets that could otherwise occur were a round robin scheduling policy to be used to assign PPP packet fragments to multiple communication links, the links are assigned tokens based on their capacities, with a fragment being assigned to the link with the most tokens. When a fragment is scheduled to a link, the tokens of the link are decremented accordingly. The tokens are periodically refreshed.