Language selection

Search

Patent 2331014 Summary

Third-party information liability

Some of the information on this Web page has been provided by external sources. The Government of Canada is not responsible for the accuracy, reliability or currency of the information supplied by external sources. Users wishing to rely upon this information should consult directly with the source of the information. Content provided by external sources is not subject to official languages, privacy and accessibility requirements.

Claims and Abstract availability

Any discrepancies in the text and image of the Claims and Abstract are due to differing posting times. Text of the Claims and Abstract are posted:

  • At the time the application is open to public inspection;
  • At the time of issue of the patent (grant).
(12) Patent Application: (11) CA 2331014
(54) English Title: SYSTEM FOR PROVIDING SATELLITE BANDWIDTH ON DEMAND EMPLOYING UPLINK FRAME FORMATTING FOR SMOOTHING AND MITIGATING JITTER AND DYNAMICALLY CHANGING NUMBERS OF CONTENTION AND DATA CHANNELS
(54) French Title: SYSTEME SERVANT A FOURNIR UNE BANDE SATELLITE SUR DEMANDE A L'AIDE D'UNE MISE AU FORMAT DES TRAMES MONTANTES POUR AMORTIR ET ATTENUER LA GIGUE ET PROCEDER A UNE MODIFICATION DYNAMIQUE DU NOMBRE DES CONFLITS ET DES CANAUX DE TRANSMISSION DE DONNEES
Status: Deemed Abandoned and Beyond the Period of Reinstatement - Pending Response to Notice of Disregarded Communication
Bibliographic Data
(51) International Patent Classification (IPC):
  • H04B 7/185 (2006.01)
  • H04B 7/212 (2006.01)
(72) Inventors :
  • HEATH, ROBERT JEFF (United States of America)
(73) Owners :
  • HUGHES ELECTRONICS CORPORATION
(71) Applicants :
  • HUGHES ELECTRONICS CORPORATION (United States of America)
(74) Agent: MARKS & CLERK
(74) Associate agent:
(45) Issued:
(86) PCT Filing Date: 2000-03-03
(87) Open to Public Inspection: 2000-09-08
Examination requested: 2000-11-01
Availability of licence: N/A
Dedicated to the Public: N/A
(25) Language of filing: English

Patent Cooperation Treaty (PCT): Yes
(86) PCT Filing Number: PCT/US2000/005650
(87) International Publication Number: WO 2000052849
(85) National Entry: 2000-11-01

(30) Application Priority Data:
Application No. Country/Territory Date
60/122,741 (United States of America) 1999-03-04

Abstracts

English Abstract


A method of transmitting time division multiplexed data from a satellite
terminal to a satellite wherein the satellite terminal receives a command
indicating to transmit data during a frame comprising a plurality of timeslots
in accordance with a timeslot reordering scheme. The timeslot reordering
scheme is selected to spread data from respective satellite terminals to
different timeslots throughout the frames. A processor monitors the use of
channels by the satellite terminals, stores bandwidth requests using queues,
allocates channels in accordance with bandwidth requests and a bandwidth
allocation algorithm, and transmits the channel allocations in a frame.
Timeslots not allocated to any of the satellite terminals are contention
channels. The number of contention channels changes dynamically, depending on
demand for the plurality of channels by the satellite terminals. Queues are
provided for each channel for storing high and low priority rate requests and
high and low priority volume requests. The bandwidth allocation algorithm
determines the preemption of the queues, and allocation priorities.


French Abstract

L'invention concerne une méthode utilisée pour transmettre, par répartition dans le temps, des données multiplexées depuis un terminal satellite vers un satellite, le terminal satellite recevant une commande lui indiquant de transmettre les données durant une trame comprenant une multitude de créneaux de temps de temps selon un plan de remise en ordre des créneaux de temps. Le plan de remise en ordre des créneaux de temps est choisi pour étendre les données, transmises par les terminaux satellites respectifs, à différents créneaux de temps dans toutes les trames. Un processeur supervise l'utilisation des canaux par les terminaux satellites, stocke les demandes de bande à l'aide de files d'attente, attribue des canaux conformément aux demandes de bande et à un algorithme d'attribution de bande, et transmet les attributions de canaux dans une trame. Les créneaux de temps qui ne sont attribués à aucun des terminaux satellites sont des canaux exploités en mode conflit. La multitude des canaux exploités en mode conflit varie de façon dynamique, en fonction du nombre de canaux demandés par les terminaux satellites. Des files d'attente sont constituées pour chaque canal afin de gérer les priorités hautes et faibles en fonction du débit et les priorités hautes et faibles en fonction du volume. L'algorithme d'attribution de bande détermine la priorité de réservation des files d'attente et les priorités d'attribution.

Claims

Note: Claims are shown in the official language in which they were submitted.


-30-
1. A method of transmitting time division multiplexed data from a satellite
terminal (40) to a satellite (20), said method comprising the steps of:
providing said satellite terminal (40) with at least one command that
allocates to said satellite terminal (40) a number of timeslots (106) within
each of at
least one frame (104) for data transmission, said command identifying said
number
of allocated timeslots (106) in a first order in accordance with a timeslot
reordering
scheme; and
converting said timeslots (106) identified by said command to corresponding
timeslot locations within each frame (104) in a second order in accordance
with said
timeslot reordering scheme to distribute said allocated timeslots (106)
throughout
each frame (104).
2. A method as claimed in claim 1, further comprising the step of selecting
said
timeslot ordering scheme to distribute data from respective satellite
terminals (40)
to different timeslots (106) throughout each frame (104).
3. A method as claimed in claim 1, wherein said converting step is performed
by said satellite terminal (40).
4. A method as claimed in claim 1, wherein said providing step comprises the
steps of:
receiving a request for bandwidth at said satellite (20) from said satellite
terminal (40);
processing said request to determine an allocation of timeslots (106) within
each frame (104) for said satellite terminal (40) to transmit said data;
generating said command to indicate said timeslots (106) allocated to said
satellite terminal (40) in said first order in accordance with said timeslot
reordering
scheme; and
transmitting said command to said satellite terminal (40).

31
5. A bandwidth on demand apparatus in a communication system (10)
comprising:
a processor (16) operable to generate commands that allocate a plurality of
channels among terminals (40), said terminals (40) being operable to process
said
commands and use said channels in accordance with said allocations;
a receiver (18) for receiving bandwidth requests from said terminals (40)
requesting use of said channels for transmission of terminal traffic
comprising at
least one of audio, video and data; and
a transmitter (18) for transmitting said commands to said terminals (40);
wherein said processor (16) allocates each of said channels as one of a
contention channel and a data channel, said contention channels allowing said
terminals to transmit said bandwidth requests, said data channels allowing
said
terminals to transmit said terminal traffic, said processor dynamically
changing said
allocation of channels depending on an amount of bandwidth requests pending at
any given time.
6. A bandwidth on demand apparatus (10) as claimed in claim 5, further
comprising a plurality of queues connected to said processor, wherein said
processor (16) writes to and reads from said queues, stores said bandwidth
requests
in said queues, and allocates said channels as data channels in accordance
with said
bandwidth requests stored in said queues.
7. A bandwidth on demand apparatus (10) as claimed in claim 5, wherein said
channels correspond to timeslots (106) in frames (104), said processor (16)
being
operable to allocate said timeslots (106) in accordance with said bandwidth
requests
and a bandwidth allocation algorithm and to generate said commands
accordingly,
and said terminals (40) being operable to process said commands and use said
timeslots (106) in accordance therewith.

32
8. A bandwidth on demand apparatus (10) as claimed in claim 5, wherein at
least a selected minimum number of said plurality of channels are configured
as said
contention channels.
9. A bandwidth on demand apparatus (10) as claimed in claim 5, wherein said
processor (16) is further operable to generate and transmit a signal via said
transmitter (18) to one of said terminals (40), to which selected ones of said
channels have been allocated, indicating that a channel release request from
said one
terminal (40) to release said selected channel allocations has been processed,
said
one terminal (40) being provided with a timer and being programmable to wait
until said timer expires before transmitting another one of said bandwidth
requests.
10. A bandwidth on demand apparatus (10) as claimed in claim 5, wherein one
of said terminals (40) transmits one of said bandwidth request via one of said
contention channels, and transmits other bandwidth requests subsequent to
receiving channel allocations in response to said one bandwidth request as
inband
messages via allocated data channels.
11. In a bandwidth on demand communication system (10), wherein channels
correspond to timeslots (106) in frames (104) with some of said channels being
designated for bandwidth requests comprising at least rate requests, said rate
requests being a request for a selected number of said timeslots (106) in each
of said
frames (104) and each of said rate requests being characterized as one of high
priority and low priority, and wherein said communication system (10) includes
terminals (40) that are operable to transmit said bandwidth requests, a
processing
device (16) for providing channel allocations comprising,

