Language selection

Search

Patent 2008666 Summary

Third-party information liability

Some of the information on this Web page has been provided by external sources. The Government of Canada is not responsible for the accuracy, reliability or currency of the information supplied by external sources. Users wishing to rely upon this information should consult directly with the source of the information. Content provided by external sources is not subject to official languages, privacy and accessibility requirements.

Claims and Abstract availability

Any discrepancies in the text and image of the Claims and Abstract are due to differing posting times. Text of the Claims and Abstract are posted:

  • At the time the application is open to public inspection;
  • At the time of issue of the patent (grant).
(12) Patent: (11) CA 2008666
(54) English Title: PACKET SWITCHING SYSTEM
(54) French Title: SYSTEME DE COMMUTATION DE PAQUETS
Status: Expired
Bibliographic Data
(52) Canadian Patent Classification (CPC):
  • 344/25
(51) International Patent Classification (IPC):
  • H04Q 11/04 (2006.01)
  • H04L 12/56 (2006.01)
(72) Inventors :
  • SUZUKI, TOSHIO (Japan)
  • ITOH, ATSUO (Japan)
(73) Owners :
  • NEC CORPORATION (Japan)
(71) Applicants :
(74) Agent: SMART & BIGGAR
(74) Associate agent:
(45) Issued: 1996-12-24
(22) Filed Date: 1990-01-26
(41) Open to Public Inspection: 1990-07-27
Examination requested: 1990-08-17
Availability of licence: N/A
(25) Language of filing: English

Patent Cooperation Treaty (PCT): No

(30) Application Priority Data:
Application No. Country/Territory Date
16224/1989 Japan 1989-01-27

Abstracts

English Abstract






A cell switching system incorporates time division
lines, serial-to-parallel converters, address filters, re-
arranging circuits, selectors and parallel-to-serial con-
verters. The novel system avoids prior art problems such
as complicated processing requirement to prevent conflicting
cells from being inverted. A number of different cells
arriving at the same time for the same destination can be
handled.


Claims

Note: Claims are shown in the official language in which they were submitted.



THE EMBODIMENTS OF THE INVENTION IN WHICH AN EXCLUSIVE
PROPERTY OR PRIVILEGE IS CLAIMED ARE DEFINED AS FOLLOWS:


1. A packet switching network for receiving information
packets on a plurality of input lines, each of said packets
having a fixed bit length and consisting of data and an
address indicative of a destination of said data, switching
said packets responsive to said addresses so that said data
are sent to desired destinations, and sending said switched
packets via a plurality of output lines, said network
comprising:
a plurality of time division lines each being associated
with a respective one of a plurality of input lines and having
a time division multiplex channel, each of the channels being
associated with a respective one of a plurality of output
lines;
a plurality of serial-to-parallel converting means, each
of said serial-to-parallel converting means being associated
with a respective one of the input lines for delivering an
input packet to an associated one of said time division lines;
a plurality of address filter means, each of said filter
means being associated with a respective one of the input
lines for identifying one of the output lies to which a
packet is destined on a basis of the address of said packet
and for indicating a channel position associated with said one
output line on an associated one of said time division lines;
a plurality of rearranging means, each rearranging means
being associated with a respective one of the input lines for
rearranging each packet on a time division multiplex channel
- 12 -




in response to an indication from an associated one of said
address filter means, said packet being outputted at a
particular channel position that is assigned to said packet in
response to said rearrangement, and delivering said rearranged
packet to an associated one of said time division lines, each
of said rearranging means comprising buffer means for
temporarily storing an output of an associated one of said
serial-to-parallel converting means and, in response to a
command from an associated one of said filter means,
delivering said stored output to an associated one of said
time division lines while delaying said stored output;
a plurality of selector means, each of said selector
means being associated with a respective one of the output
lines and being connected to a plurality of said time division
lines for periodically selecting and outputting packets on
associated ones of said time division lines; and
a plurality of parallel-to-serial converting means, each
of said parallel-to-serial converting means being associated
with a respective one of the output lines for delivering the
packet selected by the associated one of said selector means;
each of the time division lines having a bus-connection
construction for being terminated respectively at correspond-
ing ones of input terminals of all of the selector means to
input the same packet to all of the selector means;
all of said time division lines being related with
respect to channel positions so that only a single channel
that corresponds to one of the output lines exists at any one
position on a time division multiplex channel, whereby the


- 13 -


packets to be fed out to the same output are prevented from
conflicting with each other.



2. A network as claimed in claim 1, wherein each of
said address filter means is constructed to deliver the same
packet to two or more of the output lines by applying, while
said same packet is stored in said buffer means, a cell output
command to two or more of said channel positions of said time
division lines.




