JPS632510B2 - - Google Patents
Info
- Publication number
- JPS632510B2 JPS632510B2 JP11928482A JP11928482A JPS632510B2 JP S632510 B2 JPS632510 B2 JP S632510B2 JP 11928482 A JP11928482 A JP 11928482A JP 11928482 A JP11928482 A JP 11928482A JP S632510 B2 JPS632510 B2 JP S632510B2
- Authority
- JP
- Japan
- Prior art keywords
- slots
- reservation
- data
- cycle
- slot
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired
Links
- 238000000034 method Methods 0.000 claims description 15
- 238000010586 diagram Methods 0.000 description 4
- 230000005540 biological transmission Effects 0.000 description 3
- 238000004904 shortening Methods 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04J—MULTIPLEX COMMUNICATION
- H04J3/00—Time-division multiplex systems
- H04J3/17—Time-division multiplex systems in which the transmission channel allotted to a first user may be taken away and re-allotted to a second user if the first user becomes inactive, e.g. TASI
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Time-Division Multiplex Systems (AREA)
- Radio Relay Systems (AREA)
Description
【発明の詳細な説明】
この発明は複数の地球局が通信衛星を共用して
効率よく通信を行うためのアクセス方式に関する
ものである。DETAILED DESCRIPTION OF THE INVENTION The present invention relates to an access method for efficiently communicating with a plurality of earth stations by sharing a communication satellite.
衛星通信システムの構成図を第1図に示す。第
1図において、1は通信衛星、2a,2b,2c
は地球局A,B,Cを示している。地球局A(2
a),B(2b),C(2c)は同一の衛星回線を用
いて、データを一定長以下のパケツトと呼ばれる
単位に区切り、これに宛先情報を付与し、電波に
乗せて送信する。 Figure 1 shows the configuration of the satellite communication system. In Figure 1, 1 is a communication satellite, 2a, 2b, 2c
indicates earth stations A, B, and C. Earth station A (2
A), B (2b), and C (2c) use the same satellite line to divide data into units called packets of a certain length or less, add destination information to them, and transmit them on radio waves.
電波は1パケツト分連続したバーストとなつて
通信衛星1に進み、通信衛星1はこのバーストを
受信して周波数変換および増幅し、地上に送り返
す。地球局A(2a),B(2b),C(2c)はバ
ーストを受信し、宛先情報により自局宛のバース
トを取込み、他局宛のバーストは棄却する。この
ようにして地球局間で通信衛星1を経由した通信
が行われるが、バーストの送信において、複数の
地球局が、勝手にバーストを送信すると、バース
ト間の衝突が生じ、地球局は正しく受信できなく
なる。そこでこのようなバーストの衝突を防ぐア
クセス方式の一つとして従来以下に説明する予約
方式が用いられている。 The radio wave travels to the communication satellite 1 as a continuous burst of one packet, and the communication satellite 1 receives this burst, converts and amplifies the frequency, and sends it back to the ground. Earth stations A (2a), B (2b), and C (2c) receive the bursts, and according to the destination information, they take in the bursts addressed to themselves, and reject the bursts addressed to other stations. In this way, communication is performed between the earth stations via the communication satellite 1, but when multiple earth stations transmit bursts without permission, a collision occurs between the bursts, and the earth station receives the data correctly. become unable. Therefore, as one of the access methods to prevent such burst collisions, a reservation method, which will be described below, has conventionally been used.
第2図は従来の予約方式の動作を示しており、
3は地球局の送信時点、4は地球局の受信時点、
5は通信衛星1の受信時点、6はサイクル、7は
スロツト、8はデータ領域、9は予約領域、10
は小スロツト、11a,11b,11c,11d
はパケツトP1,P2,P3,P4、t1〜t7
は時刻を示している。 Figure 2 shows the operation of the conventional reservation system.
3 is the time of transmission from the earth station, 4 is the time of reception from the earth station,
5 is the reception time of communication satellite 1, 6 is the cycle, 7 is the slot, 8 is the data area, 9 is the reserved area, 10
are small slots, 11a, 11b, 11c, 11d
are packets P1, P2, P3, P4, t1 to t7
indicates the time.
衛星回線は通信衛星1上で一つのバーストが十
分入る大きさのスロツト7と呼ばれる単位に時間
を分割して使用し、各地球局はバーストをこのス
ロツト7の中に入るように送信する。予約方式で
は一定数の連続したスロツト7を集めてサイクル
6を構成し、さらに1サイクル6はデータ領域8
と予約領域9に分けて使用する。以下の説明でデ
ータ領域8のスロツト7をデータスロツト、予約
領域9のスロツト7を予約スロツトと呼ぶ。予約
スロツトはさらに短かい小スロツト10に分割し
て使用する。第2図では1予約スロツトを2小ス
ロツト10に分割して用いる場合を示している。
これから説明する予約方式ではすべての地球局に
予め小スロツト10が一つ固定的に割当てられて
いるものとする。 The satellite line is used by dividing the time into units called slots 7 on the communication satellite 1 that are large enough to accommodate one burst, and each earth station transmits a burst so that it fits into each slot 7. In the reservation method, a fixed number of consecutive slots 7 are collected to form a cycle 6, and one cycle 6 is a data area 8.
and a reserved area 9. In the following explanation, slot 7 in data area 8 will be referred to as a data slot, and slot 7 in reserved area 9 will be referred to as a reserved slot. The reserved slot is further divided into 10 smaller slots for use. FIG. 2 shows a case in which one reserved slot is divided into two small slots 10.
In the reservation system to be described from now on, it is assumed that one small slot 10 is fixedly allocated in advance to all earth stations.
通信はサイクル6内のデータスロツトを用いて
パケツトを含むバーストを送信することにより行
われるが、予約方式ではデータスロツトは予約し
なければ使用できない。第2図において時刻t1
で地球局B(2b)にパケツトP1(11a),P
2(11b),P3(11c),P4(11d)が
発生したとすると、地球局B(2b)は時刻t2
で第iサイクルの予約領域内の自局に固定的に割
当てられた小スロツト10を用いて4スロツト7
分の予約を送信する。予約はラウンドトリツプ伝
搬遅延時間後の時刻t3で全地球局により受信さ
れる。ここで説明する予約方式では第(i+1)
サイクルにおけるデータスロツトの割当ては第i
サイクルで受信された各地球局の予約から決定さ
れるものとし、また地球局は送信すべきパケツト
がなくても予約数がOの予約を送信するものとす
る。第iサイクルで受信された各地球局の予約の
うち実際にデータスロツトを予約したのが地球局
B(2b)のみとすると、地球局B(2b)には第
(i+1)サイクルのデータ領域8の最初から4
スロツト7が割当てられ、地球局B(2b)は時
刻t4,t5,t6,t7でパケツトP1(11
a),P2(11b),P3(11c),P4(1
1d)を含むバーストを送信する。このような従
来の予約方式では、第(i−1)サイクルの予約
が少ないために第iサイクルのデータスロツトが
割当てられないで残つたとしても、地球局B(2
b)は第iサイクルのこの予約されなかつたデー
タスロツトを利用できず、このデータスロツトが
無駄になる欠点、およびトラヒツクが少い場合で
も遅延が大きくなる欠点があつた。 Communication is performed by transmitting bursts containing packets using data slots in cycle 6, but in the reservation system, data slots cannot be used unless they are reserved. In Fig. 2, time t1
and sends packets P1 (11a) and P to earth station B (2b).
2 (11b), P3 (11c), and P4 (11d), earth station B (2b) is at time t2.
4 slots 7 using the small slot 10 fixedly assigned to the own station within the reserved area of the i-th cycle.
Submit your minute reservation. The reservation is received by the global station at time t3 after the round trip propagation delay time. In the reservation method explained here, the (i+1)th
The data slot assignment in the cycle is
It is assumed that the number of reservations is determined from the reservations of each earth station received in the cycle, and that the earth station transmits the reservation number O even if there are no packets to transmit. If earth station B (2b) is the only one that actually reserved a data slot among the reservations received from each earth station in the i-th cycle, then earth station B (2b) will have the data area 8 in the (i+1)th cycle. 4 from the beginning
Slot 7 is assigned, and earth station B (2b) receives packet P1 (11) at times t4, t5, t6, and t7.
a), P2 (11b), P3 (11c), P4 (1
1d). In such a conventional reservation method, even if the data slot of the i-th cycle remains unallocated because there are few reservations for the (i-1)th cycle, the data slot of the earth station B (2
In b), this unreserved data slot in the i-th cycle cannot be used, and this data slot is wasted, and the delay becomes large even when the traffic is small.
この発明はこのような従来の予約方式の欠点を
解決するため、予約されないで残つたデータスロ
ツトも各地球局に割当てておき、このデータスロ
ツトについては予め余計に予約していなくても使
用できることを特徴とし、その目的は予約されな
いで残つたデータスロツトを有効に利用して、ト
ラヒツクの少ない場合における予約方式の遅延を
減少させることにある。 In order to solve the drawbacks of the conventional reservation method, the present invention is characterized in that unreserved data slots are also allocated to each earth station, and these data slots can be used even if they are not reserved in advance. The purpose is to effectively utilize the remaining unreserved data slots to reduce the delay of the reservation system when traffic is low.
第3図はこの発明の実施例を示す図であつて、
t8〜t11は説明に用いた時刻を示している。
この発明に係る予約方式では割当てられないで残
つたデータスロツトについても定められた規則で
割当てておく。第3図で、第(i−1)サイクル
の予約領域9で受信された各地球局の予約がすべ
てOとすると、第iサイクルのすべてのデータス
ロツトは割当てられないで残るが、これを最初の
データスロツトからシステム内にある全地球局A
(2a),B(2b),C(2c)の間でたとえばA
→B→C→A→B→C→A→Bの順に各地球局に
割当てておく。この割当ては一例であつて、との
局から割当てを開始するかについては予約方式の
予約に対するスロツト割当てアルゴリズムに従つ
て決定すれば良い。このようにデータスロツトが
割当てられると、時刻t1で地球局B(2b)に
発生したパケツトP1(11a),P2(11
b),P3(11c),P4(11d)に対し、地
球局B(2b)は第iサイクルで3つのデータス
ロツトを利用でき、時刻t8,t9,t10でパ
ケツトP1(11a),P2(11b),P3(1
1c)を含むバーストを送信する。しかし第iサ
イクルでパケツトP4(11d)は送信すること
はできず、第iサイクルの予約領域9の自局の小
スロツト10で1スロツト7分の予約を送信す
る。この予約により次の第(i+1)サイクルの
データスロツトが割当てられ、時刻t11でパケ
ツトP4(11d)を含むバーストが送信され
る。以上がこの発明に係る予約方式の動作の説明
であり、予約されないデータスロツトを利用して
パケツトの発生から送信までの遅延が少くなるこ
とがわかる。ここで予約されないで残つたデータ
スロツトの割当てにおいて、割当ての対象とする
局をシステム内にあるすべての地球局としている
が、システム内で運転を中止している地球局があ
ると、データスロツトが無駄に割当てられる欠点
がある。 FIG. 3 is a diagram showing an embodiment of this invention,
t8 to t11 indicate times used in the explanation.
In the reservation system according to the present invention, data slots that remain unallocated are also allocated according to predetermined rules. In FIG. 3, if all the reservations of each earth station received in the reservation area 9 of the (i-1)th cycle are O, all the data slots of the i-th cycle remain unallocated, but this is Global stations A in the system from the data slot
For example, A between (2a), B(2b), and C(2c)
→B→C→A→B→C→A→B are assigned to each earth station in this order. This allocation is just an example, and whether or not to start allocation from the station may be determined in accordance with the slot allocation algorithm for reservation in the reservation system. When data slots are allocated in this way, packets P1 (11a) and P2 (11a) generated at earth station B (2b) at time t1 are
b), P3 (11c), and P4 (11d), earth station B (2b) can use three data slots in the i-th cycle, and sends packets P1 (11a), P2 (11b) at times t8, t9, and t10. ,P3(1
1c). However, packet P4 (11d) cannot be transmitted in the i-th cycle, and a reservation for 7 slots for one slot is transmitted in the small slot 10 of the local station in the reserved area 9 of the i-th cycle. With this reservation, a data slot for the next (i+1)th cycle is allocated, and a burst containing packet P4 (11d) is transmitted at time t11. The above is an explanation of the operation of the reservation system according to the present invention, and it can be seen that the delay from packet generation to transmission is reduced by using unreserved data slots. When allocating the data slots that remain unreserved, the target stations for allocation are all earth stations in the system, but if any earth station in the system is out of operation, the data slots will be wasted. There are drawbacks that can be assigned.
このような欠点が問題となる場合は、予約され
ないデータスロツトの割当てにおいて、すべての
地球局を対象とせず、一定期間前までの過去に予
約が受信された地球局のみを対象とするようにす
れば良い。例えば第iサイクルの予約されないデ
ータスロツトの割当て対象局を第(i−1)サイ
クルで予約が受信された局のみに限定しておくよ
うにする。 If this drawback is a problem, it is recommended that the allocation of unreserved data slots not be performed on all earth stations, but only on earth stations for which reservations have been received within a certain period of time. good. For example, the stations to which data slots that are not reserved in the i-th cycle are assigned are limited to only those stations for which reservations were received in the (i-1)-th cycle.
このようにすると、すこし処理が複雑になる
が、運転を中止している地球局に無駄にデータス
ロツトが割当てられることがなくなり、より有効
にデータスロツトが利用されるようになる。 Although this makes the processing a little more complicated, data slots will not be wasted and allocated to earth stations that are out of operation, and the data slots will be used more effectively.
なお、以上は通信衛星を利用した通信の場合に
ついて説明したが、この発明はこれに限らず、無
線パケツト通信や端末をマルチポイントに接続し
てパケツト通信を行う場合に使用してもよい。 Although the above description has been made regarding communication using a communication satellite, the present invention is not limited to this, and may be used for wireless packet communication or for packet communication by connecting terminals to multiple points.
さらに、説明では予約領域9の小スロツト10
が各地球局に固定的に割当てられ、地球局は送信
すべきパケツトがなくても予約数がOの予約を送
信し、データスロツトの割当ては一つ前のサイク
ル6で受信された予約のみから決定する予約方式
について説明したが、この発明はこれに限らず、
予約領域9の小スロツト10を競合して用いる予
約方式、送信すべきパケツトがない場合は予約を
送信しない予約方式、データスロツトの割当てを
過去からの予約を累積して行う予約方式、および
これらを組合わせた予約方式において用いても良
い。 Furthermore, in the explanation, the small slot 10 in the reserved area 9
is fixedly assigned to each earth station, and the earth station transmits reservations with O reservations even if there are no packets to transmit, and data slot allocation is determined only from the reservations received in the previous cycle 6. Although we have described a reservation method for
A reservation method that competes for the small slot 10 in the reservation area 9, a reservation method that does not send a reservation if there is no packet to be sent, a reservation method that allocates data slots by accumulating reservations from the past, and a combination of these methods. It may also be used in a combined reservation scheme.
このように本発明に係る予約方式では予約され
ないで残つたデータスロツトを有効に利用し、パ
ケツトが発生してから送信されるまでの遅延が短
かくなる効果を有する。 As described above, the reservation method according to the present invention makes effective use of the remaining data slots that have not been reserved, and has the effect of shortening the delay from when a packet is generated until it is sent.
第1図は衛星通信システムの構成を示す図、第
2図は従来の予約方式の動作を示す図、第3図は
本発明の実施例を示す図である。
図中、1は通信衛星、2a,2b,2cはそれ
ぞれ地球局A,B,C、3は地球局の送信時点、
4は地球局の受信時点、5は通信衛星1の受信時
点、6はサイクル、7はスロツト、8はデータ領
域、9は予約領域、10は小スロツト、11a,
11b,11c,11dはパケツトP1,P2,
P3,P4、t1〜t11は説明に用いた時刻を
示している。なお、図中、同一あるいは相当部分
には同一符号を付して示してある。
FIG. 1 is a diagram showing the configuration of a satellite communication system, FIG. 2 is a diagram showing the operation of a conventional reservation system, and FIG. 3 is a diagram showing an embodiment of the present invention. In the figure, 1 is a communication satellite, 2a, 2b, 2c are earth stations A, B, C, respectively, 3 is the transmission point of the earth station,
4 is the reception time of the earth station, 5 is the reception time of the communication satellite 1, 6 is the cycle, 7 is the slot, 8 is the data area, 9 is the reserved area, 10 is the small slot, 11a,
11b, 11c, 11d are packets P1, P2,
P3, P4, and t1 to t11 indicate times used in the explanation. In the drawings, the same or corresponding parts are denoted by the same reference numerals.
Claims (1)
分割し、連続した一定数のスロツトでサイクルを
構成し、1サイクル内のスロツトを予約スロツト
とデータスロツトに分け、通信局が予約スロツト
でデータスロツトの割当てを要求する予約を送信
し、受信された全体の予約からデータスロツトが
通信局に割当てられ、このデータスロツトでパケ
ツトと称する単位に区切られた情報が送信される
予約方式において、1サイクル内のデータスロツ
トの中で予約されないで残つたデータスロツトを
すべての地球局の間で順に割当てておくことを特
徴とする予約方式。 2 1サイクル内のデータスロツトの中で予約さ
れないで残つたデータスロツトを一定時間前まで
の過去に予約が受信されている地球局の間で順に
割当てておくことを特徴とする特許請求の範囲第
1項記載の予約方式。[Claims] 1. A single communication line is time-divided into slots of a fixed time length, a cycle is composed of a fixed number of continuous slots, the slots within one cycle are divided into reserved slots and data slots, and a communication station In a reservation system, a communication station transmits a reservation requesting the allocation of a data slot in a reservation slot, a data slot is allocated to a communication station based on the received overall reservation, and information divided into units called packets is transmitted using the data slot. A reservation method characterized by sequentially allocating unreserved data slots among all the earth stations within one cycle. 2. Claim 1, characterized in that data slots that remain unreserved within one cycle are sequentially allocated among earth stations for which reservations have been received in the past up to a certain period of time. Reservation method listed.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
JP11928482A JPS5911042A (en) | 1982-07-09 | 1982-07-09 | Reservation system |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
JP11928482A JPS5911042A (en) | 1982-07-09 | 1982-07-09 | Reservation system |
Publications (2)
Publication Number | Publication Date |
---|---|
JPS5911042A JPS5911042A (en) | 1984-01-20 |
JPS632510B2 true JPS632510B2 (en) | 1988-01-19 |
Family
ID=14757576
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
JP11928482A Granted JPS5911042A (en) | 1982-07-09 | 1982-07-09 | Reservation system |
Country Status (1)
Country | Link |
---|---|
JP (1) | JPS5911042A (en) |
Families Citing this family (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JPH084246B2 (en) * | 1985-11-22 | 1996-01-17 | 株式会社日立製作所 | Communication control method |
-
1982
- 1982-07-09 JP JP11928482A patent/JPS5911042A/en active Granted
Also Published As
Publication number | Publication date |
---|---|
JPS5911042A (en) | 1984-01-20 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US5295140A (en) | Method for multi-purpose utilization of resources in a communication system | |
US5278833A (en) | Method for providing reserved communication access using multiple random access resources | |
Tan et al. | A reservation random-access protocol for voice/data integrated spread-spectrum multiple-access systems | |
US6408009B1 (en) | Method and apparatus for detecting collisions on and controlling access to a communications channel | |
MXPA04007098A (en) | Allocating traffic channels in a communications system. | |
JPS632510B2 (en) | ||
JPS6322745B2 (en) | ||
KR102112182B1 (en) | APPARATUS AND METHOD FOR time slot allocation in a tactical data network | |
JPS6252499B2 (en) | ||
JPS632509B2 (en) | ||
JP2816852B2 (en) | Multiple packet communication method | |
JP2970259B2 (en) | Satellite line multiple access system | |
JPS632508B2 (en) | ||
JPH0362329B2 (en) | ||
Retnadhas | Satellite multiple access protocols | |
JPH0611140B2 (en) | Multi-access method | |
JPH04354221A (en) | Satellite packet communication system | |
Li | Performance evaluation of multiple-access networks: Introduction and issue overview | |
JP2590128B2 (en) | Satellite line access method | |
JPS63228832A (en) | Slot length variable communication system | |
JPH0380716A (en) | Satellite communication control system | |
JPH0210926A (en) | Radio communication system | |
JPH0771080B2 (en) | Random access method | |
JPS5888939A (en) | Satellite communication system with packet reservation | |
JP2817166B2 (en) | TDMA channel allocation method |