KR20120138157A - Scheduling apparatus and method - Google Patents

Scheduling apparatus and method Download PDF

Info

Publication number
KR20120138157A
KR20120138157A KR1020110057501A KR20110057501A KR20120138157A KR 20120138157 A KR20120138157 A KR 20120138157A KR 1020110057501 A KR1020110057501 A KR 1020110057501A KR 20110057501 A KR20110057501 A KR 20110057501A KR 20120138157 A KR20120138157 A KR 20120138157A
Authority
KR
South Korea
Prior art keywords
data
base station
queue
service provider
data queue
Prior art date
Application number
KR1020110057501A
Other languages
Korean (ko)
Inventor
김태근
강경운
이재형
Original Assignee
에스케이텔레콤 주식회사
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 에스케이텔레콤 주식회사 filed Critical 에스케이텔레콤 주식회사
Priority to KR1020110057501A priority Critical patent/KR20120138157A/en
Publication of KR20120138157A publication Critical patent/KR20120138157A/en

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W28/00Network traffic management; Network resource management
    • H04W28/02Traffic management, e.g. flow control or congestion control
    • H04W28/10Flow control between communication endpoints
    • H04W28/14Flow control between communication endpoints using intermediate storage
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W72/00Local resource management
    • H04W72/12Wireless traffic scheduling
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic control in data switching networks
    • H04L47/50Queue scheduling

Abstract

PURPOSE: A scheduling apparatus and method thereof are provided to transmit data to a BS(base station) based on data usage rates set in each communication service provider by using a predetermined data queue. CONSTITUTION: A storage unit(111) stores data transmitted from an EPC(evolved packet core) node of one or more communication service providers one or more data queues which are divided in the one or more communication service providers. A transmission unit(112) transmits data stored in the one or more data queues in a BS based on data usage rates set between the one or more communication service provides. The transmission unit extracts the data from the one or more data queues according to the data usage rates. The transmission unit transmits the extracted data to the BS. [Reference numerals] (111) Storage unit; (112) Transmission unit; (113) Blocking unit; (121) EPC node 1; (122) EPC node 2; (123) EPC node N; (130) Base station

Description

Scheduling Apparatus and Method {SCHEDULING APPARATUS AND METHOD}

A scheduling apparatus and method are disclosed. Particularly, embodiments of the present invention store data transmitted for each service provider by using a predetermined data queue in a communication system in which a plurality of service providers share a base station, and then, in a data usage ratio set for each service provider. By transmitting the data to the base station based on the scheme, without having to implement a complicated scheduler in the base station, the base station can perform a service for a user using a conventional scheduling scheme.

In recent years, as the amount of data used in a mobile communication network increases, research into a technology for providing an optimal service using limited resources to a user has been actively conducted.

In particular, recently, discussions have been made on how to establish a network through a predetermined contract between communication providers and provide a communication service by sharing the constructed network.

 For example, in the case of a base station that requires a lot of construction costs, in an urban area where there are many subscribers and a lot of profits, telecommunication operators can establish a network and provide communication services to users, but there are many populations or subscribers, but coverage is secured. In a non-city area where a base station needs to be established for a single base station, and several communication providers share the base station to provide a service, it is possible to reduce the cost and time according to the base station construction.

In general, since service providers have different subscriber numbers, data usage requirements for each service provider may be different. Therefore, in order to provide communication services by sharing a base station, service providers should consider data usage for each service provider. There is a need.

For example, if the carrier A and the carrier B share one base station, since the capacity that one base station can provide is limited, the number of subscribers of the carrier A is greater than that of the carrier B, so When the data usage is greater than the carrier B, the carrier A and the carrier B need to determine the usage ratio of the capacity that the base station can provide based on the data usage.

However, in general, the scheduler included in the base station is often unable to perform a complicated scheduling operation, it may not be able to schedule the data transmission in consideration of the data usage ratio determined between each carrier.