- 14 -

Description

Note: Descriptions are shown in the official language in which they were submitted.


2008666
PACKBT S~ nl~G SYSTEM



BACKGROUND OF THE INVENTION
Fleld of the Inventlon
The lnvention relates to a cell or packet swltchlng
system or network for transmittlng data by uslng cells each
havlng a flxed length. More partlcularly, the lnventlon ls
concerned wlth a cell swltchlng system of the type havlng tlme
dlvlslon llnes each belng assoclated wlth a dlfferent lnput
and provlded wlth a tlme dlvlslon multlplex channel construc-

tlon associated wlth an output, and selector means each belngassoclated wlth a dlfferent output for selectlng the tlme
dlvlslon llnes perlodlcally. Thls type of system swltches
lndlvldual cells to deslred outputs by self-routlng.



Descrlptlon of the Prlor Art
A cell swltchlng system swltches cells each conslst-
lng of data and an address lndlcatlve of a destlnatlon of the
data. In thls system, lt often occurs that a plurallty of
cells meant for the same destlnatlon arrlve at the same tlme.
Such an occurrence may be coped wlth by comblnlng a sortlng
clrcult network and a routlng clrcult network such that a
confllctlng cell ls relnputted ln the routlng clrcult network,
as taught by Alan Huang et al ln an artlcle tltled "A Wldeband
Dlgltal Swltch" publlshed ln 1984 ln the IEEE Global Telecom-
munlcatlons Conference Record. Another prlor art lmplement-
atlon ls the use of swltch modules each belng assoclated wlth
a dlfferent output for selectlng cells whlch come ln vla bus



- 1 - ~
~ 66446-478

'_L,.

- 2008666
type inputs, as dlsclosed by Y.S. Yeh et al ln an artlcle
tltled "The Knockout Swltch: A Slmple, Modular Archltecture
For Hlgh-Performance Packet Switchlng" publlshed ln the
Proceedlngs of the IEEE Internatlonal Swltchlng Symposlum
1987.
However, a problem wlth the sorting and routlng
network scheme ls that compllcated processlng ls needed to
prevent the confllctlng cells from belng lnverted ln order ln
the event of relnput. Another problem ls that a broadcastlng
functlon for sendlng out the same data to a plurallty of
outputs at the same tlme ls not readlly practlcable. The
modular swltch scheme has a dlsadvantage that swltches have to
be asslgned one-to-one to all the outputs, resultlng ln a
large hardware scale.



SUMMARY OF THF INVENTION
It ls therefore an ob~ect of the present lnventlon
to provlde a cell (or packet) swltchlng network whlch, wlth a
relatlvely slmple clrcult constructlon, dellvers even a
plurallty of packets meant for the same destlnatlon and
arrlvlng at the same tlme to a deslred output.
In order to achleve the above ob~ect, there ls
provlded a packet swltchlng network for recelvlng lnformatlon
packets on a plurallty of lnput llnes, each of sald packets
havlng a flxed blt length and conslstlng of data and an
address lndlcatlve of a destlnatlon of sald data, swltchlng
sald packets responslve to sald addresses so that sald data
are sent to deslred destlnatlons, and sendlng sald swltched




66446-478

-- 2008666
packets vla a plurallty of output llnes, sald network
comprlslng: a plurallty of tlme dlvlslon llnes each belng
assoclated wlth a respectlve one of a plurallty of lnput llnes
and havlng a tlme dlvlslon multlplex channel, each of the
channels belng assoclated wlth a respectlve one of a plurallty
of output llnes; a plurallty of serlal-to-parallel convertlng
means, each of sald serlal-to-parallel convertlng means belng
assoclated wlth a respectlve one of the lnput llnes for
dellverlng an lnput packet to an assoclated one of sald tlme
dlvlslon llnes; a plurallty of address fllter means, each of
sald filter means belng assoclated wlth a respectlve one of
the lnput llnes for ldentlfylng one of the output llnes to
whlch a packet ls destlned on a basls of the address of sald
packet and for lndlcatlng a channel posltlon assoclated wlth
sald one output llne on an assoclated one of sald tlme
dlvlslon llnes; a plurallty of rearranglng means, each
rearranglng means belng assoclated wlth a respectlve one of
the lnput llnes for rearranglng each packet on a tlme dlvlslon
multlplex channel ln response to an lndlcatlon from an
assoclated one of sald address fllter means, sald packet belng
outputted at a partlcular channel posltlon that ls asslgned to
sald packet ln response to sald rearrangement, and dellverlng
sald rearranged packet to an assoclated one of sald tlme
dlvlslon llnes, each of sald rearranglng means comprlslng
buffer means for temporarlly storlng an output of an
assoclated one of sald serlal-to-parallel convertlng means
and, ln response to a command from an assoclated one of sald
fllter means, dellverlng sald stored output to an assoclated




