JP7643548B2 - CONTROLLER, COMMUNICATION SYSTEM, CONTROL METHOD, AND PROGRAM - Google Patents

Description

The present disclosure relates to a controller, a communication system, a control method, and a program for controlling communications across multiple access networks.

In recent years, studies have been underway to accommodate multiple services and applications with various network requirements on the same network infrastructure. To achieve this, it is necessary to guarantee the quality required by each service or application accommodated on the same network (NW) in the end-to-end sections from "terminal to terminal" and "terminal to application server."

The end-to-end of a network can be divided into wireless and wired sections. In particular, in wireless sections, there is a priority control function called Enhanced Distributed Channel Access (EDCA) of IEEE 802.11 as an existing technology (see, for example, Non-Patent Documents 1 and 2).

EDCA is a terminal (destination)-based control, and it is difficult to control on a traffic flow basis, which would enable quality control on a service and application basis. However, by applying the technology in non-patent document 3, it is possible to achieve quality control on a service and application basis.

IEEE 802.11e-2005 - IEEE Standard for Information technology--Local and metropolitan area networks--Specific requirements--Part 11: Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) Specifications - Amendment 8: Medium Access Control (MAC) Quality of Service Enhancements "IEEE802.11e: Wireless LAN standard for achieving QoS," Journal of the Institute of Image Information and Television Engineers, Vol. 57, No. 11 (2003) Yuki Sakagami, Kazuki Aiura, Tatsuya Fukui, et al.: "Proposal of quality control technology by centralized control independent of wireless network", Institute of Electronics, Information and Communication Engineers General Conference, March 9, 2021, B-6-5

However, the transmission control technology in Non-Patent Document 3 is a technology for a single wireless network. For this reason, for example, when multiple access points use a wireless network of the same frequency as in Figure 1, interference occurs due to their wireless communications, and the transmission control technology in Non-Patent Document 3 has the problem that it is difficult to transmit packets according to the scheduler. For example, if the packet transmission timing of terminals #1-N and #2-N' overlaps, the interference will cause the transmission to physically fail. No specific solution to this problem has been made clear.

Therefore, in order to solve the above problem, the present invention aims to provide a controller, a communication system, a control method, and a program capable of performing transmission scheduling for multiple wireless networks that avoids mutual interference.

To achieve the above objective, the controller of the present invention collects information from terminals and access points included in each network and schedules transmission timing collectively.

Specifically, the controller according to the present invention is a controller that controls traffic of a plurality of networks,
Each of the networks has one access point and one or more terminals, and transmits packets between the terminals and the access point;
a database for storing, at each predetermined period, the amount of packets stored in a buffer for each traffic flow of the terminal and the access point;
a scheduler that calculates a transmission schedule for packets to be transmitted from the buffer based on the packet amounts stored in the database for each of the predetermined periods, and that applies a restriction when calculating the transmission schedule so that the total packet amount to be transmitted from all of the buffers included in the network does not exceed the product of the throughput of each of the networks and the predetermined period;
a transmitter for transmitting the transmission schedule to the terminal and the access point;
The present invention is characterized by comprising:

A control method according to the present invention is a control method for controlling traffic of a plurality of networks, comprising the steps of:
Each of the networks has one access point and one or more terminals, and transmits packets between the terminals and the access point;
storing, at each predetermined period, an amount of packets accumulated in a buffer for each traffic flow possessed by said terminal and said access point;
calculating a transmission schedule for packets to be transmitted from the buffer based on the amount of packets stored in the database for each of the predetermined periods;
adding a restriction so that a total amount of packets to be transmitted from all of the buffers included in the network does not exceed a product of a throughput of each of the networks and the predetermined period when calculating the transmission schedule; and transmitting the transmission schedule to the terminal and the access point.
The present invention is characterized by carrying out the following steps.

When scheduling packet transmission timing, this controller grasps the amount of packets accumulated from all terminals and access points, sets a limit to keep the total packet transmission amount below the product of the throughput and the schedule period, and performs schedule calculations. Therefore, the present invention can provide a controller and control method that can perform transmission scheduling for multiple wireless networks that avoids mutual interference.