33
a first queue and a second queue, said processing device storing said high
priority rate requests in said first queue and allocating a selected number of
said
timeslots (106) in each of said frames (104) to each of said high priority
rate requests
stored in said first queue, and storing said low priority rate requests in
said second
queue and allocating a selected number of said timeslots {106) in each of said
frames
(104) to each of said low priority rate requests stored in said second queue,
the sum
of the number of said timeslots (106) in each of said frames (104) allocated
to said
rate requests stored in said first and second queues not exceeding a total
number of
timeslots (106) in each of said frames (104), allocation of said timeslots
(106) to said
rate requests stored in said second queue being preempted for at least one
frame
(104) by allocation of said timeslots (106) to said rate requests stored in
said first
queue for said at least one frame (104).
12. A processing device (16) as claimed in claim 11, wherein said bandwidth
requests further comprise volume requests, said volume requests corresponding
to a
request for a selected number of said timeslots (106) to send a selected
amount of
terminal traffic, said terminal traffic comprising at least one of data, audio
and
video, and each of said rate requests being characterized as one of high
priority and
low priority, and wherein said processing device (16) further comprises,
a third queue and a fourth queue, said processing device storing said high
priority volume requests in said third queue and storing said low priority
volume
requests in said fourth queue, said volume requests being preempted for at
least one
frame (104) by allocation of said timeslots (106) to at least one of said rate
requests
stored in said first queue and said rate requests stored in said second queue.

34
13. A processing device (16) as claimed in claim 12, wherein said valume
requests stored in said fourth queue are preempted for at least one frame
(104) by
allocation of said timeslots to at least one of said rate requests stored in
said first
queue, said rate requests stored in said second queue and said volume requests
stored in said third queue.
14. A processing device (16) as claimed in claim 12, wherein said processing
device is programmable to allocate said timeslots (106) in each of said frames
(104)
to said volume requests stored in said third queue and stored in said fourth
queue
on a round-robin basis to allow said volume requests a substantially equal
opportunity to be allocated bandwidth.
15. A processing device (16) as claimed in claim 12, wherein said processing
device is operable to assign said timeslots (106) to as many of said volume
requests
stored in said third queue and said fourth queue as possible in lieu of
providing said
terminals (40) requesting said bandwidth all of said channels that are
available at
that time and to continue to store said volume requests in respective one of
said
third queue and said fourth queue until the requests said bandwidth has been
allocated.
16. A method of transmitting channels in a bandwidth on demand
communication system (10) wherein channels correspond to timeslots (106) in
frames (104) and the system comprises a number of uplink cells (22) within
which
terminals (40) transmit signals using at least one of said channels, said
method
comprising the steps of:
controlling the use of each of said channels by said terminals, said terminals
being operable to transmit bandwidth requests to send terminal traffic
comprising
at least one of data. audio and video, said plurality of channels each being
useful as
one of a contention channel and a data channel, said contention channel
allowing

-35-
said terminals to transmit said bandwidth requests, said data channels
allowing said
terminals to transmit said terminal traffic, said channels being allocated in
accordance with said bandwidth requests and transmitted to said terminals in a
subsequent one of said frames, said terminals being operable to adjust power
for
transmission of said bandwidth requests and said terminal traffic using an
initial
power condition; and
transmitting said contention channels in adjacent and isolated said uplink
cells (22) as cofrequency channels to reduce interference of said contention
channels
with said data channels.

Description

Note: Descriptions are shown in the official language in which they were submitted.


CA 02331014 2000-11-O1
WO 00/52849 Pt'TlUS00/05650
SYSTEM FOR PROVIDING SATELLITE
BANDWID?H ON DEMAND EMPLOYING
UP:LINK FRAME FORMATTING
FOR SMOtJTHING AND MITIGATING JITTER
AND Dl~l'AMICALLY CHANGING NUMBERS
OF CONTENTION AND DATA CHANNELS
This application claims the benefit of U.S. provisional application Serial No.
60/122,641, filed March 4, 1999.
Related subject matter is disclosed in co-pending provisional U.S. Patent
Application Serial No. ti0/156,806, entitled "Satellite System For Providing
Bandwidth-On-Demand, 1-iigh-Speed, Broadband Multimedia Services To Different
Types Of Z:Tsers With Different Delivery Options"; in co-pending provisional
U.S.
Patent Application Serial No. 60/157,096, entitled "Method And Apparatus For
Uplink Transmission In Broadband Multimedia Satellite System Having Different
Types Of Users And Delivery Options"; and in co-pending provisional U.S.
Patent
Application 60/156,845, entitled "Method And Apparatus For Downlink
Transmission In Broadban.d Multimedia Satellite System Having Different Types
Of Users And Delivery Options"; said applications all filed on September 30,
1999,
IS and the entire contents of each being expressly incorporated herein by
reference.
Field of the~nvention:
The invention relates to a system for providing bandwidth on demand for a
satellite uplink. More particularly, the invention relates to a bandwidth on
demand
system that. employs a dynamic number of contention channels with which
satellite
terminals can request bandwidth, on-board queuing of bandwidth requests and a
frame format that promates smoothing and mitigates fitter.

CA 02331014 2000-11-O1
WO 00/52849 PCTIUS00/05650
- 2 -
Ba ,found of the Invention,:
Bandwidth on demand (BOD) in a satellite communication is advantageous
because it makes more efficient use of the finite uplink resources of the
satellite and
correspondingly increases upli.nk capacity and useable bandwidth. Bandwidth
efficiency, and in particular uplink bandwidth efficiency, is important when
determining the profitability of a satellite communication system. Downlink
efficiency generally becomes an issue when uplink efficiency approaches 100
percent.
A number of BOD satellite communication systems have been proposed. In
a conventional BOD satellite system, a pre-assigned number of contention
channels
and data channels are configured by the system operator and are permanently
assigned until they are reconfigured. Such a design is disadvantageous because
the
demand for contention channels can change. A satellite communication system
using such a design makes less efficient use of the uplink bandwidth because
contention channels could be used for data traffic when the demand for
contention
channels is low.
Other conventional BOD-type communication systems support only
constant bit rate requests. User terminals requesting a constant bit rate are
allocated permanent portions of a data channel until the user terminal
requests that
ZO the allocation be terminated. A user terminal needing uplink bandwidth to
send a
file therefore requests a certain bit rate, sends the file, and then sends a
de-allocation
message to terminate the allocation. This approach is disadvantageous because
of
the increased messaging to set-up and de-allocate temporary channels which
could
otherwise be used for less bursty type traffic.
Conventional bandwidth on demand communication systems generally
assign bandwidth in response to a bandwidth request via a single allocation.
Thus,
if the entire bandwidth request could not be satisfied, the user terminal
mould have
to make additional bandwidth requests to obtain an allocation for the
unsatisfied
portion of the previous bandwidth requests.

CA 02331014 2000-11-O1
WO 00/52849 PCTNS00/05650
- 3 -
A need therefore exists for a BOD communication system that efficiently
processes the allocation and de-allocation of various sized bit rate requests,
as well
as volume-type requests for- more bursry traffic. A BOD communication system
is
also needed to overcome the other disadvantages of conventional systems
described
above such as the dynamic: use of channels as either data channels or
contention
channels. A need also exists for a BOD communication system which packs uplink
data channels more efficiently to accommodate temporary bit rate requests,
that is,
volume requests for bursry traffic as well as constant bit rate requests and
provide
different grades of quality of service. A need also exists for a BOD
communication
system which generates a plurality of bandwidth allocations to satisfy a
bandwidth
request on a periodic basis rather than providing a requesting satellite
terminal with
whatever bandwidth is avaiilable at the moment and requiring the satellite
terminal
to re-request the allocated portion of the bandwidth request.
IS Summary of the Invention:
The above-mentioned disadvantages of BOD communication systems are
overcome and a number of advantages are realized by the satellite
communication
system of the present invention. A satellite payload operates in conjunction
with
satellite terminals to dynamically use uplink channels as either contention
channels
or data channels. The number of contention channels increases as data channel
usage decreases, allowing more data channels during peak demands for uplink
bandwidth.
In accordance with an aspect of the present invention, the satellite terminals
are programmed to trans:~it rate requests or volume requests to the satellite
payload. The satellite payload processes bandwidth requests and assigns slots
in
uplink frames to satellite terminals via a downlink cell cast.
. In accordance with another aspect of the present invention, the satellite
terminals a:re programmed. to convert the timeslot allocations received via
the
satellite to other slot locations in a frame in accordance with one or more