66446-478

1, .

20086~6
one of sald tlme dlvlslon llnes whlle delaylng sald stored
output; a plurallty of selector means, each of sald selector
means belng assoclated wlth a respectlve one of the output
llnes and belng connected to a plurallty of sald tlme dlvlslon
llnes for perlodlcally selectlng and outputtlng packets on
assoclated ones of sald tlme dlvlslon llnes; and a plurallty
of parallel-to-serlal convertlng means, each of sald parallel-
to-serlal convertlng means belng assoclated wlth a respectlve
one of the output llnes for dellverlng the packet selected by
the assoclated one of sald selector means; each of the tlme
dlvlslon llnes havlng a bus-connection constructlon for belng
termlnated respectlvely at correspondlng ones of lnput
termlnals of all of the selector means to lnput the same
packet to all of the selector means; all of sald tlme dlvlslon
llnes belng related wlth respect to channel posltlons so that
only a slngle channel that corresponds to one of the output
llnes exlsts at any one posltlon on a tlme dlvlslon multlplex
channel, whereby the packets to be fed out to the same output
are prevented from confllctlng wlth each other.



BRIFF D~ ON OF THE DRAWINGS
The above an other ob~ects, features and advantages
of the present lnventlon wlll become more apparent from the
followlng detalled descrlptlon when taken wlth the accompany-
lng drawlngs ln whlch:
FIG. 1 ls a schematlc block dlagram showlng an
embodlment of the cell swltchlng system ln accordance wlth the
lnventlon;




66446-478
~3

~ 5 ~ ' 2008666

FIGS. 2A, 2B and 2C are timing chart demonstrating
a specific operation of the system shown in FIG. 1 which
occurs on the input side;
FIG. 3 is a flowchart associated with FIGS. 2A to 2C;
FIGS. 4A, 4B, 4C and 4D show channel arrangements on
time division lines which are included in the system of
FIG. l;
FIGS. 5A to 5D illustrate the operation of selectors
shown in FIG. l;
FIGS. 6A to 6D show channel constructions on time
division lines representative of another embodiment of
the present invention; and
FIGS. 7A to 7D indicate the operation of selectors
useful for understanding the embodiment shown in FIGS.
6A to 6D.
In the drawings, the same structural elements are
designated by like reference numerals.



DESCRIPTION OF THE PREFERRED EMBODIMENTS
Referring to FIG. 1, a cell switching system embodying
the present invention is shown in a block diagram. As
shown, the system has n inputs Il, I2, ..., In and m
outputs l~ 2' ''' m' The inputs Il to In are connected
to serial-to-parallel (S/P) converters 111 to lln,
respectively. As shown in FIG. 2A, cells each having
a fixed length (K bits) arrive at each input during every

- 6 - 2 00 86 66



period T of time. Each cell is made up of an address
having kl bits and data having k2 bits.
The S/P converters 111 to lln are respectively
connected to address filters 121 to 12n for identifying
the addresses of individual cells, and delay buffers 13
to 13n for delaying the individual cells based on the
result of identification of the address filters. The
delay buffers 131 to 13n are connected to time division
lines 151 to 15n, respectively. The time division lines
151 to 15 terminate respectively at corresponding ones
of n input terminals of m selectors 161 to 16m which
are associated one-to-one with the outputs l to m.
Operated on a time division basis, each of the selectors
161 to 16m sequentially selects the n inputs one at a
time while feeding them out, as will be described in
detail later.
The selectors 161 to 16m are connected to series
connections of buffers 171 to 17m and parallel-to-serial
(P/S) converters 181 to 18m, respectively. The P/S
converters 181 to 18m are connected to the outputs l
to m' respectively.
FIGS. 2A to 2C indicate a specific procedure for
multiplexing incoming cells by the time division principle.
The procedure will be described by taking the input Il
for example and with reference also made to FIG. 3. As
shown in FIG. 2A, a cell S having a kl-bit address and


- 7 - 2008666

