JPS62248337A - Packet transmission system - Google Patents

Packet transmission system

Info

Publication number
JPS62248337A
JPS62248337A JP61091518A JP9151886A JPS62248337A JP S62248337 A JPS62248337 A JP S62248337A JP 61091518 A JP61091518 A JP 61091518A JP 9151886 A JP9151886 A JP 9151886A JP S62248337 A JPS62248337 A JP S62248337A
Authority
JP
Japan
Prior art keywords
packet
transmission
speed
line
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.)
Pending
Application number
JP61091518A
Other languages
Japanese (ja)
Inventor
Tetsujirou Yasushi
安士 哲次郎
Tomoji Inoue
友二 井上
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.)
Nippon Telegraph and Telephone Corp
Original Assignee
Nippon Telegraph and Telephone Corp
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 Nippon Telegraph and Telephone Corp filed Critical Nippon Telegraph and Telephone Corp
Priority to JP61091518A priority Critical patent/JPS62248337A/en
Publication of JPS62248337A publication Critical patent/JPS62248337A/en
Pending legal-status Critical Current

Links

Landscapes

  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

PURPOSE:To enable a fast packet transmission even when a repeater exchange has a slow processing speed and line speed, by dividing an inputted packet into plural packets, and transmitting them in parallel. CONSTITUTION:A fast digital signal in a form of packet is inputted to a packet input line 1. A packet processor 2 divides the packet into plural number of blocks, and adds a destination address on each block, then generates a transmission packet, and sends out those to a repeating transmission line 4. A packet re-constructing device 5 accumulates an arrived transmission packet in an internal storage device, and at a time when the regulated number of transmission packets are inputted, an execution data part is re-constructed in an order designated by a bit of order information. Thus, an input packet with original speed of S bit/sec, and a length of L-number of bits is divided into four, and the transmission packet with line speed of about S/4 bit/sec, and length of about L/4-number of bits, is generated, and it is possible to transmit it using the repeating transmission line with speed slower than the original speed.

Description

【発明の詳細な説明】 〔産業上の利用分野〕 本発明は、複数の対地間経路を存するパケット交換網に
利用する。特に、高速の入力情報を効率よく伝送する方
式に関する。
DETAILED DESCRIPTION OF THE INVENTION [Industrial Field of Application] The present invention is applied to a packet switching network having a plurality of ground-to-ground routes. In particular, it relates to a method for efficiently transmitting high-speed input information.

〔従来の技術〕[Conventional technology]

従来のパケット伝送方式では、入力されたパケットの速
度に等しいかまたはそれを越える伝送速度をもつ出力伝
送路を使用して、そのパケットを宛先対地に向けて送出
していた。このため、入力されたパケットの速度に等し
いかまたはそれを越える伝送速度をもつ出力伝送路がす
べて使用中の場合には、適切な伝送路が空くまで待つか
、または、入力されたパケットより低速の出力伝送路を
使用して、蓄積されたパケットを強制的に宛先対地へ向
けて送出する必要があった。
In conventional packet transmission systems, an output transmission path having a transmission speed equal to or higher than the speed of the input packet is used to send the packet to the destination. Therefore, if all output transmission paths with transmission speeds equal to or higher than the speed of the input packet are in use, either wait until a suitable transmission path becomes free, or It was necessary to forcibly send the accumulated packets to the destination using the output transmission path.

〔発明が解決しようとする問題点〕[Problem that the invention seeks to solve]

しかし、いずれの場合でも遅延が著しく増大し、伝送効
率が低下する欠点があった。この問題は、パケット交換
網の規模が大きく、種々の伝送速度をもつ出力伝送路が
多数の対地に配分され、しかも、入力されるパケットの
速度が多岐にわたる場合、例えば、データや音声等の数
kbit八程度へパケットおよび動画像等の数Mbi 
t/s以上のパケットを伝送する場合には特に顕著にな
る。
However, in either case, the delay increases significantly and the transmission efficiency decreases. This problem occurs when the scale of the packet switching network is large, output transmission paths with various transmission speeds are distributed to many destinations, and input packet speeds vary widely. Number of packets and video images, etc. Mbit to about 8 kbit
This is particularly noticeable when transmitting packets of t/s or more.

