JPH0478063B2 - - Google Patents

Info

Publication number
JPH0478063B2
JPH0478063B2 JP18113182A JP18113182A JPH0478063B2 JP H0478063 B2 JPH0478063 B2 JP H0478063B2 JP 18113182 A JP18113182 A JP 18113182A JP 18113182 A JP18113182 A JP 18113182A JP H0478063 B2 JPH0478063 B2 JP H0478063B2
Authority
JP
Japan
Prior art keywords
packet
terminal
buffers
occupied
packets
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.)
Expired - Lifetime
Application number
JP18113182A
Other languages
Japanese (ja)
Other versions
JPS5970336A (en
Inventor
Atsuhiro Makino
Takashi Suzuki
Yukio Sone
Tomoji Masuyama
Makoto Kitano
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.)
Fujitsu Ltd
Original Assignee
Fujitsu Ltd
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 Fujitsu Ltd filed Critical Fujitsu Ltd
Priority to JP57181131A priority Critical patent/JPS5970336A/en
Publication of JPS5970336A publication Critical patent/JPS5970336A/en
Publication of JPH0478063B2 publication Critical patent/JPH0478063B2/ja
Granted legal-status Critical Current

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00Data switching networks
    • H04L12/54Store-and-forward switching systems 
    • H04L12/56Packet switching systems

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Description

【発明の詳細な説明】 (a) 発明の技術分野 本発明は受信バツフア管理方式、特に予め登録
した受信パケツト用バツフア数の範囲内で、端末
に対する受信パケツトのバツフア占有を許容する
パケツト交換網における受信バツフア管理方式に
関す。
DETAILED DESCRIPTION OF THE INVENTION (a) Technical Field of the Invention The present invention relates to a reception buffer management system, particularly in a packet switching network that allows a terminal to occupy a buffer for reception packets within a pre-registered number of buffers for reception packets. Regarding reception buffer management method.

