Language selection

Search

Patent 2224756 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 2224756
(54) English Title: OPTIMIZATION AND RECOVERY TECHNIQUES IN IMA NETWORKS
(54) French Title: TECHNIQUES D'OPTIMISATION ET DE RECUPERATION DANS LES RESEAUX UTILISANT LE MULTIPLEXAGE INVERSE
Status: Term Expired - Post Grant Beyond Limit
Bibliographic Data
(51) International Patent Classification (IPC):
  • H04L 45/24 (2022.01)
(72) Inventors :
  • RAHMAN, RESHAD (Canada)
  • PATRIARCHE, DOUGLAS H. (Canada)
  • VALLEE, RICHARD (Canada)
  • WHITE, STUART C. (Canada)
(73) Owners :
  • ERICSSON AB
(71) Applicants :
  • ERICSSON AB (Sweden)
(74) Agent: GOWLING WLG (CANADA) LLP
(74) Associate agent:
(45) Issued: 2002-04-16
(22) Filed Date: 1997-12-12
(41) Open to Public Inspection: 1999-06-12
Examination requested: 1997-12-12
Availability of licence: N/A
Dedicated to the Public: N/A
(25) Language of filing: English

Patent Cooperation Treaty (PCT): No

(30) Application Priority Data: None

Abstracts

English Abstract

In ATM networks, digital data in ATM cells are sent to a destination node over a connection made up of more than one transmission link in round robin fashion. This is called inverse multiplexing. Suitable transmission links are selected among a plurality of provisionable transmission links according to some selection criteria. According to some embodiments of the invention, the selection criteria are minimum delay and maximum bandwidth.


French Abstract

Dans les réseaux ATM, les données numériques dans des cellules ATM sont envoyées vers un nud de destination sur une connexion faite de plus d'un lien de transmission de manière circulaire. Ceci s'appelle le multiplexage inverse. Des liens de transmission adaptés sont sélection parmi une pluralité de liens de transmission de provision selon certains critères de sélection. Selon certains modes de réalisation de l'invention, les critères de sélection sont un retard minimal et une largeur de bande maximale.

Claims

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


WHAT IS CLAIMED IS:
1. In inverse multiplexing digital data, a method of selecting any
of a plurality of transmission links for a connection, comprising steps
of:
obtaining transmission parameters of the transmission links;
determining one or more subsets of all transmission links whose
transmission parameters meets one or more preset requirements;
choosing one of a plurality of selection criteria; and
selecting one subset of transmission links among all the subsets
determined above for activation in response to the chosen criterion.
2. The method according to claim 1, wherein the preset
requirement is any one of maximum differential delay, bit error rate
and transmission delays.
3. The method according to claim 2, wherein the selection
criteria are the minimum delay and the maximum bandwidth of the
connection.
4. The method according to claim 3, wherein the chosen
criterion is the minimum delay, the method comprising further steps
of:
determining the transmission link which has the least
transmission delay; and
selecting one subset of transmission links which includes the
transmission link having the least transmission delay.
5. The method according to claim 3, wherein the chosen
criterion is the maximum bandwidth, the method comprising further
steps of:
selecting one subset of transmission links which has the largest
number of the transmission links within said subset.

6. The method according to claim 5, wherein the chosen
criterion is the maximum bandwidth, the method comprising further
steps of:
if there are two or more subsets with the same largest number of
transmission links, selecting one subset which includes the
transmission link having the least transmission delay.
7. The method according to claim 1, comprising a further step of:
imposing upon one end of the connection already selected
transmission links or the chosen criterion to use to select transmission
links.
8. The method according to claim 4, comprising a further step of:
imposing upon one end of the connection already selected
transmission links or the chosen criterion to use to select transmission
links.
9. The method according to claim 5, comprising a further step of:
imposing upon one end of the connection already selected
transmission links or the chosen criterion to use to select transmission
links.
10. The method according to claim 6, comprising a further step
of:
imposing upon one end of the connection already selected
transmission links or the chosen criterion to use to select transmission
links.
11. The method according to claim 1, comprising a further step
of:
negotiating between two ends of the connection as to a selection
of particular transmission links or the chosen criterion to use to select
transmission links.
12. The method according to claim 4, comprising a further step
of:

