Language selection

Search

Patent 2039223 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 Application: (11) CA 2039223
(54) English Title: METHOD AND APPARATUS FOR IDENTIFYING VALID CELLS IN A REDUNDANT PATH COMBINING UNIT OF AN ASYNCHRONOUS TRANSFER MODE SWITCH
(54) French Title: METHODE ET DISPOSITIF POUR REPERER LES CELLULES VALIDES DANS UNE UNITE DE COMBINAISON DE TRAJETS FAISANT PARTIE D'UN COMMUTATEUR DE MODES DE TRANSPORT ASYNCHRONE
Status: Dead
Bibliographic Data
(52) Canadian Patent Classification (CPC):
  • 344/28
(51) International Patent Classification (IPC):
  • H04Q 3/42 (2006.01)
(72) Inventors :
  • HALL, ROBERT M. (United Kingdom)
  • HALL, ROBERT M. (United Kingdom)
(73) Owners :
  • HALL, ROBERT M. (Not Available)
  • GEC PLESSEY TELECOMMUNICATION LIMITED (United Kingdom)
(71) Applicants :
  • HALL, ROBERT M. (United Kingdom)
(74) Agent: KIRBY EADES GALE BAKER
(74) Associate agent:
(45) Issued:
(22) Filed Date: 1991-03-27
(41) Open to Public Inspection: 1992-09-28
Availability of licence: N/A
(25) Language of filing: English

Patent Cooperation Treaty (PCT): No

(30) Application Priority Data: None

Abstracts

English Abstract




ABSTRACT:-

Method and Apparatus for Identifying Valid Cell in a
Redundant Path Combining Unit of an Asynchronous
Transfer Mode Switch

A method and apparatus is provided for identifying valid cells
in a redundant path combining unit of an asynchronous transfer
mode switch having duplicated switching planes. The method
comprising the steps of:-
a) Identifying the plane from which came the last cell to be
passed in respect of a particular call,
b) Checking that a sequence number associated with the cell is not
one greater than that stored in a storage means,
c) Checking that the last cell to be passed on the particular call
was from the same plane,
d) Checking if the cell is a duplicate of the last cell to arrive on this
plane, and,
e) Passing the cell to an output store if (c) is true and (d) is not
true and storing in the storage means the sequence number of the
cell.


Claims

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





CLAIMS:-


1. A method for identifying valid cells in a redundant path
combining unit of an asynchronous transfer mode switch having
duplicated switching planes, the method comprising the steps of:-
a ) Identifying the plane from which came the last cell to be
passed in respect of a particular call,
b ) Checking that a sequence number associated with the cell is not
one greater than that stored in a storage means,
c) Checking that the last cell to be passed on the particular call
was from the same plane,
d) Checking if the cell is a duplicate of the last cell to arrive on this
plane, and,
e) Passing the cell to an output store if (c) is true and (d) is not
true and storing in the storage means the sequence number of the
cell.
2. Apparatus for executing the method claimed in Claim 1,
comprising transceiver means arranged to receive and transmit data,
a first store connected to the transceiver means and, arranged to
store plane identification data and cell sequence number data, a
second store arranged to store a call identifier used to address the
first store and a sequence number related to a particular call, for
presentation to an addressed location in the first store, first
comparator arranged to receive the sequence number from the
second store and a sequence number from the first store and
compare said numbers, a second comparator arranged to receive the
sequence number from the second store, and the sequence number





from the first store by way of an incrementer which is arranged to
increment the sequence number by one, and compare said numbers,
and cell acceptance logic circuitry connected to the first and second
comparators and arranged to generate read and write control signals
for the first store, in accordance with output signals generated by the
first and second comparators.
3. A method and apparatus for identifying valid cells in a
redundant path checking unit of a transfer mode switch substantially
as hereinbefore described.
4. Apparatus for identifying valid cells in a redundant path
checking unit of a transfer mode switch substantially as hereinbefore
described with reference to Figure 2 of the accompanying drawings.

Description

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





METHOD AND APPARATUS FOR IDENTIFYING VALID CELLS
IN A REDUNDANT PATH COMBINING UNIT OF AN
ASYNCHRONOUS TRANSFER MODE SWITCH