(b) 従来技術と問題点 第1図はこの種パケツト交換網における従来あ
る受信バツフア管理方式の一例を示す図であり、
第2図は第1図におけるパケツト転送過程の一例
を示す図である。第1図において、パケツト交換
網を構成するパケツト交換機1は、収容する複数
の端末2ツト通信を制御する。パケツト交換機1
は、各端末2に着信するパケツトを一旦格納する
バツフア3を複数保有している。各端末2は、通
信中同時に着信することが予想されるパケツト通
信トラヒツクをもとに、通信中に各端末2が占有
できるそれぞれ最大のバツフア数(以後登録バツ
フア数mと称す)を決定し、パケツト交換機1に
登録する。一方、各端末2により該登録バツフア
数mが登録されたパケツト交換機1は、ある時点
において通信中の各端末2により占有されている
バツフア数(以後占有バツフア数qと称す)をバ
ツフア管理部4により管理し、該占有バツフア数
qが登録バツフア数mを越えた場合には、該端末
2に対するパケツトの受信を拒否する処理(後
述)を行う。第2図において、端末2Bが端末2
Aに対しパケツト通信を行う為に、パケツト交換
機1に発呼要求パケツトCRを送信すると、パケ
ツト交換機1は端末2Aに対し着呼パケツトCN
を送信する。該着呼パケツトCNを受信した端末
2Aが通信可能であると、着呼受付パケツトCA
をパケツト交換機1に返送する。該着信可パケツ
トCAを受信したパケツト交換機1は、両端末2
Aおよび2B間に呼を設定し、端末2Bに対し接
続完了パケツトCCを返送する。以上の過程にお
いて、端末2Aおよび2Bは、該呼におけるウイ
ンドサイズws、即ち端末2Bが端末2Aから受
信可能状態を示す信号の返送を待たずに継続して
送信可能なパケツト数を設定する。第2図に示さ
れる呼においては、ウインドサイズwsが3に設
定されたとする。以後端末2Bは、送信シーケン
ス番号psを付与したデータパケツトDT(ps)を
順次送信する。送信シーケンス番号ps=2が付与
されたデータパケツトDT(ps=2)を受信した
端末2Aは、送達確認とデータパケツトDT(ps
=3)以降を受信可能な状態であることとを示す
ための受信シーケンス番号pr=3が付与された送
信可パケツトRR(pr=3)を返信する。パケツ
ト交換機1経由で端末2Aからの送信可パケツト
RR(pr=3)を受信した端末2Bは、予め設定
したウインドサイズws=3に基づき、データパ
ケツトDT(ps=3)乃至データパケツトDT(ps
=5)の送信を開始する。
(b) Prior art and problems Figure 1 is a diagram showing an example of a conventional reception buffer management method in this type of packet switching network.
FIG. 2 is a diagram showing an example of the packet transfer process in FIG. 1. In FIG. 1, a packet switching equipment 1 constituting a packet switching network controls two-to-two communication between a plurality of terminals accommodated therein. Packet switch 1
has a plurality of buffers 3 that temporarily store packets arriving at each terminal 2. Each terminal 2 determines the maximum number of buffers that each terminal 2 can occupy during communication (hereinafter referred to as the number of registered buffers m) based on the packet communication traffic that is expected to arrive simultaneously during communication, Register in packet switch 1. On the other hand, the packet switch 1 in which the number m of registered buffers has been registered by each terminal 2 sends the number of buffers occupied by each terminal 2 communicating at a certain point in time (hereinafter referred to as the number of occupied buffers q) to the buffer management unit 4. If the number q of occupied buffers exceeds the number m of registered buffers, a process (described later) is performed to deny reception of packets to the terminal 2. In FIG. 2, terminal 2B is terminal 2
In order to perform packet communication with A, when a call request packet CR is sent to the packet switch 1, the packet switch 1 sends the incoming packet CN to the terminal 2A.
Send. If the terminal 2A that received the incoming call packet CN is able to communicate, the incoming call acceptance packet CA
is sent back to packet exchange 1. The packet switch 1 that received the incoming call-allowed packet CA sends both terminals 2
A call is set up between A and 2B, and a connection completion packet CC is returned to terminal 2B. In the above process, the terminals 2A and 2B set the window size ws for the call, that is, the number of packets that can be continuously transmitted by the terminal 2B without waiting for the return of a signal indicating the receivable state from the terminal 2A. In the call shown in FIG. 2, it is assumed that the window size ws is set to 3. Thereafter, the terminal 2B sequentially transmits data packets DT (ps) to which transmission sequence numbers ps have been assigned. The terminal 2A that received the data packet DT (ps = 2) with the transmission sequence number ps = 2 sends a delivery confirmation and the data packet DT (ps = 2).
= 3) A sendable packet RR (pr = 3) is returned to which a reception sequence number pr = 3 is assigned to indicate that the packet is ready to receive the following packets. Packets that can be sent from terminal 2A via packet switch 1
The terminal 2B that received the RR (pr=3) sends the data packet DT (ps=3) to the data packet DT (ps=3) based on the preset window size ws=3.
=5) starts to be transmitted.

一方パケツト交換機1は、端末2Bを含む各端
末2から端末2A宛に送信されるデータパケツト
DT(ps)を前記バツフア3に格納する度に、バ
ツフア管理部4により占有バツフア数qを監視し
ており、端末2Bの送信したデータパケツトDT
(ps=4)を受信した時、既に占有バツフア数q
が登録バツフア数mに達していたとすると、パケ
ツト交換機1は端末2Bに輻輳通知パケツト
RNRを返送してデータパケツトDT(ps)の送信
を一時中止させ、受信したデータパケツトDT
(ps=4)は廃棄する。
On the other hand, the packet switch 1 transmits data packets sent from each terminal 2 including the terminal 2B to the terminal 2A.
Every time DT (ps) is stored in the buffer 3, the buffer management unit 4 monitors the number of occupied buffers q, and stores the data packet DT sent by the terminal 2B.
(ps=4), the number of occupied buffers q has already been reached.
has reached the number of registered buffers m, packet switch 1 sends a congestion notification packet to terminal 2B.
The RNR is returned to temporarily stop the transmission of the data packet DT (ps), and the received data packet DT
(ps=4) is discarded.

