JPH06276172A - Time slot allocation method - Google Patents

Abstract

PURPOSE:To enable TS allocation with improved TS utilizing efficiency by allocating plural consecutive TSes to a second TS group at the time of initial allocation, then allocating a single TS to a first TS group and performing allocation to the other TS group when the TS group becomes full. CONSTITUTION:The TS groups are divided into the first TS group to which the single TS is preferentially allocated and the second TS group to which the plural consecutive TSes are preferentially allocated. The plural consecutive TSes are preferentially allocated to the second TS group at the time of the initial allocation and then the single TS is preferentially allocated to the first TS group. Then, when the TS group becomes full, the allocation to the other TS group is also performed. When a channel for using the signal TS is changed to the channel for using the plural TSes, no room is present in the second TS group and the allocation can not be performed. Also, when the free TSes including the free TS of channel deletion are equal to or more than the number of the plural consecutive TSes in the first TS group, all the TSes of the first and second TS groups are released and are reallocated by the method of the initial allocation. Thus, the TS allocation with the improved TS utilizing efficiency can be performed at the time of the initial allocation and channel change.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a single time slot of a line using a plurality of single time slots such as a synchronous digital hierarchy system and a token ring system, and a plurality of continuous time slots. The number of consecutive time slots of the line using the slot is set to be empty, and the time slot of the deleted line is vacant. The present invention relates to improvement of a time slot (hereinafter referred to as TS) allocation method of a communication system that allocates a time slot group having slots.

For example, if the communication speed of the line is 64 Kbps, the communication speed for transmitting voice by telephone is 64 Kbps.
Since it is s, a line using a single TS is used, and when the communication speed for transmitting data is 1 Mbps, 16 consecutive TSs are used, and the communication speed for transmitting data is At 10 Mbps, continuous 1
60 TSs will be used.

[0003]

2. Description of the Related Art FIG. 5 is a block diagram of an example of a communication system to which the present invention is applied, and FIG. 6 is a diagram showing a state of time slot allocation in the conventional example.

In FIG. 5, 5 to 8 indicate optical lines, and 1 to 4
Indicates a terminal accommodating communication device, accommodating a terminal through each line, and other terminal accommodating communication devices are connected by an optical line. In FIG. 5, the terminal accommodating communication device 1 accommodates 400 terminals by connecting terminals to the respective lines of the line 10 having 400 lines using 1TS, and also has 16 lines using 16TS. A terminal is connected to each line of the line 20 to accommodate 16 terminals, and a terminal is connected to each line of the line 30 having three lines using 160TS.
It accommodates a number of terminals.

The terminal connected to the line 10 of the terminal accommodating communication device 1 having 400 lines using 1TS is the terminal connected to the line 11 having the terminal accommodating communication device 2 having 100 lines of 1TS, and the terminal. A terminal connected to the line 12 that has 200 lines using the 1TS of the accommodation communication device 3, and
The terminal-accommodating communication device 4 communicates with each terminal connected to the line 13, which has 100 lines using 1TS.

The terminal connected to the line 20 having 16 lines using 16TS of the terminal accommodating communication device 1 is connected to the line 21 having seven lines using 16TS of the terminal accommodating communication device 2, and The terminal accommodating communication device 3 communicates with the terminal 22 connected to the line 22 having two lines using 16TS, and the terminal accommodating communication device 4 having a terminal 23 connected to the line 23 having seven lines using 16TS.

Further, the terminal connected to the line 30 of the terminal accommodating communication device 1 having three 160TS use lines is a line 31 having one 160TS using line of the terminal accommodating communication device 2.
Connected to the terminal and 160T of the terminal accommodating communication device 3
It communicates with the terminal connected to the line 32 having one S-used line and the terminal connected to the line 33 having one 160TS-used line of the terminal accommodating communication device 4.

The optical line 5 has three TS groups each having an independent 500 TS. In this case, the TS allocation method of the conventional example is mechanically allocated in the order of line numbers.