The present invention relates to a method and apparatus for
identifying valid cells in a redundant path combining unit of an
asynchronous transfer mode switch having duplicated switching
planes .
In a known type of validity checking apparatus, the redundant
path combining unit is arranged to look at a sequence number
attached to each data cell, to detect whether the sequence number
matches that stored in a RAM or is greater by one. If either of these
conditions are satisfied the cell is considered valid and the sequence
number is incremented.
A disadvantage of this form of validity checking is that if the
same two consecutive cells are lost frGm both planes, the redundant
path combining unit would not allow any cells through until tlhe
sequence count had cycled round. For a 64 cell sequence follows:-


Plane 0 data 1, ,~,~, 4 ...... 63, 0, 1, 2
Plane 1 data 1, l~, ~, 4 ..... 63, 0, 1, 2
If cells 2 and 3, for example, are lost in both planes, then the
following cells 4, 5, 6 .. 63, 0, 1 are rejected in the cycle resulting
in a total loss of 64 cells. ~his results in the needless prolongation of
the original cell-loss error condition.
An obiect of the present invention is to provide a method and
apparatus for identifying valid cells which does not suffer from the
above mentioned disadvantage.




According to the present invention there is provided a method
for identifying valid cells in a redundant path combining unit of an
asynchronous transfer mode switch having duplicated switching
planes, the method comprising the steps of:-
a ) Identifying the plane from which came the last cell to be
passed in respect of a particular call,
b ) Checking that a sequence number associated with the cell is not
one greater than that stored in a storage means,
c) Checlcing that the last cell to be passed on the particular call
was from the same plane,
d) Checking if the cell is a duplicate of the last cell to arrive on this
plane, and,
e) Passing the cell to an output store if (c) is true and (d) is not
true and storing in the storage means the sequence number of the
cell.
According to the present invention there is provided an
apparatus for executing the method claimed in Claim 1, comprising
transceiver means arranged to receive and transmit data, a first store
connected to the transceiver means and, arranged to store plane
identification data and cell sequence number data, a second store
arranged to store a call identifier used to address the first store and a
sequence number related to a particular call, for presentation to an
addressed location in the first store, first comparator arranged to
receive the sequence number from the second store and a sequence
number from the first store and compare said numbers, a second
comparator arranged to receive the sequence number from the
second store, and the sequence number from the first store by way




of an incrementer which is arranged to increment the sequence
number by one, and compare said numbers, and cell acceptance logic
circuitry connected to the first and second comparators and arranged
to generate read and write control signals for the first store, in
accordance with output signals generated by the first and second
comparators .
An embodiment of the present invention will now be described
with reference to the accompanying drawings in which:-
Figure 1 shows part of an asynchronous time mode switchincorporating duplicated switching planes, and,
Figure 2 shows part of the hardware incorporated in the
redundant path combining unit necessary for executing the method.
Referring to Figure 1, an exchange termination unit ET has each
incoming line IL connected to it. The data cells pertaining to a call,
received on the line IL are passed to both switching planes P0 and P I
and are then switched to an output of the respective plane and
passed to a redundant path checking unit RPCU. The redundant path
checking unit RPCU receives therefore, a duplicate of each cell and it
is arranged to decide whether the cells received from plane 0, P0 or
plane 1, P1 should be passed to an outgoing line OL or discarded as a
duplicate.
The redundant path checking unit RPCU achieves this by
performing an algorithm. Each cell has an associated sequence
number, enabling duplicate cells to be identified. The redundant
path checking unit RPCU contains a look-up RAM 1 as shown in
Figure 2, in which the sequence number is stored for each cell at an
address which is identified by a virtual channel indicator VCI which




is used to identify the call. The VCI and sequence number are
temporarily stored in a shift register 2. The VCI is used to address
the RAM 1, and the next sequence number together with a plane
identifier PI from which the last cell was accepted is written into the
RAM under the control of cell acceptance logic circuitry 3. The
sequence number is applied to first and second comparators 4, 5
which also receive from the RAM 1~ the expected sequence number
stored for the VCI indicator, and the plane identifier, PI.
The sequence number applied to the comparator S from the
RAM 1, is incremented by one by circuit 6. The output signals from
the comparators 4, 5 are applied to the cell acceptance logic circuitry
3 for controlling the read/write operation of the RAM 1.
The plane identifier PI is applied to the RAM 1 over line 7. The
cell acceptance logic 3 also receives a RAM cycle start signal over line
8. The RAM 1 has data written to it, and read from it by a
transceiver, TC and is controlled by a microprocessor.
An example of how cells could arrive at the redundant path
checking unit RPCU is as follows:-