このような問題を回避するためには、それぞれの出力伝
送路の伝送速度を入力されるパケットの最高速度または
それ以上にする必要があった。このためには、パケット
交換の処理速度を高速化し、すべての対地に向けて高速
の伝送路を設ける必要があった。このような高速の処理
装置の実現は技術的に困難であり、パケット交換網のコ
ストを増大させる欠点があった。
In order to avoid such problems, it is necessary to set the transmission speed of each output transmission path to the maximum speed of input packets or higher. To achieve this, it was necessary to increase the processing speed of packet exchange and provide high-speed transmission lines to all destinations. It is technically difficult to realize such a high-speed processing device, and it has the drawback of increasing the cost of the packet switching network.

本発明は、以上の問題点を解決し、高速に入力されたパ
ケットを低コストで伝送できるパケット伝送方式を提供
することを目的とする。
SUMMARY OF THE INVENTION An object of the present invention is to solve the above problems and provide a packet transmission method that can transmit packets input at high speed and at low cost.

〔問題点を解決するための手段〕[Means for solving problems]

本発明のパケット伝送方式は、高速に入力されたパケッ
トを低速の複数のパケットに分割し、分割されたパケッ
トにそれぞれ順序情報を付加して別々の伝送路に送出し
、受け側で原速度のパケットを再生することを特徴とす
る。
The packet transmission method of the present invention divides a high-speed input packet into multiple low-speed packets, adds order information to each divided packet, and sends it to a separate transmission path. It is characterized by reproducing packets.

〔作 用〕[For production]

本発明のパケット伝送方式は、入力されたパケットを複
数のパケットに分割して並列に伝送することにより、中
継交換機の処理速度および伝送速度が低速でも高速のパ
ケット伝送を行うことができる。
The packet transmission system of the present invention divides an input packet into a plurality of packets and transmits them in parallel, thereby making it possible to perform high-speed packet transmission even if the processing speed and transmission speed of the relay exchange are low.

〔実施例〕〔Example〕

第1図は本発明実施例パケ7)交換網のブロック構成図
である。
FIG. 1 is a block diagram of a switching network according to an embodiment of the present invention.

パケット入力線1はパケット処理装置2に接続される。Packet input line 1 is connected to packet processing device 2 .

パケット処理装置2は、複数の中継伝送路4を介してパ
ケット再構成装置5に接続される。
The packet processing device 2 is connected to a packet reconfiguring device 5 via a plurality of relay transmission paths 4.

中継伝送路4.上には「0」以上の中継多重化伝送装置
3が設けられる。パケット再構成装置5はパケット出力
線6に接続される。
Relay transmission line 4. At the top, "0" or more relay multiplexing transmission devices 3 are provided. The packet reconfiguring device 5 is connected to the packet output line 6.

パケット入力線lには、高速のディジタル信号がパケッ
トの形状で入力される。パケット処理装置2は、入力パ
ケットに含まれる宛先アドレスと送出すべき実行データ
部とを分割し、実行データ部を複数のブロックに分割し
、それぞれのブロックに宛先アドレスを付加して伝送パ
ケットを作成し、これらを中継伝送路4に送出する。
A high-speed digital signal is input in the form of a packet to the packet input line l. The packet processing device 2 divides the destination address included in the input packet and the execution data part to be sent, divides the execution data part into a plurality of blocks, and creates a transmission packet by adding the destination address to each block. and sends these to the relay transmission line 4.