CA 02331014 2000-11-O1
WO 00/52849 PCT/US00/05650
- 4 -
numbering schemes. The numbering schemes are selected to spread packets in
time
as evenly as possible within an uplink frame. Accordingly, the use of a
numbering
scheme limits fitter, reduces fragmentation and makes defragmentation less
complicated. Efficiency of processing on-board the satellite is also increased
because the satellite is processing packets in timeslots throughout each
uplink
frame.
In accordance with yet another aspect of the present invention, th.e satellite
payload queues bandwidth requests and makes partial allocations on a periodic
basis
until each request is completely satisfied.
A method of transmitting time division multiplexed data from a satellite
terminal to a satellite is provided comprising the steps of: (1) providing the
satellite
terminal with at least one command regarding when the satellite terminal is to
transmit data during a frame comprising a plurality of timeslots in a selected
sequential order, the command indicating at least one of the timeslots in
accordance
with a timeslot reordering scheme, the timeslot reordering scheme being
selected to
reorder the plurality of timeslots in the frame in a nonsequential order; and
(2)
convening the timeslots in t:he command to the respective timeslots in the
frame in
accordance with the selected sequential order. The timeslot reordering scheme
is
selected. to spread data from respective satellite terminals to different
timeslots
throughout at least one frame.
A bandwidth on demand satellite communication system is also provided
comprising: (1) a processor; (?) a plurality of queues connected to the
processor, the
processor being operable t~o write to and read from the queues; (3) a
receiving
device for receiving bandiwidth requests from satellite terminals; a.nd (4) a
transmitting; device for transmitting commands generated via the processor
relating
to channel allocations to the satellite terminals, the channel allocations
corresponding to timeslats in frames transmitted by the satellite terminals,
the
satellite terminals being configured to receive the channel allocations. The
processor is programmed to control the use of each of a plurality of channels
for

CA 02331014 2000-11-O1
WO OOI52849 PCT/USOOI05650
use by the satellite terminals. The channels are each useful as one of a
contention
channel and a data channel. The contention channels allow the satellite
terminals
to transmit the bandwidth requests. The data channels allow the satellite
terminals
to transmit satellite terminal user traffic. The processor stores the
bandwidth
requests using its queues, allocates slots within the plurality of channels in
accordance with the bandwidth requests and a bandwidth allocation algorithm,
and
transmits the channel allocations via the transmitting device for use by the
satellite
terminals in a subsequent specified uplink frame. The processor uses the
timeslots
not allocated to any of the satellite terminals as contention channels such
that the
number of contention channels changes dynamically, depending on demand for the
plurality of channels by the satellite terminals.
The processor uses queues for each channel for storing high and low
priority rate requests and high and low priority volume requests, and a
bandwidth
allocation algorithm for determining the preemption of the queues, and
allocation
priorities.
Rr;Pf T~Pt~ript~on of Drawir~,gs:
The various aspects, advantages and novel features of the present invention
will be more readily comprehended from the following detailed description when
read in conjunction with the appended drawings, in which:
Fig. 1 illustrates the satellite communication system configured for
bandwidth on demand, usage of multiple hi-gain spot beams and on-board packet
routing in accordance with an embodiment of the present invention;
Fig. 2 is a block diagram of a satellite payload and satellite terminals
constructed in accordance arith an embodiment of the present invention;
Fig. 3 illustrates uplink beams and downlink beams in a satellite
communication system in accordance with an embodiment of the present
mventron;

CA 02331014 2000-11-O1
wo ooiszsas PcrnJSOOiosbso
- 6 -
Fig. 4 illustrates uplink channelization in accordance with an embodiment
of the present invention;
Fig. 5 illustrates an uplink frame in system timing in accordance with an
embodiment of the present invention;
Fig. 6, 7, 8 and 9 illustrates a timeslot numbering scheme for uplink frames
in accordance with an embodiment of the present invention; and
Fig. 10 illustrates numbering of consecutive timeslots in a frame in
accordance with an embadi.ment of the present invention.
Throughout the drawing figures, like reference numerals will be understood
to refer to like parts and components.
Detailed Description Of The Preferred Embodiments:
1. Satellite System Overview
With reference to Fig. 1, the broadband multimedia satellite system 10 of
the present invention preferably employs one or more geosynchronous orbit
(GEO) satellites 20 and offers a wide range of user data rates and services on
a
bandwidth-on-demand (BOD) basis. The system 10 uses the latest generation of
high-power satellites, empi.oying on-board digital signal processing, multiple
high
gain spot beams, and on-board packet routing. The broadband multimedia
satellite
system 10 is preferably capable of supporting a maximum peak capacity of at
least
10 Gigabits per second (Gbps) of user data in a point-to-point (PTP)
transmission
mode. Delivery of services to users is provided via low-cost ultra-small-
aperture
terminals (IJSATs) hereinafter referred to as satellite terminals (STs) 40. An
ST 40
can be an end-user ST or a network ST (hiST), as shown in Fig. 2. The
broadband
multimedia satellite system 10 preferably operates in the 30/20 GHz Ka-band
spectrum allocated to Ka-brand Fixed Satellite Services (FSS). The system
capacity is
scalable by either the addition of satellites in adjacent orbital slots, or by
adding
satellites in the same orbital slot that are operated in a different frequency
band to
enable future system expansion.

CA 02331014 2000-11-O1
WO 00/51849 PCT/US00/05650
The broadband multimedia satellite system 10 is a packet-based transmission
system that enables the offering of bandwidth-on-demand (BOD) connections. in
support of voice, data, video, and other interactive services and applications
such as
interactive digital communications and high-speed Internet (HSI) access. The
combination of small terminal size with high throughput makes the broadband
multimedia satellite system useful for users ranging from large and medium-
sized
corporations and other organizations to small businesses, and consumer/SOHO
users. Raw data rates supported per single carrier are preferably 16.384 Mbps
(8E1),
2.048 Mbps (El), and 512 kbps (E1/4). A 128 kbps (E1/16) fall-back mode is
also
provided for terminals experiencing large rain fades and therefore provides
for
improved availability of lower-end terminal types. Interfaces into terrestrial
networks (e.g., the public switched telephone network (PSTN), cellular
networks
and corporate data networks) allow seamless integration into existing
communication system infrastructures.
A network operations control center (NOCC) 28 is provided, as shown in
Fig. 2, to perform a number of operations such as validating STs for
authorized use
of the system 10 resources .and to support scheduled connections and BOD
traffic.
The system 10 also suppotrts connectionless traffic that does not require NOCC
involvement to establish the call. For a connection-oriented call, a satellite
terminal (ST) communicates with the NOCC to receive tokens with which to
request uplink bandwidth from the payload. In this connection mode, the NOCC
can determine if sufficient bandwidth is available to meet ST requests
therefrom
For a connectionless call, an ST communicates with the payload 21. directly
without first obtaining authorization from the NOCC using a contention channel
request.
A fundamental difference between conventional FSS systems and the
broadband multimedia satellite system 10 is the regenerative nature of the
broadband multimedia satellite system payload 21 (Fig 2). In a conventional
FSS
satellite system, a single beam typically services the satellite coverage
area.