1, 2, ,B, ~, 5, 6 ... Plane O
1, 2, ~"~, 5, 6 .... Plane 1
The above represents the cell sequence for plane O and plane 1.Assuming that the cells shown crossed do not arrive at the redundant
path checking unit I~PCU because they are lost due to faults or errors~
and cells 1 and 2 of plane O are accepted, cell 5 is valid but is out of
sequence because the redundant path checl;ing unit is expecting the




sequence number of cell 3. Cells 1 and 2 of plane 1 are rejected as
they would be duplicates of cells 1 and 2 accepted on plane 0.
The circuitry described above executes the following algorithm.
The algorithm notes the plane from which came the last cell to be
passed in respect of the particular VCI. If the cell arrives from e.g.
plane O and the sequence number is not one greater than that held in
the RAM 1, and two further checks are made as follows:-
1) Was the last cell to be passed on this VCI from this plane?
2) Is this cell a duplicate of the last cell to arrive on this plane?
This can be detected as the sequence number of this cell being the
same as that stored in the RAM 1.
If 1 is true and 2 is not true, then the cell is passed to an output
FIFO in the transceiver and the sequence number stored in the RAM
1, is the sequence number of this cell.
The redundant path checking unit RPCU accepts a cell if the
sequence number is the next in the sequence. The sequence number
written back to the RAM 1 is that of the accepted cell.
The algorithm is shown below in pseudo code:-

BEGIN Plane-sent-bit: = O; (Set up variables)
Ram-seq-no: = 63;
When cell arrives on plane do Begin
Acceptance Loop If cell-seq-no <> RAM-seq-no then Begin
Normal acceptance If cell-seq-no = RAM-seq-no ~1 then
Begi n
Cell-accepted: = True;
RAM-seq-no: = cell-seq-no;
Plane-sent-bit: = This-plane;




End;
Out of Sequence If Plane-sent-bit = This-plane then
Begin
Cell-accepted: = True;
Out-of-sequence: = True;
RAM-seq-no: = cell-seq-no;
End;
End; Else IF Plane-sent-bit = This-plane then
Duplicate-cell-alarm: = True;
END.
END.
Variables: cell-seq-no The sequence number of this
incoming cell.
RAM-seq-no The sequence number held in
RAM for this VCI.
Plane-sent-bit The Plane from which the last
cell on this VCI was accepted.
This-plane The plane that this cell has
come from (0 or 1).
Cell-accepted Control variable to say
whether this cell is passed to
the output FIFO.
Duplicate-cell-alarm Indication to microprocessor
that a cell which is a duplicate
of the last cell on this call on
this plane has arrived.
Out-of-sequence Indication to rnicroprocessor
that cells have been lost i.e.
the cell sent is out of
sequence .
The algorithm does not cause a modulo 64 sequence loss to
occur due to the situation described above with respect to the prior
art, and the performance in other situations is equal to that of
previously used algorithms.

Representative Drawing

Sorry, the representative drawing for patent document number 2039223 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 Unavailable
(22) Filed 1991-03-27
(41) Open to Public Inspection 1992-09-28
Dead Application 1993-09-28

Abandonment History

There is no abandonment history.

Payment History

Fee Type Anniversary Year Due Date Amount Paid Paid Date
Application Fee $0.00 1991-03-27
Registration of a document - section 124 $0.00 1992-12-15
Owners on Record

Note: Records showing the ownership history in alphabetical order.

Current Owners on Record
HALL, ROBERT M.
GEC PLESSEY TELECOMMUNICATION LIMITED
Past Owners on Record
HALL, ROBERT M.
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) 
Description 1992-09-28 6 201
Drawings 1992-09-28 2 24
Claims 1992-09-28 2 51
Abstract 1992-09-28 1 21
Cover Page 1992-09-28 1 14