以上の説明から明らかな如く、従来ある受信バ
ツフア管理方式においては、端末2Bは設定され
たウインドサイズwsに基づきデータパケツトDT
を送信するにも拘わらず、占有バツフア数qが登
録バツフア数mを越える為に送信したデータパケ
ツトDT(ps)を廃棄され、輻輳の解消した後に
改めて再送せねばならず、またパケツト交換機1
もデータパケツトDTの廃棄、および幅輳通知パ
ケツトRNRを返送する為に処理能力を消費せざ
るを得ない。
As is clear from the above explanation, in the conventional reception buffer management system, the terminal 2B sends data packets DT based on the set window size ws.
However, because the number of occupied buffers q exceeds the number of registered buffers m, the transmitted data packet DT (ps) is discarded and must be retransmitted after the congestion is resolved, and the packet switch 1
However, the processing capacity must be consumed to discard the data packet DT and return the congestion notification packet RNR.

(c) 発明の目的 本発明の目的は、前述の如き従来ある受信バツ
フア管理方式の欠点を除去し、受信バツフアの輻
輳に起因するパケツト交換機並びに端末の無効処
理を軽減する手段を実現することに在る。
(c) Purpose of the Invention The purpose of the present invention is to eliminate the drawbacks of the conventional reception buffer management system as described above, and to realize a means for reducing invalid processing of packet switching equipment and terminals caused by congestion of the reception buffer. exist.

(d) 発明の構成 この目的は、予め登録した受信パケツト用バツ
フア数の範囲内で、端末に対する受信パケツトの
バツフア占有を許容するパケツト交換網におい
て、パケツト受信端末がパケツト受信可能状態を
示す信号を送出した時に予め設定されたウインド
サイズにより定まるバツフア数を占有バツフア数
に加算し、該加算結果が前記登録済みバツフア数
を越えぬことを確認した後、パケツトの送信を許
容する信号をパケツト送信端末に返送する手段を
設けることにより達成される。
(d) Structure of the Invention The object of the present invention is to enable a packet receiving terminal to send a signal indicating that it is ready to receive packets in a packet switching network that allows a terminal to occupy a buffer for receiving packets within a preregistered number of buffers for receiving packets. The number of buffers determined by the window size set in advance at the time of transmission is added to the number of occupied buffers, and after confirming that the addition result does not exceed the registered number of buffers, the packet transmitting terminal sends a signal allowing packet transmission. This is achieved by providing a means for returning the

