[go: up one dir, main page]

WO2008101366A1 - Procédé de distribution de paquets dans un système de communication sans fil - Google Patents

Procédé de distribution de paquets dans un système de communication sans fil Download PDF

Info

Publication number
WO2008101366A1
WO2008101366A1 PCT/CN2007/000590 CN2007000590W WO2008101366A1 WO 2008101366 A1 WO2008101366 A1 WO 2008101366A1 CN 2007000590 W CN2007000590 W CN 2007000590W WO 2008101366 A1 WO2008101366 A1 WO 2008101366A1
Authority
WO
WIPO (PCT)
Prior art keywords
service
rate
threshold
soft
resource
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.)
Ceased
Application number
PCT/CN2007/000590
Other languages
English (en)
Chinese (zh)
Inventor
Xiubin Sha
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.)
ZTE Corp
Original Assignee
ZTE Corp
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 ZTE Corp filed Critical ZTE Corp
Priority to PCT/CN2007/000590 priority Critical patent/WO2008101366A1/fr
Publication of WO2008101366A1 publication Critical patent/WO2008101366A1/fr
Anticipated expiration legal-status Critical
Ceased legal-status Critical Current

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W28/00—Network traffic management; Network resource management
    • H04W28/16—Central resource management; Negotiation of resources or communication parameters, e.g. negotiating bandwidth or QoS [Quality of Service]
    • H04W28/24—Negotiating SLA [Service Level Agreement]; Negotiating QoS [Quality of Service]