negotiating between two ends of the connection as to a selection
of particular transmission links or the chosen criterion to use to select
transmission links.
13. The method according to claim 5, comprising a further step
of:
negotiating between two ends of the connection as to a selection
of particular transmission links or the chosen criterion to use to select
transmission links.
14. The method according to claim 6, comprising a further step
of:
negotiating between two ends of the connection as to a selection
of particular transmission links or the chosen criterion to use to select
transmission links.

Description

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


CA 022247~6 1997-12-12
OPTIMIZATION AND RECOVERY TECHNIQUES IN IMA
NETWORKS
Field of the Invention
The invention resides in the field of the ATM inverse
multiplexing. In particular, it is directed to an ATM inverse
multiplexing technique which enables link selection to be performed at
any time according to one of a plurality of selection criteria.
10 Background of the Invention
It has been recognized that the T1/E1 rate (1.544/2.048 Mbit/s) is a
cost effective way of user access to an ATM network as well as
connection between ATM network switches. However, as ATM
technology for wide area networks is deployed more and more,
15 decmands for transmission links of a rate higher than T1/E1 are
increasing. Links of higher rates, such as T3/E3 (44.736/34.368 Mbit/s),
have been designed to meet these needs. However, the cost of T3/E3
links is still prohibitive in many cases and the ratio of cost versus
realistic utilization of the entire rate is not always attractive and fully
20 justified for new ATM end users and service providers. IMA (short for
inverse multiplexing for ATM) satisfies the need by using multiple
T1/E1 links which are grouped collectively to provide the service at a
higher rate.
Figure 1 and Figure 2 show two sample configurations in which
25 IMA is used. In this specification, inverse multiplexing for ATM and
ATM devices performing inverse multiplexing are collectively called
IMA. Figure 1 depicts a user access to a network through user network
interfaces (UNIs) and Figure 2 illustrates a link connection between
ATM switches through broadband inter-carrier interfaces (BICIs) or
30 private network to network interfaces (PNNIs).
Referring to the figures, the basic function of IMA device is to
work in pairs to take an ATM cell stream coming from the ATM layer,
send it over the multiple links by spreading cells over the available
links and ensure that the initial cell stream can be retrieved at the far
35 end. Thus the IMA preferably makes the ATM traffic transparent to the
ATM layer over multiple links in use. As far as the ATM layer is

CA 022247~6 1997-12-12
concerned, it should only see a pipe (can be considered as a virtual link)
whose rate is now the sum of the multiple link rates. It is assumed that
each link is run in clear-mode without the presence of intermediate
ATM nodes processing ATM cells. This means that there should be no
cell discard by any intermediate transmission equipment.
U. S. Patent No. 5,608,733, Mar. 4, 1997, Vallee et al uses ATM
sequence number cells indicating a specific round robin order of a
plurality of transmission links over which ATM data cells are
transmitted. The ATM sequence number cells also indicate whether or
10 not a destination is ready to receive ATM data cells in that specific
round robin order.
The present invention extends further a variety of
functionalities which are useful in inverse multiplexing.
15 Objects of the Invention
It is therefore an object of the invention to provide a method of
and apparatus for sending ATM traffic over a connection consisting of a
plurality of transmission links.
It is a further object of the invention to provide a method of
20 sending a series of ATM cells between IMA devices over a connection
consisting of a plurality of transmission links, transparent to the ATM
layer.
It is also an object of the invention to perform IMA over a
connection consisting of a plurality of transmission links which are
25 selected according to one of a plurality of selection criteria.
It is another object of the invention to provide a method of
sending ATM traffic over a connection which consists of a plurality of
transmission links and has been reconfigured after the connection
start-up.
It is a further object of the invention to provide a method of
handling link failure and link reconfiguration.
It is yet another object of the invention to provide a method of
handling link configuration or reconfiguration according to one chosen
set of a plurality of possible link setting criteria.