(e) 発明の実施例 以下、本発明の一実施例を図面により説明す
る。第3図は本発明の一実施例による受信バツフ
ア管理方式を示す図であり、第4図は第3図にお
けるパケツト転送過程の一例を示す図である。な
お、全図を通じて同一符号は同一対象物を示す。
第3図においては、パケツト受信端末〔本例では
端末2A〕が送信する各種パケツトは、パケツト
交換機1に設けられたバツフア管理部40を経由
してパケツト送信端末〔本例では端末2B〕に返
送される。第4図において、端末2Bが第2図と
同様にパケツト交換機1に端末2Aに対する発呼
要求パケツトCRを送信し、パケツト交換機1が
端末2Aに送信した着呼パケツトCNに対して端
末2Aが着呼受付パケツトCAを返送すると、バ
ツフア管理部40内のパケツト分析回路41は返
送された着呼受付パケツトCAを分析し、バツフ
ア管理回路43を起動して着呼受付パケツトCA
による起動であることを伝達する。バツフア管理
回路43は、まず端末2Aからの着信受付パケツ
トCAを受信した時点において、パケツト交換機
1が端末2Aに対応して保持している占有バツフ
ア数qを抽出し保持するとともに着呼受付パケツ
トCAを分析して、呼に設定されるウインドサイ
ズwsを抽出し、これを保持する。次にバツフア
管理回路43は、抽出した占有バツフア数q及び
ウインドサイズwsの両者を加算した結果が、端
末2Aに対応する登録バツフア数mを越えぬこと
を確認の上、加算結果(q+ws)を新たな占有
バツフア数qとしてパケツト交換機1に通知して
占有バツフア数qを更新する(q+ws→q)。そ
して、このようにウインドサイズwsを加算して
占有バツフア数qを更新し、以後、端末2Bより
連続的に送信されるデータパケツトDT(ps)の
ためのバツフア領域をあらかじめ確保したバツフ
ア管理回路43は、パケツト送出回路42に指示
し端末2Bに対して着呼受付パケツトCAを送出
させる。パケツト交換機1は第2図と同様に端末
2Aおよび2B間に呼を設定し、接続完了パケツ
トCCを端末2Bが返送する。以後パケツト交換
機1は、端末2Bに送信するデータパケツトDT
(ps)を端末2Aに送信する度に、保持する占有
バツフア数qから1を減ずる。データパケツト
DT(ps)を受信した端末2Aが送信可パケツト
RR(pr)を返送すると、パケツト分析回路41
は返送された送信可パケツトRR(pr)を分析し、
バツフア管理回路43を起動して呼の識別と送信
可パケツトRR(pr)による起動であることを伝
達する。バツフア管理回路43は、まず、パケツ
ト交換機1にて端末2Aに対応して保持されてい
る占有バツフア数q及びウインドサイズwsを抽
出する。次に、該呼に関して端末2Aから端末2
Bへ返信された最新の送信可パケツトRR(pr)
を分析し受信シーケンス番号Prを抽出して保持
する。さらに、前回の送信可パケツトRR(pr)
を受信時に保持した受信シーケンス番号pr′を抽
出する。以後は、上記抽出によつて保持される情
報(q、ws、pr、pr′)により以下のような計算
を行う。
(e) Embodiment of the invention An embodiment of the invention will be described below with reference to the drawings. FIG. 3 is a diagram showing a reception buffer management system according to an embodiment of the present invention, and FIG. 4 is a diagram showing an example of the packet transfer process in FIG. 3. Note that the same reference numerals indicate the same objects throughout the figures.
In FIG. 3, various packets transmitted by a packet receiving terminal (terminal 2A in this example) are sent back to a packet transmitting terminal (terminal 2B in this example) via a buffer management section 40 provided in packet switch 1. be done. In FIG. 4, terminal 2B sends a call request packet CR to terminal 2A to packet switch 1 in the same way as in FIG. When the call acceptance packet CA is returned, the packet analysis circuit 41 in the buffer management unit 40 analyzes the returned incoming call acceptance packet CA, activates the buffer management circuit 43, and returns the incoming call acceptance packet CA.
It communicates that it is activated by. First, upon receiving the incoming call acceptance packet CA from the terminal 2A, the buffer management circuit 43 extracts and holds the number of occupied buffers q held by the packet exchange 1 corresponding to the terminal 2A, and also outputs the incoming call acceptance packet CA. , extracts the window size ws set for the call, and stores it. Next, the buffer management circuit 43 checks that the result of adding both the extracted occupied buffer number q and the window size ws does not exceed the registered buffer number m corresponding to the terminal 2A, and then adds the addition result (q+ws). The new number q of occupied buffers is notified to the packet exchange 1 and the number q of occupied buffers is updated (q+ws→q). Then, the buffer management circuit 43 updates the number of occupied buffers q by adding the window size ws in this way, and thereafter secures a buffer area in advance for the data packets DT (ps) that will be continuously transmitted from the terminal 2B. , instructs the packet sending circuit 42 to send an incoming call acceptance packet CA to the terminal 2B. Packet exchange 1 sets up a call between terminals 2A and 2B as in FIG. 2, and terminal 2B returns a connection completion packet CC. Thereafter, the packet switch 1 transmits the data packet DT to the terminal 2B.
(ps) to the terminal 2A, 1 is subtracted from the number of occupied buffers q held. data packet
Terminal 2A that received DT (ps) can send packets
When RR(pr) is returned, the packet analysis circuit 41
analyzes the returned ready-to-send packet RR(pr),
The buffer management circuit 43 is activated and the call identification and notification that the activation is based on the transmittable packet RR (pr) are transmitted. The buffer management circuit 43 first extracts the number q of occupied buffers and the window size ws held in the packet exchange 1 corresponding to the terminal 2A. Next, regarding the call, from terminal 2A to terminal 2
Latest sendable packet RR (pr) returned to B
is analyzed, and the received sequence number Pr is extracted and retained. Furthermore, the previous transmittable packet RR (pr)
Extract the reception sequence number pr' held when receiving. Thereafter, the following calculations are performed using the information (q, ws, pr, pr') retained by the above extraction.

