Method of controlling communication resources
25 claims: 9 independent, 16 dependent
- 1テレコミュニケーションシステムの通信リソースを制御する方法であって、通信リソースは、割り当て周期へと分割され、割り当て周期は、更に、少なくとも2つの異なるサイズのスロットへと分割することができ、スロットは、通信リソースの割り当て可能な最小単位であり、 接続をそれらの遅延要求に基づいて少なくとも2つの接続クラスに分割し、該少なくとも2つの接続クラスは、少なくとも、厳格な遅延要求をもつ第1の接続クラスおよびあまり厳格でない遅延要求をもつか又は遅延要求を全くもたない第2の接続クラスを含み、 各接続クラスにおける通信リソースに対する現在の必要性に関する情報を記憶し及び更新し、 通信リソースをスロットへ分割し、接続クラスに基づく通信リソースに対する現在の必要性に基づいてスロットを予約し、 回路交換通信リソースを上記第1の接続クラスの接続に割り当て、そして 各次々の割り当て周期中に、上記第2の接続クラス の接続 を含む他の接続に、パケット交換リソースを割り当てる、という段階を含むことを特徴とする方法。
- 2異なる送信方向に互いに独立して上記リソースを割り当てるという段階を更に含む請求項1に記載の方法。
- 3ベースステーションサブシステム(BSS)及び複数の移動ステーションを含む移動テレコミュニケーションシステムにおいて、 移動ステーションからベースステーションサブシステムへの最小送信遅延に対して厳格な要求をもつ接続に対する必要性の変化に応答して、必要なリソースの量を示す容量要求メッセージをベースステーションサブシステムへ送信し、そして 上記要求に応答して、ベースステーションサブシステムに、必要とされるリソースの量を指示する容量要求メッセージを送り、 上記要求に応答して、上記ベースステーションサブシステムは、該接続に回路交換通信リソースを割り当て、そして割り当てられたリソースを指示する容量割り当てメッセージを移動ステーションに送信することにより割り当てられたリソースを移動ステーションに通知する請求項1に記載の方法。
- 4ベースステーションサブシステム(BSS)及び複数の移動ステーションを含む移動テレコミュニケーションシステムにおいて、 ベースステーションサブシステムから移動ステーションへの最小送信遅延に対して厳格な要求をもつ接続に対する必要性の変化が決定されるのに応答して、ベースステーションサブシステムは、接続に回路交換通信リソースを割り当て、そして割り当てられたリソースを指示する容量割り当てメッセージを移動ステーションに送信することにより割り当てられたリソースを移動ステーションに通知する請求項1に記載の方法。
- 5送信遅延に対してあまり厳格な要求をもたない接続を、送信されるべきデータの量に基づいて少なくとも2つの接続サブクラスに更に分割し、そして送信されるべきデータ量が多い接続には、次々の割り当て周期に対して通信リソースの割り当てをシグナリングするときに使用される予約認識を割り当てる請求項1に記載の方法。
- 6ベースステーションサブシステム(BSS)及び複数の移動ステーションを含む移動テレコミュニケーションシステムにおいて、 送信遅延に対してあまり厳格な要求をもたない接続を、送信されるべきデータ量に基づいて少なくとも2つの接続サブクラスに更に分割し、 送信されるべき量が多い又は少ない接続サブクラスに対し、接続サブクラス特有のリソース割り当て方法を使用し、 移動ステーションからベースステーションサブシステムへ送信遅延に対してあまり厳格でない要求をもつ接続が必要とされるのに応答して、移動ステーションは、必要とされるリソースの量を示す容量要求メッセージをベースステーションサブシステムに送信し、 上記要求を受け取るのに応答して、ベースステーションサブシステムは、送信されるべき量が多い接続サブクラスに接続が属するか又は送信されるべき量が少ない接続サブクラスに接続が属するかを決定し、 送信されるべき量が多い接続サブクラスに接続が属することを決定するのに応答して、送信されるべき量が多い接続サブクラスに対して指定された割り当て方法を使用し、そして 送信されるべき量が少ない接続サブクラスに接続が属することを決定するのに応答して、送信されるべき量が少ない接続サブクラスに対して指定された割り当て方法を使用する請求項1に記載の方法。
- 7送信されるべき量が多い接続サブクラスに対して指定された割り当て方法は、接続へ予約認識を割り当て、そしてその割り当てられた予約認識を移動ステーションへ送信される割り当てメッセージにおいて移動ステーションに通知する請求項6に記載の方法。
- 8送信されるべき量が少ない接続サブクラスに対して指定された割り当て方法は、所与の量のデータを送信するに充分なリソースを接続に割り当て、そしてその割り当てられたリソースを移動ステーションに送信される割り当てメッセージにおいて移動ステーションに通知する請求項6に記載の方法。
- 9ベースステーションサブシステム(BSS)及び複数の移動ステーションを含む移動テレコミュニケーションシステムにおいて、 送信遅延に対してあまり厳格でない要求をもつ接続を、送信されるべきデータの量に基づいて少なくとも2つの接続サブクラスに更に分割し、 送信されるべき量が多い又は少ない接続サブクラスに対し、接続サブクラス特有のリソース割り当て方法を使用し、ベースステーションサブシステムから移動ステーションへ送信遅延に対してあまり厳格でない要求をもつ接続が必要とされることが決定されるのに応答して、ベースステーションサブシステムは、送信されるべき量の多い接続サブクラスに接続が属するか、又は送信されるべき量が少ない接続サブクラスに接続が属するかを決定し、そして 送信されるべき量の多い接続サブクラスに接続が属することを決定するのに応答して、送信されるべき量の多い接続サブクラスに対して特定された割り当て方法を使用し、そして送信されるべき量の少ない接続サブクラスに接続が属することを決定するのに応答して、送信されるべき量の少ない接続サブクラスに対して特定された割り当て方法を使用する請求項1に記載の方法。
- 10送信されるべき量の多い接続サブクラスに対して特定された割り当て方法は、接続に対して予約認識を割り当て、そしてその割り当てられた予約認識を移動ステーションへ送信される割り当てメッセージにおいて移動ステーションに通知することより成る請求項9に記載の方法。
- 11送信されるべき量の少ない接続サブクラスに対して特定された割り当て方法は、所与の量のデータを転送するに充分なリソースを接続に割り当てそしてその割り当てられたリソースを移動ステーションへ送信される割り当てメッセージにおいて移動ステーションに通知することより成る請求項9に記載の方法。
- 12ベースステーションサブシステム(BSS)及び複数の移動ステーションを含む移動テレコミュニケーションシステムであって、通信リソースが割り当て周期へと分割され、割り当て周期は、更に、少なくとも2つの異なるサイズのスロットへと分割することができ、スロットは、通信リソースの割り当て可能な最小単位であり、 接続を、それらの遅延要求に基づいて、厳格な遅延要求をもつ第1の接続クラスおよびあまり厳格でない遅延要求をもつか又は遅延要求を全くもたない第2の接続クラスを少なくとも含む少なくとも2つの接続クラスに分割するための第1の接続分割手段と、 上記第1の接続分割手段に応答して、異なる接続クラスにおける通信リソースに対する現在の必要性を決定するための決定手段と、 上記決定手段に応答して、物理的な無線リソースを、上記接続クラスに基づく上記通信リソースに対する現在の必要性に基づいてスロットへと分割するためのリソース分割手段と、 上記決定手段及びリソース分割手段に応答して、異なるクラスの 接続 に対して異なる形式のチャンネルを割り当てるための割り当て手段と、を備え、上記割り当て手段は、上記第1の接続クラスの接続に回路交換通信リソースを割り当て、各次々の割り当てに対して、上記割り当て手段は、上記第2の接続クラス の接続 を含む他の接続にパケット交換リソースを割り当てることを特徴とする移動テレコミュニケーションシステム。
- 13上記第1の接続分割手段に応答して、上記第2の接続クラスの接続を、送信されるべきデータの量に基づいて少なくとも2つの接続サブクラスに分割するための第2の接続分割手段を更に備え、そして 通信の必要性を決定する上記手段は、上記第1及び第2の接続分割手段に応答する請求項12に記載の移動テレコミュニケーションシステム。
- 14ベースステーションサブシステム(BSS)及び複数の移動ステーションを含む移動テレコミュニケーションシステムのベースステーションサブシステムであって、通信リソースが割り当て周期へと分割され、割り当て周期は、更に、少なくとも2つの異なるサイズのスロットへと分割することができ、スロットは、通信リソースの割り当て可能な最小単位であり、上記ベースステーションサブシステムは、 接続を、それらの遅延要求に基づいて、厳格な遅延要求をもつ第1の接続クラスおよびあまり厳格でない遅延要求をもつか又は遅延要求を全くもたない第2の接続クラスを少なくとも含む少なくとも2つの接続クラスに分割するための第1の接続分割手段と、 上記第1の接続分割手段に応答して、異なる接続クラスにおける通信リソースに対する現在の必要性を決定するための決定手段と、 上記決定手段に応答して、物理的な無線リソースを、上記接続クラスに基づく上記通信リソースに対する現在の必要性に基づいてスロットへと分割するためのリソース分割手段と、 上記決定手段及びリソース分割手段に応答して、異なるクラスの 接続 に対して異なる形式のチャンネルを割り当てるための割り当て手段と、を備え、上記割り当て手段は、上記第1の接続クラスの接続に回路交換通信リソースを割り当て、各次々の割り当てに対して、上記割り当て手段は、上記第2の接続クラス の接続 を含む他の接続にパケット交換リソースを割り当てることを特徴とするベースステーションサブシステム。
- 15上記ベースステーションサブシステムは、上記第1の接続分割手段に応答して、上記第2の接続クラスの接続を、送信されるべきデータの量に基づいて少なくとも2つの接続サブクラスに分割するための第2の接続分割手段を更に備え、そして 通信の必要性を決定する上記手段は、上記第1及び第2の接続分割手段に応答する請求項14に記載のベースステーションサブシステム。
- 16複数のベースステーション及びこれらベースステーションを制御するベースステーションコントローラより成るベースステーションサブシステムと、複数の移動ステーションとを備えた移動テレコミュニケーションシステム用のベースステーションコントローラであって、上記移動テレコミュニケーションシステムの通信リソースが割り当て周期へと分割され、割り当て周期は、更に、少なくとも2つの異なるサイズのスロットへと分割することができ、スロットは、通信リソースの割り当て可能な最小単位であり、上記ベースステーションコントローラは、 接続を、それらの遅延要求に基づいて、厳格な遅延要求をもつ第1の接続クラスおよびあまり厳格でない遅延要求をもつか又は遅延要求を全くもたない第2の接続クラスを少なくとも含む少なくとも2つの接続クラスに分割するための第1の接続分割手段と、 上記第1の接続分割手段に応答して、異なる接続クラスにおける通信リソースに対する現在の必要性を決定するための決定手段と、 上記決定手段に応答して、物理的な無線リソースを、上記接続クラスに基づく上記通信リソースに対する現在の必要性に基づいてスロットへと分割するためのリソース分割手段と、 上記決定手段及びリソース分割手段に応答して、異なるクラスの 接続 に対して異なる形式のチャンネルを割り当てるための割り当て手段と、を備え、上記割り当て手段は、上記第1の接続クラスの接続に回路交換通信リソースを割り当て、各次々の割り当てに対して、上記割り当て手段は、上記第2の接続クラス の接続 を含む他の接続にパケット交換リソースを割り当てることを特徴とするベースステーションコントローラ。
- 17上記第1の接続分割手段に応答して、上記第2の接続クラスの接続を、送信されるべきデータの量に基づいて少なくとも2つの接続サブクラスに分割するための第2の接続分割手段を更に備え、そして 通信の必要性を決定する上記手段は、上記第1及び第2の接続分割手段に応答する請求項16に記載のベースステーションコントローラ。
- 18ベースステーションサブシステム(BSS)及び複数の移動ステーションを含む移動テレコミュニケーションシステムの移動ステーションであって、通信リソースが割り当て周期へと分割され、割り当て周期は、更に、少なくとも2つの異なるサイズのスロットへと分割することができ、スロットは、通信リソースの割り当て可能な最小単位であり、上記移動ステーションは、 接続を、それらの遅延要求に基づいて、厳格な遅延要求をもつ第1の接続クラスおよびあまり厳格でない遅延要求をもつか又は遅延要求を全くもたない第2の接続クラスを少なくとも含む少なくとも2つの接続クラスに分割するための第1の接続分割手段と、 上記第1の接続分割手段に応答して、異なる接続 クラス に対 する リソース要求 を、ベースステーションであって、上記第1の接続クラスの接続に回路交換通信リソースを割り当て、上記第2の接続クラスの接続を含む他の接続にパケット交換通信リソースを割り当てるように構成されたベースステーションへ、送信 する要求手段と、を備えたことを特徴とする移動ステーション。
- 19上記第1の接続分割手段に応答して、上記第2の接続クラスの接続を、送信されるべきデータの量に基づいて少なくとも2つの接続サブクラスに分割するための第2の接続分割手段を更に備え る 請求項18に記載の移動ステーション。
- 20接続が確立されるとき接続に対するサービスのクオリティをネゴシエーションし、該ネゴシエーションされたサービスのクオリティに基づいて確立される接続に対する接続クラスを選択することを更に含む請求項1に記載の方法。
- 21テレコミュニケーションシステムの通信リソースを制御する方法であって、通信リソースは、割り当て周期へと分割され、割り当て周期は、更に、少なくとも2つの異なるサイズのスロットへと分割することができ、スロットは、通信リソースの割り当て可能な最小単位であり、 接続を、それらの送信遅延要求に基づいて、少なくとも2つの接続クラス、すなわち、少なくともリアルタイム接続のための第1の接続クラスおよび少なくとも非リアルタイム接続のための第2の接続クラスに分割し、 各接続クラスにおける通信リソースに対する現在の必要性に関する情報を記憶し及び更新し、 上記通信リソースに対する現在の必要性に基づいて上記通信リソースをスロットへ動的に分割し、 第1の接続クラスの接続に対して回路交換通信リソースを割り当て、 上記第2の接続クラスに属する接続に対して各次々の割り当て周期中に パケット交換 リソースを割り当てる、という段階を含むことを特徴とする方法。
- 22接続が確立されるとき接続に対するサービスのクオリティをネゴシエーションし、該ネゴシエーションされたサービスのクオリティに基づいて確立される接続に対する接続クラスを選択することを更に含む請求項21に記載の方法。
- 23テレコミュニケーションシステムの通信リソースを制御する方法であって、通信リソースは、割り当て周期へと分割され、割り当て周期は、更に、少なくとも2つの異なるサイズのスロットへと分割することができ、スロットは、通信リソースの割り当て可能な最小単位であり、 接続を、それらの送信遅延要求に基づいて、少なくとも2つの接続クラスに分割し、 各接続クラスにおける通信リソースに対する現在の必要性に関する情報を記憶し及び更新し、 上記通信リソースに対する現在の必要性に基づいて上記通信リソースをスロットへ動的に分割し、 第1の接続クラスの所与の接続に対して回路交換形式の割り当て機構を使用して少なくとも1つのスロットを割り当て、 第2の接続クラスの所与の接続に対して次々の割り当て周期においてスロットを割り当てるという段階を含み、上記第2の接続クラスは、遅延要求を全くもたないか又は上記第1の接続クラスによって必要とされるよりは厳格でない遅延要求をもつものであり、上記第1および第2の接続クラスの所与の接続は、それらの各接続において各割り当てられたスロットを使用することを特徴とする方法。
- 24接続が確立されるとき接続に対するサービスのクオリティをネゴシエーションし、該ネゴシエーションされたサービスのクオリティに基づいて確立される接続に対する接続クラスを選択することを更に含む請求項23に記載の方法。
- 25テレコミュニケーションシステムの通信リソースを制御する方法であって、通信リソースは、割り当て周期へと分割され、割り当て周期は、更に、少なくとも2つの異なるサイズのスロットへと分割することができ、スロットは、通信リソースの割り当て可能な最小単位であり、 接続を、それらの送信遅延要求に基づいて、少なくとも2つの接続クラス、すなわち、データパケットが送信側から送信されるまでの送信遅延が比較的に短いことが必要とされる接続に対する第1の接続クラスおよび該第1の接続クラスによって必要とされるよりは厳格でない送信遅延に対する要求をもつ接続に対する第2の接続クラスに分割し、 各接続クラスにおける通信リソースの現在の必要性に関する情報を記憶し及び更新し、 上記通信リソースに対する現在の必要性に基づいて上記通信リソースをスロットへ動的に分割し、 上記第1の接続クラスの所与の接続に対して回路交換形式の割り当て機構を使用して少なくとも1つのスロットを割り当て、 上記第2の接続クラスの所与の接続に対して次々の割り当て周期においてスロットを割り当てるという段階を含み、上記第1および第2の接続クラスの所与の接続は、それらの各接続において各割り当てられたスロットを使用することを特徴とする方法。
Independent claims25
65 paragraphs, as filed
The present invention relates to a method of controlling communication resources of a communication system, particularly a mobile telephone system.
BACKGROUND ART In communication systems such as mobile telephone systems, the system has a given amount of information transfer resources that can be used to establish a connection to system users. The different types of connections required by the user impose various demands on the quality of information transmission. For example, audio signals allow some transmission errors, but virtually no transmission delays. On the other hand, program files that should be transferred from one computer to another should not contain any transfer errors, but those transfers allow significant transmission delays.
[0003] Generally speaking, information transfer technology can be classified into a circuit switching method and a packet switching method. In a circuit exchange network, some continuous communication resource, which is deallocated only at the moment of disconnection of the user circuit, is allocated for the use of the connection during the connection establishment phase. In contrast, packet-switched network technology knows several different packet-switched communication protocols, the connections established between the terminal unit and the base station are not continuous, and the information varies in width. It is carried in the form of a packet with sequential transmission with a separation interval. Therefore, one advantage over circuit exchange networks is that the radio resources required for a given connection are not unnecessarily reserved in the event of a temporary pause in the transfer of information.
[0004] In a packet switching network, packets acting on information transfer of a large number of individual connections use the same communication resource capable of transmitting one packet at a time. As a result, packets must be queued for their assigned transmission positions in the packet transmission sequence, which results in greater transmission delays in the packet-switched network than in the circuit-switched network. Generally speaking, circuit-switched connections are effectively used for connections that require short transmission delays, such as voice signals, while packet-switched networks are suitable for connections that allow long transmission delays. ..
[0005] In order for different types of connections to work optimally, the system flexibly forms short-delay circuit-switched connections while maximizing the use of information transfer resources to activate packet-switched connections. Must have the ability of. One conventional system that can establish both circuit-switched and packet-switched connections is a GPRS (General Packet Radio Service) system that operates in connection with a GSM (Global System for Mobile Communications) system. Here, resources are permanently and dynamically allocated between the two systems, so the resources allocated to the GSM system are used to establish circuit-switched connections, and the resources of the GPRS system are packet-switched connections. Acts on. However, if the GSM system does not occupy the channel defined by the assigned time slot, for example due to silence intervals in voice communication, the unused capacity of the channel cannot be utilized by the GPRS system.
Finnish Patent Application No. FI964308, which has not yet been published on the filing date of the present invention, divides the resources of the radio communication channel between the base station and the terminal device into frames, and these frames into smaller units. It discloses a method of subdividing. Each frame has a two-dimensional structure. The first level of frame subdivision is time-based, which means that each frame is given a certain time span, which is further subdivided into consecutive time slots. In a preferred embodiment of the invention, each frame comprises a certain number of time slots, but the allocation of time slots varies from frame to frame. The second level of frame subdivision is based on time, frequency or code. If the second subdivision level is also time-based, then each time slot in the frame is further subdivided into smaller slots. If the second level of frame subdivision is frequency-based, then the entire frame may reserve a given frequency band, from which a narrow subband or frequency channel may be assigned for each time slot of the frame. it can. When the second level of frame subdivision execution is code-based, a number of mutually orthogonal codes are assigned to each time slot. Obviously, if necessary, the slots obtained by the division based on two of these subdivision variables can be subdivided into smaller allocation units based on the third subdivision variable. The smallest resource unit that can be allocated from a given frame is called a slot, and individual slots are always allocated for a single use of a given connection.
[0007] FIG. 1 shows a deformation of a two-dimensional frame by a known technique. As mentioned above, the first dimension of the frame is time, while the other dimension is time, frequency or code. In the case of FIG. 1, the second subdivision of the frame is time-based or code-based. The size of the frame in both dimensions must be determined so that the frame meets all other specifications of the system. In the illustrated example, the width of the frame on the time scale is about 4.615 ms, which is temporally divided into eight time slots, where each time slot reference number 15 has a width of about 0.577. ms. The frequency bandwidth of the frame is about 1.6 MHz. When the second subdivision is time-based, the smallest continuous unit of frames or slots has a bandwidth of 1.6 MHz, so their width on the time scale is 0.577 ms or 0.114 ms. .. Reference number 16 indicates a large slot of dimension 0.577msx1.6MHz, and reference number 17 indicates a small slot of dimension 0.114msx1.6MHz. When the second subdivision is code-based, the slots have a bandwidth of 1.6 MHz and a time width of 0.577 ms, but various forms of code are used for different slots. When code format 1 is used, a time slot can only be assigned to one connection at a time. When code format 2 is used, the same time slot can be used simultaneously with four connections. Since the use of code increases the amount of information to be transferred, the total amount of information that can be transferred by code format 2 is less than that of code format 1.
[0008] Allocation of resources using the known techniques described above provides an efficient configuration to meet the needs of different types of connections. However, no method is known that can control the allocation of communication resources, such as radio resources, in a sufficiently flexible and dynamic manner between connections with different requirements. An object of the present invention is to satisfy this requirement by the method and apparatus described in the independent claims.
[Disclosure of the Invention] An object of the present invention is to optimally use common communication resources to form various communication services for different types of connections. In the method of the invention, the connections are split into at least two different connection classes based on their requirement for transmission delay. The control system of the base station subsystem keeps a record of the user's transmission needs recorded in different categories and divides the available radio resources into slots of appropriate capacity based on this recorded information. ..
[0010] In the case of a connection with strict requirements regarding transmission delay, a circuit exchange connection with a dynamically controllable bandwidth is assigned. A sufficient amount of resources per allocation cycle is then allocated to the connection with a high tolerance for delay, eg, from a resource pool that has not yet been specified after resource allocation to the circuit exchange connection. A given amount of data is transmitted. The allocation cycle consists of one or more time frames. Resources in different transmission directions are allocated independently of each other.
[0011] According to one embodiment, the class of connections with high tolerance for delay is further subdivided into at least two subclasses based on the amount of information to be transferred. For connections that require a low amount of information, traffic channels are allocated for a limited amount of time sufficient to send a given amount of data. For connections that require a large amount of information transfer, a reservation recognition RID is assigned. This RID is used to notify the allocation of communication resources in the subsequent allocation cycle.
[Best Mode for Carrying Out the Invention] Hereinafter, the present invention will be described in detail with reference to the accompanying drawings. Embodiments of the present invention will be described below. First, the present invention will be described with respect to the slot structure shown in FIG. However, it should be noted that the use of the methods of the invention is not limited to this application. The only limitation of the present invention is that resources can be divided into slots, which are the smallest units that can be allocated, and that there are at least two slot sizes. The division of communication resources is not necessarily time-based, as shown in Figure 1. Another example of possible division is code-frequency division.
[0013] First, a preferred protocol configuration capable of implementing the functional requirements according to the present invention will be described. Figure 2 shows the protocol stack that controls traffic on the wireless interface of a mobile telephone system. Formed by physical layer L1 (Layer 1), RLC / MAC (Wireless Link Control / Media Access Control) and LLC (Logical Link Control) sublayers to be implemented in the base station system BSS and mobile station MS. Link layer L2 and network layer L3 are shown. Although many other layers are defined above the network layer, their detailed description is not relevant to the present invention and is omitted here.
The physical layer encodes, interleaves, and modulates the signal to be transmitted over the radio path. This same layer disassembles the modulation, interleaving and channel code of the received signal transmitted via the radio path, respectively. The MAC sublayer above the physical layer controls and allocates radio resources with the required signaling and maps logical channels over physical channels. Control of radio resources takes place in a base station subsystem located on the fixed network side.
An RLC unit specified separately for each connection in the MAC layer serves to maintain the quality of service (QoS) negotiated for the connection. To maintain quality at negotiated levels, the RLC unit connects the correct transmission format (RT / NRT), including error correction, selection of interleaving depth and modulation method, and control of defective frame retransmissions. Select against.
LLC establishes a logical connection on the radio path that utilizes the services provided by the underlying RLC / MAC layer. From the information received from the underlying layer by transmission over the radio path, the LLC forms an LLC frame suitable for transfer by the RLC layer, and in the opposite direction, the LLC is LLC by the RLC layer. The information carried on the radio path in the frame is combined into a format suitable for transfer to the layer lying on it. Next, the functions of Layer 2, especially the RLC / MAC layer, will be described in detail.
The overall function of Layer 2 is to implement layer 3 connected radio bearers for their QoS goals. The first radio bearer, referred to as the initial radio bearer, is primarily used to carry radio network layer (RNL) signaling and messages destined for the core network. Other radio bearers are used to carry user data and network signaling. The initial radio bearer is maintained as long as the other radio bearers have data to transfer. This is the last one to be released.
The initial radio bearer configuration procedure is triggered by Layer 3 after receiving the paging message or when the MS has a message for the core network on the mobile station side. This procedure is different from the procedure used to establish other radio bearers, where configuration requests are sent in short burst format over a common uplink channel and the timing advance is unknown. The network then assigns MAC level awareness to the MS. This procedure deals with conflicts, and Layer 3 resolves conflicts between mobile stations and ensures that MAC level awareness is assigned to one and only mobile stations. MAC level recognition is maintained as long as the initial radio bearer is maintained. It is valid within a given cell and must be exchanged in each cell-to-cell handover.
The message used to establish another radio bearer is a layer 3 message carried through the initial radio bearer. RLC / MAC is defined as one layer with one interface to the physical layer and one interface to the LLC layer, but the functions of the RLC part and the MAC part can be separated. Therefore, Layer 2 consists of three types of protocol entities. LLC and RLC entities are formed in relation to wireless bearers, and their function is to ensure negotiated QoS for connections that use wireless bearers. The mobile MAC and network MAC entities are shared by all radio bearers, and their main task is to dynamically partition the radio resources among the bearers.
Each time a radio bearer is established, two RLCs (one for the MS and one for the network) are formed by the management plane and the service data unit SDU arriving from the LLC connected to the bearer. handle. These operating parameters are selected as a function of QoS to be given. The first task of RLC is to segment the SDUs coming from LLC. The second task of RLC is to meet the QoS goals specified for them. For this reason, they have elaborate control mechanisms to deal with fluctuations in the quality of wireless links.
[0021] The RLC protocol is deployed at BSS and mobile stations. It has two modes of operation, the first of which provides a real-time connection that requires a short transmission delay, and the second of which provides a non-real-time connection with a high tolerance for transmission delay. RT mode uses power control and link adaptation mechanisms. NRT mode uses power control and retransmission procedures.
[0022] In RT mode, the source RLC serves to divide the LLC flow into traffic channels (TCH) assigned to the radio bearer. The RLC handles link adaptation and therefore sends a resource change request to the MAC to adapt to changes in traffic or radio link quality. The bearer transmission format (channel coding, interleaving and modulation) is selected from a limited set of options. However, the actual code rate can be adjusted separately for each TCH. The RLC divides the LLC data into RLC PDUs based on the transmission format, arbitrarily calculates the CRC (Repeat Redundancy Code), and feeds the PDU to the physical layer for transmission. The receiving RLC checks the CRC for 1 and notifies the MAC of the CRC check result. RLC assembles the received PDU and supplies the resulting SDU to LLC.
[0023] In NRT mode, the source RLC dictates the size of the data to be sent to the MAC layer. The transmission format to be used is agreed upon when setting up the bearer. From this format, the RLC infers the applicable partitioning and supplies the protocol data unit PDU to Layer 1 when requested by the MAC, i.e. when resources are allocated to the wireless bearer by the network. The sink RLC checks the CRC and warns the MAC when it receives a corrupted PDU. RLC assembles the correct PDU and supplies the SDU to LLC.
One MAC entity per mobile station manages all radio bearers established by the mobile station. The peer MAC of the network manages all wireless bearers in one cell. A MAC message consists of a data field and a CRC field. Data fields are used to carry MAC signaling exclusively. MAC entities are not crossed by a stream of data that comes from a higher layer or is destined for a higher layer.
The MAC entity essentially serves to assign and deallocate the TCH to the radio bearer. --For RT radio bearers used for transmission delay sensitive connections, the allocation mechanism is circuit exchange type, i.e. TCH allocation is valid until the release procedure is performed. --In the case of NRT radio bearers used for connections with high tolerance for transmission delays, the allocation mechanism is packet-switched, i.e. the allocation is valid only during the allocation cycle. This mechanism does not allocate resources during the intermediate time cycle, so it can adapt quickly to load conditions. In addition, the MAC handles retransmission signaling when an RLC PDU is received with a corrupted CRC. This retransmission mechanism can be adapted to the capabilities of MS.
The base station subsystem (or corresponding construct) maintains a reservation table, which conveniently fits the size of the allocation cycle, and the size, reservation status, and allocation of each slot. Indicates other possible slot-specific parameters in the cycle. The contents of the booking table at three different moments are shown in Figures 3A, 3B and 3C. In the reservation table of FIG. 3A, frame time slots 1, 2, 6, 11, 12 and 14 are assigned to 1/16 slots, which have not yet been split. Time slots 4, 7 and 9 are divided into smaller 1/64 slots, and their resources are allocated to use connections with lower data transfer rates. This reservation table contains only information about the reservation status of physical channels, connection characteristics and delay requests are irrelevant here.
[0027] FIG. 3B shows a time frame of the next continuous allocation cycle. Compared to the time frame of FIG. 3A, the resources of time slots 1 and 11 are shown to be released. Furthermore, as is clear, the layer that is responsible for allocating radio resources is well suited to subdivide time slot 11 into 1/64 slots, as the number of connections requiring 1/64 slots becomes very large. It turns out that.
[0028] In the case of FIG. 3C, the number of connections requiring a low data transfer rate is reduced, so the unit acting on the reservation of radio resources should unlock all 1/64 slots of time slot 9. Can be done. Note that reservations are made based on the allocation cycle, and the reserved channel does not necessarily have to include slots from each time frame of the allocation cycle. Therefore, not all time frames of the allocation cycle are necessarily the same.
[0029] Some of the important criteria to be evaluated before reserving slots for the use of new connections by units responsible for maintaining the reservation table and subdividing the time slots into slots are Traffic status, information classification of new connections to be established (eg audio, video, data, etc.), priority classes to be determined based on new connections (eg regular calls, disaster calls), traffic status The total transmit power level based on, and the type of communication connection (eg, real-time or non-real-time). Further criteria of the more advanced form include the sensitivity of interference and the required transmit power of a slot.
The MAC transmits the data units to be sent to Layer 1 and reads the data units received from Layer 1. It also serves to clear the transmit and receive buffers. In addition, the MAC determines when an attempt to decode burst data should be made. The decoding operation is executed at layer 1 in response to the decoding request "L1-decoding request" from the RLC / MAC layer. In the RT operation mode, the burst data can be removed from the buffer as soon as the burst data is transmitted. On the receiving side, data can be removed from the buffer as the data units are decoded and passed through the RLC / MAC layer.
[0031] In the NRT operation, the data unit can be removed from the transmission buffer when the data unit is confirmed. On the receiving side, data can be removed from the receive buffer when the data unit is decoded and passed through RLC / MAC and when it is determined that the quality of the data unit is sufficient. For example, quality can be determined by using CRC checks on data units. The data unit is removed by layer 1 in response to the request "L1 buffer clear request" from the RLC / MAC layer that directs the bursts that form the data unit. If RLC / MAC level ARQ (Automatic Repeat on Request) format error correction is not used, data units can be cleared from the receive buffer immediately after the decode operation. When the RLC / MAC level ARQ is used, when the RLC notifies that the quality of the data unit is sufficient (ie, when the CRC check indicates that there are no errors), the data unit comes from the receive buffer. It will be cleared.
On the transmitting side, RT data units can be cleared from the buffer at the end of the interleave cycle. NRT data units are cleared based on the confirmation received from the receiver. The establishment of the connection in the system shown here will be described below. BSS-MAC uses a CTRL-Capacity Allocation (CTRL-CA) message to assign a connection connected to a control channel or to notify the MS of a new location for a common control channel. This message contains an identifier indicating the connection, information about the physical channel assigned, and the format of the control channel. The CTRL-CAA message is used by the MS to confirm the CTRL-capacity allocation. If CTRL-CAA is not received by BSS within the specified time cycle, CTRL-CA or CTRL by the time CTRL-CAA / CTRL-CDA is received (CTRL-CDA = CTRL-capacity deallocation confirmation) -The allocation status must be clarified by deallocating capacity (CTRL-CD).
[0033] Traffic channel resources can be allocated independently of each other in different transmission directions (uplink / downlink) based purely on the need for transmission. The procedure used to allocate the traffic channel depends on the mode of operation, which is described below. In the methods of the invention, the allocation of radio resources is essentially the same for both real-time and non-real-time services, i.e. slots are allocated from time frames for both needs. Information transfer over a wireless path varies based on the type of service and whether it is real-time or non-real-time. Applications that require real-time or virtual real-time services are, for example, packet speech transmissions and bidirectional video connections. In the simulation test of the method according to the invention, the requirement for sending speech between the base station and the terminal device is 10<sup>-3</sup>The maximum allowable bit error rate (BER) and the maximum allowable transfer delay of 30 ms were set. In the video connection required for bidirectional video connection, the corresponding limit is 10<sup>-6</sup>And 100ms, the long delay is due to the temporal interleaving of the video information to be transferred. These services use FEC (forward error correction) style error correction and the radio resource reservation mechanism described in detail below. Non-real-time services are, for example, file transfers during a traditional Internet connection. This application uses packet-switched data transfer and an ARQ-type error correction protocol.
【0034】<u style="single">RT operation mode</u>An important feature of the RT mode of operation is the allocation of TCH for intermediate time periods. A release procedure is required to release the TCH. You cannot multiplex more than one radio bearer on a TCH. The MAC uses an addressing mechanism that allows the TCH to have a very precise granularity, thus eliminating the need for multiplexing. (One TCH is mapped to one physical channel. This mapping can be done for each time frame, every other time frame, and so on, up to every 128th time frame.) [0035 ]<u style="single">Network start procedure for RT operating mode</u>The procedure initiated in the network deals with the change of state of the radio for the uplink radio bearer and the change of bit rate for the downlink radio bearer. A signal chart showing the procedure for assigning, reassigning, and deallocating RT bearers is shown in FIG. There are three types of commands. That is, the allocation of TCH, the exchange of one TCH for another, and the deassignment of TCH. For example, when a network RLC asks a network MAC for more resources, the network MAC warns the peer MAC with an RT Capacity Allocation (RT-CA) message. This message points to the radio bearer and the assigned TCH. This is confirmed by the RT Capacity Allocation Confirmation (RT-CAA) message. TCH is exchanged and released using RT Capacity Change (RT-CC) and RT Capacity Deallocate (RT-CD) messages and associated confirmations.
[0036] The confirmation message (for example, RT-CAA, RT capacity release confirmation, RT capacity change confirmation) can be replaced with another uplink MAC message by MS-MAC. In this case, the Iterative Redundancy Code (CRC) for checking the integrity of the message is calculated from the composite data of the DL-MAC message to be checked and the replacement UL-MAC message to be sent. RT-CC messages have old and new TCH assignment fields. The MS or the radio bearer can be identified from the old TCH and does not need to be identified. The RT-CD message indicates that the TCH has been deallocated. All RT messages mentioned above can be separated from other signaling messages using the message discriminator field. All messages except RT-CC type indicate the radio bearer and also MS unless it can be identified from the applicable signaling channel.
【0037】<u style="single">Mobile start procedure for RT operation mode</u>The procedure initiated on the mobile deals with the change of state of the radio for the downlink radio bearer and the change of bit rate for the uplink radio bearer. The signal chart in FIG. 5 shows the procedure for assigning, reassigning, and deallocating RT bearers. When a mobile RLC requests a resource change from its MAC, the MAC interprets the request as an RT Capacity Request (RT-CR) MAC message. This message includes indication of the required data transmission rate, identification of the message format, the radio bearer in question, and the radio station issuing the request (unless it can be previously identified from the applicable signaling channel). The capacity allocation procedure is similar to that initiated in the mobile, as described in the network-initiated procedure. However, channel allocation is initiated by the RT-CR message, not by the BSS RLC request.
Connections that require real-time services require multiple simultaneous uplink and downlink channels between the subscriber terminal unit and the base station. Such simultaneous channels are referred to as parallel connections. According to a preferred embodiment of the invention, a temporary logical identifier is assigned to the terminal device. This distinguishes the terminal device from other terminal devices that communicate with the same base station subsystem. Short additional identifiers (eg, 4 bits in length) can be used to distinguish between parallel connections.
【0039】<u style="single">NRT operating mode</u>In NRT operating mode, the network knows how much data to send. TCH is assigned separately for each allocation cycle. The NRT operating mode can be divided into high bit rate NRTs used for large amounts of data and intermediate bit rate NRTs used for short or infrequent data transmission. For high bitrate NRTs, only 1/16 of the physical channel is used and the allocation period is fixed at two TDMA frames. The data unit specifies two 1/16 bursts associated with TCH during one allocation cycle. Since the network must advertise the TCH split between different NRT bearers for each allocation cycle, each active RLC is assigned a short reservation recognition (indicated by RID) at the beginning of its source activity. This recognition is BSS It is valid until it is released by MAC. For intermediate bitrate NRTs, all TCH formats can be assigned, and the length of the allocation period is variable (2-32 TDMA frames). Assignments for intermediate bitrate NRT users are notified separately for each TCH, and normal MAC and RLC recognition is used.
【0040】<u style="single">Downlink High Bitrate NRT Allocation and Transmission</u>Allocation of resources and transmission of data in a downlink high bit rate NRT connection is shown in Figure 6. When the source of the downlink bearer is activated and the BSS MAC decides to use the high bitrate NRT capacity, the network MAC contains the message discriminator, RID, bearer reference and MS identifier (if these cannot be identified from the channel). Send a high bitrate NRT capacity allocation message to the MS. These messages also refer to a pair of logical channels (NRT control channel for downlink traffic, ie DNCCH, and forward order channel FOCH). The fixed DNCCH position can be represented as a carrier number, while the FOCH is given as a channel address. The mobile station confirms the HB NRT-CA with the HB NRT capacity allocation confirmation message.
The mobile MAC entity is now required to listen to the DNCCH. The division of TCH between RIDs is notified in the downlink NRT control message via DNCCH for each allocation cycle. The mobile station directs a list of data units that must be sent by the BSS in the forward order message. This message is transmitted via the forward order channel FOCH, which is a common channel shared by many mobile stations. Scheduling for FOCH use is notified via DNCCH. The forward order (FO) message sent to FOCH contains the FO window and a list of units of NRT to be sent. The FO window points to the start of unconfirmed data, and the list is a binary word that indicates each ordered NRT unit in one digit.
The downlink control (DNC) message sent to the DNCCH is composed of a TCH list and a TCH and FOS (forward order schedule) scheduling list. The TCH list is a binary word whose length is equal to the number of units of transmission that can be considered during one allocation cycle, eg 16 for 16 slot frames. A single digit in this list indicates that the corresponding resource will be allocated for NRT use. The scheduling list indicates whether each RID that receives the data has permission to use each FO channel, and in which resource reported in the TCH list each RID receives the data. After all the data has been transferred, the NRT connection will be disconnected when the RID release message is sent to the MS, which will release the RID used for the connection. The mobile station confirms the message by sending a RID cancellation confirmation message to the BSS MAC.
【0043】<u style="single">Uplink High Bitrate NRT Allocation and Transmission</u>When the uplink bearer's NRT source is activated, the mobile MAC sends an NRT capacity request message to the network indicating the bearer criteria and the amount of data to be sent (see Figure 7). Based on the amount of data requested and the load state of the cell, BSS MAC allocates a high bit rate or intermediate bit rate NRT capacity to the MS. In the case of high bitrate allocation, the BSS MAC allocates a RID in the response and informs the amount of data allowed in the HB NRT capacity allocation message. This message also points to the logical channel UNCCH (NRT control channel for uplink traffic). Finally, the mobile station sends a confirmation with an NRT capacity allocation confirmation message. The division of TCH between RIDs for each allocation cycle is notified by BSS MAC via UNCCH in the uplink NRT control message. The uplink NRT control message also indicates the unit of data that must be sent via the assigned TCH.
【0044】<u style="single">High Bitrate NRT Retransmission Procedure</u>NRT mode uses a highly flexible signaling procedure that allows the use of various retransmission mechanisms. In either case, all NRT data is ordered by the recipient, so the underlying algorithm for that order does not have to be the same for all MSs. Based on the capabilities of the mobile station, a slightly more sophisticated retransmission mechanism can be selected when setting up the bearer. The simplest ARQ algorithm is the usual form 1 ARQ, on which the RLC-CRC is checked, and the result is that the PDU is accepted or discarded and a retransmission request is sent.
[0045] However, it is assumed that the highest efficiency is achieved with the following Form II hybrid ARQ mechanism. That is, the RLC-PDU (RLC packet data unit) is encoded so that the data can already be decoded after the first part thereof is transmitted. If the decoding operation does not work, the rest of the code data (including the redundant part of the first part) is transmitted. If the decoding operation of the PDU does not work after transmitting all the data, the retransmission request of a certain data unit is preferably made with the lowest reception quality until the decoding operation is successful.
【0046】<u style="single">Intermediate bit rate NRT transmission</u>The procedure is almost the same regardless of whether the intermediate bit rate allocation is initiated by a BSS RLC request or an MS MAC NRT capacity request. The BSS MAC sends an intermediate bit rate NRT capacity allocation (MB NRT-CA) message containing the MAC-ID, bearer ID, TCH address, allocation cycle length, and allocation identifier. The downlink intermediate bit rate NRT transmission is shown in Figure 8, and the uplink intermediate bit rate NRT transmission is shown in Figure 9. The transmitting side appropriately transmits NRT data. In the case of downlink NRT transmission, the MS checks the data received when the decoding operation is successful. If the decoding operation is unsuccessful for either the uplink or downlink transmission, the BSS MAC sends an MB NRT-CA message with the same allocation identifier, and the sender reissues the same data. Send. This procedure is repeated until the decoding operation is determined to be successful.
In summary, the means required for BS and MS are shown in FIGS. 10 and 11. Figure 10 shows the steps required for the BSS for the allocation process given to the downlink channel. This means includes: --A first connection splitting means for splitting a connection into at least two classes based on those delay requests. (This is done in Layer 3 and above protocols. Other parts of this means are done in Layer 2.)-In response to the first connection splitting means, NRT connections are NRT / HB and NRT / A second connection splitting means for further splitting into MB format connections. --Communication necessity determining means for determining the need for communication in response to the first and second connection splitting means. --A resource dividing means for dividing communication resources into slots based on communication needs in different communication classes in response to the communication need determining means. --Assignment means for allocating different types of channels, namely RT, NRT / HB or NRT / MB channels, for different classes of communication in response to resource partitioning means and communication need determination means.
FIG. 11 shows the means required for MS and BSS for a given uplink channel allocation. Means in MS include: --A first connection splitting means for splitting a connection into at least two classes based on those delay requests. (This is done in Layer 3 and above protocols. Other means are done in Layer 2.)-In response to the first connection splitting means, NRT connections are in NRT / HB and NRT / MB formats. A second connection splitting means for further splitting into the connections of. --A requesting means for requesting resources for different types of connections in response to the first and second connection splitting means.
Means in BSS include: --Communication necessity determination means for determining the communication necessity in response to the request means of the mobile station. --A resource dividing means for dividing communication resources into slots based on communication needs in different communication classes in response to the communication need determining means. --Assignment means for allocating different types of channels, namely RT, NRT / HB or NRT / MB channels, for different classes of communication in response to resource partitioning means and communication need determination means.
BSS generally comprises a base station BS and a base station controller BSC, and the above means are implemented in any of these network elements. The above means may be distributed between BS and BSC. For non-real-time connections, the same principles of parallel connection described for real-term services can be applied. The MAC layer also manages timing advance (TA). It is used to align the transmission timing of the mobile station so that the timing exactly matches the slot boundaries of the base station with which the mobile station communicates and compensate for transmission path delays. Timing progress is managed for each MS. Ultimately, the MAC provides signaling to control the transmit power level in both directions. This control is provided by an option for adjusting the power level of each TCH for each radio bearer.
The MS must periodically transmit to provide the BSS information needed to maintain the TA. If the MS does not send anything, it can send a specific timed advance probe (TAP) message. To manage dynamic channeling on behalf of MSs that support a large number of bearers, BS-MAC assigns which physical channels to all bearers to send and receive to each MS. You have to keep a record. This record can be used as the basis for synthesizing time alignment measurements (performed at Layer 1) for all MS bearers to form one estimate of time correction for MS. As a result, BS-MAC (or the process associated with BS-MAC) continuously monitors the timing of MS alignment based on the measurements reported by Layer 1.
[0052] If necessary, the BS-MAC sends a timing adjustment correction (TAC) message containing a TA correction that should be applied to all bursts transmitted. This TAC message is a common control channel such as the forward access channel FACH used to broadcast MAC layer messages, or a common control channel such as SDCCH (stand-alone dedicated control channel) or FACCH (fast associative control channel). It can be transmitted via a dedicated control channel. The MS will stop transmitting the TA probe, and the MS will lose time alignment. The MS attempting to initiate transmission to the BSS must retransmit the TAP message in an access burst on the S-RACH. In response to the probe, BSS sends a TAC message.
[0053] In the case of low power control, a power control (PC) message can be transmitted via FACH, N-RACH or DCCH. In the case of any fast power control, the use of FACCH, SDCCH or FACH is unsuitable for the transfer of power level reports. Rather, the public power control channel PWCCH is adopted. This requires one 1/64 time slot per frame and dictates the differential power settings to be applied. This has the advantage of being able to support unidirectional bearers or bearers operating DTX, but also has the disadvantage that the mobile station must be able to monitor the broadcast on each frame. When using an adaptive antenna, the MS must make periodic transmissions to give the BSS the information needed to estimate the location of the MS. If the MS does not send anything, it can send a specific probe (eg, a timed advance probe message).
[0054] The abbreviations used in the above description are as follows. ARQ: Automatic repeat on request BSS: Base station system CA: Capacity allocation CAA: Capacity allocation confirmation CC: Capacity change CD: Capacity release CR: Capacity request CRC: Repeated redundant code DNCCH: Downlink control channel DNC: Downlink control FACCH : High-speed associative control channel [0055] FEC: Forward error correction FO: Forward order FOCH: Forward order channel FOS: Forward order schedule GPRS: General-purpose packet radio system GSM: Global system for mobile communication L1: Layer 1 L2: Link layer L3: Network layer LLC: Logical link control MAC: Media access control [0056] MB: Intermediate bit rate MS: Mobile station NRT: Near real-time PC: Power control PDU: Protocol data unit PWCCH: Public power control channel QoS: Quality of service RID: Reservation recognition [0057] RLC: Wireless link control RNL: Wireless network layer RT: Real-time SDCCH: Stand-alone control channel SDU : Service data unit TA: Timing advance TAC: Timing adjustment correction TAP: Timing advance probe TCH: Traffic channel TDMA: Time division multiple access UNCCH: NRT control channel for uplink traffic [Simple description of drawing] [Fig. 1] Known It is a figure which shows the method for dividing a communication resource into a slot based on a technique.
FIG. 2 is a diagram showing a protocol configuration capable of implementing the functional requirements according to the present invention.
FIG. 3A is a diagram showing a reservation table for a time frame.
FIG. 3B is a diagram showing a reservation table for a time frame.
FIG. 3C is a diagram showing a reservation table for a time frame.
FIG. 4 shows a signaling transfer for allocating radio resources to an uplink real-time connection.
FIG. 5 shows a signaling transfer for allocating radio resources to a downlink real-time connection.
FIG. 6 shows signaling transfer for allocating radio resources to uplink non-real-time connections at high bit rates.
FIG. 7 shows signaling transfer for allocating radio resources to downlink non-real-time connections at high bit rates.
FIG. 8 illustrates signaling transfer for allocating radio resources for uplink non-real-time connections at medium bit rates.
FIG. 9 illustrates signaling transfer for allocating radio resources for downlink non-real-time connections at medium bit rates.
FIG. 10 is a diagram showing functions required for controlling communication resources in the uplink direction.
FIG. 11 is a diagram showing functions required for controlling communication resources in the downlink direction.
13 sheets
Sheet 1 Sheet 2 Sheet 3 Sheet 4 Sheet 5 Sheet 6 Sheet 7 Sheet 8 Sheet 9 Sheet 10 Sheet 11 Sheet 12 Sheet 13
Every citation, both ways
| Document | Relation | Office |
|---|---|---|
| JP09055768A | Cites | Japan |
| JP10190621A | Cites | Japan |
| JP08242257A | Cites | Japan |
| JP08331182A | Cites | Japan |
| JP09065429A | Cites | Japan |
| JP09500778A | Cites | Japan |
| WO96002985A1 | Cites | World Intellectual Property Organization (WIPO) |
22 members in 13 offices
Priority claims9
| Document | Office | Kind | Date |
|---|---|---|---|
| 973169 | Finland | A | |
| 973169 | Finland | A | |
| 973169 | Finland | – | |
| 9800607 | Finland | W | |
| 9800607 | Finland | W | |
| 1997973169 | – | – | – |
| 1998000607 | – | – | – |
| FI19970003169 | – | – | – |
| WO1998FI00607 | – | – | – |
Members22
| Document | Office | Kind | |
|---|---|---|---|
| FI973169A | Finland | A | |
| CA2297896A1 | Canada | A1 | |
| WO9907170A2 | World Intellectual Property Organization (WIPO) | A2 | |
| AU8543898A | Australia | A | |
| ZA986804B | South Africa | B | |
| WO9907170A3 | World Intellectual Property Organization (WIPO) | A3 | |
| FI104143B | Finland | B | |
| FI104143B1 | Finland | B1 | |
| EP1025728A2 | European Patent Office (EPO) | A2 | |
| CN1265811A | China | A | |
| JP2001512939A | Japan | A | |
| CN1122430C | China | C | |
| EP1025728B1 | European Patent Office (EPO) | B1 | |
| AT256953T | Austria | T | |
| ATE256953T1 | Austria | T1 | |
| DE69820667D1 | Germany | D1 | |
| US6693892B1 | United States of America | B1 | |
| ES2210784T3 | Spain | T3 | |
| DE69820667T2 | Germany | T2 | |
| MY122136A | Malaysia | A | |
| CA2297896C | Canada | C | |
| JP4065367B2This record | Japan | B2 |
29 legal events, as the office reported them to INPADOC
Over the term
Point at a mark for the eventEvents
| Event | Code | |
|---|---|---|
| Cancellation because of completion of termEXPY | EXPY | |
| Receipt of annual feesJAPANESE INTERMEDIATE CODE: R250R250 | R250 | |
| Receipt of annual feesJAPANESE INTERMEDIATE CODE: R250R250 | R250 | |
| Receipt of annual feesJAPANESE INTERMEDIATE CODE: R250R250 | R250 | |
| Written notification of registration of transferJAPANESE INTERMEDIATE CODE: R350R350 | R350 | |
| Request for change of ownership or part of ownershipJAPANESE INTERMEDIATE CODE: R313113S111 | S111 | |
| Written notification of registration of transferJAPANESE INTERMEDIATE CODE: R350R350 | R350 | |
| Written request for registration of change of domicileJAPANESE INTERMEDIATE CODE: R313531S531 | S531 | |
| Receipt of annual feesJAPANESE INTERMEDIATE CODE: R250R250 | R250 | |
| Receipt of annual feesJAPANESE INTERMEDIATE CODE: R250R250 | R250 | |
| Renewal fee payment (event date is renewal date of database)FPAY | FPAY | |
| Renewal fee payment (event date is renewal date of database)FPAY | FPAY | |
| Renewal fee payment (event date is renewal date of database)FPAY | FPAY | |
| Renewal fee payment (event date is renewal date of database)FPAY | FPAY | |
| Renewal fee payment (event date is renewal date of database)FPAY | FPAY | |
| Certificate of patent or registration of utility modelJAPANESE INTERMEDIATE CODE: R150R150 | R150 | |
| First payment of annual fees (during grant procedure)JAPANESE INTERMEDIATE CODE: A61A61 | A61 | |
| Written decision to grant a patent or to grant a registration (utility model)JAPANESE INTERMEDIATE CODE: A01A01 | A01 | |
| Decision of grant or rejection writtenTRDD | TRDD | |
| Written amendmentJAPANESE INTERMEDIATE CODE: A523A521 | A521 | |
| Written permission of extension of timeJAPANESE INTERMEDIATE CODE: A602A602 | A602 | |
| Written request for extension of timeJAPANESE INTERMEDIATE CODE: A601A601 | A601 | |
| Notification of reasons for refusalJAPANESE INTERMEDIATE CODE: A131A131 | A131 | |
| Written amendmentJAPANESE INTERMEDIATE CODE: A523A521 | A521 | |
| Written permission of extension of timeJAPANESE INTERMEDIATE CODE: A602A602 | A602 | |
| Written request for extension of timeJAPANESE INTERMEDIATE CODE: A601A601 | A601 | |
| Notification of change in applicantJAPANESE INTERMEDIATE CODE: A712A711 | A711 | |
| Notification of reasons for refusalJAPANESE INTERMEDIATE CODE: A131A131 | A131 | |
| Report on retrievalJAPANESE INTERMEDIATE CODE: A971007A977 | A977 |
Numbers
- Publication
- 4065367
- Publication, DOCDB
- 4065367
- Publication, EPODOC
- JP4065367B
- Application
- 2000505760
- Application, DOCDB
- 2000505760
- Application, EPODOC
- JP20000505760
Titles2
- Japanese
- 通信リソースを制御する方法
- English
- How to control communication resources
Classification
- CPC, 2
- H04W72/0446
- H04W48/16
- IPC, 4
- H04Q7 36
- H04L12 56
- H04W72 04
- H04W74 04