パケット再構成装置5は、中継伝送路4を経由して到来
した伝送パケットのアドレス部と実行データ部とに分離
し、実行データ部のみを元の順番に再構成し、これにア
ドレス部を付加して受信パケットとし、パケット出力線
6を介して受信側に送出する。
The packet reconfiguration device 5 separates the transmission packet that arrived via the relay transmission path 4 into an address part and an execution data part, reconstructs only the execution data part in the original order, and adds the address part to it. The received packet is then sent to the receiving side via the packet output line 6.

本実施例により入力パケットを4個に分割して伝送する
場合を例に説明する。
An example in which an input packet is divided into four parts and transmitted according to this embodiment will be explained.

第2図はパケット処理装置2の動作を示す図である。FIG. 2 is a diagram showing the operation of the packet processing device 2. As shown in FIG.

パケット入力線1からパケット処理装置2に入力される
入力バケツ)11は、実行データ部12および宛先アド
レス13を含む、パケット処理装置2は、入力パケット
11を記憶装置に蓄積し、実行データ部12を4個のブ
ロック12−1.12−2.12−3.12−4に分割
し、それぞれに順序情報18を付加し、さらに宛先アド
レス13を付加して4個の伝送バケツ)14.15.1
6および17を作成する。この後に、空いて゛いる中継
伝送路4を見つけて伝送バケツ)14.15.16およ
び17を連続して送出する。
The input bucket (11) input to the packet processing device 2 from the packet input line 1 includes an execution data section 12 and a destination address 13. The packet processing device 2 stores the input packet 11 in a storage device, is divided into four blocks 12-1.12-2.12-3.12-4, order information 18 is added to each block, and a destination address 13 is added to each block to create four transmission buckets) 14.15 .1
6 and 17 are created. After this, an empty relay transmission path 4 is found and transmission buckets 14, 15, 16 and 17 are successively transmitted.

第3図はパケット再構成装置5の動作を示す図である。FIG. 3 is a diagram showing the operation of the packet reconfiguring device 5.

伝送パケット14.15.16および17は、宛先アド
レス13に従い、パケット交換網中の異なる中継伝送路
4および中継多重化伝送装置3を経由して受信側に到達
する。異なる中継伝送路4を経由することから、一般的
には伝送パケット14.15.16および17が受信側
に到達する時刻は異なる。そこで、パケット再構成装置
5は、到来した伝送パケットを内部の記憶装置に蓄え、
再構成するために必要な伝送パケット14.15.16
および17がそろった時点で、順序情報18により指定
される順序で実行データ部12を再構成する。さらにこ
の実行データ部12に宛先アドス13を付加して入力パ
ケットを再生し、これを出力パケット21として送出す
る。
Transmission packets 14, 15, 16 and 17 reach the receiving side via different relay transmission paths 4 and relay multiplex transmission equipment 3 in the packet switching network according to the destination address 13. Since the transmission packets 14, 15, 16 and 17 are routed through different relay transmission paths 4, the times at which they arrive at the receiving side are generally different. Therefore, the packet reconfiguring device 5 stores the arrived transmission packets in an internal storage device, and
Transmission packets required for reassembly 14.15.16
and 17, the execution data section 12 is reconfigured in the order specified by the order information 18. Furthermore, a destination address 13 is added to this execution data section 12, the input packet is reproduced, and this is sent out as an output packet 21.

このようにして、原速度がSビット毎秒で長さがLビッ
トの入力パケットを4分割し、伝送速度が約S/4ビツ
ト毎秒で長さが約L/4ビットの伝送パケットをつくり
、原速度より低速の中継伝送路を使用して伝送すること
ができる。伝送速度および長さが正確に174にならな
いのは、宛先アドレス13および順序情報18を付加し
たことによるものである。
In this way, an input packet with an original speed of S bits per second and a length of L bits is divided into four, creating a transmission packet with a transmission speed of about S/4 bits per second and a length of about L/4 bits, and the original packet is divided into four. Transmission can be performed using a relay transmission path that is slower than the original speed. The reason why the transmission speed and length are not exactly 174 is due to the addition of the destination address 13 and order information 18.

