Abstract: Apparatuses, non-transitory program storage devices, and methods to implement a network function proxy are described. An example apparatus includes at least one non-transitory memory including computer program code configured with at least one processor to cause the apparatus to perform updating a profile including data associated with a producer network function in response to a registration request of the producer network function by adding a token identifier to a service identifier associated with a service of the producer network function, forwarding the updated profile to a network function repository function, wherein at least one internet protocol address is updated so that a proxy function is an endpoint for use of the service, storing and maintaining a mapping between the token identifier and the service of the producer network function, and providing the updated profile to a consumer network function in response to a discovery request for the service.

Abstract: Apparatuses, non-transitory program storage devices, and methods to implement a network function proxy are described. An example apparatus includes at least one non-transitory memory including computer program code configured with at least one processor to cause the apparatus to perform updating a profile including data associated with a producer network function in response to a registration request of the producer network function by adding a token identifier to a service identifier associated with a service of the producer network function, forwarding the updated profile to a network function repository function, wherein at least one internet protocol address is updated so that a proxy function is an endpoint for use of the service, storing and maintaining a mapping between the token identifier and the service of the producer network function, and providing the updated profile to a consumer network function in response to a discovery request for the service.

Abstract: A cognitive radio scanning method is disclosed that enables cognitive radios to rapidly scan for neighboring channels by staggering the position of beacons across the frame relative to other channels and intelligently allocate the bandwidth across super frames such that a device has the ability to switch and scan multiple beacons both within and across multiple super frames.

Abstract: An IP packet transmission system is disclosed and more specifically it is a system using a hybrid ARQ method including a sliding purge window and having the transmitter opportunistically piggy-back a snapshot of the transmitter's transmit/send window in data frames. When the receiver receives this snapshot the receiver can compare it with its receive window and if a mismatch is detected, whereby the transmitter has moved on to the next packet, the receiver can now also sync up quicker and not wait for the regular timeout to progress ahead.

Abstract: An IP packet transmission system is disclosed and more specifically it is a system using a hybrid ARQ method including a sliding purge window and having the transmitter opportunistically piggy-back a snapshot of the transmitter's transmit/send window in data frames. When the receiver receives this snapshot the receiver can compare it with its receive window and if a mismatch is detected, whereby the transmitter has moved on to the next packet, the receiver can now also sync up quicker and not wait for the regular timeout to progress ahead.

Abstract: An IP packet transmission system is disclosed and more specifically it is a system using a hybrid ARQ method that includes a sliding purge window to reduce packet losses and improve TCP throughput thus ensuring data integrity, improving reliability, and to some extent guaranteeing in-order delivery of packets at the receiver.

Abstract: A cognitive radio scanning method is disclosed that enables cognitive radios to rapidly scan for neighboring channels by staggering the position of beacons across the frame relative to other channels and intelligently allocate the bandwidth across super frames such that a device has the ability to switch and scan multiple beacons both within and across multiple super frames.

Abstract: A method that allows for rapid inter base station handoffs in IP based wireless networks is disclosed. More specifically a technique to address the problem of accurate location management during rapid handoff across multiple base stations is described in this invention disclosure. The idea proposed uses a combination of Timestamp and Sequence number along with a message exchange protocol over the network to maintain the registration with only a single base station at any point of time.

Abstract: A method that allows for rapid inter base station handoffs in IP based wireless networks is disclosed. More specifically a technique to address the problem of accurate location management during rapid handoff across multiple base stations is described in this invention disclosure. The idea proposed uses a combination of Timestamp and Sequence number along with a message exchange protocol over the network to maintain the registration with only a single base station at any point of time.

Abstract: This disclosure describes a dynamic pattern elimination compression method to eliminate redundant patterns, the content of which is not known a priori, by identifying the candidate dynamic patterns and marking them, then checking to see if there are any duplicate occurrences within the entire message by searching for markers, if a marker is found, checking to see if the pattern occurred before, if not, assigning a unique variable to the pattern, if so replacing the pattern with the variable that was assigned for this pattern, and if a pattern is found only once, removing the variable assigned to it.

Abstract: This disclosure describes a dynamic pattern elimination compression method to eliminate redundant patterns, the content of which is not known a priori, by identifying the candidate dynamic patterns and marking them, then checking to see if there are any duplicate occurrences within the entire message by searching for markers, if a marker is found, checking to see if the pattern occurred before, if not, assigning a unique variable to the pattern, if so replacing the pattern with the variable that was assigned for this pattern, and if a pattern is found only once, removing the variable assigned to it.