EP1090525A1 - Procede et appareil d'attribution de canaux dans un reseau mobile de telecommunications a commutation de paquets et de circuits - Google Patents

Procede et appareil d'attribution de canaux dans un reseau mobile de telecommunications a commutation de paquets et de circuits

Info

Publication number
EP1090525A1
EP1090525A1 EP99935214A EP99935214A EP1090525A1 EP 1090525 A1 EP1090525 A1 EP 1090525A1 EP 99935214 A EP99935214 A EP 99935214A EP 99935214 A EP99935214 A EP 99935214A EP 1090525 A1 EP1090525 A1 EP 1090525A1
Authority
EP
European Patent Office
Prior art keywords
channels
connections
connection
allocated
packet switched
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.)
Withdrawn
Application number
EP99935214A
Other languages
German (de)
English (en)
Inventor
Gunnar Hedby
Mats Karlsson
Kenneth Bo Gustaf Balck
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Telefonaktiebolaget LM Ericsson AB
Original Assignee
Telefonaktiebolaget LM Ericsson AB
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Telefonaktiebolaget LM Ericsson AB filed Critical Telefonaktiebolaget LM Ericsson AB
Publication of EP1090525A1 publication Critical patent/EP1090525A1/fr
Withdrawn legal-status Critical Current

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/50—Allocation or scheduling criteria for wireless resources
    • H04W72/56—Allocation or scheduling criteria for wireless resources based on priority criteria
    • H04W72/563—Allocation or scheduling criteria for wireless resources based on priority criteria of the wireless resources
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/04—Wireless resource allocation
    • H04W72/044—Wireless resource allocation based on the type of the allocated resource
    • H04W72/0446—Resources in time domain, e.g. slots or frames