Definitions

  • the present invention relates to a wireless communication system supporting multi-user packet data services.
  • the rate scalability of packet services is very large. If the system data load is too light, the packet data service rate is too small, which will reduce the system throughput and waste system resources. If the packet data service rate is too large when the system load is heavy, the system resources will be exhausted and new users cannot access.
  • QoS Quality of Service
  • the system is generally considered to be congested when the user initiates a call but the system resources are insufficient to cause the call to fail, thereby triggering the packet data service rate to be lowered to release part of the resources.
  • Such a scheme can make full use of system resources, but the disadvantage is that a large amount of call loss occurs when the system is under heavy load, because the failure of resource allocation means that the call has failed, and the system congestion is considered to be late.
  • the technical problem to be solved by the present invention is to provide a packet scheduling method in a wireless communication system.
  • a wireless communication system carrying a multi-user packet data service when the system capacity is insufficient, the new user can still access the system.
  • the present invention provides a packet scheduling method in a wireless communication system, which includes the following steps: (a) when the system allocates resources to the target cell or increases the resource allocation of the service with the hard resource requirement of the service, if the resource allocation is successful, the next step is performed;
  • step (b) determining whether the system resource is sufficient according to a preset system resource threshold is performed by any one of the following three determinations:
  • the minimum hard resource requirement threshold is determined according to the type of the system bearer service, and is the maximum value of the minimum hard resource requirement of various services supported by the system.
  • the above method may further have the following features:
  • the system performs resource allocation with a minimum hard resource requirement of the service after receiving a service establishment request or a handover request.
  • the foregoing method may further have the following features:
  • the service performs resource preemption, and the resource preemption includes the following steps:
  • the new user does not wait for a timeout, the new user is reassigned resources.
  • the foregoing method may further have the following features: In the step-1), whether the user with a lower priority of the service quality of the service and can be preempted in the determining system is prioritized by the service quality in the system. The user with the lowest level starts to judge whether the user can be preempted according to the core network parameters carried by the radio access bearer when the service is established. If not, the user with the lower priority of the service quality is judged.
  • the packet scheduling and speed reduction processing of the service in the system includes the following steps:
  • (b-1) determining whether there is a rate-downtable service in the system, and if so, sorting the services in the system according to the size of the falling rate of the service rate, where the falling rate of the service rate refers to the current rate of the service The difference in the minimum rate of service, otherwise, the end;
  • step (b-2) preferentially reduce the service rate of the service with a large drop in service rate, and return to step (b-1) o
  • the foregoing method may further have the following features: after the service rate is lowered in the step (b-2), it is first determined whether the system resource is sufficient, and if so, the packet scheduling deceleration processing ends, otherwise the step returns to the step (b- 1), the determining whether the system resource is sufficient is to perform any one of the following three judgments:
  • the foregoing method may also have the following features: During the process of the packet data service, periodically monitor the traffic volume and perform the following steps:
  • step (i) when the packet scheduling and speed-up processing is performed on the service in the system, the following steps are included:
  • the foregoing method may further have the following feature: the difference between the soft congestion control threshold and the soft congestion control recovery threshold is greater than or equal to an increase in soft capacity that may be caused by a level of increase in various service rates.
  • Another technical problem to be solved by the present invention is to provide a packet scheduling method in a wireless communication system.
  • a wireless communication system carrying a multi-user packet data service when the system resources are dynamically adjusted according to the traffic demand, the original user can be guaranteed. Under the premise of business service quality, system resources are occupied at a low level.
  • the foregoing method may further have the following features:
  • the determining whether there is insufficient system resources after the service rate is adjusted one level and the service quality priority in the system is not slowed down is higher.
  • a low business is one of the following three judgments:
  • the foregoing method may further have the following features: In the step (C), after the current service rate is adjusted, determining whether the remaining amount of the system hard resource is less than a preset minimum hard resource requirement threshold or system soft Whether the capacity load is greater than the system soft capacity congestion control threshold, and if so, the packet scheduling and speed reduction processing is performed on the services in the system; otherwise, the packet scheduling acceleration process ends.
  • the above method may further have the following features: In the step (A), performing Before step (B), or in the step (C), it is judged whether the current service rate can be up-regulated, and if so, the execution continues, otherwise, it ends. Further, the foregoing method may further have the following feature: the difference between the soft congestion control threshold and the soft congestion control recovery threshold is greater than or equal to an increase in soft capacity that may be caused by a level of increase in various service rates.
  • the invention can basically solve the problem that the new service call loss is caused by the packet service rate in the system is too high through the five packet service related processing flows. Since the present invention comprehensively considers the characteristics of the packet data service, the performance of the wireless communication system, and the QoS of the packet data service carried in the wireless communication system, the packet access can be maximized under the premise of ensuring system performance and user QoS. The capacity of the system.
  • FIG. 1 is a diagram showing an example of a hard resource allocation process when an initial service is accessed
  • FIG. 2 is a diagram showing an example of a resource preemption process when a service is established
  • 3 is a diagram showing an example of a packet scheduling slowdown process triggered by congestion control
  • FIG. 4 is an exemplary diagram of a traffic triggering packet scheduling process
  • FIG. 5 is a diagram showing an example of a packet scheduling acceleration process in a service maintenance process.
  • the minimum hard resource requirement (Requirement- Hard) is also called the minimum hard resource demand threshold, which is determined according to the type of the system bearer service, and is generally the maximum value of the system supporting the minimum hard resource requirement of various services, or may be other settings. value.
  • the minimum hard resource requirement for guaranteeing a CS12.2k (circuit switched) service call is a code resource with a Spreading Factor (hereinafter referred to as SF) of 128; assuming I/B type PS services
  • SF Spreading Factor
  • the rate of the service requirement is 32K, which is equivalent to the minimum hard resource requirement is a code resource with an SF of 64.
  • the S-type PS service generally guarantees a rate of 64K, which is equivalent to a minimum hard resource requirement of a code resource with an SF of 32.
  • the code resource with the SF of 32 is equivalent to four code resources with an SF of 128. Therefore, the minimum hard resource requirement (Requirement- Hard) for ensuring QoS during initial service access can be configured as a code resource with an SF of 32.
  • the CongestionThreshold (Soft) threshold is mainly used to prevent the system soft capacity load from exceeding the maximum system soft capacity and affect the stable operation of the system. It can be determined according to system performance.
  • the soft capacity refers to downlink power and uplink interference.
  • the soft-capacity congestion control recovery threshold (NoraialThreshold_Soft) is mainly used to prevent the rate ping-pong lifting problem in the packet switching (Packet Switch, hereinafter referred to as PS) service acceleration process, which is generally smaller than the congestion control threshold, the congestion control threshold and the congestion control recovery threshold.
  • PS Packet Switch
  • the difference is greater than or equal to the increase in soft capacity that may result from a level of increase in various service rates.
  • the maximum downlink transmit power of the downlink TCP is 41 dBm
  • the congestion control threshold of the downlink is set to 40 dBm. If the TCP increment caused by the PS traffic rate increase is less than ldB, the congestion control recovery threshold of the downlink downlink can be set to 39 dBm. If the TCP increment caused by the PS rate up one level may be between 2 and 3 dB, the recovery threshold should be set to 37 dBm or lower.
  • the basic principle of the present invention is: The system load is lowered in advance to avoid accepting the call loss caused by the rejection (call failure). After each service hard resource application is completed, it is determined whether the remaining amount of system hard resources is less than Requirement- Hard or whether the system soft-capacity load is greater than the system soft-capacity congestion control gate. CongestionThreshold—Soft, if yes, triggers the system packet scheduling process until the system hard resource remaining amount is greater than Requirement—hard or the system soft capacity load is less than CongestionThreshold—Soft, reducing system load and ensuring that new users can access the system. In addition, when the user performs packet data service, the system performance parameters are periodically monitored and packet scheduling is performed to ensure the original user's QoS.
  • the congestion control process (such as PS service rate reduction) is triggered to release part of the resources to reduce the system load; when other factors trigger
  • the congestion control recovery threshold 39 dBm or 37 dBm. If yes, the rate-up process is not performed.
  • FIG. 1 is a resource allocation process of a service initial access cell, and the detailed implementation steps are as follows: Step 101: The system receives a service establishment request or a handover request.
  • Step 102 The system allocates resources in the target cell with the minimum hard resource requirement of the service; when the hard resources are relatively abundant, the system does not limit the resource allocation by using the minimum hard resource requirement of the service, but Multiple acceptance attempts and load shedding processes.
  • Step 103 If the resource allocation is successful, go to step 105, otherwise go to step 104; Step 104, invoke the resource preemption process when the service is established, as shown in Figure 2;
  • Step 105 Determine whether the remaining amount of the system hard resource is smaller than the minimum hard resource requirement threshold Requirement Jiard or the system soft capacity load that guarantees the QoS when the service is initially accessed. If the system is not greater than the system soft congestion control threshold CongestionThreshold_Soft, if yes, go to step 106. Otherwise, the business distribution process ends;
  • Step 106 Call the packet scheduling slowdown process triggered by the congestion control, as shown in FIG. 3.
  • Figure 2 shows the resource preemption process when the service is established. The detailed implementation steps are as follows:
  • Step 201 The system invokes a resource preemption process when the service is established
  • Step 202 Determine whether the new user has the preemption capability. If yes, perform the next step, otherwise the current resource preemption process ends.
  • Step 203 Determine whether there is a user with a lower service QoS priority and can be preempted in the system, for example, perform the next step; otherwise, the current resource preemption process ends;
  • Step 204 Release the user with the lowest service QoS priority in the system and can be preempted.
  • Step 205 Determine whether the new user waits for a timeout. If yes, the current resource preemption process ends. Otherwise, perform the next step;
  • Step 206 Re-allocate resources to the new user. If the user is accepted when the resource is re-allocated, the current resource preemption succeeds. If the user is rejected, the current call is terminated, and the current resource preemption process ends.
  • the present invention may also employ other various resource preemption processes.
  • 3 is an example of a packet scheduling slowdown process triggered by congestion control
  • Step 301 The congestion control triggers a packet scheduling slowdown process
  • Step 302 Determine whether there is a service whose rate can be continuously adjusted in the system, and if yes, perform the next step, otherwise, the packet scheduling slowdown process ends;
  • the criterion for determining whether the rate can continue to be down-regulated is related to the service type. For example, for the CS service, the rate cannot be lowered. For the stream service, the rate reduction should be no lower than the guaranteed rate (the CN parameter brought in the AB assignment); For interactive class background services, the rate can be reduced to zero. Step 303: Perform rate reduction priority ordering on services in the system.
  • the larger the margin the higher the priority of the drop rate, and the same margin is sorted according to the service QoS priority.
  • Step 304 Downgrade the service rate with the highest rate of descending rate first;
  • Step 305 Determine whether the remaining amount of the system hard resource is less than a minimum hard resource requirement threshold (Requirement- Hard) or whether the system soft capacity load is greater than a system soft congestion control threshold (CongestionThreshold_Sofl), and if yes, return to step 302, otherwise the packet scheduling slowdown The process ends.
  • a minimum hard resource requirement threshold Requirement- Hard
  • CongestionThreshold_Sofl system soft congestion control threshold
  • the packet service rate in the system is downgraded step by step according to the derating rate priority until all packet service rates in the system are reduced to no longer fall.
  • Figure 4 is an example of a traffic triggering packet scheduling process
  • Step 401 the traffic measurement report decision
  • Step 4 02 whether the traffic measurement triggers the service rate up-regulation, if yes, step 403 is performed, otherwise, step 404 is performed;
  • Step 403 Determine whether the current service rate is up-regulated, and if yes, perform the next step, otherwise, end;
  • Step 404 perform packet scheduling acceleration processing on the service (call the packet service acceleration process, see Figure 5); The purpose is to determine whether the current service has the maximum rate and whether it can be adjusted upwards. In another embodiment, the current service rate may not be up-regulated at this time, and the determination is performed in the packet scheduling acceleration process.
  • Step 405 Whether the traffic measurement triggers the service rate reduction, if yes, step 405 is performed; step 406, determining whether the current service rate can be down-regulated, and if yes, performing step 406, otherwise, ending;
  • step 407 the current service rate is lowered by one level or several levels.
  • the current service refers to the corresponding service carried by the user that reports the traffic measurement report (triggered rate reduction); reports a measurement report, and the service decreases the rate.
  • FIG. 5 is an example of a packet scheduling acceleration process in a service maintenance process
  • Step 501 triggering a packet scheduling acceleration process
  • Step 502 If the current service rate is increased by one level, whether the remaining amount of the system hard resource is less than the Requirement- Hard and the QoS priority of the system that is not decelerated is lower than the current service, if yes, the packet scheduling acceleration process End, otherwise, perform the next step;
  • the system soft capacity load may also be used as a judgment condition, that is, whether the current service rate increases by one level, whether the system soft load is greater than CongestionThreshold_Soft, and the system has no deceleration QoS priority lower than the current
  • the service of the service, or the system resource remaining amount and the system soft capacity load are simultaneously used as the judgment conditions, that is, whether the current system traffic rate rises one level later, the system hard resource remaining amount is less than the Requirement-Hard and the system soft capacity load is greater than the CongestionThreshold-Soft. There is no service in the system where the QoS priority can be lower than that of the current service.
  • Step 503 Determine whether the remaining amount of the hard resource in the system is less than Requirement_Hard, and if yes, the packet scheduling acceleration process ends; otherwise, perform the next step;
  • Step 504 Determine whether the soft load in the system is greater than NomialThreshold_Soft. If yes, the packet scheduling acceleration process ends; otherwise, perform the next step;
  • Step 505 the current service rate is adjusted by one level or several levels;
  • Step 506 Determine whether the remaining amount of the system hard resource is smaller than the minimum hard resource requirement threshold of the guaranteed QoS when the service is initially accessed, or whether the system soft load is greater than the system soft congestion control threshold CongestionThreshold_Soft, and if yes, step 508 is performed. Otherwise, the packet scheduling acceleration process ends;
  • Step 507 the packet scheduling slowdown process triggered by the congestion control is invoked, as shown in FIG. 3.
  • the packet scheduling slowdown process can also be triggered when the resource allocation of the service is increased.
  • the current user will be rate-up. If the remaining amount of the hard resource is less than the Requirement-Hard after the up-regulation, the Qos can be lower through the congestion control rate-down process. The user's rate drops. For example: A 32Kbps user requests an increase rate, but the current load of the system is greater than the congestion control recovery threshold. If there is a 384Kbps service in the system, the service rate of 32Kbps can be raised to 128Kbps, and then the service rate of 384Kbps will be To 256Kbps.
  • the method comprehensively considers the characteristics of the packet data service, the performance of the wireless communication system, the QoS of the packet data service carried in the wireless communication system, and the like, and can maximize the packet access system under the premise of ensuring system performance and user QoS. Capacity.