In order of the line number, there are 3 lines using 1TS.
50 lines in succession, then 1 line using 160TS, then 12 lines using 16TS, 2 lines using 160TS, 4 lines using 16TS, then 4 lines using 16TS Assuming that 50 lines using 1TS continue,
TS having 500 TS as shown in (A), (B) and (C)
An initial allocation method of the conventional example to the TS group in the case where there are three groups will be described.

First, 350 TSs, each of which uses 1 TS, are assigned to the TS group shown in FIG. Then the remaining free TS
Since 150 TSs cannot be allocated in the next order, 160 TSs in the next order cannot be allocated, so 12 TSs using 16 TSs are allocated first in the TS group shown in FIG. 6B.

Then, the remaining empty TSs are 150, and the TSs using 160TSs in the next order cannot be allocated. Therefore, the TSs shown in FIG.
TSs using 60TS are allocated, then 4 pieces using 16TS are allocated, and then 50 pieces using 1TS are allocated.

When a line using 1TS or 16TS is added, it is sequentially allocated to the empty TSs shown in FIGS. 6A and 6B, or when a line using 16TS is changed to a line using 1TS, for example. If the 16 empty TSs are in the order of the beginning of the empty TSs, 1TS is allocated here.

[0013]

However, at the time of initial allocation, as shown in FIGS. 6 (A) and 6 (B), the next order is 160
Since it uses TS, it cannot be accommodated, and each one
There is a problem that the utilization efficiency of the remaining TS of 50 TSs is poor.