CA 022247~6 1997-12-12
Summary of the Invention
Briefly stated, the invention resides in inverse multiplexing
digital data. According to one aspect, the invention is directed to a
method of selecting any of a plurality of transmission links for a
5 connection. The method comprises steps of obtaining transmission
parameters of the transmission links and determining one or more
subsets of all transmission links whose transmission parameters meets
one or more preset requirements. The method includes further steps
of choosing one of a plurality of selection criteria and selecting one
10 subset of transmission links among all the subsets determined above
for activation in response to the chosen criterion.
Brief Description of the Drawings
For a more complete understanding of the invention and for
15 further objects and advantages thereof, reference may now be made to
the following description, taken in conjunction with the accompanying
drawings, in which:
Figure 1 shows a sample configuration involving IMA UNIs;
Figure 2 shows a sample configuration involving IMA BICIs or
20 PNNIs;
Figure 3 is a schematic illustration of multiplexing and de-
multiplexing of ATM cells over IMAs and links;
Figure 4 is an illustration of selection criteria.
25 Detailed Description of Plefelled Embodiments
Figure 3 shows how the ATM cells are demultiplexed and then
multiplexed over IMAs in one direction. At the (near end)
transmitting node, an IMA 10 takes a series of ATM cells from an ATM
layer device. It spreads ATM cells and transmits each cell over each of
30 N transmission links, N being a positive integer. The N transmission
links form a link group and there may be more than one link group
between the nodes. The order of transmission is in the round robin
fashion within the link group. At the (far end) receiving node, cells
from N links are assembled and sent to an ATM layer device by an IMA
35 14. This process is called an inverse multiplexing The same order
must be employed at this node to recover a proper sequence of cells.

CA 022247~6 1997-12-12
Both nodes must be aware of the round robin order which is to be
employed. Upon initialization, therefore, both IMAs send a series of
special cells (e.g. sequence number cells) in round robin fashion over
the links, e.g. T1/E1 links. This allows the receiver IMA at both nodes
to establish the sequence in which to read cells from the incoming links
as well as to adjust relative link delay.
Links within an IMA link group may have different delays
which may also vary in time. Thus, cells transmitted in a given order
may not be received in the same order at the far end. In fact, a cell may
10 be received significantly later than another cell that followed it in the
original cell streams.
The receiving IMA device must preserve cell order; to do this it
buffers cells received on each link and compensates for the differential
delays prior to recombining the cells into the single stream. The term
15 link delay synchronization (LDS) is used to indicate that a receive link's
differential delay, relative to its peers in the IMA link group, has been
measured and compensated for.
In the process of IMA group startup, while establishing
communication with the far end node, the IMA measured the
20 differential delay of the receive links. If a link's differential delay is
within a specified maximum, the link is declared to be in LDS, and it
can be accepted as an active member of the link group. If the link's
differential delay exceeds the specified maximum, the link is not in
LDS and is rejected as an active member. When both near and far ends
25 agree on which links are acceptable, they can start exchanging user cells.
The IMA continually monitors and compensates for the
differential delay of its links. If a link's delay changes such that it
exceeds the specified maximum differential delay, the link is declared
to have experienced loss of delay synchronization (LODS), and is
30 deactivated from the group.
When a change of link configuration occurs by a link being
added, removed or declared as being down, each node sends a series of
ICP (IMA Control Protocol) cells to allow the far-end node to reestablish
the sequence of cells to read from the incoming links.
A set of IMA link configuration procedures is accepted in the
industry, such as the IMA group startup which includes "Addition of a