すなわち、まず、今回新たに端末2Aによつて
送達が確認されたパケツトの個数bを、今回の送
信可パケツトRR(pr)から保持した確認済みシ
ーケンス番号prと、既に前回送達が確認されたパ
ケツトのシーケンス番号ps′との差から求める
(pr−pr′→b)。次に、その結果bを仮に占有バ
ツフア数qに加算した結果qと、登録バツフア数
mとを比較し、該加算結果q(=q+b)が登録
バツフア数mを越えるか否かを判定する。該加算
結果が登録バツフア数mを越えぬ場合には、該加
算結果によりパケツト交換機1の保持する占有バ
ツフア数qを更新させると共に、パケツト分析回
路41の受信した送信可パケツトRR(pr)をパ
ケツト送出回路42に転送して送出させる。パケ
ツト交換機1は、第2図と同様に送信可パケツト
RR(pr)を端末2Bに返送する。また前記加算
結果が登録バツフア数mを越える場合には、パケ
ツト送出回路42に送信可パケツトRR(pr)の
送出は行わせず、タイミング回路44の示す時点
をタイミング登録回路45に呼に対応して登録さ
せる。以後予め設定されている時間が経過する
と、選択回路46は再びバツフア管理回路43を
起動し、呼の識別および送信可パケツトRR(pr)
による起動であることを伝達する。バツフア管理
回路43は、前述の同様の過程で送信可パケツト
RR(pr)の返送の可否を判定する。すなわちパ
ケツト交換機1から端末2Aへの送信データパケ
ツトDT(ps)が順次送信されて占有バツフア数
qが減少するまで送信可パケツトRR(pr)の送
出を待機することにより、端末2Bからの次なる
データバケツトDT(ps=pr)の送信を拒否する。
更に通信が終了し、端末2Bがパケツト交換機1
に復旧要求パケツトCQを送信し、該復旧要求パ
ケツトCQを受信したパケツト交換機1が端末2
Aに切断指示パケツトCIを送信し、該切断指示
パケツトCIを受信した端末2Aが切断確認パケ
ツトCFを返送すると、パケツト分析回路41が
該切断確認パケツトCFを分析してバツフア管理
回路43を起動し、呼の識別および切断確認パケ
ツトCFによる起動であることを伝達する。ここ
で、呼接続時に占有パケツト数qに加算され、通
信中も一定に保たれていたウインドサイズwsの
内、端末2BからのデータパケツトDTのために
占有バツフア数qに対し予め加算しておいたバツ
フア数b=pr+ws−ps−1分について、これを
減算する処理を行う(q−b→q)。ただし受信
シーケンス番号pr及び発信シーケンス番号psは保
持する最新の値を用いる。また、未だ送達が確認
されていないデータパケツトDTにより占有され
ているバツフア数は、パケツト交換機1から端末
2AにデータパケツトDT(ps)が送信される度
に占有バツフア数qから1が減算されていきやが
て消滅するので、バツフア管理回路43はこれを
放置する。その後、パケツト管理回路43は、パ
ケツト送出回路42に指示し、パケツト分析回路
41の受信した切断確認パケツトCFを送出させ
る。パケツト交換機1は、復旧完了パケツトCF
を端末2Bに返送する。
That is, first, the number b of packets whose delivery has been newly confirmed by the terminal 2A this time is calculated from the confirmed sequence number pr held from the current transmittable packet RR (pr) and the packet whose delivery was already confirmed last time. It is determined from the difference from the sequence number ps'(pr-pr'→b). Next, the result b is tentatively added to the number q of occupied buffers, and the result q is compared with the number m of registered buffers, and it is determined whether the addition result q (=q+b) exceeds the number m of registered buffers. If the addition result does not exceed the number m of registered buffers, the number q of occupied buffers held by the packet switch 1 is updated based on the addition result, and the packet analysis circuit 41 updates the received sendable packet RR (pr). It is transferred to the sending circuit 42 and sent out. The packet switch 1 transmits packets that can be transmitted as in FIG.
RR(pr) is sent back to terminal 2B. If the addition result exceeds the number m of registered buffers, the packet sending circuit 42 is not sent the ready-to-send packet RR(pr), and the timing registration circuit 45 is made to respond to the call at the time point indicated by the timing circuit 44. and register it. Thereafter, when a preset time has elapsed, the selection circuit 46 activates the buffer management circuit 43 again to identify the call and send the sendable packet RR(pr).
It communicates that it is activated by. The buffer management circuit 43 determines the transmittable packets in the same process as described above.
Determine whether RR(pr) can be returned. That is, by waiting to send the ready-to-send packet RR (pr) until the transmission data packets DT (ps) from the packet exchange 1 to the terminal 2A are sequentially transmitted and the number of occupied buffers q decreases, the next data from the terminal 2B is transmitted. Rejects sending bucketed DT (ps=pr).
Furthermore, the communication ends and terminal 2B transfers to packet switch 1.
Terminal 2
When the terminal 2A that has received the disconnection instruction packet CI sends the disconnection instruction packet CI to terminal A and returns the disconnection confirmation packet CF, the packet analysis circuit 41 analyzes the disconnection confirmation packet CF and starts the buffer management circuit 43. , the call identification and disconnection confirmation packet CF conveys that the call has been activated. Here, among the window size ws that is added to the number of occupied packets q at the time of call connection and is kept constant during communication, it is added in advance to the number of occupied buffers q for the data packet DT from terminal 2B. A process of subtracting the buffer number b=pr+ws-ps-1 is performed (q-b→q). However, the latest values held are used for the reception sequence number pr and the transmission sequence number ps. In addition, the number of buffers occupied by data packets DT whose delivery has not yet been confirmed is determined by subtracting 1 from the number of occupied buffers q every time a data packet DT (ps) is transmitted from the packet exchange 1 to the terminal 2A. Since it disappears, the buffer management circuit 43 leaves it alone. Thereafter, the packet management circuit 43 instructs the packet sending circuit 42 to send out the disconnection confirmation packet CF received by the packet analysis circuit 41. Packet switch 1 sends the restored packet CF
is sent back to terminal 2B.