Therefore, when a plurality of carriers share one base station, a study on a scheme of scheduling data transmission in consideration of the data usage ratio between the carriers is required.

Embodiments of the present invention store data transmitted for each service provider using a predetermined data queue in a communication system in which a plurality of service providers share a base station, and then store the data based on a data usage ratio set for each service provider. By transmitting to the base station, the base station can perform the service for the user by using the existing scheduling scheme, without having to implement a complicated scheduler in the base station.

According to an embodiment of the present invention, a scheduling apparatus includes a storage unit configured to store data transmitted from an Evolved Packet Core (EPC) node of each at least one carrier in at least one data queue divided by the at least one carrier; And a transmitter configured to transmit data stored in the at least one data queue to a base station based on a data usage ratio set between the at least one communication provider.

In this case, according to an embodiment of the present invention, the transmitter may extract data from each of the at least one data queue according to the data usage ratio, and transmit the extracted data to the base station.

In addition, according to an embodiment of the present invention, when the amount of data stored in the first data queue of the at least one data queue exceeds a predetermined threshold, the scheduling apparatus is transmitted to the first data queue. The apparatus may further include a blocking unit for blocking data.

In addition, according to an embodiment of the present invention, the size of the at least one data queue may be divided according to the data usage ratio.

According to an embodiment of the present invention, a scheduling method includes storing data transmitted from each EPC node of at least one service provider in at least one data queue divided by the at least one service provider and the at least one service provider. And transmitting the data stored in the at least one data queue to the base station based on the data usage ratio set between the two.

In this case, according to an embodiment of the present invention, the transmitting may extract data from each of the at least one data queue according to the data usage ratio, and transmit the extracted data to the base station.

According to an embodiment of the present invention, if the amount of data stored in a first data queue of the at least one data queue exceeds a predetermined threshold, the scheduling method blocks data transmitted to the first data queue. It may further comprise the step.

In addition, according to an embodiment of the present invention, the size of the at least one data queue may be divided according to the data usage ratio.

Embodiments of the present invention store data transmitted for each service provider using a predetermined data queue in a communication system in which a plurality of service providers share a base station, and then store the data based on a data usage ratio set for each service provider. By transmitting to the base station, it is possible to assist the base station to perform the service for the user using the existing scheduling scheme, without having to implement a complicated scheduler in the base station.

In addition, embodiments of the present invention can share limited radio resources in a cell according to a data usage rate between carriers without increasing the complexity of the scheduler of the base station.

1 is a diagram showing the structure of a scheduling apparatus according to an embodiment of the present invention.
2 is a view for explaining the operation of the scheduling apparatus according to an embodiment of the present invention.
3 is a flowchart illustrating a scheduling method according to an embodiment of the present invention.

Hereinafter, embodiments according to the present invention will be described in detail with reference to the accompanying drawings. However, the present invention is not limited to or limited by the embodiments. Also, like reference numerals in the drawings denote like elements.

As a method of sharing a base station among a plurality of service providers, there are a method in which each service provider configures a separate cell with its own frequency band and a method in which each service provider shares a frequency band to provide a communication service.

The former method uses only its own frequency band allocated to each service provider and does not share the frequency band with other service providers.

In other words, carriers share a place for establishing a base station, a base station, an antenna, and related hardware, but use a separate frequency to configure an independent cell for each carrier.

In this case, only the terminal of the communication service provider can access the specific cell.

Therefore, such a communication system can set a cell configuration and parameters desired by a carrier for each cell, and thus radio quality may vary according to a carrier.

The latter method for sharing a base station is a method in which each service provider shares one frequency band and performs a service for a terminal based on a data usage ratio set through a predetermined contract between service providers.

In such a communication system, the carriers share the allocated frequency bands, thereby increasing frequency efficiency, and even a non-international licensed carrier can establish a nationwide network by sharing the frequency with other carriers.