Further, as shown in FIG. 6A, 350 using 1TS
The line for 10TS of the line was deleted and became empty,
As shown in (A '), the total free TS is 160TS.
However, since it is not continuous, 16 lines using 1TS
Even if I try to change the line to 0TS, I can't allocate it,
There is a problem that TS utilization efficiency is poor.

According to the present invention, at the time of initial allocation and after line deletion,
It is an object of the present invention to provide a TS allocation method with high TS utilization efficiency when changing to a line having a different number of used TSs.

[0016]

FIG. 1 shows the principle of the present invention. Multiple TSs on a line using a single TS
A plurality of continuous TSs of a line using a plurality of continuous TSs, the TSs of the deleted lines are vacant, a plurality of independent TSs of the plurality of continuous TSs When allocating to a TS group shown in (A) and (B) having a number of TSs larger than the number, a first TS group shown in (B) in which a single TS is preferentially allocated to the plurality of TS groups And a second number shown in (A) for preferentially allocating the plurality of continuous TSs.
Divided into TS groups, initial, when adding lines, and multiple TS
When changing a line using a single TS to a line using a single TS, the continuous TSs are preferentially assigned to the second TS group shown in (A), and then a single TS is assigned. Priority (B)
When preferentially allocating to the first TS group shown in, and allocating to other TS groups when the TS group becomes full, when changing the line using a single TS to the line using a plurality of TSs, (A)
Since there is no room in the second TS group shown in FIG.
As shown in (C), there is an empty T for deleting the line in the first TS group.
If the number of empty TSs including S is equal to or more than the number of consecutive TSs, all TSs of the first and second TS groups are released, and the initial allocation is performed as shown in (D) and (E). Allocate by method.

[0017]

As shown in FIGS. 1 (A) and 1 (B), there are two TS groups each having seven TSs, and the number of a plurality of continuous TSs is three, and one TS and a single TS. The TS allocation method will be described in the case where there are six that use.

According to the present invention, the TS group shown in FIG. 1A is used as a second TS group to which lines using three TSs are preferentially assigned, and the TS group shown in FIG. Be a first TS group to which lines using a single TS are preferentially assigned, and 3TS of lines using three TSs are assigned to a second TS group as shown in FIG. Six TSs of a line using six single TSs are assigned to the first TS group as shown in FIG.

In this way, at the time of initial allocation, 3TS
There is no allocation to the second TS group without skipping the 2TS close to the second TS group, and if there are many allocation lines and the TS groups to be preferentially allocated are full, other TSs are allocated.
Since it is also assigned to the vacant group, the TS utilization efficiency is good.

When adding a line or changing a line using 3TS to a line using a single TS, allocation is performed by the same method as described above. Also, when the lines using 1TS allocated to the first TS group in FIG. 1B are deleted by two lines as shown by the slanted lines in FIG. 1C, there is a total of 3TS available in the first TS group. Occurs.

Here, if the two lines using 1TS are changed to the two lines using 3TS, the 3TS of one line becomes the second TS.
It can be assigned to a group, but the second line cannot be assigned to this group. At this time, all TSs of the first and second TS groups are released,
Allocate using the initial allocation method described above.

Then, allocation can be performed as shown in FIGS. 1D and 1E, and the TS utilization efficiency improves.

[0023]

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS FIG. 2 is a flow chart of the TS allocation in the embodiment of the present invention when the lines are changed and when the allocation is possible, FIG. 3 is a block diagram of the TS allocation unit of the embodiment of the present invention, and FIG.
FIG. 6 is a diagram showing a state of TS allocation according to the embodiment of the present invention.

Also in the case of the embodiment, as in the conventional example, an example of the case of the communication system shown in FIG. 5 will be described. T shown in FIG.
The S allocation unit includes a CPU 11, a ROM 12 that stores a program for TS allocation, and a RAM 13 that stores a TS group to which TSs are allocated. The three TSs that have 500 TSs stored in the RAM 13 are provided. As for the groups, the first TS group shown in FIG. 4A and the second TS group shown in FIG.
Group, and the third TS group shown in (C).

As the TS allocation program stored in the ROM 12, for example, the first TS group shown in FIG. 4A is to be allocated preferentially to the line using 1TS. In the second TS group shown in (B), lines using 16TS are preferentially allocated, and FIG.
The program that allocates the lines using 160TS to the third TS group shown in (1), and the lines that use many TSs are changed to lines that use a small number of TSs at the initial stage, when a line is added. At this time, a line using 160 TSs is preferentially allocated to the third TS group, and then 16 Ts are allocated.
Lines using S are preferentially allocated to the second TS group, then lines using one TS are preferentially allocated to the first TS group, and if the TS groups to be preferentially allocated are full, Other TS
When changing to a program that allocates more TSs than a program that allocates to a group free space,
The program shown in the flowchart of FIG. 2 is stored, and the CPU 11 allocates the TS group stored in the RAM 13 using this program.

Allocation using this program will be described below. In the first TS group shown in FIG. 4A, lines using 1TS are preferentially allocated, and FIG.
It is assumed that the line using 16TS is preferentially assigned to the second TS group shown in FIG. 4 and the line using 160TS is preferentially assigned to the third TS group shown in FIG.

Then, three lines using 160TS are shown in FIG.
4C is allocated to the third TS group as shown in FIG. 4C, 16 lines using 16TS are allocated to the second TS group as shown in FIG. 4B, and 400 lines using 1TS are shown in FIG. 4A. As shown, it can be assigned to the first TS group.

Since there is a vacancy in the second TS group to be preferentially allocated when the line using 16TS is added, it is allocated to this and the third TS group to be preferentially allocated when the line using 160TS is added. The second TS because there is no space in the TS group
Assign to groups.

For example, when changing the line using 16TS to the line using 1TS, the corresponding part of the TS group in FIG. 4B is made empty, and the first priority allocation shown in FIG. 4A is made. There is a space in the TS group, so assign it here.

If there is no space in the first TS group, another TS
Allocate to the empty part of the group. Next, the first shown in FIG.
When there is a deletion in the line assigned to the TS group, 65TS in the shaded area in FIG. 4 (A ') becomes empty, and 2 lines using 1TS are changed to 2 lines using 160TS.
A description will be given according to the flowchart of FIG.

Since 160 TS needs to be allocated in step 1, the process proceeds to step 2 and the empty T satisfying the condition is satisfied.
Although S is not in the third TS group to be preferentially allocated shown in FIG. 4C, it is present in the second TS group shown in FIG. 4B, so S is allocated in step 3 and step 4 Go to, but 16
Since TS allocation is not necessary, the process proceeds to step 7.

In this case as well, there is no need to allocate 1TS, so the operation proceeds to step 9. Since there are unallocated items, the process returns to step 1, and since 160TS needs to be allocated, the process proceeds to step 2.

In this case, since there is no empty TS satisfying the conditions, the process proceeds to step 10, all the TSs of the first, second, and third TS groups are released, the process returns to step 1, and the process sequentially proceeds from step 1 to 160TS. The ones are preferentially assigned to the third TS group, the ones of 16TS are preferentially assigned to the second TS group,
1TS one is preferentially assigned to the first TS group, but only three 160TS ones can be assigned to the third TS group, but one 160TS one is assigned to the second TS group, By this opening, one can be assigned to the first TS group, so it is also assigned to this.

That is, at the time of initial allocation and after the circuit is deleted, it becomes possible to allocate TS with high TS utilization efficiency when changing to a circuit having a different number of used TSs.

[0035]

As described in detail above, according to the present invention, there is an effect that efficient TS utilization can be performed at the time of initial assignment and at the time of changing to a line having a different number of used TS after the line is deleted. .

[Brief description of drawings]

FIG. 1 is a principle diagram of the present invention,

FIG. 2 is a flowchart of time slot allocation when allocation is possible if the lines are changed according to the embodiment of the present invention;

FIG. 3 is a block diagram of a time slot allocation unit according to the embodiment of the present invention,

FIG. 4 is a diagram showing a state of time slot allocation according to the embodiment of the present invention;

FIG. 5 is a block diagram of an example of a communication system to which the present invention is applied,

FIG. 6 is a diagram showing a conventional time slot allocation state.

[Explanation of symbols]

 Reference numeral 11 is a CPU, 12 is a ROM, and 13 is a RAM.

 ─────────────────────────────────────────────────── ─── Continuation of the front page (72) Inventor Shinya Kimura 3-9-18 Shin-Yokohama, Kohoku-ku, Yokohama-shi, Kanagawa, Fujitsu Communication Systems Ltd. (72) Akira Yoneyama 3 Yokohama, Kohoku-ku, Yokohama-shi, Kanagawa 9-9-18 Fujitsu Communication Systems Limited (72) Inventor Yuji Kawada 3-9-18 Shin-Yokohama, Kohoku-ku, Yokohama-shi, Kanagawa Prefecture Fujitsu Communication Systems Limited (72) Inventor Nasu Mitsue Kanagawa 3-9-18 Shin-Yokohama, Kohoku-ku, Yokohama-shi Fujitsu Communication Systems Limited

Claims (1)

[Claims] 1. A single time slot of a line using a plurality of single time slots and a continuous time slot of a line using a plurality of consecutive time slots are deleted. The time slots of the circuit are vacant, and are allocated to a plurality of independent time slots, each of which has a number of time slots larger than the number of consecutive time slots [(A) (B)]. In this case, the plurality of time slot groups is a first time slot group [(B)] for preferentially allocating a single time slot,
A second one for preferentially allocating the plurality of consecutive time slots
The time slot group [(A)] of the above is divided into a plurality of consecutive time slots at the initial stage, when a line is added, and when a line using a plurality of time slots is changed to a line using a single time slot. A slot is preferentially assigned to the second time slot group [(A)], and then a single time slot is preferentially assigned to the first time slot group [(B)]. When it becomes full, it is assigned to another time slot group, and when a line that uses a single time slot is changed to a line that uses multiple time slots, the second time slot group [(A)] If the first time slot group [(C)] includes a vacant time slot for line deletion in the first time slot group [(C)], the vacant time slot is equal to or more than the number of consecutive time slots. The A time slot characterized in that all time slots of the first and second time slot groups [(A) (B)] are released and assigned by the above-mentioned initial assignment method [(D) (E)]. Allocation method.