以上の説明から明らかな如く、本実施例によれ
ば、パケツト交換機1は、呼設定時および端末2
Aが送信可パケツトRR(pr)を返送する時に、
以後端末2Bがウインドサイズwsにより許容さ
れる数のデータパケツトDT(ps)を継続して送
信した場合に、端末2Aに対する占有バツフア数
qが登録バツフア数mを越えぬことをバツフア管
理部40により確認した上でパケツト通信を許容
する為、端末2Bが無効のデータパケツトDT
(ps)を送信することは阻止され、その結果パケ
ツト交換機1も輻輳通知パケツトRNRの送出等
の無効処理を行うことは防止される。
As is clear from the above explanation, according to the present embodiment, the packet switch 1 performs a call setup and a terminal 2
When A returns sendable packet RR (pr),
Thereafter, if the terminal 2B continues to transmit the number of data packets DT (ps) allowed by the window size ws, the buffer management unit 40 confirms that the number q of occupied buffers for the terminal 2A does not exceed the number m of registered buffers. In order to allow packet communication after
(ps) is prevented from transmitting, and as a result, the packet exchange 1 is also prevented from performing invalid processing such as sending the congestion notification packet RNR.

なお、本実施例においては、占有バツフア数q
は端末対応に保持されているが、例えばパケツト
交換機1における発信パケツト、着信パケツト、
或いは中継パケツト毎に保持することにより輻輳
管理を行う等、他に幾多の変形が考慮されるが、
何れの場合にも本発明の効果は変らない。また第
3図および第4図も又あく迄本発明の一実施例に
過ぎず、例えばバツフア管理部40の構成は図示
されるものに限定されることは無く、他に幾多の
変形が考慮されるが、何れの場合にも本発明の効
果は変らない。また本発明の対象となるパケツト
交換網の構成は図示されるものに限定されること
は無く、複数のパケツト交換機1から構成される
等他に幾多の変形が考慮されるが、何れの場合に
も本発明の効果は変らない。
In addition, in this embodiment, the number of occupied buffers q
For example, outgoing packets, incoming packets,
There are many other variations that can be considered, such as managing congestion by retaining each relay packet.
In either case, the effects of the present invention remain the same. Further, FIGS. 3 and 4 are also only one embodiment of the present invention, and for example, the configuration of the buffer management section 40 is not limited to that shown in the figures, and many other modifications may be considered. However, the effects of the present invention remain the same in either case. Furthermore, the configuration of the packet switching network that is the object of the present invention is not limited to that shown in the drawings, and many other variations such as being configured with a plurality of packet switching devices 1 are possible, but in any case, However, the effect of the present invention remains unchanged.