Definitions

  • the present invention relates to mobile telecommunications networks and in particular to the allocation of channels in such a network when both packet switched and circuit switched traffic is used in the network.
  • GSM Global System for Mobile communication
  • HCSD High Speed Circuit Switched Data
  • packet switched traffic data communication is often very intermittent and the information to be transferred occurs in bursts of varying length. During a burst the bandwidth demand may be very high, whereas between bursts it may be zero. To utilize each channel optimally, a number of packet communication connections often share a number of physical channels.
  • the channel or channels assigned to a packet switched connection are assigned to a particular connection only when information is being transmitted on the connection. The rest of the time, the channel or channels can be used for the other connections assigned to the same channel or channels.
  • the effective transmission rate for each connection is of course reduced if many connections share the same physical channels. Therefore, from a user's point of view it is beneficial not to share a channel with other users.
  • the circuit switched connections often carry speech, whereas the packet switched connections are mostly used for data. Therefore, the circuit switched connections must be transmitted in real time, while this is not so critical for the packet switched connections. Therefore, circuit switched connections are usually given a higher pri- ority than packet switched connections. This means that, if the total number of channels requested is higher than the total number of available channels, packet switched connections may be disconnected to enable a circuit switched connection.
  • the number of channels required for each type varies with time. Therefore, the dynamic allocation of resources between circuit switched and packet switched traffic should be possible. Since the total number of channels in a cell is fixed, the number of channels allocated to each type of traffic has to be balanced, especially when the total traffic demand in a cell is high.
  • European Patent Specification EP 0 831 669 A2 describes a method for controlling the load of a Code Division Multiple Access (CDMA) system in which circuit switched and packet switched traffic occurs.
  • CDMA Code Division Multiple Access
  • the number of channels that may be allocated to each type of traffic can be set dynamically in dependence of the demand for each type of circuit switched and packet switched traffic, respectively.
  • EP 0 831 669 A2 relates to the overall distribution of resources between circuit switched and packet switched networks. It does not, however, concern itself with optimizing the utilization of the channels that may be allocated to each of the two types of traffic.
  • a method of allocating channels in a mobile telecommunications system in which packet switched and circuit switched traffic may be used comprising the following steps: - specifying a maximum number of channels (TS MAX ) that may be allocated to packet switched connections for each frequency;
  • NU MAX a maximum number of connections
  • - when a packet switched connection is requested performing the following steps: - checking if the maximum number (TS MA X) of channels have been allocated and, if not aUocating the available channels to the connection; - if more channels were requested, allocating other channels among the channels that may be allocated to packet switched connections to the requested packet switched connection.
  • TS MA X maximum number
  • control node in a mobile telecommunications network comprising programs developed to perform said method.
  • the method and control node according to the invention ensure that a certain num- ber of channels are always reserved for circuit switched traffic, and at the same time guarantees that a reasonable number of packet switched connections share each of the channels that may be used for packet switched connections
  • TS MAX maximum number o channels
  • NU MAX maximum number of connections
  • TS MAX maximum number of channels
  • NU MAX maximum number of connections
  • the steps are preferably performed for each frequency according to a priority order list, until a frequency is found on which the connection request can be fulfilled, or until the last frequency has been examined.
  • connection request If no frequency is found on which the connection request can be fulfilled, the best possible assignment of channels is made, the connection is denied or the connection is assigned to channels that may not normally be allocated to packet switched connections.
  • the maximum number of channels (TS MAX ) that may be allocated to packet switched connections and/or the number of connections (NU MA X) that may be assigned to each channel may be set individually for each frequency. This enables the establishment of a limited number of packet switched connections with a high bandwidth without increasing the total number of channels that may be assigned to packet switched connections too much.
  • One or more packet switched connections may be disconnected to make idle channels for the circuit switched connection. This ensures that the circuit switched connections are always given a higher priority than the packet switched connections, which do not require real-time communication.
  • Figure 1 illustrates the communication between a mobile terminal and a base station terminal in a TDMA system
  • Figure 2 is a flow chart of the inventive method
  • Figures 3A-3E illustrate the use of the inventive method for allocating channels to one frequency.
  • Figure 1 illustrates the communication between a mobile terminal 1 and a base sta- tion 3 in a mobile telecommunications system according to TDMA.
  • a number of channels are transmitted in time slots on the same frequency.
  • eight time slots corresponding to eight physical channels, are transmitted on the same frequency.
  • the base station 3 is controlled by a base station controller 5, through which it is connected to a telecommunications network 7. This description is, how- ever, only concerned with the communication between the mobile terminal 1 and the base station 3.
  • a circuit switched connection is assigned one or more physical channels, and occupies this channel or these channels alone for the duration of the connection.
  • a packet switched connection is assigned one or more physical channels, which it shares with other packet switched connections.
  • NU MAX The maximum number of packet switched connections that can be accommodated for each time slot.
  • TS MA X The maximum number of time slots on one frequency that may be allocated for packet switched connections. If the TS MAX criterion is fulfilled for a frequency, this means that at least this number of time slots on this frequency is allocated to packet switched connections.
  • Area The area criterion is fulfilled for a given frequency if there are at least NUM AX connections assigned to all the channels that may be allocated to packet switched connections on that frequency.
  • Both NU MAX and TSMA X may be given different values for different frequencies. This may be used to make the system more flexible. For example, the value for TS MA X may be set relatively low for most frequencies, while a few frequencies may have a higher TS MA X to enable packet switched connections with higher bandwidth on these few frequencies.
  • NUM A X and TSM AX are used together to dete ⁇ nine when a new frequency should be selected for new packet switched connections to be set up. They may be set by the operator and may be changed when the traffic situation changes.
  • a priority order has been defined for the allocation frequencies to circuit switched and packet switched traffic, respectively.
  • circuit switched traffic has a higher priority than packet switched traffic. This means that, if more than the available number of channels are requested a channel used for packet switched connections may be pre-empted to make room for a circuit switched connection.
  • TS MA X has different values for different frequencies, different priority lists may be used.
  • the first frequency examined may always be the frequency for which TS MAX is equal to the number of channels requested.
  • FIG. 2 is a flow chart of the method according to the invention.
  • Step SI A packet switched connection utilizing a number N of channels is requested.
  • Step S2 Select the first frequency in the above mentioned priority list.
  • Step S3 Is the TS MA X criterion fulfilled for this frequency? If no, go to step S4; if yes, go to step S5.
  • Step S4 Allocate the channels that may be allocated to packet switched connections and that are not currently allocated to any connection on this frequency to the connection. If more channels are requested, go to step S6, otherwise, end of procedure.
  • Step S5 Is the Area criterion fulfilled for this frequency? If no, go to step S6; if yes, go to step S7.
  • Step S6 Assign the requested number of channels on this frequency to the packet switched connection, or, if the number of channels requested is higher than TSM A X, assign TSMAX channels.
  • the channels are selected as the ones that have the fewest connections allocated to them among the ones already used for packet switched connections. End of procedure.
  • Step S7 Is this the last frequency in the priority list? If yes, go to step S8, if no, go to step S9.
  • Step S8 Make the best possible assignment of channels.
  • Step S9 Select the next frequency in the priority list as the current frequency. Go to step S3.
  • step S8 that is, if the TS M AX and the Area criteria are fiilfilled for all frequencies, alternative actions are possible.
  • the connection is assigned to channels already having more than NU MA X connections as- signed to them. It would also be possible to deny the connection altogether, to guarantee a minimum bandwitdh to eacfecoaoection actually set up.
  • a third possibility would be to assign channels that may not normally be used for packet switched connections to the connection.
  • FIGS 3A-3E illustrate the allocation of channels according to the procedure described above.
  • TS MA X is set to four and NU M AX is set to three. This means that, of the eight channels available on the frequency shown, four may be allocated to packet switched connections. Three connections may share one physical channel before it will be considered to allocate a newly requested connection to a new frequency.
  • Figure 3 A shows the situation when there is only one connection on the frequency. Two channels have been allocated to the connection, as indicated by the two boxes with diagonal shading.
  • Figure 3B shows the situation after a second connection has been established. Three channels have been assigned to this connection, as indicated by three boxes with vertical shading. Since fewer than TS M A X (that is, four) channels were allocated to packet switched data before this connection was set up, the connection uses the two channels that were not previously used and shares one channel with the first connection.
  • Figure 3C shows the situation after the establishment of a third connection using four time slots. Since all the four channels allocated to packet switched connections already had been assigned, a check was made to see if the Area criterion was ful- Q
  • Figure 3D shows the situation after two more one-channel connections have been allocated.
  • the time slots used are shown as black squares. Now all the channels except one have the maximum number of connections assigned to them. If a connection request for two or more channels is made at this stage, there are two alternatives:
  • connection may be set up on this frequency, which means that on two channels there will be one more than NUM AX (that is, three) connections. This is the situation shown in Figure 3E.
  • Another frequency may be selected for the new connection, since it cannot be set up on this frequency without violating the Area criterion.
  • the functions described above may be implemented as software packages included in a node in the network.
  • a separate node may be included, or the functions may be implemented in an existing node, for example, the base station controller 5 shown in Figure 1.