以上の説明では一つのパケットを4個のパケットに分割
する場合を例に説明したが、分割数および分割したパケ
ットの伝送速度は、ハードウェアの制限条件の範囲内で
どのように設定しても本発明を同様に実施できる。
The above explanation uses an example where one packet is divided into four packets, but the number of divisions and the transmission speed of the divided packets can be set in any way within the limits of the hardware. The invention can be practiced similarly.

第4図は具体的なパケット交換網の例を示す。FIG. 4 shows an example of a concrete packet switching network.

多重化ノードN0は9本のパケット入力線を収容し、三
つの中継伝送路を介して多重化ノードN3に接続される
。第一の中継伝送路は、伝送容量がCIの伝送路Ll、
多重化ノードNIおよび伝送容量がC!の伝送路L2で
構成される。第二の中継伝送路は、伝送容量がC1の伝
送路り1、多重化ノードN2および伝送容量が04の伝
送路L4で構成される。第三の中継伝送路は、伝送容量
が05の伝送路り、で構成される。多重化ノードN2に
は無限大木のパケット出力線が接続される。多重化ノー
ドN0〜N、のキュー数(待ち合わせ記憶容りはそれぞ
れQo 、Q+ 、Qz 、Qxである。
Multiplexing node N0 accommodates nine packet input lines and is connected to multiplexing node N3 via three relay transmission lines. The first relay transmission line is a transmission line Ll with a transmission capacity of CI,
Multiplexing node NI and transmission capacity are C! It is composed of a transmission path L2. The second relay transmission line is composed of a transmission line 1 with a transmission capacity of C1, a multiplexing node N2, and a transmission line L4 with a transmission capacity of 04. The third relay transmission line is composed of a transmission line with a transmission capacity of 05. An infinite tree packet output line is connected to the multiplexing node N2. The number of queues (queue storage capacities are Qo, Q+, Qz, and Qx, respectively) of multiplexing nodes N0 to N, respectively.

多重化ノードN0には、ポアソン生起の情報源から速度
16キロビツト毎秒で平均バースト長(指数分布)が4
ミリ秒、速度64キロビット毎秒で平均バースト長が4
ミリ秒、および速度384キロビット毎秒で平均バース
ト長が20ミリ秒のパケットが供給される。
Multiplexing node N0 has an average burst length (exponential distribution) of 4 at a speed of 16 kbit/s from a Poisson source.
milliseconds, average burst length of 4 at a speed of 64 kilobits per second
packets with an average burst length of 20 milliseconds at a rate of 384 kilobits per second.

第5図はこの交換網でシミュレーションを行って得られ
た遅延(分布の95%値)とバースト廃棄率との関係を
示す、従来例方式と本方式とについて、入力トラヒック
量が0.66.0.81.0.97.1.03および1
.12メガビット毎秒の場合のバースト廃棄率と遅延と
の関係を示す0本方式は、入力トラヒ7り量が小さい場
合に、従来例方式に比較して遅延および廃棄率が優れて
いる。
FIG. 5 shows the relationship between the delay (95% of the distribution) and the burst discard rate obtained by simulation in this switching network, for the conventional method and the present method, when the input traffic amount is 0.66. 0.81.0.97.1.03 and 1
.. The zero line method, which shows the relationship between the burst drop rate and delay in the case of 12 megabits per second, is superior in delay and drop rate than the conventional method when the amount of input traffic is small.

〔発明の効果〕〔Effect of the invention〕

以上説明したように、本発明のパケット伝送方式は、高
速度のパケットを十分に低速のパケット群に分割して、
パケット交換網内の利用可能なすべての伝送路を用いて
伝送できる。それぞれの伝送路の伝送速度が低速でもよ
く、また中継処理装置の製造コストの低減および伝送路
のコスト低減によりパケット交換網のコストを低減でき
、高速パケットの低コスト伝送が可能となる効果がある
As explained above, the packet transmission method of the present invention divides high-speed packets into groups of sufficiently low-speed packets,
Transmission can be performed using all available transmission paths within the packet switching network. The transmission speed of each transmission path may be low, and the cost of the packet switching network can be reduced by reducing the manufacturing cost of the relay processing device and the cost of the transmission path, which has the effect of enabling low-cost transmission of high-speed packets. .

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

第1図は本発明実施例パケット交換網のブロック構成図
。 第2図はパケット処理装置の動作を示す図。 第3図はパケット再構成装置の動作を示す図。 第4図は具体的なパケット交換網の例を示す図。 第5図はシミュレーションにより得られた遅延とバース
ト廃棄率との関係を示す図。 1・・・パケット入力線、2・・・パケット処理装置、
3・・・中継多重化伝送装置、4・・・中継伝送路、5
・・・パケット再構成装置、6・・・パケット出力線、
11・・・入力パケット、12・・・実行データ部、1
2−1〜12−4・・・ブロック、13・・・宛先アド
レス、14〜17・・・伝送パケット、18・・・順序
情報、21・・・出カバケア)、N、〜N、・・・多重
化ノード、L l−L s・・・伝送路。 特許出願人 日本電信電話株式会社 代理人 弁理士 井 出 直 孝 M 1 図 パケット処理 32 図 パケットA構成 爪 3 図
FIG. 1 is a block diagram of a packet switching network according to an embodiment of the present invention. FIG. 2 is a diagram showing the operation of the packet processing device. FIG. 3 is a diagram showing the operation of the packet reconfiguring device. FIG. 4 is a diagram showing a specific example of a packet switching network. FIG. 5 is a diagram showing the relationship between delay and burst discard rate obtained through simulation. 1...Packet input line, 2...Packet processing device,
3... Relay multiplex transmission device, 4... Relay transmission line, 5
...Packet reconfiguration device, 6...Packet output line,
11... Input packet, 12... Execution data section, 1
2-1 to 12-4...Block, 13...Destination address, 14-17...Transmission packet, 18...Sequence information, 21...Output cover care), N, ~N,... - Multiplexing node, Ll-Ls...transmission line. Patent Applicant Nippon Telegraph and Telephone Corporation Agent Patent Attorney Naotaka Ide M 1 Figure Packet Processing 32 Figure Packet A Configuration Claw 3 Figure