(f) 発明の効果 以上、本発明によれば、前記パケツト交換網に
おいて、受信バツフアの輻輳に起因するパケツト
交換機および端末の無効処理が軽減され、当該パ
ケツト交換網の効率が向上する。
(f) Effects of the Invention As described above, according to the present invention, in the packet switching network, the invalidation processing of the packet switching equipment and terminals due to the congestion of the receiving buffer is reduced, and the efficiency of the packet switching network is improved.

【図面の簡単な説明】[Brief explanation of the drawing]

第1図は従来ある受信バツフア管理方式の一例
を示す図、第2図は第1図におけるパケツト転送
過程の一例を示す図、第3図は本発明の一実施例
による受信バツフア管理方式を示す図、第4図は
第3図におけるパケツト転送過程の一例を示す図
である。 図において、1はパケツト交換機、2は端末、
3はバツフア、4および40はバツフア管理部、
41はパケツト分析回路、42はパケツト送出回
路、43はバツフア管理回路、44はタイミング
回路、45はタイミング登録回路、46は選択回
路、CRは発呼要求パケツト、CNは着信パケツ
ト、CAは着信可パケツト、CCは通信可パケツ
ト、DTはデータパケツト、RRは送信可パケツ
ト、RNRは輻輳通知パケツト、CQは復旧要求パ
ケツト、CIは切断指示パケツト、CFは切断確認
パケツト、psは送信シーケンス番号、prは受信シ
ーケンス番号、wsはウインドサイズ、qは占有
バツフア数、mは登録バツフア数、を示す。
FIG. 1 is a diagram showing an example of a conventional reception buffer management method, FIG. 2 is a diagram showing an example of the packet transfer process in FIG. 1, and FIG. 3 is a diagram showing an example of a reception buffer management method according to an embodiment of the present invention. 4 are diagrams showing an example of the packet transfer process in FIG. 3. In the figure, 1 is a packet switch, 2 is a terminal,
3 is Batsuhua, 4 and 40 are Batsuhua management department,
41 is a packet analysis circuit, 42 is a packet sending circuit, 43 is a buffer management circuit, 44 is a timing circuit, 45 is a timing registration circuit, 46 is a selection circuit, CR is a call request packet, CN is an incoming packet, and CA is an incoming call possible. packet, CC is a communicable packet, DT is a data packet, RR is a sendable packet, RNR is a congestion notification packet, CQ is a recovery request packet, CI is a disconnection instruction packet, CF is a disconnection confirmation packet, ps is a transmission sequence number, and pr is a The reception sequence number, ws, is the window size, q is the number of occupied buffers, and m is the number of registered buffers.

Claims (1)