In addition, in such a communication system, terminals in the same cell may receive services of different communication providers, and up to six carriers may share frequency.

However, in a system in which a plurality of service providers share a common frequency band, the number of subscribers may be different for each service provider, and thus, it is necessary to appropriately classify data usage rates among service providers.

For example, if the service provider A has 10 million subscribers, but the service provider B has 5 million subscribers, and the service providers A and B share a common frequency, the frequency utilization rate of the service provider A is the service provider B. Can be higher.

Therefore, the service providers A and B need to divide the data usage ratio through a predetermined contract.

However, in general, the scheduler included in the base station is often unable to perform a complicated scheduling operation, it may not be able to schedule the data transmission in consideration of the data usage ratio determined between each carrier.

Accordingly, embodiments of the present invention store data transmitted for each service provider by using a predetermined data queue in a communication system in which a plurality of service providers share a base station, and then, based on the data usage ratio set for each service provider, By transmitting the data to the base station, the base station can perform a service for a user using an existing scheduling scheme without having to implement a complicated scheduler in the base station.

1 is a diagram showing the structure of a scheduling apparatus according to an embodiment of the present invention.

Referring to FIG. 1, the scheduling apparatus 110 includes a storage 111 and a transmitter 112.

The storage 111 stores data transmitted from the EPC nodes 121, 122, and 123 of each of the at least one service provider in at least one data queue divided by the at least one service provider.

The transmitter 112 transmits the data stored in the at least one data queue to the base station 130 based on the data usage ratio set between the at least one communication service provider.

At this time, according to an embodiment of the present invention, the transmitter 112 may transmit the data stored in the at least one data queue to the base station 130 based on the data usage ratio.

Hereinafter, the operation of the scheduling apparatus 110 according to an embodiment of the present invention will be described in detail with reference to FIG. 2.

2 is a view for explaining the operation of the scheduling apparatus 110 according to an embodiment of the present invention.

First, it is assumed that the communication service provider 1, the communication service provider 2, and the communication service provider 3 share the base station 130, and the data use ratio between the communication service provider 1, the communication service provider 2, and the communication service provider 3 is 3: 2: 5.

The storage unit 111 stores data transmitted from the EPC node of the service provider 1 in the data queue 1 210, stores data transmitted from the EPC node of the service provider 2 in the data queue 2 220, and communicates with the service provider. Data transmitted from the EPC node of 3 may be stored in the data queue 3 230.

At this time, the data stored in the data queue 1 (210), the data queue 2 (220), and the data queue 3 (230) may be different because the amount of subscriber or requested data may be different between the respective service providers. Can be different.

The transmission unit 112, as shown in the reference numerals 211, 221, 231 in consideration of the data usage ratio between the carrier 1, the carrier 2, the carrier 3, data queue 1 (210), data queue 2 (220) The data may be extracted from the data queue 3 230 according to the data use ratio 3: 2: 5 and then transmitted to the base station 130.

At this time, according to an embodiment of the present invention, the transmission unit 112 according to the data use ratio 3: 2: 5 from the data queue 1 (210), the data queue 2 (220), the data queue 3 (230). The data may be sequentially extracted in a token manner and then transmitted to the base station 130.

When the base station 130 receives data from the scheduling apparatus 110, the received data is sequentially transmitted to the user by using proportional fairness (PF) scheduling or the like regardless of the data usage ratio between the carriers. You can perform the service.

As a result, the scheduling apparatus 110 according to an embodiment of the present invention stores data transmitted for each service provider by using a predetermined data queue, and then stores the data based on the data usage ratio set for each service provider. ), It is possible to assist the base station 130 to perform a service for a user using an existing scheduling scheme, without having to implement a complicated scheduler in the base station 130.

In other words, the base station 130 does not need to perform a process of classifying users for each communication service provider, and only needs to perform scheduling by reflecting a wireless environment according to the number, location, etc. of users located in a cell.

