JPS6342262A - Packet conference switching system - Google Patents

Abstract

PURPOSE:To attain a conference switching in a packet switching network by selecting a data packet the highest in a priority when the data packets are received from plural transmitting subscribers within a constant time and transmitting to an incoming subscriber by an incoming packet switchboard. CONSTITUTION:The transmission data packet 27 of the subscriber 21 is converted into the data packet 28 and the data packet 32 by a transmission packet switchboard 24 and they are respectively transmitted to the incoming packet switchboards 25 and 26. The transmission data packet 30 of the subscriber 23 is converted into the data packets 31 and 33 by the packet switchboard 26 and they are respectively transmitted to the packet switchboards 24 and 25, In the packet switchboard 35, the data packets 28 and 31 are simultaneously received, so that the data packet high in the priority is selected and the data packet 29 is transmitted to the incoming subscriber 22.

Description

DETAILED DESCRIPTION OF THE INVENTION (Field of Industrial Application) The present invention relates to a packet conference switching system in which three or more parties perform MAt in a packet switching network.

(Prior Art) Communication in a conventional packet switching network is carried out by l-to-l bidirectional communication.

(Problems to be Solved by the Invention) Therefore, using packet communication '1: When holding a conference with three or more participants, the conference participants set up multiple calls among themselves, The drawback was that conference participants had to send the same data packet to all conference participants.

The object of the invention is to provide a complete packet conference switching system that makes it possible to perform conference exchange in a packet switched network, overcoming all of the above-mentioned drawbacks.

(Means for Solving All Problems) In order to achieve all of the above objectives, the uninvented packet conference switching system connects multiple packet switches using relay lines to form a network of packet switches! - 1 call: send a reply to the back-cut exchanger, and hold a conference between three or more subscribers. = t-C, under the outgoing bucket exchange, the number of authorized β participants excluding the originating party's money is 8r-Yu-Kuketsu I-All the wires are generated, and these data buckets are Of the geta packets sent from people's names, ``18ke Fubizu 2〉 and 2-
1 also give each data bag the address of the subscriber, and write each incoming bucket 9.
The data bucket It - sends l - 1 stone 1 t bucket With the exchanger, it is fixed [times within a day - 1,'1ii. 1. Select all the previous data packets and send them to the incoming subscriber [
2).

(Actual Monthly) The following is a heather "invention VC, Rite drawing meeting flu L 'C
i,t? , reveal.

Figure 1! fi, warehouse! This is a diagram showing an embodiment of the bucket switching network of the present invention. Subscribers 1, 2, and 3 exchange packets @4゜5
．． Under the control of 6, Bak'tu I, prayer, and conduct case C
A2],.

No.! Figure W11: 1st page 111) ≦Ise 1] Noj type: Gold theory, light-yo" 217Ibeme diagram, 2) L.

Power n Entering 21t7L) 6 (H Data Bucket”I・27
iJ, ``home 1 sabeket exchange 2, ``r''f-, non-bakkut 2) 3 and data backup 326:, transformation v tatami'' si 1. Kakuba bucket exchange Zeso 2 so 5 and 261/ζ Taniyan delivery IB Sagaro.

3 (l id:
Packet exchanger 2G 5' - = Kubabat 31 (!
: 33 [changed 'i'r, pie
Niji4, l225 ToVF i, :'! ')'(fl
#re2).

・On the other hand, the (DL day mebakut 28 and 31 t ft'71 o'clock) is -
The height of the alarm (・“Fuji data Bakutkoshi 8 Gold 1. Q voice 1.,, Incoming call υ person k 22, Degupactsto:?,
9) Humanity) 1. Figure 3 shows the 6-H, 6-movement, and 9-1 parts of the outgoing packet switch shown in Figure 2.

First of all, 10,000 barots 1 the 1 iso 24 r, 1, 宕i (Iris and Nagisa 21,, l: Ride Bucket 27 紮 懛子 い)
(111 Steg 41),.

Next W-Receive/False (7) ←j゛・-・Tabatat i-27'i Send to all conference participants/1- or not, count all 2] Set the counter initially (operation, step 2) )
.

In operation step 43, the data for the conference 8 participants 8.
+Memory buffer for packets Allocated in memory.