CA 022247~6 1997-12-12
link to an IMA group", "Deletion of a link from an IMA group, and
"Deactivation of a link from an IMA group due to a link or IMA fault".
Referring to Figure 3 again, the IMA device provides
provisioning and monitoring of the IMA groups. In one arrangement,
5 up to 8 IMA groups are supported and one IMA group may comprise 1
to 8 ports, each handling one transmission link.
According to the above accepted procedures, the IMA device
provides the user with the following options;
(1) Selection of the maximum differential link delay to be
10 tolerated within the group (a default value of 25 milliseconds being
widely accepted); and
(2) Selection of the period of time to wait before attempting to
reactivate a failed link.
Because the receiving IMA equalizes the delay of all links active
15 in the IMA group, the IMA virtual link effectively exhibits a
transmission delay equal to that of the greatest delay link active in the
group. Thus the following trade-off must be made when selecting the
maximum differential delay to be supported: a larger value may permit
more links to be activated within the group, but admission of these
20 links may result in a larger effective transmission delay for the IMA
virtual link. Because the maximum differential delay to be supported
is provisionable, the user can select the best value for a given
application.
Selection of other transmission characteristics parameters is also
25 possible for provisioning transmission links, such parameters as bit
error rate, transit delays etc.
As mentioned above, there are more than one transmission
links in an IMA link group. At a connection startup or
reconfiguration, certain links are selected for activation based on
30 transmission characteristics of each link etc., such as those mentioned
immediately above. It is however recognized now that there may be
other criteria which can be used for selecting links for certain
conditions. When certain provisioned transmission links do not meet
minimum requirments, other selection criteria can be used for link
35 activation.

CA 022247~6 1997-12-12
As one example, according to one embodiment of the invention,
such selection criteria as "minimize delay" and "maximize bandwidth"
can be used when not all provisioned links in the group conform to the
maximum differential delay.
When the criterion is minimum delay, links are selected for
activation as follows. First the least delay link is selected as the
reference link. Then, all links with differential delay relative to the
reference link less than or equal to the provisioned maximum
differential delay are selected for activation. Any links with relative
10 differential delay greater than the provisioned maximum are rejected
and are considered to be in a Loss of Delay Synchronization (LODS)
condition. Using this criterion will ensure that the IMA virtual link
has the lowest effective transmission delay possible given the
maximum acceptable differential delay, but it may restrict the
15 throughput capacity of the IMA virtual link.
When the criterion is maximum bandwidth, links are selected
for activation as follows. Each link in turn is considered to be the
reference link, and the corresponding set of acceptable links is
determined. The acceptable links are those with differential delay
20 relative to the reference link less than or equal to the provisioned
maximum differential delay. The largest set of acceptable links is then
selected for activation; if there are multiple sets of the largest size the
one with the lowest delay link is selected. Any unacceptable links are
rejected and are considered to be in a LODS condition. Using this
25 criterion will ensure that the IMA virtual link has the greatest
throughput capacity possible given the maximum acceptable
differential delay, but it may result in a larger effective transmission
delay of the IMA virtual link.
In one embodiment, available criteria are presented to the user
30 for selection but default is set to the maximum bandwidth. The
selection of criteria and/or execution of link selection according to the
chosen criterion can be made at any time, either at the connection
startup or at reconfiguration.
Figure 4 provides an example illustrating the two selection
35 criteria. Assuming that the IMA group has been provisioned to accept
a maximum differential delay of 25 milliseconds, then two different

CA 022247~6 1997-12-12
sets of links would be activated depending on the chosen link selection
criterion. If the least delay is used, links 1 and 2 would be activated, and
the effective transmission delay of the IMA virtual link would be 40
milliseconds. If the maximum bandwidth is used, links 2, 3, and 4
5 would be activated, and the effective transmission delay of the IMA
virtual link would be 60 milliseconds.
Note that there is no requirement for the near end and far end
IMA groups to have the same provisioning. However, if provisioning
does not match, it may result in one end rejecting links that the other
10 end finds acceptable; these links will not be activated since a link must
be accepted by both sides in order to be activated.
The above embodiments use "maximum bandwidth" and
"minimum delay" as two possible criteria. It should be noted that
other transmission characteristics can be used as the selection criteria.
According to yet another embodiment, two ends negotiate for
the criterion to be chosen. In one case, one end can be a master and the
other a slave, in that the master imposes the set of criteria to be used.
Alternatively, the master specifies what links it wants selected. In this
way, cases where both ends choose disjoint sets can be avoided.

Representative Drawing
A single figure which represents the drawing illustrating the invention.
Administrative Status

2024-08-01:As part of the Next Generation Patents (NGP) transition, the Canadian Patents Database (CPD) now contains a more detailed Event History, which replicates the Event Log of our new back-office solution.

Please note that "Inactive:" events refers to events no longer in use in our new back-office solution.

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 , Event History , Maintenance Fee  and Payment History  should be consulted.