According to an embodiment of the present invention, the size of the at least one data queue may be divided according to the data usage ratio.

In addition, according to an embodiment of the present invention, the scheduling apparatus 110 further includes a blocking unit 113.

The blocking unit 113 blocks the data transmitted to the first data queue when the amount of data stored in the first data queue of the at least one data queue exceeds a predetermined threshold.

In more detail, the blocking unit 113 is based on a random early detection (RED) method to prevent data drop that may occur due to the concentration of data in data queues classified by communication providers. After determining whether the amount of data to be stored exceeds the predetermined threshold, and when the amount of data to be stored in the data queue exceeds the predetermined threshold, random data is blocked to induce data retransmission on the data transmission side. can do.

That is, the blocking unit 113 naturally allocates radio resources according to the data usage ratio set between the carriers by naturally delaying the data of the carriers having high traffic.

3 is a flowchart illustrating a scheduling method according to an embodiment of the present invention.

In step S310, data transmitted from the EPC node of each of the at least one communication provider is stored in at least one data queue divided by the at least one communication provider.

In step S320, data stored in the at least one data queue is transmitted to a base station based on a data usage ratio set between the at least one communication service provider.

At this time, according to an embodiment of the present invention, in step S320, data may be extracted from each of the at least one data queue according to the data usage ratio, and the extracted data may be transmitted to the base station.

In addition, according to an embodiment of the present invention, if the amount of data stored in the first data queue of the at least one data queue after the step (S310) exceeds the predetermined threshold, the first data The method may further include blocking data transmitted to the queue.

In addition, according to an embodiment of the present invention, the size of the at least one data queue may be divided according to the data usage ratio.

As a result, the scheduling method according to an embodiment of the present invention stores data transmitted for each service provider by using a predetermined data queue, and then transmits the data to the base station based on a data usage ratio set for each service provider. Without having to implement a complicated scheduler in the base station, it is possible to assist the base station to perform a service for a user using an existing scheduling scheme.

The scheduling method according to an embodiment of the present invention has been described above with reference to FIG. 3. Here, since the scheduling method according to an embodiment of the present invention may correspond to the configuration of the scheduling apparatus 110 described with reference to FIG. 1, a detailed description thereof will be omitted.

Scheduling method according to an embodiment of the present invention is implemented in the form of program instructions that can be executed by various computer means may be recorded on a computer readable medium. The computer readable medium may include program instructions, data files, data structures, etc. alone or in combination. The program instructions recorded on the medium may be those specially designed and constructed for the present invention or may be available to those skilled in the art of computer software. Examples of computer-readable recording media include magnetic media such as hard disks, floppy disks, and magnetic tape, optical media such as CD-ROMs, DVDs, and magnetic disks, such as floppy disks. Magneto-optical media, and hardware devices specifically configured to store and execute program instructions, such as ROM, RAM, flash memory, and the like. Examples of program instructions include not only machine code generated by a compiler, but also high-level language code that can be executed by a computer using an interpreter or the like. The hardware device described above may be configured to operate as one or more software modules to perform the operations of the present invention, and vice versa.

In the present invention as described above has been described by the specific embodiments, such as specific components and limited embodiments and drawings, but this is provided to help a more general understanding of the present invention, the present invention is not limited to the above embodiments. For those skilled in the art, various modifications and variations are possible from these descriptions.

Accordingly, the spirit of the present invention should not be construed as being limited to the embodiments described, and all of the equivalents or equivalents of the claims, as well as the following claims, belong to the scope of the present invention .

110: scheduling device
111: storage unit 112: transmission unit
113: blocking unit
121, 122, 123: EPC nodes
130: base station

Claims (8)