CA 02331014 2000-11-O1
WO 00/52849 PGT/US00/05650
- 8 -
Information transmitted by a central hub station is received by the satellite
and
broadcast to. all user terminals within the footprint. The user terminals
transmit
back to their intended destination through the satellite to the hub station.
Thus,
the satellite simply acts as a repeater. Mesh connections (i.e., user terminal-
to-user
terminal connections) must always be routed through the hub creating
additional
latency, due to the double hop required.
In the broadband multimedia satellite system 10 of the present invention,
however, the uplink uses approximately 112 spot beams, for example, that
provide
coverage for uplink cells 2 2 geographically distributed over the satellite
coverage
area, as shown in Fig. 1. 'The system 10 is provided with a satellite payload
21
which can combine inter-beam routing with a broadcast capability. Each uplink
cell 22 preferably operates on a fixed polarization with a four-cell reuse
pattern to
maximize capacity density. The downlink coverage sub-divides each uplink cell
22
into seven microcells 24a through 24g, as shown in Fig. 3. Downlink microcells
24
are capable of operating in either polarization, but operationally are
assigned a
single polarization, except in areas where there is a high inbound capacity
requirement. This enable:. the satellite 20 to take advantage of the peak gain
available in each downlink beam for point-to-point (1'TP) transmissions.
Additionally, the satellite 20 differs from conventional satellites in that
user
data or broadband multimedia packets are processed, and routed by the
satellite
payload 21. The satellite payload 21 therefore performs a significant amount
of the
switching and routing responsibilities previously relegated to the network
control
facility of the central hub station in conventional FSS systems.
A primary transmission function of the broadband multimedia satellite 20 is
not to broadcast a received broadband multimedia packet to the entire coverage
area. When operating in t:he PTP mode, the satellite payload 21 of the present
invention receives a packet from an uplink cell 22 and routes it only to the
downlink cc~11 24 in which a destination satellite terminal (ST) 40 is
located. The
payload 21 is also capable of replicating and routing a packet to up to forty

CA 02331014 2000-11-O1
WO 00/52849 PCT/US00/05650
_ g _
multiple downlink cells 2~4 for point-to-mufti-point (PMP) applications. The
satellite payload 21 can also support PMP applications without replication.
Each
ST 40 within a downlink rnicrocell 24 receives all broadband multimedia
packets
from the payload 21 and only processes those packets addressed to that
specific ST
40. For a system 10 operating in North America, for example, each satellite 20
has
the capability to transmit broadband multimedia packets to the continental
United
States (CONUS), Alaska, Hawaii, predefined parts of Canada and selected Latin
America cities. There are preferably two CONUS broadcast beams (one for each
polarization) that simultanE:ously cover all or a portion of the satellite
coverage
area. The system 10 is also configurable to transmit packets to all STs 40 in
a cell
22, that is, to cell cast.
The ;payload 21 on-board the satellite 20 comprises receive antennas for
receiving uplink beams (e.g., 106 beams) from various uplink cells 22, and
downconvercers (e.g., 120 Ka-band downconverters) for downconverting the
frequency of the received signals for the processing thereof by a switch
matrix (e.g.,
fast packet switch (FPS) 14). The FPS 14 connects a variable number of
demodulators, which are represented by the RF/Modem unit 18 in Fig. 2, to each
uplink cell 22 based on demand.
With continued reference to Fig. 2, the payload 21 preferably comprises
5376 E1, or the equivalent thereof, multi-rate demodulators for E1/4, E1 and
8E1
transmissions, for example, in accordance with the present invention. The FPS
14
switches the outputs of the demodulators among variable raze modulators (eg.,
24
modulators), which are also represented by the RF/Modem unit 18. The FPS 14 is
preferably a 10 gigabits per second (Gbps) asynchronous transfer mode or ATM-
type fast packet switch. P. payload control computer (PCC) 12 is provided to
perform BOD and payload rnanagement operations. Ka-band direct input/output
(I/O) modulators generate hopping beams (e.g., 442 Mbps hopping beams) that
are
time division multiplexed writh broadcast beams (e.g., two 147 Mbps 'broadcast
beams). ThE: dwell time per downlink cell 24 is dynamically determined based
on

CA 02331014 2000-11-O1
WO 00/52849 PCT/US00/05650
- 10 -
demand. A bypass configuration is provided to allow the use of the satellite
20 as a
bent-pipe transponder with coverage that can be adjusted. A transmit antenna
is
also provided which can generate, for example, 24 beams and is connected to
the
outputs of the modulators or the bypass circuit.
The broadband multimedia satellite system 10 of the present invention is
advantageous because it can achieve high link availability and low packet loss
rates.
For example, availability chat is typically higher than 99.7 % is realized, as
well as
end-to-end packet loss rates vtypically better than 1 in 106. Another
advantage of the
broadband multimedia satellite system 10 of the present invention is its
ability to
dynamically allocate resources to areas with higher demand. The satellite 20
provides for the flexible ;allocation of demodulator resources on the
satellite
payload 21 among the uplink cells 22. This flexibility allows the system 10
via the
NOCC 28 to have a capacity planning function to adapt to both relatively short
term (e.g., hours) and long term capacity requirement variations.
As shown in Fig. 4, the uplink utilizes an FDMA TDMA signal format with
each ST transmitting at an assigned frequenry, as indicated at 50, and
timeslot, as
indicated at 52. The uplink user data packets use one of three-supported burst
modes such as 521 kilo-symbols per second (ksps), 2.08 mega-symbols per second
(Msps), or 16.67 Msps channels, as indicated at 54, 56 and 58, respectively. A
total
of preferably 16 sub-bands per satellite 20 are used with eight sub-bands 60
per
polarization as indicated at :i0. One or more sub-bands 60 can be allocated to
each
uplink cell 22. A sub-band 60 preferably accommodates the transmission
capacity
24 E1 channels 56 or three 16.67 Msps channels 58 or 96 E1/4 channels 54,
depending on the burst mode. All sub-bands allocated to a particular uplink
cell 22
have the same polarization; therefore, STs 40 in that cell 22 are configured
for the
same polarization. Between zero and eight sub-bands 60 are allocated to each
uplink cell 22 per satellite .20 based on traffic expectations from STs in
that cell.
The maximum capacity than can be allocated to a given uplink cell ??,
therefore, is
preferably eight sub-bands 60, which corresponds to 192 E1 channels. To avoid

CA 02331014 2000-11-O1
WO 00/52849 PCT/US00/05650
- 11 -
interference, a given sub-band is not allocated to geographically adjacent
uplink
cells 22. _
Three basic downlinl: transmission modes are supported in accordance with
the present invention. A point-to-point (PTP) mode provides mesh connectivity
between the STs 40. The broadcast mode (e.g., a CONUS broadcast mode) is used
to broadcast information to STs 40 located within a selected geographic area
such as
the CONUS. The beacon :mode is used for system synchronization. Other uses
for the PTP mode include multicast or packet replication and transmission to
as
many as 40 locations, and cell cast (i.e., packet broadcast to groups of seven
downlink cells 24 or an uplink cell 22. The broadband multimedia satellite
downlink architecture has the capability of flexibly allocating the total
system
capacity between PTP and CONUS broadcast capacity. The capacity division
between the PTP mode and the broadcast mode is adjusted by changing the
percentage of time the downlink is in the PTP mode versus the broadcast mode.
~Xlith reference to the beacon and timing block 32 in Fig. 2, the beacon
mode facilitates system synchronization by transmitting a 1/3 rate binary
phase
shift keying (BPSK) pseudo random noise (PRN) sequence once per 3 ms downlink
frame using one of the downlink slots. The beacon uses a beam pattern designed
to
fit the entire coverage area of the system 10.
Each downlink frame is preferably 3 milliseconds (ms) divided into 138 slots
that are shared between PTP, CONUS, and beacon transmissions. Transmission
rates for the PTP and CONUS beams are 400 Mbps and 133 1/3 Mbps respectively.
PTP bursts each occupy one slot, while the 1/3 raze CONUS bursts use 3 slots.
Thus, the split between P'I'lP and CONUS traffic can be changed in increments
of
three slots.
The downlink preferably consists of a set of as many as 24 independent and
simultaneously moving high rate (400 Mbps) TDM carriers. Each TDM carrier
contains the user traffic for a given geographic area The set of 24 TDM
carriers can
be redirected every downlink slot time (2 L73 ~s) to service a different
downlink

CA 02331014 2000-11-O1
WO 00/52849 PCTNS00/05650
- 12 -
cell 24. Alternatively, the available power from the 24 TDM carriers is used
to
generate one of 2 TDM carriers serving a CONUS broadcast shaped beam aid
operating in a low rate mode of I33 1/3 Mbps (i.e, 400/3 Mbps).
To facilitate BOD access techniques, the broadband multimedia satellite 10
uses packetised transnussions. A broadband multimedia satellite packet
undergoes
a number of transformations as it is transmitted from an ST 40 through the
satellite
payload to another ST 40. ~X7ithin an ST 40, the user data is first segmented
into
broadband milltimedia satellite packets. Sets of multiple broadband multimedia
satellite packets, along with forward error correction, access control
security
signature, and synchronization data, are used to form uplink bursts. The
uplink
bursts are then transmitted to the satellite 20 at the assigned frequency and
timeslot,
as described above with reference to Fig. 4.
Upon receiving a burst, the satellite payload 21 decodes the broadband
multimedia satellite packets and corrects errors, if necessary. Then, the
packets are
checked for an access control signature to ensure that it was transmitted from
an
authorized ST 40. If the burst is valid (i.e., authenticated and error free),
the
packeu are extracted and raut:ed to the appropriate destination. A satellite
routing
field contained in the header o f each packet is used by the payload processor
21 to
determine to which downlink cell 24 the packets are routed. The packets are
encapsulated into a downlink TDM burst structure and transmitted on the
downlink
The destination ST 40 processes all downlink packets in the burst addressed
to its cell 24 and extracts broadband multimedia satellite packets. The ST
examines
the addressing information within each packet and determines whether the
packet
should be processed further. If the packets are addressed to the destination
ST,
they are reassembled back into a packet of user data and forwarded to the user
application.
With reference to the beacon and timing unit 32, system synchronization is
maintained using the satellite beacon in conjunction with time of day (TOD)

CA 02331014 2000-11-O1
WO 00/52849 PCT/US00/05650
- 13 -
messages broadcast periodically by the spacecraft. The beacon allows both time
and frequency synchronization between the STs 40 and satellite payload 21.
Frequency alignment between the ST 40 and satellite payload (reference) is
derived
in the ST 40 from the recovered PN clock. Timing is generated from the 1.56
second beacon epoch. TOD is maintained on-board the satellite 20, and the
satellite distributes this message to all downlink microcells 24 in the first
half of the
beacon epoch. At the epoch boundary, each ST 40 updates its time of day with
the
new value.
Broadband multimedia satellite terminals (nodes) utilize the appropriate
type of carrier to support the data rate requirements of the application.
Through
commands by the NOCC 28, the satellite 20 can be configured to support the
desired burst mode on each uplink 22. The exact configuration and amount of
resources depends on the business environment and is re-configurable as the
business conditions dictate. Except for receive-only terminals, at a minimum,
all
STs 40 preferably support th~° 521 ksps burst mode.
As stated previously, the system 10 of the present invention supports
connectionless and connection-oriented calls. For a connection-oriented call,
an ST
40 communicates with the NOCC 28 to receive tokens with which to request
uplink bandwidth from the payload. In this connection mode, the NOCC 28 can
determine if sufficient bandwidth is available to meet ST requests therefrom
For a
connectionless call, an ST 40 communicates with the payload 21 directly
without
first obtaining authorization from the NOCC 28. The ST first sends an
contention
channel request to the payload for uplink bandwidth. The payload PCC 1.2 in
turn
sends an allocation to the S'C, as well as a power measurement to allow the ST
to
adjust uplink power. The payload 21 receives packet segments from the ST,
validates signatures provided therein, schedules packets for downlink
transmission
and then transmits them.'

CA 02331014 2000-11-O1
WO 00/52849 PCTNS00/05650
- 14 -
2. Uplink Frame Structure
As stated previously in connection with Fig. 4, the uplink frame structure
for the three razes of data channels (i.e., ~ 12 kbps, 2 Mbps, and 16 Mbps
channels
54, 56 and 58, respectively) preferably consists of a 96 ms frame 104 with 32
slots
106 of 3 ms each, as shown in Fig. 5. The fall-back mode discussed above
employs
eight slots per frame for I28 kbps channels, for example. STs can send 3 ms
bursts
of packets into each timeslot on each channel to be processed by the satellite
payload 21. The number of packets within a timeslot varies by rate. For
example,
a 3 ms burst contains two packets on a 512 kbps channel, eight packets on a 2
Mbps
channel, and 64 packets on a 16 Mbps channel. The present invention is
described
below with .reference to the 512 kbps (1/4 El) rate uplink. It is to be
understood
that the designs for the 2 Mbps (El) and 16 Mbps (8E1) uplinks are the same.
For data channels, t:he numbering of the slot locations in accordance with
the present invention is preferably as illustrated in Fig. 6. The frame is
depicted for
illustrative purposes as a matrix of 8 rows of 4 slots each. The sloe in a row
are
consecutive in ume, as area the respective rows. This numbering scheme allows
spreading of the slots 106 within a frame 104 more evenly in time for less
than full
rate users, thereby mitigatuig fitter and smoothing traffic across uplink
channels. A
plurality of different slot numbering patterns can be used to spread the
traffic load
evenly across the channels, as illustrated in Figs. 7, 8 and 9.
The STs 40 are programmed in accordance with the present invention to
convert slot numbers that are assigned pursuant to a numbering scheme (e.g.,
one
of the numbering schemes depicted in Figs. 6-9) to reduce fitter and provide
smoothing to consecutively numbered slots, as shown in Fig. 10. Such
conversion
permits packets sent using the assigned slots to arrive at the destination ST
in the
correct order. For example, if an ST 40 is assigned slots 0 through 3, the ST
transmits its packets in slots 0, 8, 16 and 24 per the numbering scheme
depicted in
Fig. 10. Accordingly, the transmitted slots are distributed throughout the
frame
104. The use of the number scheme allows for more simple commands to the

CA 02331014 2000-11-O1
WO 00/52849 PCTlUS00/05650
- 15 -
originating ST as to those slots it is to use. In other words, it is more
simple to say
that an ST can use the first consecutive four slots per the scheme in Fig. 6
than to
provide each slot number (i.e., slots 0, 8, 16 and 24) in a slot allocation
command.
The slot numbering scheme :is also advantageous because it prevents the uneven
use
of slot numbers across all channels for a frame, thereby promoting the
processing
of packets by the satellite substantially throughout the frame period,
regardless of
the traffic load or type. ~G'itlzout the use of such a numbering scheme, the
first part
of each frame period (i.e., slots 0-15) may be used more often than the slots
during
the later part of a frame period.
To smooth traffic across all channels during a 96 ms frame, four different
numbering schemes (e.g., Fi~;s. 6-9) are used, for example. Each channel is
assigned
one of the four patterns by the NOCC 28 when the channel is configured. The
NOCC 28 can assign the patterns to the channels such that, on average, the
number of packets transrniated in any 3 ms timeslot of the uplink frame is
appoxirnately equal to the number of packets transmitted in any other 3 ms
slot of
frame. The :~10CC, therefore, assigns one-fourth of the 16 Mbps channels to
each
pattern, one-fourth of the 2 lvlbps channels to each pattern, and so on.
3. Uplink Beams and Channels
The satellite 20 h~~s a plurality of uplink demodulators (e.g., 224
demodulators), as described above with reference to the RF/modem unit 18 of
Fig.
2. Each uplink demodulator preferably supports the equivalent of three 16 Mbps
channels 58. Each 16 Mbps channel can be configured as a single 16 Mbps
channel
58 or eight 2 Mbps channels 56, as shown in Fig. 4. If configured for eight 2
Mbps
channels, each of those can be configured as a single 2 Mbps channel 56 or
four 512
Kbps channels 54. Thus, the capacity of the satellite is 21,504 channels if
all are
configured as 512 Kbps chmnels 54. An uplink beam 22 preferably requires a
minimum of one uplink demodulator. For bandwidth control purposes, the set of

CA 02331014 2000-11-O1
WO 00/52849 PCT/US00/05650
- 16 -
channels processed by one demodulator in an uplink beam 22 is preferably
considered.
Two types of uplink channels are preferably used in the system 10, that is,
contention channels and data channels. A channel is configured as either a
contention channel or a data channel at any one time and not both at the same
time. In other words, uplink channels preferably operate in one of t:wo modes,
that is, as a contention channel or a reserved channel. The satellite payload
21
sends information packets by multicast to every ST in each uplink beam to
describe
the uplink channel configuration, including which channels are contention
channels and which channels are reserved channels. The contention channels
preferably operate at the 512 kbps rate.
When an ST uses a contention channel, the ST sends a 3 ms, two-packet
burst into a random timeslot on the channel, for example. If no other ST sends
a
burst to the same channel and timeslot, the satellite payload 21 is able to
process
and deliver the packets in the burst. If two or more STs transmit packets on
the
same channel and timeslot and a collision occurs, the payload 21 can process
and
deliver one burst, while the other burst is lost. It is also possible that the
payload
21 is not able to process a.nd deliver either burst. STs do not receive direct
confirmation from the satellite payload 21 that it has processed a contention
channel burst or that the burst has been lost. STs determine that data sent to
a
contention channel has been processed by waiting for a response from the
satellite
payload 21, ST or end user to which the packets were addressed.
STs can use contention channels either for control purposes to send packets
to the PCC 12 or a system. ST (SST) at the NOCC 28, or, if authorized, for
communication purposes to send user data packets to another ST. Some S 12 kbps
channels can be allocated for data packet contention use only, and other 512
kbps
channels can be allocated for either control or data contention bursts.
Contention channels are also used by the ST 40 for bandwidth allocation
requests to t:he BCP 14 in the satellite 20. Bandwidth allocations are made

CA 02331014 2000-11-O1
WO 00/52849 PCT/US00/05650
- 17 -
periodically by the BCP 14 based on the requests on its queues. After making
its
allocations, the BCP transfeo-s any totally unallocated data channels to
contention
channels. Allocations are packed into a downlink muiticast to all ST 40 in an
uplink beam, for example. 'this multicast or cell cast also indicates any
additional
contention c:ha.nnels (in addition to configured contention channels)
available to
the ST 40 in the beam 22 for a specified frame. The NOCC 28 preferably
configures a11. channels withiin all demodulators in all uplink beams as
follows: (1)
configures uplink rate; (2) configures the slot numbering scheme; and (3)
configures
the use of each channel (c:.g., supervisory contention, BOD contention, data
contention, data, or not av aillable).
Assuming the demodulator servicing an uplink beam 22 is configured as 96
channels 58 of rate 512 Kbps, the uplink channels within the beam 22 are used
as
follows. First, the highest numbered channels are configured as a selected
number
of contention channels. Data channels preferably start at the lowest numbered
channel. All channels except the configured contention channels are available
for
BOD allocation. Bandwidtih allocations or allocations are made by starting
with
the first data channel. Any unallocated data channels are transferred to
temporary
(i.e., temporary for one frame) contention channels.
In accordance with frequency reuse rules employed in the system 10, STs
transmit data. at near optimal power levels for a given atmospheric
degradation. An
uplink power control algorithm (ULPC) is employed by the STs and the satellite
payload 21 whereby STs receive feedback from the satellite to perform a closed
loop type of power control. When STs first request bandwidth, they are
provided
with an initial condition for the control loop, which may not be accurate, to
determine the initial power ~ or transmission. The bandwidth requests are sent
via a
contention channel. The U~L,PC algorithm provides different performance on the
contention channels than o~n the rate and volume channels. To address uplink
power inaccuracies, frequency use constraints are preferably used on content
channels. The type of interference that is a concern occurs when an ST sending

CA 02331014 2000-11-O1
WO 00/52849 PGTNS00/05650
- 18 -
data on a contention channel transmits at high power and interferes with an ST
sending data at an appropriate power level. By placing the contention channels-
of
nearby isolated cells to be cofrequency, additional interference that may
occur due
to content channels does not impact rate and volume traffic performance.
4. Rate Requests
Rate requests specify the number of slots 106 in each uplink frame 104 that
an ST 40 requires to meet the uplink demands for its connection-oriented
traffic. A
Rate request results in the allocation of a preferably constant number of
slots each
frame, which are distributed as evenly in time as possible, chat the ST can
use to
send packets at a constant rate. Each frame preferably has a maximum of 32
slots
(Fig. 5). A Rate request spy°_cifies from 1 to 32 slots per frame. A
full 16 Mbps, 2
Mbps, or 512 Kbps user requests all 32 slots. An 8 Mbps, 1 Mbps, or 256 Kbps
user
requests 16 slots per frame and so on. The requesting ST gets a constant
allocation
of that uplink capacity every frame until the request is cancelled by the ST
via a de-
allocation message to the satellite. Sending rate allocations every frame
permits the
PCC 12 to move rate allocation sloe within a channel or to another channel to
perform de-fragmentation of rate allocations. A Rate request has the following
information at a minimum: (1) an ST source address (e.g., ST source ID and
uplink
beam m); (2) the type of request (i.e., Rate request); (3) the number of slots
106 per
frame 104 required; (4) the channel rate (e.g., specify 512 kbps, 2.048 Mbps
or
16.384 Mbps or channel, slots, and so on) already on queue (if any); (5) the
priority
of the request; and (6) security information.
Rate requests are placed on data channels Q1 or Q2 within the memory of
BCP memory 16. The requesting ST 40 receives a periodic allocation (or
allocation) which specifies the channel, start location, and number of slots.
An ST
40 is assigned the same channel and start location on each allocation unless
it is
notified of a change in channel and/or location. Changes are necessary when a
ST

CA 02331014 2000-11-O1
WO 00/52849 PC'f/US00/05650
- 19 -
makes an additional request (Rate or Volume) and is moved to a nea~ channel
and/or location or during realignment for de-fragmentation.
Rate requests are queued to the first data channel until its capacity is
filled,
then to the second data channel, and so on. Rate requests are packed in this
manner to allow data channels with no Raze allocations and no Volume
allocations
to be transferred to contention channels.
Initial bandwidth requests for a Rate allocation are preferably only sent on a
contention channel; however, the message to de-allocate a Rate request can be,
and
is preferably sent within the Rate allocation being de-allocated. Rate
requests are
acknowledged by the BCP 16 in one of two ways, that is, a Rate allocated
message
or a Rate denied message. Rate release (or de-allocate) messages from the ST
40 are
acknowledged by the satellite 20. If the ST does not get a response to a Rate
request or Raze release within a selected period of time, it resends the
message. If
an ST receives a request aenied response to a Rate request, it retries no
earlier than
until a selected period of time has elapsed. Rate requests preferably must be
de-
allocated (released) by the S'r when it is no longer needed.
Rate requests can be increased or decreased by sending another Rate request
specifying a different number of slots per frame. This new request is sent
using an
allocation from the original Raze request. If the request can be granted, the
ST
receives an accepted message; otherwise, the ST receives a denial message. The
BCP
16 does not de-allocate the original Rate request until it has successfully
processed
the new Rate request.
An ST that has a rain fade, or otherwise does not receive the cell cast
message with the allocations, waits until it receives the next cell cast which
specifies
its allocation to start sending. An ST falling back or going forward to a
channel
with a different channel rate uses an original raze request, even if the ST
already has
an active rate on queue for another channel rate. The BCP 16 discards the
queued
rate when the fallback rate request is received.

CA 02331014 2000-11-O1
WO 00/52849 PCT/US00/05650
- 20 -
5. Volume Requests
Volume requests spea:fy the number of uplink slots an ST requires to send_a
specific number of packets t:o another ST. The requesting ST receives a period
allocation of one or many slots within a specific frame until the entire
number of
slots requested has been allocated. The system 10 of the present invention
acknowledges that there is some maximum total of uplink bandwidth used for
Rate
allocations at any one time, a.nd that a portion of the total uplink bandwidth
in an
uplink beam is available far Volume allocations for bursty packet-type
traffic. A
Volume allocation is used by an ST 40 to send one or many packets of data on
the
uplink in a single occurrence., although several such slot allocations may
occur in a
short period of time to send a file consisting of hundreds of packets (e.g.,
IP frames
segmented into packets).
A Volume request ha.s the following information at minimum: (1) an ST
source address; (2) type of request (i.e., Volume request); (3) the priority
of the
request (i.e., high or low); (4,i the number of slots requested; (5) the
channel rate;
(6) and an indication of whether this is a follow-up request to send
additional
packets received since the previous request.
An ST can use Volume requests to send large amounts of data on the uplink
and, by the use of follow-up requests, almost continuously send data for a
long
period of time. For example, initial Volume requests for uplink bandwidth are
made by sending a message on the uplink on a contention channel for a number
of
slots required to transmit packets. If the ST receives additional data before
the
initial request has been completely metered out, a "follow-up" volume request
is
made by sending an inband message using a slot allocation of the previous
request.
The follow-up request is far the number of slots required for packets for
which a
request has not been made, including the packet for the data displaced by the
follow-up request. The ST 4C) is provided with a follow-up request timer of
greater
duration than an initial contention request timer also provided therein. The
follow-up request timer is preferably equal to the allocation timer discussed
below.

CA 02331014 2000-11-O1
WO 00/52849 PCT/US00/05650
- 21 -
During periods where the ,spunk beam 22 is oversubscribed and there are a
number
of slots (i.e., a number greater than or equal to a configured threshold)
already on
queue for all data channels, the BCP 16 discards all follow-up requests. A bit
within the request indicates whether the request is a follow-up request.
In response to a Volume request, the BCP 16 either sends an allocation or
sends an acknowledgement in an multicast allocation or acknowledgement packet,
respectively, to the requesting ST within preferably a selected number of
milliseconds. If no response is received within this amount of time, the ST 40
can
re-request on a contention channel. An additional backoff algorithm is
provided
which increases the random time to send a re-request, based upon the number of
times it has been attempted. to minimize the likelihood chance of another
collision.
Acknowledgements are used to insure that the ST 40 receives a response, if
the request is accepted, within a selected number of milliseconds to reduce
the
number of re-requests on the contention channels. No acknowledgement is made
for follow-up requests since the ST uses the allocation timer value for follow-
up
requests and assumes it was received unless that timer expires.
An ST 40 receiving either an acknowledgement or the first allocation of a
mufti-allocation cancels its response timer and sets an allocation timer. This
timer
is restarted when each allocation is received. If it expires, the ST 40 sends
a new
request on a contention channel.
For volume requests, only one active request and one piggyback request is
preferably allowed in the BCP 16 at any one time per priority or destination.
Two
request Bas are available per request priority and as many as 126 different
destinations, for example. An ST can then send an original volume request
using
one of the request IDs, send a piggyback request using the other request ID,
and
continue sending piggybacl~; requests using alternate ones of the request IDs
until all
of its data is transmitted.
The BCP 16 in the satellite 20 places Volume requests on either the low or
high priority Volume queue. Volume requests remain on queue within the
satellite

CA 02331014 2000-11-O1
WO 00/52849 PCTIUS00/05650
- 22 -
20 until the bandwidth requested has been allocated completely or after a
configured time-out (e.g., using an allocation timer). _
The total number of Volume request entries on a channel's low and high
priority Volume queues varies based upon the total capacity available for
Volume
allocations, the number slots in each Volume request on queue, and latenry
requirements. The maximum number of requests on queue is configurable.
Volume requests are :>pread evenly among the available data channels, that
is, the first request is queued to the first available channel, the second
request to the
next available channel, and so on. Thus, if there are ten available channels,
and ten
volume requests are received within the same timefrarne, then theoretically
one
request is queued to each channel. The requests are essentially queued to
channels
on a round-robin basis.
Fairness is maintained among competing STs attempting to acquire uplink
bandwidth in a number of vvays. For example, a contention channel for original
Volume requests is used so that each ST has an essentially equal chance of
success.
During periods of moderately heavy traffic, follow-up requests from STS 40 are
discarded. This provides other STS 40 using the contention channel a better
chance
of a successful request. The ST, whose follow-up request has been discarded,
does
not send another request an the contention channel until its allocation timer
expires.
During periods of extremely heavy traffic (e.g., all queues at maximum), the
BCP 16 controls the number of re-requests on the contention channel by sending
an acknowledgement to requests received on the contention channel, and then by
discarding the request. The STs 40 do not make a re-request until the
allocation
timer expires.
6. ST Contention Channel Usage
An ST making a bandwidth request (Rate or Volume) on a contention
channel performs operations which will now be described. If the ST did not

CA 02331014 2000-11-O1
WO 00/52849 PCT/US00/05650
- 23 -
receive the BCP 16 cell cast: allocation message for the next frame (i.e., it
is not
aware of additional contention channels), the ST randomizes its bandwidth
request
over the number of slot locations specified by the configured contention
chapels
only. If this is one channel (i.e. the highest numbered channel in an uplink
beam),
then the ST picks a slot location from among the 32 slot locations in that
channel.
If the ST has received a BC~P cell cast indicating temporary additional
contention
channels for the next frame, it randomizes a BOD request over the total slots
in the
configured and temporary contention channels.
7. Satellite Request Queues
As discussed above, t:he satellite has a set of queues for bandwidth requests.
Each uplink channel, except for configured contention channels, preferably has
four queues. A Q1 queue is provided for high priority Rate requests. The total
of
Q 1 requests on queue cannot exceed the capacity of the channel. Thus, one 512
Kbps user, two 256 Kbps users, and so on, can be on this queue. These requests
get
an allocation every frame equal to the number of slots per frame in the Rate
request. Requests on this queue are not preempted by any other request.
A Q2 queue is provided for low priority rate requests. The total o.f Q1 and
Q2 on queue cannot exceed the capacity of the channel. These requests get an
allocation every frame equal to the number of slots per frame in the Rate
request.
Requests on queue Q2 can be preempted by a new high priority Rate request and
removed from the queue and either discarded or moved to another channel's Q2
queue.
A Q3 queue is provided for Volume requests of high priority packet traffic.
ZS A request is for N number of slots. These requests are processed using
whatever
bandwidth is left over for t;he channel after the Q1 and Q2 requests have been
allocated. Requests are not queued to Q3 if the total of Q 1 and Q2 equals the
maximum capacity of the ~,:hannel.

CA 02331014 2000-11-O1
WO 00/52849 PGTNS00/05650
- 24 -
A Q4 queue is provided for volume requests of low priority packet traffic.
A request is for N number of slots. These requests are processed using
whateder
bandwidth is left over for the channel after the Q1, Q2, and Q3 requests have
been
allocated. Requests are not queued to Q4 if the total of Q1 and Q2 equals the
maximum capacity of the channel. A minimum bandwidth for Q4 can be
configured such that Q4 is processed before Q3 once every N frames. For
example, if a minimum bandwidth of 5% of Q4 is desired, then Q4 is processed
first every ta~enry frames.
8. Bandwidth Control l?rocessor (BCP) Uplink Allocation Algorithm
The BCP 16 in the satellite 20 makes Rate and Volume allocations a selected
number of times each frame (e.g., once per frame). The BCP makes bandwidth
allocations for the fourth frame in the future to allow for downlink queuing
and
space delay to the ST 40. The STs 40 are allocated the bandwidth required in
the
requests on queue. The total of the bandwidth required for Rate requests on a
channel's Q 1 and Q2 queue can equal, but does not exceed, the capacity of a
frame
for that channel.
The BCP 16 processing of Volume requests on Q3 and Q4, if any, will now
be described. Queues Q3 and Q4 are round robin queues, that is, requests on
these
queues each get an equal chance to be allocated bandwidth. Each time the BCP
16
makes a bandwidth allocation for a request on queue Q3 or Q4, the BCP moves to
the next request on queue for the next allocation, and so on. The BCP starts
with
the queue Q3 and only processes the queue Q4 if there is available bandwidth
and
no entries on the queue Q3 unless a minimum bandwidth is configured for Q4, in
which case Q4 is first processed. The BCP attempts to allocate the entire
unallocated portion of a frame (i.e., a maximum of 32 slots) to the next ST on
the
queues Q3 or Q4 (i.e., queue Q3 is not used). If the ST's request is equal to,
or
more than, the number of unallocated slots in the channel, the ST is assigned
all
unallocated slots; otherwise it is allocated less slots. If the ST is not
allocated all

CA 02331014 2000-11-O1
WO 00/52849 PCT/US00/05650
- 25 -
unallocated slots, the second. ST on queue is allocated bandwidth, and so on,
until
all the slots are allocated or there are no more requests. The BCP decrements
the
number of slots allocated from the number requested for the ST or ST's that
were
allocated slots and moves ita pointer to the next ST on queue when processing
resumes. If an ST's allocation depletes the requested slots, the request is
removed
from the queue and discarded. Each Volume request on queue has a time stamp of
the last time the request received an allocation. It this time exceeds the
allocation
timer value used by the ST the request is discarded.
9. Downlink Cells and 13CP Cell cast Messages
The BCP 16 merges all the allocations for an uplink beam 22 into one or
more packets. and uses a cell cast to the center sub-cell of the downlink cell
24
which corresponds to the uplink beam 22 to send the slot allocations to the ST
40
in the beam 22. Each upl.ink beam 22 has a corresponding downlink cell 24
consisting of 7 sub-cells 24a through 24g. A downlink burst is, by way of an
example, equal to one slot of twelve packets. At some interval, the downlink
process takes twelve packets, or fewer packets if there are not twelve packets
on
queue, from a downlink cell's queue, points to the center sub-cell 24 and
transmits
the cell cast burst to each sub-cell in an uplink beam.
The BCP 16 in the satellite 20 transmits different information every frame
in a cell cast message to all STs 40 within an uplink beam 22 that are also in
the
same downlink cell 24a, 246, 24c, 24d, 24e, 24f or 24g. For example, the
information in every frame preferably includes: (1) rate allocation or denial
messages in response to Rate requests; (2) acknowledgements to Volume requests
received via contention ch;~nnels; (3) slot allocations, in response to Rate
and
Volume requests, for a speci:Eied frame in the future; and (4) the number and
carrier
of the temporary additional contention channels available for a specified
frame in
the future. The cell cast information described above is packed into one
downlink

CA 02331014 2000-11-O1
WO 00/52849 PCT/US00/05650
- 26 -
packet, or multiple packets if necessary, and sent via a cell cast address to
be
received by all the ST 40 within a downlink cell.
10. BCP Allocations
The BCP packs all allocations destined for the ST that have allocations in
the same downlink beam 24 into one or more cell cast messages. The common
portion of the message contains the uplink frame for which the allocations
apply
and other information used by all STs 40. The allocation portion of the
message
preferably has three sections, that is, temporary contention channels, Rate
allocations, and Volume allocations.
The Rate allocation section contains individual allocations with preferably
the following information: (~'~) uplink channel; (2) slot start location
within the
frame (i.e., one of slots 0 - 31); (3) the number of contiguous slots less 1;
(4)
priority; and (5) slot numbering pattern. The volume allocation section
contains
IS individual allocations with preferably the following information: (1) ST
source
address; (2) uplink channel; (3) burst start location (i.e., one of slots 0 -
31); (4) the
number of contiguous slots :minus 1; (5) an indication of whether it is the
last
allocation of request; (6) priority (i.e., high or low); and (7) slot
numbering pattern.
11. Broadcast Message Protocol
BOD requires that the ST 40 and the satellite 20 have a message exchange
and event timers to stay synchronized. The protocol for Rate request will now
be
described. First, the ST 40 sends a Rate request on a contention channel and
starts
its response timer. If the satel:Lite 20 receives the request, it sends either
an accepted
or denied response. If the ST 40 receives an accepted response, the Rate is on
queue
in the satellite 20. If the ST 40 receives a denied response from the
satellite 20, the
ST starts its 750ms re-request timer and sends another Rate request when the
re-
request timer expires. If the ST response timer expires, the ST sends another
Rate
request immediately and starts its response timer.

CA 02331014 2000-11-O1
WO 00/52849 PCT/US00/05650
- 27 -
The protocol for Rate de-allocations will now be described. The ST 40
sends a Rate de-allocation message, using the latest allocation received for
the Rate,
and starts its response timer. If the satellite 20 receives the message, the
satellite
sends a de-allocated response. If the ST 40 does not receive a de-allocated
message,
its response timer expires and it sends another Rate de-allocation message to
the
satellite, using the latest allocation received for the Rate. The ST also
starts its
response umer.
The protocol for Volume requests will now be described. The ST sends a
Voltame request on a contention channel and starts its response timer. If the
satellite 20 receives and accepts the request it sends either an
acknowledgement or
an allocation to the ST. If the ST 40 receives the acknowledgement or
allocation,
and the allocation was not for the total slots requested, the ST starts its
allocation
timer. If th.e ST receives neither an acknowledgement nor an allocation before
its
response timer expires, it sends another Volume request and starts its
response
timer. Each time the ST receives an allocation for its request, and it is not
the last
allocation of the request, i.t restarts its allocation timer. If the
allocation timer
expires and the ST has more packets to send, the ST sends another Volume
request
on a contention channel and starts its response timer. When the ST receives
its last
allocation of a request and it has more packets to send, it uses one of the
slots in the
allocation to send a follow-up request for additional slots and starts its
allocation
umer.
12. Uplink Frame Fragmentation
The BCP 16 looks upon a frame as 32 consecutive slots. As stated
previously, a slot numbering scheme is preferably used as described with
reference
to Figs. 6-9. Thus, when assigning the Rate requests for a channel, the BCP
gives
the first request on queue the first consecutive slots in a frame starting
with slot 0.
The second Rate request on queue is assigned consecutive slots starting from
the
last slot of the first request, and so on, until all Rate requests are
assigned. The

CA 02331014 2000-11-O1
WO 00/52849 PCT/US00/05650
- 28 -
BCP performs a similar process with volume requests. The first volume request
on
queue is given as many of tike 32 consecutive slots in the frame being
allocated as
are available and it can use, then the next volume request on queue is
assigned the
next consecutive slots, and s;o on. This almost completely eliminates the need
to
perform de-fragmentation on a frame. A channel with four 128K Rate allocations
is automatically de-fragmented when any request is released (i.e., de-
allocated), and
the remaining Rate requests are allocated when the allocations are made for
the
next frame.
13. Bandwidth Allocatior.~s
The Bandwidth Control (BC) Algorithm makes allocations once per frame
for the uplink frame that is approximately 2 'h frames in the future. It
processes
each uplink beam and makes allocations for requests on queue in the following
sequence: (1) Rate Allocations; (2) High Priority Volume Allocations; and (3)
Low
Priority Volume Allocations.
The BCP 16 lookahead for volume allocations is one frame rather than
allocating several frames in adivance, say 10 frames. In an oversubscribed
uplink, no
matter how many advance :frames are used, the result is at most one available
unallocated frame at any one time. The first request received gets allocated
all 10
frames in the lookahead. If in the next frame another request is received, 9
of the
10 lookahead frames have already been allocated in the previous frame. Thus,
the
second request is only given the tenth frame, and so on. In a fully loaded
system,
nothing is allocated on a per frame basis other than the farthest frame in the
future
in the lookahead. Thus, it is advantageous to have small lookahead. A small
lookahead interval is easier to manage, and handles priorities better, among
other
benefits. In this system 10, a two frame lookahead can be used, instead of an
optimal one frame lookahead, t:o limit the allocations on the downlink.

CA 02331014 2000-11-O1
WO 00/52849 PCTNS00/05650
- 29 -
The BCP 16 preferably queues the volume requests and sends out many
allocations, instead of giving the requesting ST 40 what is available at that
moment,
and allowing the ST to re-request for the unallocated portion of the request.
Assuming an oversubscribed uplink with one frame to allocate at any point in
time,
not queuing causes a significant increase in requests since only a small
portion of
each request can be allocated at the instant the request arrives. This either
overburdens the contention channels (i.e., if there are no follow-up requests)
or
decreases data bandwidth by displacing data with follow-up requests. It is
more
efficient to queue volume requests, with several others, use a round robin
allocation
scheme to mete out allocations to everyone on queue, thereby satisfying all
ST's
with an allocation every 400 - 500 ms or so until the entire requests are
satisfied.
Another advantage of the present invention is the fairness of follow-up
requests to ST's making a:~loha requests when the number of contention
channels
becomes reduced due to hE~avy packet load. In an oversubscribed uplink, the
BCP
16 attempts to fill the upli.nk and be fair to competing ST at the same time.
The
BCP 16 ignores follow-uF~ requests if there are more than a selected number of
requests on queue already. The sender of the follow-up request then waits
until the
allocation timer expires to send a new aloha request.
Although the present invention has been described with reference to a
preferred embodiment thereof, it will be understood that the invention is not
limited
to the details thereof. Various modifications and substitutions have been
suggested in
the foregoing description, and others will occur to those of ordinary skill in
the art.
All such substitutions are intended to be embraced within the scope of the
invention
as defined in the appended claims.

Representative Drawing
A single figure which represents the drawing illustrating the invention.
Administrative Status

2024-08-01:As part of the Next Generation Patents (NGP) transition, the Canadian Patents Database (CPD) now contains a more detailed Event History, which replicates the Event Log of our new back-office solution.

Please note that "Inactive:" events refers to events no longer in use in our new back-office solution.

For a clearer understanding of the status of the application/patent presented on this page, the site Disclaimer , as well as the definitions for Patent , Event History , Maintenance Fee  and Payment History  should be consulted.

Event History

Description Date
Inactive: IPC from MCD 2006-03-12
Application Not Reinstated by Deadline 2005-04-21
Inactive: Dead - No reply to s.29 Rules requisition 2005-04-21
Deemed Abandoned - Failure to Respond to Maintenance Fee Notice 2005-03-03
Inactive: Abandoned - No reply to s.29 Rules requisition 2004-04-21
Inactive: Abandoned - No reply to s.30(2) Rules requisition 2004-04-21
Inactive: S.30(2) Rules - Examiner requisition 2003-10-21
Inactive: S.29 Rules - Examiner requisition 2003-10-21
Amendment Received - Voluntary Amendment 2001-07-26
Inactive: Cover page published 2001-03-06
Inactive: First IPC assigned 2001-02-27
Letter Sent 2001-02-15
Inactive: Acknowledgment of national entry - RFE 2001-02-15
Application Received - PCT 2001-02-14
All Requirements for Examination Determined Compliant 2000-11-01
Request for Examination Requirements Determined Compliant 2000-11-01
Application Published (Open to Public Inspection) 2000-09-08

Abandonment History

Abandonment Date Reason Reinstatement Date
2005-03-03

Maintenance Fee

The last payment was received on 2004-03-03

Note : If the full payment has not been received on or before the date indicated, a further fee may be required which may be one of the following

  • the reinstatement fee;
  • the late payment fee; or
  • additional fee to reverse deemed expiry.

Patent fees are adjusted on the 1st of January every year. The amounts above are the current amounts if received by December 31 of the current year.
Please refer to the CIPO Patent Fees web page to see all current fee amounts.

Fee History

Fee Type Anniversary Year Due Date Paid Date
Basic national fee - standard 2000-11-01
Registration of a document 2000-11-01
Request for examination - standard 2000-11-01
MF (application, 2nd anniv.) - standard 02 2002-03-04 2002-02-27
MF (application, 3rd anniv.) - standard 03 2003-03-03 2003-02-18
MF (application, 4th anniv.) - standard 04 2004-03-03 2004-03-03
Owners on Record

Note: Records showing the ownership history in alphabetical order.

Current Owners on Record
HUGHES ELECTRONICS CORPORATION
Past Owners on Record
ROBERT JEFF HEATH
Past Owners that do not appear in the "Owners on Record" listing will appear in other documentation within the application.
Documents

To view selected files, please enter reCAPTCHA code :



To view images, click a link in the Document Description column. To download the documents, select one or more checkboxes in the first column and then click the "Download Selected in PDF format (Zip Archive)" or the "Download Selected as Single PDF" button.

List of published and non-published patent-specific documents on the CPD .

If you have any difficulty accessing content, you can call the Client Service Centre at 1-866-997-1936 or send them an e-mail at CIPO Client Service Centre.


Document
Description 
Date
(yyyy-mm-dd) 
Number of pages   Size of Image (KB) 
Representative drawing 2001-03-05 1 16
Description 2000-10-31 29 1,377
Description 2001-07-25 30 1,396
Drawings 2000-10-31 6 213
Abstract 2000-10-31 1 69
Claims 2000-10-31 6 221
Claims 2001-07-25 5 226
Notice of National Entry 2001-02-14 1 203
Courtesy - Certificate of registration (related document(s)) 2001-02-14 1 113
Reminder of maintenance fee due 2001-11-05 1 112
Courtesy - Abandonment Letter (R30(2)) 2004-06-29 1 166
Courtesy - Abandonment Letter (R29) 2004-06-29 1 166
Courtesy - Abandonment Letter (Maintenance Fee) 2005-04-27 1 174
PCT 2000-10-31 4 127