Abstract

L'invention porte sur un traitement efficace du trafic dans un système AMRT à commutation de circuits et de paquets. Ledit procédé comporte les étapes suivantes: spécification du nombre maximal de canaux attribuables pour chaque fréquence aux liaisons à commutation de paquets; spécification du nombre maximal de liaisons attribuables à un canal; et en cas de demande de liaison à commutation de paquets: vérification que le nombre maximal de canaux a été attribué et sinon attribution à la liaison des canaux disponibles, et si plus de canaux sont demandés, attribution à la liaison à commutation par paquets demandée, d'autres canaux pris parmi les canaux pouvant être attribués à des liaisons à commutation par paquets. L'invention porte également sur un noeud de commande de réseau mobile de télécommunications comportant des programmes de mise en oeuvre dudit procédé.
EP99935214A 1998-06-26 1999-06-16 Procede et appareil d'attribution de canaux dans un reseau mobile de telecommunications a commutation de paquets et de circuits Withdrawn EP1090525A1 (fr)

Applications Claiming Priority (3)

Application Number Priority Date Filing Date Title
SE9802295A SE519730C2 (sv) 1998-06-26 1998-06-26 Förfarande och anordning för tilldelning av kanaler i ett telekommunikationsnät med både paketförmedlad och kretskopplad trafik
SE9802295 1998-06-26
PCT/SE1999/001080 WO2000001186A1 (fr) 1998-06-26 1999-06-16 Procede et appareil d'attribution de canaux dans un reseau mobile de telecommunications a commutation de paquets et de circuits

Publications (1)

Publication Number Publication Date
EP1090525A1 true EP1090525A1 (fr) 2001-04-11

Family

ID=20411869

Family Applications (1)

Application Number Title Priority Date Filing Date
EP99935214A Withdrawn EP1090525A1 (fr) 1998-06-26 1999-06-16 Procede et appareil d'attribution de canaux dans un reseau mobile de telecommunications a commutation de paquets et de circuits

Country Status (6)

Country Link
EP (1) EP1090525A1 (fr)
CN (1) CN1315124A (fr)
AU (1) AU5073599A (fr)
CA (1) CA2335751A1 (fr)
SE (1) SE519730C2 (fr)
WO (1) WO2000001186A1 (fr)