k2-bit data arrives at the input Il during the period T.
When the entire string of bits constituting the cell S
sent in series have arrived at the input Il (step Sl,
Fig. 3), it is transformed into parallel data by the
associated S/P converter 111 (step S2). The S/P converter
111 may be implemented by a K-bit shift register, for
example. The resulting parallel data are shown in FIG. 2B.
The S/P conversion is effected such that m (number of
outputs) cells can be time-division multiplexed within
the cell length period T. Specifically, the cell length
period t after the conversion of one cell satisfies the
relationship T ~ mt. The parallel data representative
of the cell S are stored in the delay buffer 131 (step S3).
While performing S/P conversion as stated above, the
S/P converter 111 separates the address from the cell S
and delivers it to the associated address filter 121.
On detecting the address of the cell S, the address filter
121 identifies one of the outputs l to m (step S4) to
which the cell S is destined. At the same time, the
address filter 121 controls the delay buffer 131 such
that the cell S is delayed by a required period of time
and fed out to the time division line 151.
Specifically, as shown in FIG. 2C, m channels are
defined on the time division line 151, and each of the
channels is allotted the time t corresponding to the
cell length period after serial-to-parallel conversion.


- 8 - 200 8 6 66

The m channels are associated with the output lines l to
m' respectively. Assuming that the address of the cell S
designates the output O4, for example, the address filter
121 controls the associated delay buffer 13l such that
the cell S having been stored in the delay buffer 131 is
outputted when a time slot associated with the output O4
shown in FIG. 2C is reached (steps S5 and S6). The same
data may be fed out to a plurality of output lines at a
time by outputting it repetitively at a plurality of
desired channel positions. For example, if address
information commanding simulltaneous broadcast is set
up beforehand, the address filter 121 will produce the
same data on the desired channels every time it detects
the address information.
Each of the m selectors 16l to 16m sequentially
selects the time division lines 151 to 15n at the intervals
of t so as to store in associated one of the buffers 171
to 17 the cell S which should be fed out to the associated
m




output line. The cells so lodged in the individual buffers
17l to 17m are transformed into serial data by the
associated P/S converters 18l to 18m to be delivered to
the output lines l to O . It is noteworthy that all
the n time division lines differ from one another with
respect to the above-stated channel positions. This will
be described specifically with reference to FIGS. 4A to
4D.


9 2008666


FIGS. 4A to 4D depict channel positions on the
individual time division lines 151 to 15n. As shown,
the timing for the cell length period T to be repeated is
sequentially deviated by the time t from the time division
line 151 to the time division line 15n, i.e., all the time
division lines 151 to 15n are different from one another
with respect to the channel positions. Hence, only one
channel that corresponds to a certain output exists at
the same position on the time axis. At a time tl, for
example, a channel corresponding to the output l exists
on the time division line 151 only. The selectors 161
to 16m, therefore, select the inputs in matching relation
to the individual channel positions. For example, the
selector 161 associated with the output l selects the
time division line 151 at the time tl and the time
division line 152 at a time t2. Likewise, the selector
162 selects the time division line 151 at the time t2
and the time division line 152 at a time t3. FIGS. 5A
to 5D indicate such a relationship of selection timing
in the selectors 161 to 16m.
As stated above, only a single time division channel
(cell) that should be fed out to a single output exists
at any time on all the time division lines. This is
successful in eliminating the conflict of cell. Hence,
even when a plurality of cells having the same address
arrive at the cell switching system at the same time,




lO- 2008666

they can be fed out to a desired output without being
discarded due to conflict or being inverted in sequence.
Every time one cell S is completed on any one of the
inputs Il to In, it is delivered to a destined output
within the next period T. It follows that each of the
delay buffers 131 to 13 needs only a K-bit (one cell)
memory area. It will be clear that the buffers 171 to 17m
and the P/S converters 181 to 18m can be implemented by
K-bit memories and K-bit shift registers, respectively.
As described above, the illustrative embodiment
assigns a different repetition timing of the cell length
period T to each input. This requires that different
timing pulses be generated for and fed to the individual
input lines (S/P converters, address filters and delay
buffers) and individual output lines (selectors, buffers
and P/S converters). Nevertheless, the selectors 161 to
16m need only to switch over in response to the same
timing pulses the period of which is T.
Referring to FIGS. 6A to 6D and FIGS. 7A to 7D another
embodiment of the present invention is shown in which all
the inputs Il to In and time division lines 151 to 15n
share the same timing concerning the repetition of the
period T. In this embodiment, therefore, all the S/P
converters 111 to 11 are operated in synchronism. An
advantage achievable with such a construction is that a
pulse indicative of the beginning of the peirod T can be



2 00 86 6 6


fed to all the circuits at the same timing, promoting easy
control over the entire system. However, the control over
the selectors 161 to 16m is not easy because the order in
which the time division lines 151 to 15n is selected
differs from one selector to another. Specifically, as
shown in FIGS. 7A to 7D, the selector 161 sequentially
selects the time division lines 151, 152, 153 and so
forth in this order from the beginning of the period T,
while the selector 162 selects the time division lines
15m, 151, 152 and so forth in this sequence.