The calculation method is as follows.
(1) First Calculation Method: The database also stores the bandwidth of each of the networks,
The scheduler is characterized in that, in the restriction, the total amount of packets transmitted from all of the buffers included in each of the networks is equal to or less than the bandwidth of each of the networks.
(2) Second Calculation Method The scheduler:
The predetermined period is divided for each of the networks to obtain divided periods,
In the above restriction, the product of the throughput of each of the networks and the predetermined period is set to the product of the throughput of each of the networks and the division period.
(3) Third Calculation Method When the communication between the terminal and the access point is Orthogonal Frequency-Division Multiplexing (OFDM),
The scheduler
Divide each subcarrier available in the network into divided subcarriers for each network;
In the above restriction, the product of the throughput of each of the networks and the predetermined period is set to the product of the throughput of each of the networks when the subcarriers are divided and the predetermined period.

The communication system of the present invention further comprises the controller and multiple networks having one of the access points and one or more of the terminals.

Furthermore, the present invention is a program for causing a computer to function as the controller. The data collection device of the present invention can also be realized by a computer and a program, and the program can be recorded on a recording medium or provided via a network.

The above inventions can be combined as much as possible.

The present invention can provide a controller, communication system, control method, and program capable of transmission scheduling for multiple wireless networks that avoids mutual interference.

FIG. 1 is a diagram illustrating a problem to be solved by the present invention. FIG. 1 is a diagram illustrating a communication system according to the present invention. FIG. 4 is a diagram for explaining a database provided in a controller according to the present invention. FIG. 4 is a diagram for explaining a database provided in a controller according to the present invention. FIG. 4 is a diagram illustrating a control method according to the present invention. FIG. 4 is a diagram illustrating a control method according to the present invention. FIG. 4 is a diagram illustrating a control method according to the present invention. FIG. 1 is a diagram illustrating a communication system according to the present invention.

An embodiment of the present invention will be described with reference to the attached drawings. The embodiment described below is an example of the present invention, and the present invention is not limited to the following embodiment. Note that components with the same reference numerals in this specification and drawings are assumed to indicate the same components.