A storage unit for storing data transmitted from each EPC node of at least one telecommunication service provider in at least one data queue divided by the at least one telecommunication service provider; And
Transmitter for transmitting the data stored in the at least one data queue to the base station based on the data usage ratio set between the at least one communication provider
Scheduling apparatus comprising a.
The method of claim 1,
The transmitter
And extract data from each of the at least one data queue according to the data usage ratio, and transmit the extracted data to the base station.
The method of claim 1,
A blocking unit to block data transmitted to the first data queue when the amount of data stored in the first data queue of the at least one data queue exceeds a predetermined threshold.
The scheduling apparatus further comprises.
The method of claim 1,
And a size of the at least one data queue is divided according to the data usage ratio.
Storing data transmitted from an Evolved Packet Core (EPC) node of each of at least one service provider in at least one data queue divided by the at least one service provider; And
Transmitting data stored in the at least one data queue to a base station based on a data usage ratio set between the at least one communication operator;
Scheduling method comprising a.
The method of claim 5,
The transmitting step
And extracting data from each of the at least one data queue according to the data usage ratio, and transmitting the extracted data to the base station.
The method of claim 5,
Blocking data transmitted to the first data queue when the amount of data stored in the first data queue of the at least one data queue exceeds a predetermined threshold;
The scheduling method further comprising.
The method of claim 5,
The size of the at least one data queue is divided according to the data usage ratio.
KR1020110057501A 2011-06-14 2011-06-14 Scheduling apparatus and method KR20120138157A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
KR1020110057501A KR20120138157A (en) 2011-06-14 2011-06-14 Scheduling apparatus and method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
KR1020110057501A KR20120138157A (en) 2011-06-14 2011-06-14 Scheduling apparatus and method

Publications (1)

Publication Number Publication Date
KR20120138157A true KR20120138157A (en) 2012-12-24

Family

ID=47905034

Family Applications (1)

Application Number Title Priority Date Filing Date
KR1020110057501A KR20120138157A (en) 2011-06-14 2011-06-14 Scheduling apparatus and method

Country Status (1)

Country Link
KR (1) KR20120138157A (en)

Similar Documents

Publication Publication Date Title
US10462846B2 (en) Multi-service provider wireless access point
CN100399856C (en) Resource management apparatus and a method of resource management therefor
EP3783987A1 (en) Information transmission method and device
CN110945933B (en) Resource allocation method, first device and second device
EP3288329A1 (en) Frequency spectrum coordination device and method, and device and method in wireless communication system
JP6575850B2 (en) Wireless communication terminal and base station allocation method
US10405263B2 (en) Private radio networks
US9020514B2 (en) Multi-cell network including communication device scheduling outer cell frequency resource and method for same
US10461900B2 (en) Hierarchical arrangement and multiplexing of mobile network resource slices for logical networks
CN109802838B (en) Method and equipment for integrated charging
WO2017133617A1 (en) Device and method for wireless communication system, and spectrum management device
CN106612166B (en) A kind of method and apparatus of narrow band transmission
EP2934033A1 (en) Method and base station for performing interference coordination in lte trunking communication system
CN103379498A (en) Method and device for sharing dynamic spectrums
RU2013113226A (en) METHOD AND DEVICE FOR THE PROVISION OF DIFFERENTIATED SERVICES FOR USER EQUIPMENT
CN103096474A (en) Data distribution transmission method, user equipment and base station
CN102917443A (en) Method and device for selecting gateway and transmitting information, and network system
WO2016170719A1 (en) Radio communication terminal and frequency assignment method
CN104081745B (en) Uplink transmission method, base station, and user equipment
US11723062B2 (en) System and method for determining priorities for handling data based on network slice identifiers
CN110313198A (en) Terminal device, base station, control equipment, method and recording medium
CN109845312B (en) Data transmission method and device, computer equipment and system
CN104509133A (en) Method, base station and user terminal of transmitting signal in device-to-device approach service
US20160360523A1 (en) Access system, device and method
US11477808B2 (en) System and method for low latency integrated access and backhaul

Legal Events

Date Code Title Description
WITN Withdrawal due to no request for examination