【特許請求の範囲】 1 受信端末2A固有に占有可能なバツフア数m
を予め登録しておき、該登録済みバツフア数の範
囲m内で、ウインドサイズwsに基づく発信端末
2Bからのパケツトの送出を許容するパケツト交
換網1において、 該発信端末2Bとの呼の接続時に、該受信端末
2Aに占有されるバツフア数qに、予め該ウイン
ドサイズwsを加算しておき、通信中の該受信端
末2Aから送出されたパケツト受信可能状態を示
す信号RRより受信シーケンス番号prを抽出し、
該受信シーケンス番号prから送達確認済のパケツ
ト数bを算出し、該受信端末2Aにより占有され
ているバツフア数qと該確認済みパケツト数bと
の加算値(q+b)が前記登録済みバツフア数m
を越えぬとき該占有バツフア数qを該加算値(q
+b)に更新し、該送信可信号RRを送出する手
段を設けることを特徴とする受信バツフア管理方
式。
[Claims] 1 Number of buffers m that can be occupied uniquely to the receiving terminal 2A
is registered in advance, and within the range m of the registered buffer number, in the packet switching network 1 that allows the sending of packets from the originating terminal 2B based on the window size ws, when a call is connected to the originating terminal 2B. , the window size ws is added in advance to the number of buffers q occupied by the receiving terminal 2A, and the receiving sequence number pr is determined from the signal RR indicating the packet receivable state sent from the receiving terminal 2A during communication. extract,
The number b of packets whose delivery has been confirmed is calculated from the reception sequence number pr, and the sum (q+b) of the number q of buffers occupied by the receiving terminal 2A and the number b of confirmed packets is the number m of registered buffers.
, the occupied buffer number q is the added value (q
+b) and means for transmitting the transmission ready signal RR.
JP57181131A 1982-10-15 1982-10-15 Receiving buffer managing system Granted JPS5970336A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
JP57181131A JPS5970336A (en) 1982-10-15 1982-10-15 Receiving buffer managing system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
JP57181131A JPS5970336A (en) 1982-10-15 1982-10-15 Receiving buffer managing system

Publications (2)

Publication Number Publication Date
JPS5970336A JPS5970336A (en) 1984-04-20
JPH0478063B2 true JPH0478063B2 (en) 1992-12-10

Family

ID=16095411

Family Applications (1)

Application Number Title Priority Date Filing Date
JP57181131A Granted JPS5970336A (en) 1982-10-15 1982-10-15 Receiving buffer managing system

Country Status (1)

Country Link
JP (1) JPS5970336A (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2757482B2 (en) * 1989-08-25 1998-05-25 日本電気株式会社 Communication system between processors

Also Published As

Publication number Publication date
JPS5970336A (en) 1984-04-20

Similar Documents

Publication Publication Date Title
JP2001292177A (en) Device and method for automatically finding port identification in hierarchical heterogeneous system
JP2959740B2 (en) Message communication method
JPH0478063B2 (en)
JP3684526B2 (en) Signaling virtual channel control method and apparatus in ATM switching system
EP1087591B1 (en) Data conversion apparatuses and method
JP3522339B2 (en) Relay transfer system
JP2001313604A (en) Method for acknowledging multi-address communication of mobile communication system and mobile communication system
JPH05304541A (en) Terminal equipment
JPH06120947A (en) Remote terminal data collecting method
JPS58106933A (en) Memory buffer reserving system
JP2000295278A (en) Wireless packet communication equipment
JPH08204704A (en) Communication equipment
JP2001285336A (en) Service center, message service system, mobile communication system, message transmission method and billing method
JP2000049892A (en) Method of transmitting information between communication terminals in an ISDN network
JP2000059432A (en) IP packet communication system
JP3492466B2 (en) Band variable control method
JPH02142245A (en) Charging system in packet exchange network
JP3231809B2 (en) Switching device and control method thereof
JP2966579B2 (en) One-way call detection in packet-switched networks
JPH06244867A (en) Backup route connection standby routing system
JPS61177049A (en) Inter-network connecting device
JPH07177175A (en) Packet communication priority control method
JPH0227859B2 (en)
JPS5986939A (en) Telegram communicating system
JPH06326806A (en) Communication terminal equipment and isdn communication system