Landscapes

  • Engineering & Computer Science (AREA)
  • Quality & Reliability (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

L'invention concerne un procédé de distribution de paquets dans un système de communication sans fil qui supporte un service de données de paquets multi-utilisateur, et permet à un nouvel utilisateur d'accéder au système lorsque la capacité du système est insuffisante. Le procédé comporte les étapes suivantes : le système distribue les ressources (102) ou accroît la distribution des ressources du service dans une cellule destinataire selon la quantité demandée de ressources strictes du service, et, si la distribution des ressources a réussi, l'étape suivante est mise en oeuvre (103); les ressources du système sont déterminées suffisantes ou non selon un seuil (105) préétabli de ressources système, et, si les ressources système sont insuffisantes, un processus de ralentissement de la distribution des paquets est mis en oeuvre (106) sur le service du système.
PCT/CN2007/000590 2007-02-17 2007-02-17 Procédé de distribution de paquets dans un système de communication sans fil Ceased WO2008101366A1 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
PCT/CN2007/000590 WO2008101366A1 (fr) 2007-02-17 2007-02-17 Procédé de distribution de paquets dans un système de communication sans fil

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/CN2007/000590 WO2008101366A1 (fr) 2007-02-17 2007-02-17 Procédé de distribution de paquets dans un système de communication sans fil

Publications (1)

Publication Number Publication Date
WO2008101366A1 true WO2008101366A1 (fr) 2008-08-28

Family

ID=39709604

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2007/000590 Ceased WO2008101366A1 (fr) 2007-02-17 2007-02-17 Procédé de distribution de paquets dans un système de communication sans fil

Country Status (1)

Country Link
WO (1) WO2008101366A1 (fr)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110825520A (zh) * 2019-10-18 2020-02-21 山东省计算中心（国家超级计算济南中心） 一种实现资源高效利用的集群极速弹性伸缩方法
CN118170107A (zh) * 2024-05-16 2024-06-11 青岛国创智能家电研究院有限公司 基于可抽象设备功能的操作系统的调度方法、装置、系统

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1520653A (zh) * 2001-06-25 2004-08-11 ����ɭ�绰�ɷ����޹�˾ 通信系统中触发分组数据速率改变
CN1671233A (zh) * 2004-03-15 2005-09-21 大唐移动通信设备有限公司 移动通信系统中非实时业务的资源分配和调度方法
CN1681348A (zh) * 2004-04-08 2005-10-12 大唐移动通信设备有限公司 控制移动终端非实时业务数据传输的方法

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1520653A (zh) * 2001-06-25 2004-08-11 ����ɭ�绰�ɷ����޹�˾ 通信系统中触发分组数据速率改变
CN1671233A (zh) * 2004-03-15 2005-09-21 大唐移动通信设备有限公司 移动通信系统中非实时业务的资源分配和调度方法
CN1681348A (zh) * 2004-04-08 2005-10-12 大唐移动通信设备有限公司 控制移动终端非实时业务数据传输的方法

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110825520A (zh) * 2019-10-18 2020-02-21 山东省计算中心（国家超级计算济南中心） 一种实现资源高效利用的集群极速弹性伸缩方法
CN110825520B (zh) * 2019-10-18 2023-08-29 山东省计算中心（国家超级计算济南中心） 一种实现资源高效利用的集群极速弹性伸缩方法
CN118170107A (zh) * 2024-05-16 2024-06-11 青岛国创智能家电研究院有限公司 基于可抽象设备功能的操作系统的调度方法、装置、系统

Similar Documents

Publication Publication Date Title
US9414255B2 (en) Packet flow control in a wireless communications network based on an indication contained in a packet
KR100426357B1 (ko) 이동통신시스템의 서비스품질 및 자원관리를 위한스케줄링 방법
US7453801B2 (en) Admission control and resource allocation in a communication system supporting application flows having quality of service requirements
RU2460120C2 (ru) Способ и устройство для управления ресурсами в беспроводном устройстве
US9743314B2 (en) Communication network congestion control using allocation and retention priority
KR20070095905A (ko) 고속 다운링크 패킷 접속을 위한 셀 변경에서의 흐름 제어방법 및 장치
US20230072593A1 (en) Traffic Control Method, Network Device, and Communication System
CN100454903C (zh) 一种对iub接口进行流量控制的方法
CN101572918B (zh) 一种分配无线资源的方法、装置和系统
WO2005053329A1 (fr) Procede pour attribution de ressources de canal sans fil et regulation de debit dans un systeme de communication amrc
EP2854446A1 (fr) Procédé et dispositif de contrôle d'accès
WO2011032454A1 (fr) Procédé et équipement permettant d'allouer des ressources d'un réseau partagé
EP1326463A1 (fr) Méthode et appareil pour l'ordonnancement de la transmission de paquets par la fonction de commande de charge
CN102857969A (zh) 一种拥塞控制方法及系统
CN101626598A (zh) 传输资源管理的方法和系统
CN100369524C (zh) 一种cdma系统上行包调度方法
JP5410296B2 (ja) 高速ダウンリンク・パケット・アクセスに有用な電力過負荷制御方法
JP4348367B2 (ja) 通信システム、通信ユニット、およびその内部における能力温存方法
CN102223668A (zh) 长期演进lte系统中业务拥塞时的资源抢占方法
WO2008101366A1 (fr) Procédé de distribution de paquets dans un système de communication sans fil
CN100421530C (zh) 无线网中前向兼容终端的接入方法
CN101902779B (zh) 控制上行增强专用信道的信用度资源分配的方法、设备及系统
CN100514938C (zh) 无线网络中Iub接口带宽资源的控制方法及其系统
CN100581167C (zh) 资源接入方法及其装置
CN100417290C (zh) 一种第三代移动通讯系统中的拥塞控制方法

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 07711006

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 07711006

Country of ref document: EP

Kind code of ref document: A1