Claims (1)

【特許請求の範囲】[Claims] (1)高速に入力されたパケットを低速の複数のパケッ
トに分割し、 分割されたパケットにそれぞれ順序情報を付加して別々
の伝送路に送出し、 受け側で原速度のパケットを再生する パケット伝送方式。
(1) A packet that divides a high-speed input packet into multiple low-speed packets, adds order information to each divided packet, sends it to a separate transmission path, and reproduces the original-speed packet on the receiving side. Transmission method.
JP61091518A 1986-04-21 1986-04-21 Packet transmission system Pending JPS62248337A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
JP61091518A JPS62248337A (en) 1986-04-21 1986-04-21 Packet transmission system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
JP61091518A JPS62248337A (en) 1986-04-21 1986-04-21 Packet transmission system

Publications (1)

Publication Number Publication Date
JPS62248337A true JPS62248337A (en) 1987-10-29

Family

ID=14028630

Family Applications (1)

Application Number Title Priority Date Filing Date
JP61091518A Pending JPS62248337A (en) 1986-04-21 1986-04-21 Packet transmission system

Country Status (1)

Country Link
JP (1) JPS62248337A (en)

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0762705A2 (en) * 1995-09-08 1997-03-12 Hitachi, Ltd. Method for transmitting data via a network
US6470391B2 (en) 1995-09-08 2002-10-22 Hitachi, Ltd. Method for transmitting data via a network in a form of divided sub-packets
JP2006238144A (en) * 2005-02-25 2006-09-07 National Institute Of Information & Communication Technology Fwa device, method for transmitting information, program for fwa device, and recording medium with the program recorded thereon
WO2010073656A1 (en) * 2008-12-26 2010-07-01 パナソニック株式会社 Communication terminal, communication method, and program
WO2011100132A2 (en) * 2010-02-11 2011-08-18 Massachusetts Institute Of Technology Multiprocessor communication networks