In motion step = 8-1, the motion step 41' is secured in motion step 3.
T"'e ('fJ data packet Uchitani Kim'1 bead, 6.3 operation step 45 and memory count: 7a (I include all 1' destination addresses of this meeting β addition, 6 bβ participants) Contents of the day, evening, and kukerato addressed to ri JI! 'TJ-
) 11, In operation step 46, Kei J's SuePatsubu!
Created in 93 (Contents of data packets meeting βIJ
Send 1□2 to the bucket exchanger that stores and accepts the lunar calendar.
n-J''a) 1. At step 47, send ξ data to all participants in the meeting β at step 41;
・If the contents of the data pack are sent to the bank, ft-, or not, the payment will be completed. Transmission completes 2: Kere (operation step 48 'TT 27')
:/ i Il? IT Next Meeting A #1Ill 4
K m 7ir', Iy, mark 1 step 43. ．． l
- Recurring misfortune.

Figure 4i U: In the 2nd rfA, the flow rate is 1 out of 1 (the negative operation of the foot exchanger) 1'' - 4 in the figure showing the money).

First of all ~” A masterpiece, a fixed count for 1411 at Sputsub 51'f'11 - Reset H-i-23 and time 611j
Start setting 4). 7'57' T
: ii: GI reception after starting time measurement 110. /j −
7-The place with the highest degree of 4 degrees among Tabakts
Daytime ゛゛组 2〕Ga) / nt lead destination, 9 J: J ¥: Ant-choi priority 1f & this set 1'-2) O move) ゛゛tufu' 5: 111 In the Nubakut, I realized that I was going to start the game at 10-5.
-'m-seconds first 20 sieves' door-to-ta packet '8. All I have to do is to secure the money for 2) Deke Packet 1 Memory/Kuno.

At operation speed 54, whether the delta baffle i of the meeting R Kasen Shinen has arrived or not, search 1612 indicates that the new power has arrived, and at trial operation speed 55, the -t'' de-tabacut?
Received 2 no. If it has not arrived, please proceed to the operation stage "Jump to Horn 59 2".

11 swords, step '56 (Mareki 1. ; l'j
', 17' -1 Check whether the priority of the backup is V higher than the current priority P. If it is not high, jump to operation step 59, and if it is high, proceed to operation step 57. Set to . In operation step 58, the received data packets are copied to the data packet memory buffer secured in operation step 53.

In operation step 59, in the case of voice, one data packet is converted into analog voice, the time table that can be propagated during 9, and the content of one data packet in the case of display information? If the time elapsed from operation step 51 does not exceed the specified time, the operation step 54
Manufactured by Kinken Gaeshi.

If the data packet is available within a certain period of time, the data packet is sent to the called subscriber from the data packet memory buffer in operation step 60. Further, in parallel with operation step 60, when a certain time period has elapsed, the operation starts from operation step 51.

(Effects of the Invention) As explained in detail above, the present invention generates data packets to be transmitted to all conference participants by a packet exchanger from all outgoing data packets, and generates incoming packets to be accommodated by conference participants. The generated data packet is sent to the exchange, and the incoming packet exchange sends the data packet from multiple sources (if data packets are received from N subscribers within a certain period of time), the data packet with the highest priority is sent to the exchange. Select <shi, ;) If you send out a double watcher, it is a coincidence. Therefore, there is an effect that conference exchange is impossible even when packet exchange is slow.

[Brief explanation of drawings]

FIG. 1 is a packet switching network diagram showing an embodiment of the packet conference switching system according to the present invention, FIG. 2 is a diagram for explaining the entire operation of the IJ implemented in FIG. 1, and FIG. FIG. 4 is a flowchart for explaining the entire operation of the originating packet switch of the embodiment. FIG. 4 is a flowchart for explaining the entire operation of the terminating packet switch of the embodiment in FIG. 1.2, 3, 21, 22.23...Meeting participants 4.5
, 6, 24, 25, 26...Packet switch 27-3
3...Data packet 41-48.51-60...Operation step patent applicant NEC Corporation agent Patent attorney Inoro 4 years old 1i (1st official/l is (與J晟゛)

Claims (1)

[Claims] A packet conference switching system in which multiple packet switches are connected by relay lines to form a packet switch network, and conferences are held between three or more subscribers accommodated in this packet switch network. , generates data packets for the number of conference participants excluding the caller, copies the content of the outgoing data packet from the calling subscriber to these data packets, and assigns the address of the conference participant to each data packet, The data packet is sent to each terminating packet switch, and when the terminating packet switch receives multiple data packets addressed to the same subscriber within a certain period of time, it selects the data packet with the highest priority among them and sends it to the terminating subscriber. A packet conference switching method characterized by sending out packets.