Event History

Description Date
Inactive: IPC expired 2022-01-01
Inactive: IPC from PCS 2022-01-01
Inactive: Expired (new Act pat) 2017-12-12
Inactive: First IPC assigned 2013-01-09
Inactive: IPC assigned 2013-01-09
Inactive: IPC expired 2013-01-01
Inactive: IPC removed 2012-12-31
Letter Sent 2011-04-15
Inactive: Late MF processed 2003-11-25
Inactive: Office letter 2002-12-02
Letter Sent 2002-06-06
Inactive: Adhoc Request Documented 2002-05-08
Inactive: Office letter 2002-05-08
Inactive: S.8 Act correction requested 2002-04-23
Grant by Issuance 2002-04-16
Inactive: Cover page published 2002-04-15
Inactive: Final fee received 2002-01-23
Pre-grant 2002-01-23
Letter Sent 2001-07-24
Notice of Allowance is Issued 2001-07-24
Notice of Allowance is Issued 2001-07-24
Inactive: Approved for allowance (AFA) 2001-07-10
Inactive: Inventor deleted 2000-05-18
Inactive: Inventor deleted 2000-05-18
Inactive: Inventor deleted 2000-05-18
Inactive: Inventor deleted 2000-05-18
Inactive: Multiple transfers 2000-01-06
Letter Sent 1999-07-22
Inactive: Cover page published 1999-07-02
Application Published (Open to Public Inspection) 1999-06-12
Revocation of Agent Requirements Determined Compliant 1999-05-04
Inactive: Office letter 1999-05-04
Inactive: Office letter 1999-05-04
Appointment of Agent Requirements Determined Compliant 1999-05-04
Appointment of Agent Request 1999-04-07
Revocation of Agent Request 1999-04-07
Inactive: Single transfer 1998-05-27
Inactive: IPC assigned 1998-04-03
Classification Modified 1998-04-03
Inactive: First IPC assigned 1998-04-03
Inactive: Courtesy letter - Evidence 1998-03-17
Inactive: Filing certificate - RFE (English) 1998-03-13
Application Received - Regular National 1998-03-12
Request for Examination Requirements Determined Compliant 1997-12-12
All Requirements for Examination Determined Compliant 1997-12-12

Abandonment History

There is no abandonment history.

Maintenance Fee

The last payment was received on 2001-11-28

Note : If the full payment has not been received on or before the date indicated, a further fee may be required which may be one of the following

  • the reinstatement fee;
  • the late payment fee; or
  • additional fee to reverse deemed expiry.

Patent fees are adjusted on the 1st of January every year. The amounts above are the current amounts if received by December 31 of the current year.
Please refer to the CIPO Patent Fees web page to see all current fee amounts.

Owners on Record

Note: Records showing the ownership history in alphabetical order.

Current Owners on Record
ERICSSON AB
Past Owners on Record
DOUGLAS H. PATRIARCHE
RESHAD RAHMAN
RICHARD VALLEE
STUART C. WHITE
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) 
Drawings 1997-12-11 2 26
Representative drawing 2002-03-12 1 5
Representative drawing 1999-06-28 1 4
Description 1997-12-11 7 341
Abstract 1997-12-11 1 14
Claims 1997-12-11 3 87
Filing Certificate (English) 1998-03-12 1 165
Courtesy - Certificate of registration (related document(s)) 1998-07-21 1 140
Reminder of maintenance fee due 1999-08-16 1 114
Commissioner's Notice - Application Found Allowable 2001-07-23 1 165
Correspondence 2002-12-01 2 12
Correspondence 2002-11-13 5 138
Correspondence 2002-05-07 1 15
Correspondence 2002-01-22 1 31
Correspondence 1999-05-03 1 7
Correspondence 1999-05-03 1 9
Correspondence 2000-11-30 1 26
Correspondence 2000-02-07 1 22
Fees 2001-11-27 1 26
Fees 1999-11-25 1 30
Fees 2002-11-03 1 35
Correspondence 1999-04-06 2 52
Correspondence 1998-03-16 1 35
Correspondence 2002-04-22 1 23
Fees 2000-11-27 1 30