Cited By (13)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5903724A (en) * 1995-09-08 1999-05-11 Hitachi, Ltd. Method of transferring packet data in a network by transmitting divided data packets
EP0762705A3 (en) * 1995-09-08 2000-09-27 Hitachi, Ltd. Method for transmitting data via a network
US6449631B1 (en) 1995-09-08 2002-09-10 Hitachi, Ltd. Method and apparatus for transmitting data in a network wherein acknowledgment signals are transmitted to acknowledge receipt of data
US6470391B2 (en) 1995-09-08 2002-10-22 Hitachi, Ltd. Method for transmitting data via a network in a form of divided sub-packets
EP0762705A2 (en) * 1995-09-08 1997-03-12 Hitachi, Ltd. Method for transmitting data via a network
JP4630997B2 (en) * 2005-02-25 2011-02-09 独立行政法人情報通信研究機構 FWA device, information transmission method, program for FWA device, and recording medium recording the program
JP2006238144A (en) * 2005-02-25 2006-09-07 National Institute Of Information & Communication Technology Fwa device, method for transmitting information, program for fwa device, and recording medium with the program recorded thereon
WO2010073656A1 (en) * 2008-12-26 2010-07-01 パナソニック株式会社 Communication terminal, communication method, and program
JP5436451B2 (en) * 2008-12-26 2014-03-05 パナソニック株式会社 Communication terminal, communication method, program
US9054923B2 (en) 2008-12-26 2015-06-09 Panasonic Intellectual Property Management Co., Ltd. Communication terminal, communication method, and program
WO2011100132A2 (en) * 2010-02-11 2011-08-18 Massachusetts Institute Of Technology Multiprocessor communication networks
WO2011100132A3 (en) * 2010-02-11 2012-01-12 Massachusetts Institute Of Technology Multiprocessor communication networks
US8819272B2 (en) 2010-02-11 2014-08-26 Massachusetts Institute Of Technology Multiprocessor communication networks

Similar Documents

Publication Publication Date Title
US5555243A (en) Self routing exchange and exchange system
US5418779A (en) High-speed switched network architecture
US5495426A (en) Inband directed routing for load balancing and load distribution in a data communication network
US5166930A (en) Data channel scheduling discipline arrangement and method
US5099475A (en) Switching system
US6950395B1 (en) Method and apparatus for a token bucket metering or policing system with a delayed filling scheme
US6747972B1 (en) Method and apparatus for reducing the required size of sequence numbers used in resequencing packets
JPH03135133A (en) Multi-medium integration network system
US6266333B1 (en) Network-independent routing of communication signals
GB2189112A (en) Automatic telecommunications switching system
JPH02305040A (en) Communication protocol for statistical data multiplexer built in wide area network
US5987030A (en) Transparent circuit emulation for packet switching network
US6999453B1 (en) Distributed switch fabric arbitration
WO2000076256A1 (en) Photonic switch using time-slot interchange
EP0939576B1 (en) Circuit-switched network
US20030091070A1 (en) Methods and systems for improving utilization of high-speed time division multiplexed communications links at signal transfer point
JPS62248337A (en) Packet transmission system
Karol et al. A simple adaptive routing scheme for congestion control in ShuffleNet multihop lightwave networks
US7349435B2 (en) Multiport overhead cell processor for telecommunications nodes
Sharon et al. On the efficiency of slot reuse in the dual bus configuration
US7042845B1 (en) System and method for time division multiplexed switching of data using a high-speed packet switch
JP6377577B2 (en) Parallel packet transmission apparatus and method
Fredrikson Analysis of channel utilization in traffic concentrators
US20040008701A1 (en) Hierarchical finite-state machines
JP2802408B2 (en) Path setting method for ring transmission network