(Embodiment 1)
Fig. 2 is a diagram for explaining the communication system of this embodiment. This communication system includes a controller 13, and multiple networks (NW#1, NW#2) each having one access point 12 and one or multiple terminals 11. In Fig. 2, the number of networks NW is two, but it may be three or more. In addition, the networks are wireless networks, and all of them communicate at the same frequency.

The controller 13 is connected to each terminal 11 and each access point 12, and it is assumed that no other network devices exist.
It is assumed that the controller 13 has previously recorded in the database unit DB each of the terminals 11 to be connected, each of the access points 12, the network NW#j to which they belong, and the maximum throughput _TPj .

The controller 13 is connected to each terminal 11 and each access point 12 .
Each terminal 11 and each access point 12 accumulates packets in a buffer for each traffic flow (per-flow buffer units FB1, FB2) or in a buffer within an application, and notifies the controller 13 of the amount of accumulated packets at predetermined intervals.
The controller 13 records the notified accumulated packet amounts in the database unit DB.
The scheduling unit SCH3 of the controller 13 determines the packet transmission schedule (transmission time and transmission amount for each traffic flow) for each flow unit buffer unit (FB1, FB2) based on the information in the database unit DB. At this time, the scheduling unit SCH3 calculates so that the total packet transmission amount according to the schedule does not exceed the product of the throughput and a predetermined period (schedule period). Details of the scheduling will be described later.
The controller 13 notifies each terminal 11 and each access point 12 of the determined transmission schedule.
The scheduler units (SCH1, SCH2) of each terminal 11 and each access point 12 instruct each per-flow buffer unit (FB1, FB2) to transmit packets according to the notified transmission schedule.
Each terminal 11 and each access point 12 transmits packets via a main signal buffer unit (MB1, MB2) and a main signal transmitting/receiving unit (MTR1, MTR2).
It is assumed that the times of the terminals 11, the access points 12, and the controller 13 are synchronized using NTP (Network Time Protocol), PTP (Precision Time Protocol), or the like.

Specifically, the controller 13 is a controller that controls traffic of a plurality of networks NW#j,
Each network NW#j has one access point 12 and one or more terminals 11, and transmits packets between the terminals 11 and the access points 12.
a database DB for storing the amount of packets stored in the buffers (FB1, FB2) for each traffic flow of the terminal 11 and the access point 12 at each predetermined period;
a scheduler SCH3 that calculates a transmission schedule for packets to be transmitted from the buffers (FB1, FB2) based on the packet amounts stored in a database DB for each of the predetermined periods, and that applies a restriction when calculating the transmission schedule so that the total packet amount to be transmitted from all the buffers (FB1, FB2) included in the network NW#j does not exceed the product of the throughput of each of the networks NW#j and the predetermined period;
a transmitter CTR3 for transmitting the transmission schedule to a terminal 11 and an access point 12;
The present invention is characterized by comprising:

This communication system communicates control signals between the controller 13 and the access points 12/terminals 11 using a communication means separate from the communication means for the main signals (traffic packets). Specifically, the control signals are transmitted and received between the control signal transmitting/receiving unit CTR1 of each terminal 11 and the control signal transmitting/receiving unit CTR3 of the controller 13, and between the control signal transmitting/receiving unit CTR2 of each access point 12 and the control signal transmitting/receiving unit CTR3 of the controller 13.

Each terminal 11 and each access point 12 periodically (every schedule period) notifies the controller 13 of the amount of packets stored in the per-flow buffer units (FB1, FB2) as a control signal.
The terminal 11 accumulates packets from each application AP1 in a buffer (FB1#1 to FB1#L/FB1#L') for each application (for each flow). The packet amount notification unit NTF1 periodically checks the amount of accumulated packets in each buffer (FB1#1 to FB1#L/FB1#L') and notifies the controller 13 of this as a control signal via the control signal transmission/reception unit CTR1.
The access point 12 also stores packets from the upper network devices (50#1, 50#2) in buffers (FB2#1 to FB2#K/FB2#K') for each application (each flow). The packet amount notification unit NTF2 periodically checks the amount of packets stored in each buffer (FB2#1 to FB2#K/FB2#K') and notifies the controller 13 of this as a control signal via the control signal transmission/reception unit CTR2.
Incidentally, each of the flow unit buffer units FB1 may be owned by the application AP1.

The controller 13 records the notified packet accumulation amount, information on the terminal 11, the access point 12, and the flow unit buffers (FB1, FB2), and based on this, determines a transmission schedule (transmission time and transmission amount) for each buffer and notifies each terminal 11 and each access point 12 as a control signal.

The control signal transmission/reception unit CTR3 of the controller 13 receives control signals from each terminal 11 and each access point 12, and organizes the packet accumulation amount contained in the control signal, information on the terminal 11, the access point 12, and the flow unit buffers (FB1, FB2) in a database DB.

3 and 4 are diagrams for explaining an example of information organized in the database DB. This database DB organizes the following four pieces of information in the first information section (see FIG. 3).
Item number: A serial number for all the buffers (FB1, FB2) of the terminal 11 and the access point 12.
Belonging wireless network: The number j of the wireless network (NW#1, NW#2) to which the target buffer (FB1, FB2) belongs.
Node number: The number of the access point 12 or the terminal 11.
Buffer number: the number of the buffer FB1 held by each terminal 11, or the number of the buffer FB2 held by each access point 12.
Packet amount: The amount of packets stored in a buffer having a particular buffer number.
For example, item number K+2 indicates the amount of packets stored in the per-flow buffer unit FB1#2 of the terminal 11#1 belonging to the wireless network NW1 (j=1), and the amount is "B12."

This database DB organizes the following two pieces of information in the second information section (see FIG. 4).
Belonging wireless network: The number j of the wireless network (NW#1, NW#2) to which the target buffer (FB1, FB2) belongs.
Throughput: The maximum throughput TP _j of each wireless network NW#j.

The scheduling unit SCH3 of the controller 13 uses a scheduling method described later to determine a transmission schedule (transmission time and transmission amount) for each buffer from the contents of the database unit DB. The scheduling unit SCH3 then transmits the determined transmission schedule as a control signal from the control signal transmitting/receiving unit CTR3 to the terminal 11 and the access point 12.

Each terminal 11 and access point 12 extracts packets stored in the flow unit buffer units (FB1, FB2) at the transmission time and transmission amount of the notified transmission schedule and inputs them to the main signal buffer units (MB1, MB2). The main signal transmission/reception units (MTR1, MTR2) transmit the packets in the main signal buffer units (MB1, MB2) to the wireless network 15.

5 is a flowchart illustrating the above-described operation. The control method of this embodiment is a transmission control performed by the controller 13 on each terminal 11 and each access point 12 that transmit packets to each other via the respective wireless networks (15#1, 15#2),
Storing transmission packets for each traffic flow in the buffers (FB1, FB2) of each terminal 11 and each access point 12 (steps S111, S112, S121, S122);
Transmitting to the controller 13 the amount of the transmission packets stored in each of the buffers for each traffic flow (steps S113 and S123);
The controller 13 determines a transmission schedule for the transmission packets for each traffic flow based on the accumulated amounts received from the terminal 11 and the access point 12 (steps S131 and S132);
Transmitting the transmission schedule from the controller 13 to each of the terminal 11 and the access point 12 (step S133); and Transmitting transmission packets for each traffic flow from each of the buffers (FB1, FB2) of the terminal 11 and the access point 12 to the wireless networks (15#1, 15#2) according to the transmission schedule (steps S114, S124).
It is characterized by:
However, certain restrictions, which will be described later, are imposed when determining the transmission schedule.

[Scheduling method]
Here, a description will be given of the scheduling method performed by the scheduling unit SCH13 of the controller 13. Any scheduling method may be used, but here, the scheduling method disclosed in Non-Patent Document 3 will be described.
[1] Fair Scheduling This scheduling method performs calculations to divide the bandwidth or time by the total number of per-flow buffers (FB1, FB2) in which packets are stored in the terminal 11 and the access point 12.
The parameters are explained below.
The number of per-flow buffers in which packets are stored, including the terminal 11 and the access point 12 combined: n
Time for 1 cycle: T [sec]
Total transmission limit of main signal per cycle time: Z [Bytes/sec]
Time to transmit the first stored packet: t _start [sec]

フロー単位バッファ＃Ｊの送信時間Ｔ_Ｊ［ｓｅｃ］は、

フロー単位バッファ＃Ｊの送信時刻ｔ_Ｊ［ｓｅｃ］は、

と計算される。 in this case,
The transmission amount S _J [Bytes] of the per-flow buffer #J is

The transmission time T _J [sec] of the per-flow buffer #J is expressed as follows:

The transmission time t _J [sec] of per-flow buffer #J is expressed as follows:

It is calculated as follows.

The order in which flow unit buffers start transmitting may be, for example, starting from the lowest item number organized in the database unit DB of the controller 13.

[2] Scheduling Considering Bandwidth Weighting This scheduling method is determined based on the number of per-flow buffers (FB1, FB2) in which packets are stored in the terminal 11 and the access point 12 and the amount of packets stored therein.
The parameters are explained below.
Packet accumulation amount in per-flow buffer #J: B _J [Bytes]
Time for 1 cycle: T [sec]
Transmission limit per cycle: Z [Bytes/sec]
Time required to transmit all packets stored in all per-flow buffers: T _all [sec]
Time when the first packet is transmitted from all packets stored in the per-flow buffer: t _start [sec]

とすると、
フロー単位バッファ＃Ｊの送信量Ｓ_Ｊ［Ｂｙｔｅｓ］は、
Ｔ_ａｌｌ≦Ｔの場合、

Ｔ_ａｌｌ＞Ｔの場合、

フロー単位バッファ＃Ｊの送信時間Ｔ_Ｊ［ｓｅｃ］は、
Ｔ_ａｌｌ≦Ｔの場合、

Ｔ_ａｌｌ＞Ｔの場合、

フロー単位バッファ＃Ｊの送信時刻ｔ_Ｊ［ｓｅｃ］は、
Ｔ_ａｌｌ≦Ｔの場合、

Ｔ_ａｌｌ＞Ｔの場合、

と計算される。 in this case,

Then,
The transmission amount S _J [Bytes] of the per-flow buffer #J is
If T _all ≦T,

If T _all >T,

The transmission time T _J [sec] of the per-flow buffer #J is expressed as follows:
If T _all ≦T,

If T _all >T,

The transmission time t _J [sec] of per-flow buffer #J is expressed as follows:
If T _all ≦T,

In the case where T _all >T,

It is calculated as follows.

If T _all >T, packets that cannot be transmitted are carried over to the next transmission timing.

[Certain Restrictions]
Here, restrictions imposed on the schedule calculation performed by the scheduling unit SCH13 of the controller 13 will be described.

As a result of scheduling, the amount of packets transmitted from each per-flow buffer unit (FB1, FB2) is denoted as p _i . In this case, the total amount of packets P transmitted in a scheduling period T can be expressed as follows.

Also, the throughput of each wireless network NW#j is denoted as _TPj . Specifically, the throughput of wireless network NW#1 is _TP1 , and the throughput of wireless network NW#2 is _TP2 (see FIG. 4). The controller 13 calculates a transmission schedule so that the following relationship always holds for each wireless network NW#j.
[Math A2]
T× _TPj ≧P
This is because when multiple same-frequency wireless networks exist, the maximum throughput is not the sum of the maximum throughputs of each wireless network, but is the maximum throughput among the same-frequency wireless networks divided by each wireless network.

If the controller 13 knows the throughput tp _j of each wireless network NW _j in real time, the controller 13 performs scheduling so that the following relationship is satisfied.

(Example 1)
In this example, the database DB also stores the bandwidth of each network NW#j.
The scheduling unit SCH3 is characterized in that, in the above-mentioned restriction, the total amount of packets transmitted from all the buffers (FB1, FB2) included in each network NW#j is equal to or less than the bandwidth of each network NW#j.

The controller 13 determines in advance the bandwidth to be used by each wireless network NW#j. Specifically, the bandwidth of the wireless network NW#1 is _P1 , and the bandwidth of the wireless network NW#2 is _P2 .
When calculating the transmission schedule, the scheduling unit SCH3 imposes a restriction so that the packet transmission volume (amount of packets transmitted from the main buffer units (MB1, MB2)) of the terminals 11 and access points 12 belonging to each wireless network NW# _j falls within the range of the determined bandwidth volume Pj. In this example, when calculating the transmission schedule, a restriction is imposed so as to satisfy the relationship of the following formula (A4).

(Example 2)
In this example, the scheduling period is divided for each network (see FIG. 6).
The predetermined period T is divided for each network NW#j to obtain a divided period _Tj ,
In the above restriction, the product of the throughput TP _j of each network NW#j and the predetermined period T is set to the product of the throughput TP _j of each network NW#j and the division period T _j .

The scheduler 13 determines in advance the available period (division period T _j ) of each wireless network NW#j. Specifically, the division periods of the wireless networks NW#1 and NW#2 are T ₁ and T ₂ , respectively. If the scheduling period is T, the following relationship holds:
[Math A5]
T = _T1 + _T2

In this example, when calculating the transmission schedule, the following restriction is imposed using the throughput _TPj and the total packet amount P of each network in each division period _Tj :
[Math A6]
_T1 × _TP1 ≧ P
_T2 × _TP2 ≧ P

(Example 3)
In this example, the network band is divided into subcarriers (see FIG. 7).
When the communication between the terminal 11 and the access point 12 is Orthogonal Frequency-Division Multiplexing (OFDM), the scheduler 13
Each subcarrier SC available in the network NW#j is divided for each network to obtain a divided subcarrier SC _j ,
In the above restriction, the product of the throughput _TPj of each network NW#j and the predetermined period T is set to the product of the throughput of each network NW#j when it is a divided subcarrier and the predetermined period T.

The scheduler 13 divides the available subcarriers SC in advance as shown in Fig. 7 and assigns them to each wireless network NW#j (divided subcarriers SC _j ). Specifically, the divided subcarriers to be assigned to the wireless networks NW#1 and NW#2 are SC ₁ and SC ₂ , respectively. If the available subcarriers are SC, the following relationship holds:
[Math A7]
SC= _SC1 + _SC2

In this example, when calculating the transmission schedule, the following restriction is imposed using the throughput _TP'j of each network and the total packet amount P when the divided subcarrier _SCj is applied:
[Math A8]
T×TP′ ₁ ≧P
T×TP′ ₂ ≧P

(Embodiment 2)
The controller 13 can also be realized by a computer and a program, and the program can be recorded on a recording medium or provided via a network.
8 shows a block diagram of a system 100. The system 100 includes a computer 105 connected to a network 135.

Network 135 is a data communications network. Network 135 may be a private or public network and may include any or all of the following: (a) a personal area network, for example covering a room; (b) a local area network, for example covering a building; (c) a campus area network, for example covering a campus; (d) a metropolitan area network, for example covering a city; (e) a wide area network, for example covering an area that crosses city, regional, or national boundaries; or (f) the Internet. Communications are conducted by electronic and optical signals over network 135.

Computer 105 includes processor 110 and memory 115 connected to processor 110. Although computer 105 is depicted herein as a stand-alone device, it is not limited to such, but rather may be connected to other devices not shown in a distributed processing system.

Processor 110 is an electronic device comprised of logic circuits that respond to and execute instructions.

The memory 115 is a tangible computer-readable storage medium on which a computer program is encoded. In this regard, the memory 115 stores data and instructions, i.e., program code, that can be read and executed by the processor 110 to control the operation of the processor 110. The memory 115 can be implemented as a random access memory (RAM), a hard drive, a read-only memory (ROM), or a combination thereof. One component of the memory 115 is the program module 120.

The program modules 120 include instructions for controlling the processor 110 to perform the processes described herein. Although operations are described herein as being performed by the computer 105 or a method or process or sub-process thereof, the operations are actually performed by the processor 110.

The term "module" is used herein to refer to a functional operation that may be embodied as either a stand-alone component or an integrated configuration of multiple subcomponents. Thus, program module 120 may be realized as a single module or as multiple modules operating in concert with one another. Furthermore, although program module 120 is described herein as being installed in memory 115 and thus implemented in software, it is possible for it to be implemented in either hardware (e.g., electronic circuitry), firmware, software, or a combination thereof.

Although the program module 120 is shown as already loaded into the memory 115, it may be configured to be located on the storage device 140 for later loading into the memory 115. The storage device 140 is a tangible computer-readable storage medium that stores the program module 120. Examples of the storage device 140 include compact disks, magnetic tapes, read-only memories, optical storage media, memory units consisting of a hard drive or multiple parallel hard drives, and universal serial bus (USB) flash drives. Alternatively, the storage device 140 may be a random access memory or other type of electronic storage device located in a remote storage system not shown and connected to the computer 105 via the network 135.

System 100 further includes data source 150A and data source 150B, collectively referred to herein as data sources 150, communicatively connected to network 135. In practice, data source 150 may include any number of data sources, i.e., one or more data sources. Data source 150 may include unstructured data and may include social media.

The system 100 further includes a user device 130 operated by the user 101 and connected to the computer 105 via a network 135. The user device 130 includes an input device, such as a keyboard or a voice recognition subsystem, to allow the user 101 to communicate information and command selections to the processor 110. The user device 130 further includes an output device, such as a display device or a printer or a voice synthesizer. A cursor control, such as a mouse, trackball, or touch-sensitive screen, allows the user 101 to manipulate a cursor on a display device to communicate further information and command selections to the processor 110.

The processor 110 outputs the results 122 of the execution of the program module 120 to the user device 130. Alternatively, the processor 110 can provide the output to a storage device 125, such as a database or memory, or via a network 135 to a remote device not shown.

For example, a program that performs steps S131 to S133 in the flowchart of Figure 3 may be the program module 120. The system 100 may be operated as the controller 13.

The terms "comprising" or "comprising" should be interpreted as specifying the presence of the stated features, integers, steps, or components, but not excluding the presence of one or more other features, integers, steps, or components, or groups thereof. The terms "a" and "an" are indefinite articles and therefore do not exclude embodiments having a plurality thereof.

Other Embodiments
In addition, the present invention is not limited to the above-described embodiment, and various modifications can be made without departing from the scope of the present invention. In short, the present invention is not limited to the above-described embodiment, and the components can be modified and embodied without departing from the scope of the present invention at the implementation stage.

In addition, various inventions can be formed by appropriately combining multiple components disclosed in the above embodiments. For example, some components may be deleted from all of the components shown in the embodiments. Furthermore, components across different embodiments may be appropriately combined.

11, 11#1, 11#2: Terminal 12, 12#1, 12#2: Access point 13: Controller NW#j: Wireless network 50, 50#1, 50#2: Upper network device 100: System 101: User 105: Computer 110: Processor 115: Memory 120: Program module 122: Result 125: Storage device 130: User device 135: Network 140: Storage device 150: Data source 301: Control system

Claims (7)

A controller for controlling traffic of a plurality of networks, comprising:
Each of the networks has one access point and one or more terminals, and transmits packets between the terminals and the access point;
a database for storing, at each predetermined period, the amount of packets stored in a buffer for each traffic flow of the terminal and the access point;
a scheduler that calculates a transmission schedule for packets to be transmitted from the buffer based on the packet amounts stored in the database for each of the predetermined periods, and that applies a restriction when calculating the transmission schedule so that the total packet amount to be transmitted from all of the buffers included in the network does not exceed the product of the throughput of each of the networks and the predetermined period;
a transmitter for transmitting the transmission schedule to the terminal and the access point;
A controller comprising: The database also stores the bandwidth of each of the networks;
2. The controller according to claim 1, wherein the scheduler sets the restriction such that a total amount of packets transmitted from all of the buffers included in each of the networks is equal to or less than a bandwidth of each of the networks. The scheduler
The predetermined period is divided for each of the networks to obtain divided periods,
2. The controller of claim 1, wherein in said limiting, the product of each of said network throughputs and said predetermined period is the product of each of said network throughputs and said division period. If the communication between the terminal and the access point is orthogonal frequency-division multiplexing (OFDM),
The scheduler
Divide each subcarrier available in the network into divided subcarriers for each network;
2. The controller according to claim 1, wherein the restriction is a product of the throughput of each of the networks and the predetermined period, the product of the throughput of each of the networks when the subcarriers are divided and the predetermined period. A controller according to any one of claims 1 to 4;
a plurality of networks each having one of the access points and one or more of the terminals;
A communication system comprising: A method for controlling traffic of a plurality of networks, comprising:
Each of the networks has one access point and one or more terminals, and transmits packets between the terminals and the access point;
storing, at each predetermined period, an amount of packets accumulated in a buffer for each traffic flow possessed by said terminal and said access point;
calculating a transmission schedule for packets to be transmitted from the buffer based on the stored packet amount for each of the predetermined periods;
adding a restriction so that a total amount of packets to be transmitted from all of the buffers included in the network does not exceed a product of a throughput of each of the networks and the predetermined period when calculating the transmission schedule; and transmitting the transmission schedule to the terminal and the access point.
A control method comprising the steps of: A program for causing a computer to function as a controller according to any one of claims 1 to 4.

Images