Viasat, Inc.

Matthew John Freier

Dennis Patrick Connors

Kristi Ann Jaska

Xiao Wu

James Edward Deveau

In a data over satellite system, preallocation of upstream channel resources is provided by a scheduler at the gateway satellite modem termination system (SMTS) in response from the user terminal, wherein the user terminal detects web browser and/or bulk transfers involving large amounts of data transfer from users via the upstream channel. A type length value (TLV) field is included with data packets transmitted to the gateway SMTS, at which excess transfer capability is allocated to the user terminal in anticipation of load requirements.

Web-bulk transfer preallocation of upstream resources in a satellite communication system

Upstream information arriving through a gateway from a user terminal in a satellite link subject to propagation delay is efficiently scheduled through a modified Demand Assigned Multiple Access (DAMA) algorithm such that arriving data packets arriving at the software queue at the user terminal are concatenated to form a large frame for transmission to improve efficiency. A piggyback request replacing a conventional DAMA contention request for the succeeding packet is issued to request bandwidth allocation for the succeeding concatenated packet. In a specific embodiment, all packets up to the physical request limit arriving at the user terminal since a prior piggyback request or contention request are concatenated so that all currently known packets (up to that limit) are accounted for by the next piggyback request.

Large packet concatenation in satellite communication system

Upstream information arriving through a user terminal in a satellite link is efficiently scheduled through a modified Demand Assigned Multiple Access (DAMA) algorithm such that data packets arriving at the user terminal are concatenated to form a larger frame for transmission and the concatenated packet is held in a first queue disposed ahead of a second queue, where the data in the second queue cannot be modified (typically a hardware queue), sufficient to allow the second queue to be emptied. In a specific embodiment, all packets arriving at the user terminal since a prior piggyback request are concatenated so that all currently known packets (up to a preselected limit) are accounted for by each succeeding piggyback request. Since it is desirable to concatenate all packets that arrive at the user terminal since the last piggyback request, the piggyback request according to the invention covers all currently known packets (up to the preselected limit) in the user terminal. The held-back packets are released or dumped to the second queue by a trigger operative according to a map, the map being a grant allocation schedule. This mechanism handles instances where the second queue is not able to handle all known packets.

Growing community of inventors

Carlsbad, CA, United States of America

Matthew John Freier