Families Citing this family (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
FI20001544A (fi) 2000-06-29 2001-12-30 Nokia Networks Oy Poikkeavan päätelaitteen tukeminen verkossa
SE517920C2 (sv) * 2000-11-10 2002-08-06 Ericsson Telefon Ab L M Allokeringsförfarande i ett mobiltelekommunikationssystem
WO2002078230A1 (fr) * 2001-03-23 2002-10-03 Koninklijke Philips Electronics N.V. Ordonnancement de creneaux de donnees a vitesse fixe
WO2003098948A1 (fr) * 2002-05-21 2003-11-27 Nokia Corporation Procedure de remise en paquets pour services a commutation par paquets en mode par flux
US6631269B1 (en) 2002-05-23 2003-10-07 Interdigital Technology Corporation Signaling connection admission control in a wireless network
US7440763B2 (en) * 2003-04-11 2008-10-21 Telefonaktiebolaget Lm Ericsson (Publ) Multi-access call setup
EP2661924B1 (fr) * 2011-01-05 2019-10-30 Telefonaktiebolaget LM Ericsson (publ) Équilibrage de charge de données
CN103188807B (zh) * 2011-12-31 2016-05-25 中国移动通信集团广东有限公司 一种确定信道数量的方法及装置

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
GB2162022B (en) * 1984-07-17 1988-03-02 Stc Plc Data transmission system
CA2063901C (fr) * 1991-03-25 2002-08-13 Arunas G. Slekys Systeme de transmission de donnees en chevauchement dans un systeme cellulaire
FI114178B (fi) * 1995-01-09 2004-08-31 Nokia Corp Radiokapasiteetin dynaaminen jakaminen TDMA-järjestelmässä

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
See references of WO0001186A1 *

Also Published As

Publication number Publication date
SE519730C2 (sv) 2003-04-01
AU5073599A (en) 2000-01-17
SE9802295L (sv) 1999-12-27
CA2335751A1 (fr) 2000-01-06
SE9802295D0 (sv) 1998-06-26
WO2000001186A1 (fr) 2000-01-06
CN1315124A (zh) 2001-09-26

Similar Documents

Publication Publication Date Title
JP4319699B2 (ja) パケット通信システムのパフォーマンスを向上させる方法と装置
JP4450832B2 (ja) 時分割型通信システムにおける無線リソースを管理する方法およびシステム
US5349580A (en) Method and apparatus for channel allocation integrity in a communication network
JP3782352B2 (ja) 広帯域符号分割多元接続システムにおけるチャネル設定
EP1947897B1 (fr) Appareil de station de base sans fil capable d'utiliser efficacement des ressources sans fil en fonction des types de données
EP0993211B1 (fr) Technique de partition d'un canal à accès aléatoire pour système à AMRC
KR100249814B1 (ko) 실시간 대역 예약 요청 보장을 위한 다원 접속 방법
US5987021A (en) Method and apparatus for allocating resources between queued and non-queued services
EP1396966B1 (fr) Attribution dynamique de bande passante d'un flux de données à débit binaire variable
US7155533B2 (en) Procedure and controller for a packet-oriented data network for the transmission of data in variable time slots
WO2000001186A1 (fr) Procede et appareil d'attribution de canaux dans un reseau mobile de telecommunications a commutation de paquets et de circuits
US7630378B2 (en) Method for improving the QoS mechanisms in the bandwidth allocation-in CDMA mobile communication systems
EP1048153B1 (fr) Systeme permettant d'etablir une sequence de transmission pour plusieurs terminaux dans un reseau sans fil
EP2274941B1 (fr) Equilibrage de la charge de canal de commande commun dans un système de communications
KR100347733B1 (ko) 무선 이동 단말에서의 트래픽 제어 방법
KR100250478B1 (ko) 계층 구조의 셀에서 핸드오프 감소 및 셀의 트래픽분배를 고려한 호 접속 방법
JP3312718B2 (ja) 符号分割多重アクセス方法
KR100347731B1 (ko) 무선 이동 단말에서의 트래픽 제어 방법
JPH10308752A (ja) 通信装置及び通信システム
KR100714376B1 (ko) 시간 슬롯 분류 메커니즘을 포함하는 와이어레스 네트워크
WO2002003622A1 (fr) Etablissement des priorites d'abonnes dans un centre de commutation d'un systeme de telecommunication
KR100346779B1 (ko) 무선 에이티엠망에서 공통큐를 이용한 동적예약 무선 액세스 방법
KR100278314B1 (ko) 무선 비동기전달모드 망에서의 기지국과 단말간의 코드분할다중접속 인터페이스에 있어서 매체 다중접속 제어방법
CN117896852A (zh) 低延迟业务链路映射方法、多连接设备及存储介质
JP2000069549A (ja) 通信帯域制御方法

Legal Events

Date Code Title Description
PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

17P Request for examination filed

Effective date: 20001216

AK Designated contracting states

Kind code of ref document: A1

Designated state(s): ES GB IT

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: THE APPLICATION HAS BEEN WITHDRAWN

18W Application withdrawn

Effective date: 20030218