Representative Drawing

Sorry, the representative drawing for patent document number 2008666 was not found.

Administrative Status

For a clearer understanding of the status of the application/patent presented on this page, the site Disclaimer , as well as the definitions for Patent , Administrative Status , Maintenance Fee  and Payment History  should be consulted.

Administrative Status

Title Date
Forecasted Issue Date 1996-12-24
(22) Filed 1990-01-26
(41) Open to Public Inspection 1990-07-27
Examination Requested 1990-08-17
(45) Issued 1996-12-24
Expired 2010-01-26

Abandonment History

There is no abandonment history.

Payment History

Fee Type Anniversary Year Due Date Amount Paid Paid Date
Application Fee $0.00 1990-01-26
Registration of a document - section 124 $0.00 1990-09-19
Maintenance Fee - Application - New Act 2 1992-01-27 $100.00 1991-12-24
Maintenance Fee - Application - New Act 3 1993-01-26 $100.00 1992-12-17
Maintenance Fee - Application - New Act 4 1994-01-26 $100.00 1993-12-16
Maintenance Fee - Application - New Act 5 1995-01-26 $150.00 1994-12-19
Maintenance Fee - Application - New Act 6 1996-01-26 $150.00 1995-12-15
Maintenance Fee - Application - New Act 7 1997-01-27 $150.00 1996-12-16
Maintenance Fee - Patent - New Act 8 1998-01-26 $150.00 1997-12-30
Maintenance Fee - Patent - New Act 9 1999-01-26 $150.00 1998-12-21
Maintenance Fee - Patent - New Act 10 2000-01-26 $200.00 1999-12-16
Maintenance Fee - Patent - New Act 11 2001-01-26 $200.00 2000-12-18
Maintenance Fee - Patent - New Act 12 2002-01-28 $200.00 2001-12-17
Maintenance Fee - Patent - New Act 13 2003-01-27 $200.00 2002-12-18
Maintenance Fee - Patent - New Act 14 2004-01-26 $200.00 2003-12-17
Maintenance Fee - Patent - New Act 15 2005-01-26 $450.00 2004-12-07
Maintenance Fee - Patent - New Act 16 2006-01-26 $450.00 2005-12-07
Maintenance Fee - Patent - New Act 17 2007-01-26 $450.00 2006-12-08
Maintenance Fee - Patent - New Act 18 2008-01-28 $450.00 2007-12-06
Maintenance Fee - Patent - New Act 19 2009-01-26 $450.00 2008-12-15
Owners on Record

Note: Records showing the ownership history in alphabetical order.

Current Owners on Record
NEC CORPORATION
Past Owners on Record
ITOH, ATSUO
SUZUKI, TOSHIO
Past Owners that do not appear in the "Owners on Record" listing will appear in other documentation within the application.
Documents

To view selected files, please enter reCAPTCHA code :



To view images, click a link in the Document Description column. To download the documents, select one or more checkboxes in the first column and then click the "Download Selected in PDF format (Zip Archive)" or the "Download Selected as Single PDF" button.

List of published and non-published patent-specific documents on the CPD .

If you have any difficulty accessing content, you can call the Client Service Centre at 1-866-997-1936 or send them an e-mail at CIPO Client Service Centre.


Document
Description 
Date
(yyyy-mm-dd) 
Number of pages   Size of Image (KB) 
Cover Page 1994-03-27 1 20
Drawings 1994-03-27 7 138
Claims 1994-03-27 3 79
Abstract 1994-03-27 1 12
Description 1994-03-27 11 354
Abstract 1996-12-24 1 14
Cover Page 1996-12-24 1 16
Description 1996-12-24 11 387
Claims 1996-12-24 3 102
Drawings 1996-12-24 7 122
Examiner Requisition 1993-01-14 1 54
Examiner Requisition 1995-08-18 2 57
Prosecution Correspondence 1990-08-17 1 26
Prosecution Correspondence 1993-06-25 2 66
Prosecution Correspondence 1996-02-16 2 40
PCT Correspondence 1990-08-15 1 33
Office Letter 1990-10-31 1 19
PCT Correspondence 1996-10-11 1 31
Office Letter 1990-08-08 1 57
Fees 1996-12-16 1 67
Fees 1995-12-15 1 65
Fees 1994-12-19 1 59
Fees 1993-12-16 1 39
Fees 1992-12-17 1 36
Fees 1991-12-24 1 22