CA2233191A1 - Method for the reception of message cells from low-priority connections from only one of a number of redundant transmission paths - Google Patents
Method for the reception of message cells from low-priority connections from only one of a number of redundant transmission paths Download PDFInfo
- Publication number
- CA2233191A1 CA2233191A1 CA002233191A CA2233191A CA2233191A1 CA 2233191 A1 CA2233191 A1 CA 2233191A1 CA 002233191 A CA002233191 A CA 002233191A CA 2233191 A CA2233191 A CA 2233191A CA 2233191 A1 CA2233191 A1 CA 2233191A1
- Authority
- CA
- Canada
- Prior art keywords
- message
- connections
- cells
- message cells
- transmission path
- 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.)
- Abandoned
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q11/00—Selecting arrangements for multiplex systems
- H04Q11/04—Selecting arrangements for multiplex systems for time-division multiplexing
- H04Q11/0428—Integrated services digital network, i.e. systems for transmission of different types of digitised signals, e.g. speech, data, telecentral, television signals
- H04Q11/0478—Provisions for broadband connections
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/54—Store-and-forward switching systems
- H04L12/56—Packet switching systems
- H04L12/5601—Transfer mode dependent, e.g. ATM
- H04L2012/5638—Services, e.g. multimedia, GOS, QOS
- H04L2012/5646—Cell characteristics, e.g. loss, delay, jitter, sequence integrity
- H04L2012/5651—Priority, marking, classes
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/54—Store-and-forward switching systems
- H04L12/56—Packet switching systems
- H04L12/5601—Transfer mode dependent, e.g. ATM
- H04L2012/5672—Multiplexing, e.g. coding, scrambling
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/54—Store-and-forward switching systems
- H04L12/56—Packet switching systems
- H04L12/5601—Transfer mode dependent, e.g. ATM
- H04L2012/5678—Traffic aspects, e.g. arbitration, load balancing, smoothing, buffer management
- H04L2012/5679—Arbitration or scheduling
Abstract
In a transmission system wherein redundant message cells, routed in the course of virtual connections according to the ATM (Asynchronous Transfer Mode) transmission method, are respectively transmitted via redundant transmission paths, a rejection of message cells belonging to a low-priority connection is permitted on the transmission paths to form the total traffic volume. To avoid an overload following the recombination of the message cell streams transmitted via the redundant transmission paths, the message cells of a connection of low priority are received by only one transmission path. For a number of connections, a selection identification character defines the transmission path by which the message cells belonging to these connections are received.
Description
S P E C I ~ I C A T I O N
TITLE
"METHOD FOR THE RECEPTION OF MESSAGE CELLS FROM LOW-PRIORITY
CONNECTIONS FROM ONLY ONE OF A NUMBER OF REDUNDANT
TRANSMISSION PATltS"
BACKGROUND OF THE INVENTION
Field of the Invention The present invention is directed to a method for routing message cells from connections having respectively different priorities particularly in the reception of message cells from low-priority connections, such as non-real time (NRT) traffic, of the type wherein redundant message cells are respectively transmitted via redundant transmission paths, and only one of the received redundant message cells is selected for further processing.
Description of the Prior Art In ATM (Asynchronous Transfer Mode) transmission, the sequence of message cells belonging to a virtual connection should be maintained. In order to meet a prescribed loss probability, parallel routing or forwarding, via through-connections along redundant transmission paths may be necessary. Among the redundantly transmitted message cells, only one message cell is selected at the reception location as the next message expected in the sequence. To designate the sequence, each message cell carries a series number, allocated to it in a cyclically progressing fashion in a field for the series number. The individually distinguishable series numbers of a virtual connection define a message cell sequence cycle.
The redundant tra~-sn,ission paths can each include a statistical multiplexer unit which is intended to form the traffic of low-priority connections during the activity of CA 02233191 1998-03-2~
large buffer memories in such a way that the total traffic loads the output line optimally, i.e. to nearly 100 percent.
The statistical multiplexer units of the coupling field slices operate independently of each other, so that message cell streams with different contents can arise.
If a simple recombination algorithm is applied at the receiving location at the end of the redundant transmission paths, then the message cells which were rejected on one transr"ission path for reasons of overload are replaced by redundant message cells transmitted on another transmission path, which leads to a load of greater than 100%
and thus to an overflow of the RPC buffer at the exit of the output unit.
A selection identification character could be entered In the receiving unit for the connections of lower priority, this selection identification character determining the transmission path by which message cells of the relevant connection are exclusively received for further processing. Given the failure of a transmission path, the board controller would have to rewrite all the affected entries which would last several seconds, given up to 8192 connections, and which would have to be followed by a message cell sequence cycle in order to avoid an undesired mixing of the message cell streams of the low-priority connections of the transmission paths participating in the switchover. During such a cycle the transmission paths participating in the switchover do not receive any message cells for further processing.
SUMMARY OF THE INVENTION
It is an object of the present invention to provide a method for a transmission system in which message cells transmitted redundantly via redundant transmission paths are rejected independently of each other on the transmission paths. It is a further CA 02233191 1998-03-2~
object to provide such a method wherein a switchover from reception of only a first transmission path to reception of only a second transmission path takes place with a considerably reduced time requirement.
The above object is achieved in accordance with the principles of the present invention in a method for routing message cells received from connections having different priority via redundant transmission paths, wherein redundant message cells are respectively transmitted via redundant transmission paths with only one of the received redundant message cells being selected for further processing, wherein connections having low ranking priority are assigned an identification bit, with a number of such connections designated by the same identification bit forming a class, and wherein the identification bit is evaluated upon reception of a message cell, and the message cell contains a selection condition character which defines the transmission path by which the message cells belonging to the class are accepted for further processing.
Besides a simplification of the switchover, the method according to the invention offers a considerable abbreviation of the time requirement for the switchover which correspondingly lowers the loss of message cells due to the switchover, because for a number of connections, only the selection identification character has to be changed.
In an embodiment of the inventive method the identification bit is carried in each message cell of a connection of low priority. This measure offers a low-outlay distinguishability between message cells of different priority.
In another embodiment, an identification bit identifying the connections is evaluated in the reception of a message cell. Besides the advantage that no CA 02233191 1998-03-2~
modifications to the message cells of a priority class are necessary, this measure, whereby an entry ensues in the output unit in the course of the buildup of a connection, offers the advantage that the entry is valid for all the message cells of the relevant connection.
The selection condition character in the method can be switched into an active mode or an inactive mode. This measure offers a simple possibility for exchange between an operation via only one transmission path and an operation via redundant transmission paths.
With the switchover from one lrallsmission path to another transmission path, the receipt of message cells is interrupted for a strictly prescribed time-span. This measure prevents repetitions of message cells or overload at the exit due to the switchover.
In order to prevent cell repetition, with the switchover from a transmission path the reception of message cells ensues corresponding to an algorithm with blocking windows, as described in the United States Patent No. patent application by the present applicant entitled "Redundant Transmission System That Avoids Cell Repetitions" filed simultaneously herewith (Atty. Docket No. P98,0362).
DESCRIPTION OF THE DRAWINGS
Figure 1 is a schematic illuslrdtiol ~ of a switching arrangement which switches through message cells via redundant transmission paths, these message cells having been routed according to an asynchronous transmission method, operable in accordance with the inventive method.
Figure 2 shows a basic arrangement of a message cell in accordance with the invention.
CA 02233191 1998-03-2~
Figure 3 illustrates a switchover process with a pause in accordance with the invention.
DESCRIPTION OF THE PREFERRED EMBODIMENTS
The switching arrangement depicted in Figure 1 includes an input unit LICI (for:
Line Interface Circuit Input) at the input side, to which message cells are supplied in the course of a virtual connection, these message cells having been transmitted according to an asynchronous transmission method - particularly the ATM (Asynchronous Transfer Mode) method. 8192 virtual connections could be established, for example.
A message cell depicted in Figure 2 has a fixed length and is formed with a useful data portion DATA and a message cell header HEAD placed before this data portion. The useful data portion may be 48 bytes in length, and the message cell head may be 5 bytes in length. The message cell head contains a target information VPI
(Virtual Path Identifier)NCI (Virtual Channel Identifier) which identifies the message cell as belonging to a virtual connection and which identifies the receiver. With the arrival of a message cell in the input unit LICI, the target information of the message cell is delivered to a conversion unit HTT (for: Header Translation Table), which effects an addition of switch-through information ROUT (for: routing) to the message cell according to the target information. The switch-through information indicates the exit (output line) of the switching arrangement to which the message cells are to be switched through via a coupling field slice ASN (for: Asynchronous Switching Network).
To meet a prescribed loss probability of 10-'', for example, a parallel switch-through via redundant coupling field slices can be necessary. The switching arrangement has two redundant coupling field slices ASN0, ASN1, which form redundant transmission paths.
CA 02233191 1998-03-2~
Duplication of the message cells ensues in the input unit LICI corresponding to the number of coupling field slices -- a doubling in the exemplary embodiment -- per group of message cells with the same contents. A message cell has a series number which is assigned in a cyclically progressing manner for consecutive message cells belonging to a virtual connection. The individually distinguishable series numbers of a virtual connection define a message cell sequence cycle. The message cells of a group have the same series number. One message cell from a group of message cells is switched through to the relevant exit via the redundant coupling field slices.
The redundant coupling field slices include respective stalislical multiplexer units SMU0, SMU1 (for: Statistical Multiplexer Unit). With the aid of large buffer memories organized as connection-specific FIFO memories, a statistical multiplexer unit should so form the traffc of NRT (for: non-real-time) connections without a real-time requirement, such that the output line is optimally loaded, i.e. to nearly 100 %. The connections without a real-time requirement, are for traffic of lower priority, as compared to traffc of RT (for: real time) connections with real-time requirements. A
rejection of message cells is permissible in the NRT connections without real-time requirements, such as connections of an undefined message cell rate (what is known as UBR (Undefined Bit Rate connections)) -- or connections with a message cell rate which is readily available (known as ABR (for: Available Bit Rate) connections) for example.
The statistical coupling multiplexer units of the coupling field slices do not operate in a synchronous fashion independently of each other. Particularly when overload is arising, message cells of different connections without real time are rejected ~;
CA 02233191 1998-03-2~
in the employment of conventional techniques such as Early Packet Discard EPD or Partial Packet Discharge (PPD) in the coupling field slices, this rejection producing message currents with different contents.
The message cells delivered by the redundant coupling field slices are received by an output unit LICO (for: Line Interface Circuit Output). The received message cells are checked in the output unit LICO for errors. This can occur by checking parity bits.
Message cells determined to be erroneous are rejected. The output unit LICO includes a selection stage RPC (for: Redundant Path Combination) which selects only one message cell from a group of message cells received as error-free and further processes this message cell. The further processing may occur by a routing via an RPC buffer and a line to a remotely disposed means.
The sequence of the message cells for a virtual connection must be maintained in the routing of message cells according to the ATM transmission method.
The selection stage RPC includes a memory, such as a random access memory RAM having a memory line (or row) for each connection VC1, VC2,..., Vcn. A space (not shown in Figure 1 ) is reserved in the memory line for storing the series number of the message cell last routed for the relevant; virtual connection. A memory space A for each connection is further reserved in the memory line, this space designating the trans",ission path over which the message cell of the relevant connection last selected for routing was transmitted.
It is checked in the selection stage RPC whether an incoming message cell is the one which is to be routed for the relevant virtual connection immediately following the last - routed (most recently routed) message cell. To this end, a recombination CA 02233191 1998-03-2~
algorithm evaluates the series number stored in the memory line for the relevant virtual connection as well as the contents of the memory space A. The determination of the message cell immediately following can ensue by incrementation of the stored series number of the last-routed message cell and a comparison of the incremented series number with the series number of a message cell just switched through. The determination of the message cell immediately following thus is accomplished by an easily performed comparison of the series numbers.
In general, the message cell arriving first in the output unit LICO (i.e., in the selection stage RPC therein) is routed to a group of message cells. A message cell arriving in the selection stage RPC later than a message cell of the same group that was previously selected for routing is rejected. European Applications 0 384 936, 0 453 606 (corresponding to United States Patent No. 5,222,063) and 0 453 607 (corresponding to United States Patent No. 5,200,950), for example, teach particular recombination algorithms for determining the respective message cell to be routed next for a virtual connection.
In addition, a determination of the error rate of a transmission path can ensue through progressive evaluation of the contents of the memory space A with the aid of a sorted algorithm, for example.
If the recombination algorithm for the recombination of RT connections with real-time requirements is used as well for NRT connections with non-real-time requirements, the message cells on a transmission path rejected for reasons of overload are replaced by redundant mess~ge cells transmitted on another transmission path, which leads to CA 02233191 1998-03-2~
a load of greater than 100 percent and thus to an overflow of the RPC buffer at the exit of the output unit LICO.
In accordance with the invention the NRT connections without real-time requirements and the RT connections with real-time requirements are distinguishable by identification characters. As shown in Figure 2, this can ensue by means of an identification character CSP (for: Conditional Single Plane) carried in the switch-through information ROUT of the message cell for NRT connections without real-time requirements, for example. In the exemplary embodiment an identification character ICSP (for: local Conditional Single Plane) is set in the memory line for NRT connections without real-time requirements. The entries in a memory line of the output unit LICO
for a connection may ensue simultaneously with the entries in the input unit LICI in the course of the buildup of the connection~ (The entries for a connection are erased with the dismantling of this connection.) The connections for which the identification character is set in an active condition, e.g. the logic HIGH condition, form a class. A global selection identification character rCSP (for: regional Conditional Single Plane) designates exactly one transmission path. The global selection identification character rCSP defines the transmission path by which message cells of the connection belonging to the class are received for further processing.
Upon the arrival of a message cell, the recombination algorithm first checks whether an identification character ICSP is set for the appertaining connection. If an active identification character ICSP is set, then the contents of the memory space A are of no importance and the recombination algorithm further checks whether the message g . CA 02233191 1998-03-2~
cell was transmitted on the transmission path designated by the global selection identification character rCSP. A message cell which was transmitted on the transmission path designated by the global selection identification character rCSP is received for further processing. A message cell which was not transmitted on the transmission path designated by the global selection identification character rCSP is rejected.
In the method according to the invention, the message cells of connections which are allocated to a class are only received for further processing if they are transmitted by a transmission path just designated. The method according to the invention realizes a connection-dependent transmission via a single transmission path in a transmission system with redundant transmission paths, i.e. a single-path transmission. By setting and resetting a global activation character rCSPEN (for:
regional Conditional Single Plane Enable), the single-path transmission can be switched into an active mode or into an inactive mode.
If the global selection identification character rCSP is switched over to designate of another transmission path, then message cells of connections allocated to the class are received exclusively by transmission paths with the current designation. In the method according to the invention, a switchover of the global selection identification character rCSP, which can be performed in one step, effects a switchover from one transmission path to another transmission path for all the connections belonging to the class. A switchover of the global selection identification character rCSP can ensue through the board controller PCP with a register con""and. A switchover of the global selection identification character rCSP can ensue as a reaction to reaching a prescribed CA 02233191 1998-03-2~
error rate or to reaching a determination of a failure of the transmission path just switched into the active mode.
With the switchover from one transmission path to another transmission path a global pause identification character rCSPPause (for: regional Conditional Single Plane Pause) may be simultaneously set. The pause identification character, which is cleared after the expiration of a strictly prescribed time-span t pause~ effects the rejection of all the message cells of the connections belonging to the class for as long as this pause identification character remains set. Thus, multiplications or repetitions of message cells due to the switchover are prevented. The strictly prescribed time-span tpauSe may be equally as long as the maximum expected difference between the transit times of the transmission paths, or as long as the duration of a message cell sequence cycle.
Figure 3 shows the basic flow of the message cell streams in a switchover from the transmission path ASNO to the transmission path ASN1 with a pause of strictly prescribed time-span t pause~ The original message cell stream transmitted by the transmission path ASNO is routed at the lower margin of Figure 3 with a determination for further processing. A pause of the time-span t pause follows this message cell stream with the beginning of the switchover, during which pause message cells cannot be routed. Following the expiration of the prescribed time-span the message cell stream transmitted via the transmission path ASN1 is routed. The loss of message cells occurring during the prescribed time-span t pause iS permissible for NRT connections without real-time requirements.
Alternatively to the blocking of the interconnection with the use of the pause character, a repetition of previously transmitted cells following switchover of the CA 02233191 1998-03-2~
transmission path can ensue by the application of the algorithm with blocking windows as described in the aforementioned United States patent application of the present applicant filed simultaneously herewith.
For easier and clearer demonstrability, the subject matter of the invention has been described above only for two transmission paths, but the inventive method can be employed for transmission systems with a larger number of transmission paths.
Although modifications and changes may be suggested by those skilled in the art, it is the intention of the inventor to embody within the patent warranted hereon all changes and modifications as reasonably and properly come within the scope of his contribution to the art.
TITLE
"METHOD FOR THE RECEPTION OF MESSAGE CELLS FROM LOW-PRIORITY
CONNECTIONS FROM ONLY ONE OF A NUMBER OF REDUNDANT
TRANSMISSION PATltS"
BACKGROUND OF THE INVENTION
Field of the Invention The present invention is directed to a method for routing message cells from connections having respectively different priorities particularly in the reception of message cells from low-priority connections, such as non-real time (NRT) traffic, of the type wherein redundant message cells are respectively transmitted via redundant transmission paths, and only one of the received redundant message cells is selected for further processing.
Description of the Prior Art In ATM (Asynchronous Transfer Mode) transmission, the sequence of message cells belonging to a virtual connection should be maintained. In order to meet a prescribed loss probability, parallel routing or forwarding, via through-connections along redundant transmission paths may be necessary. Among the redundantly transmitted message cells, only one message cell is selected at the reception location as the next message expected in the sequence. To designate the sequence, each message cell carries a series number, allocated to it in a cyclically progressing fashion in a field for the series number. The individually distinguishable series numbers of a virtual connection define a message cell sequence cycle.
The redundant tra~-sn,ission paths can each include a statistical multiplexer unit which is intended to form the traffic of low-priority connections during the activity of CA 02233191 1998-03-2~
large buffer memories in such a way that the total traffic loads the output line optimally, i.e. to nearly 100 percent.
The statistical multiplexer units of the coupling field slices operate independently of each other, so that message cell streams with different contents can arise.
If a simple recombination algorithm is applied at the receiving location at the end of the redundant transmission paths, then the message cells which were rejected on one transr"ission path for reasons of overload are replaced by redundant message cells transmitted on another transmission path, which leads to a load of greater than 100%
and thus to an overflow of the RPC buffer at the exit of the output unit.
A selection identification character could be entered In the receiving unit for the connections of lower priority, this selection identification character determining the transmission path by which message cells of the relevant connection are exclusively received for further processing. Given the failure of a transmission path, the board controller would have to rewrite all the affected entries which would last several seconds, given up to 8192 connections, and which would have to be followed by a message cell sequence cycle in order to avoid an undesired mixing of the message cell streams of the low-priority connections of the transmission paths participating in the switchover. During such a cycle the transmission paths participating in the switchover do not receive any message cells for further processing.
SUMMARY OF THE INVENTION
It is an object of the present invention to provide a method for a transmission system in which message cells transmitted redundantly via redundant transmission paths are rejected independently of each other on the transmission paths. It is a further CA 02233191 1998-03-2~
object to provide such a method wherein a switchover from reception of only a first transmission path to reception of only a second transmission path takes place with a considerably reduced time requirement.
The above object is achieved in accordance with the principles of the present invention in a method for routing message cells received from connections having different priority via redundant transmission paths, wherein redundant message cells are respectively transmitted via redundant transmission paths with only one of the received redundant message cells being selected for further processing, wherein connections having low ranking priority are assigned an identification bit, with a number of such connections designated by the same identification bit forming a class, and wherein the identification bit is evaluated upon reception of a message cell, and the message cell contains a selection condition character which defines the transmission path by which the message cells belonging to the class are accepted for further processing.
Besides a simplification of the switchover, the method according to the invention offers a considerable abbreviation of the time requirement for the switchover which correspondingly lowers the loss of message cells due to the switchover, because for a number of connections, only the selection identification character has to be changed.
In an embodiment of the inventive method the identification bit is carried in each message cell of a connection of low priority. This measure offers a low-outlay distinguishability between message cells of different priority.
In another embodiment, an identification bit identifying the connections is evaluated in the reception of a message cell. Besides the advantage that no CA 02233191 1998-03-2~
modifications to the message cells of a priority class are necessary, this measure, whereby an entry ensues in the output unit in the course of the buildup of a connection, offers the advantage that the entry is valid for all the message cells of the relevant connection.
The selection condition character in the method can be switched into an active mode or an inactive mode. This measure offers a simple possibility for exchange between an operation via only one transmission path and an operation via redundant transmission paths.
With the switchover from one lrallsmission path to another transmission path, the receipt of message cells is interrupted for a strictly prescribed time-span. This measure prevents repetitions of message cells or overload at the exit due to the switchover.
In order to prevent cell repetition, with the switchover from a transmission path the reception of message cells ensues corresponding to an algorithm with blocking windows, as described in the United States Patent No. patent application by the present applicant entitled "Redundant Transmission System That Avoids Cell Repetitions" filed simultaneously herewith (Atty. Docket No. P98,0362).
DESCRIPTION OF THE DRAWINGS
Figure 1 is a schematic illuslrdtiol ~ of a switching arrangement which switches through message cells via redundant transmission paths, these message cells having been routed according to an asynchronous transmission method, operable in accordance with the inventive method.
Figure 2 shows a basic arrangement of a message cell in accordance with the invention.
CA 02233191 1998-03-2~
Figure 3 illustrates a switchover process with a pause in accordance with the invention.
DESCRIPTION OF THE PREFERRED EMBODIMENTS
The switching arrangement depicted in Figure 1 includes an input unit LICI (for:
Line Interface Circuit Input) at the input side, to which message cells are supplied in the course of a virtual connection, these message cells having been transmitted according to an asynchronous transmission method - particularly the ATM (Asynchronous Transfer Mode) method. 8192 virtual connections could be established, for example.
A message cell depicted in Figure 2 has a fixed length and is formed with a useful data portion DATA and a message cell header HEAD placed before this data portion. The useful data portion may be 48 bytes in length, and the message cell head may be 5 bytes in length. The message cell head contains a target information VPI
(Virtual Path Identifier)NCI (Virtual Channel Identifier) which identifies the message cell as belonging to a virtual connection and which identifies the receiver. With the arrival of a message cell in the input unit LICI, the target information of the message cell is delivered to a conversion unit HTT (for: Header Translation Table), which effects an addition of switch-through information ROUT (for: routing) to the message cell according to the target information. The switch-through information indicates the exit (output line) of the switching arrangement to which the message cells are to be switched through via a coupling field slice ASN (for: Asynchronous Switching Network).
To meet a prescribed loss probability of 10-'', for example, a parallel switch-through via redundant coupling field slices can be necessary. The switching arrangement has two redundant coupling field slices ASN0, ASN1, which form redundant transmission paths.
CA 02233191 1998-03-2~
Duplication of the message cells ensues in the input unit LICI corresponding to the number of coupling field slices -- a doubling in the exemplary embodiment -- per group of message cells with the same contents. A message cell has a series number which is assigned in a cyclically progressing manner for consecutive message cells belonging to a virtual connection. The individually distinguishable series numbers of a virtual connection define a message cell sequence cycle. The message cells of a group have the same series number. One message cell from a group of message cells is switched through to the relevant exit via the redundant coupling field slices.
The redundant coupling field slices include respective stalislical multiplexer units SMU0, SMU1 (for: Statistical Multiplexer Unit). With the aid of large buffer memories organized as connection-specific FIFO memories, a statistical multiplexer unit should so form the traffc of NRT (for: non-real-time) connections without a real-time requirement, such that the output line is optimally loaded, i.e. to nearly 100 %. The connections without a real-time requirement, are for traffic of lower priority, as compared to traffc of RT (for: real time) connections with real-time requirements. A
rejection of message cells is permissible in the NRT connections without real-time requirements, such as connections of an undefined message cell rate (what is known as UBR (Undefined Bit Rate connections)) -- or connections with a message cell rate which is readily available (known as ABR (for: Available Bit Rate) connections) for example.
The statistical coupling multiplexer units of the coupling field slices do not operate in a synchronous fashion independently of each other. Particularly when overload is arising, message cells of different connections without real time are rejected ~;
CA 02233191 1998-03-2~
in the employment of conventional techniques such as Early Packet Discard EPD or Partial Packet Discharge (PPD) in the coupling field slices, this rejection producing message currents with different contents.
The message cells delivered by the redundant coupling field slices are received by an output unit LICO (for: Line Interface Circuit Output). The received message cells are checked in the output unit LICO for errors. This can occur by checking parity bits.
Message cells determined to be erroneous are rejected. The output unit LICO includes a selection stage RPC (for: Redundant Path Combination) which selects only one message cell from a group of message cells received as error-free and further processes this message cell. The further processing may occur by a routing via an RPC buffer and a line to a remotely disposed means.
The sequence of the message cells for a virtual connection must be maintained in the routing of message cells according to the ATM transmission method.
The selection stage RPC includes a memory, such as a random access memory RAM having a memory line (or row) for each connection VC1, VC2,..., Vcn. A space (not shown in Figure 1 ) is reserved in the memory line for storing the series number of the message cell last routed for the relevant; virtual connection. A memory space A for each connection is further reserved in the memory line, this space designating the trans",ission path over which the message cell of the relevant connection last selected for routing was transmitted.
It is checked in the selection stage RPC whether an incoming message cell is the one which is to be routed for the relevant virtual connection immediately following the last - routed (most recently routed) message cell. To this end, a recombination CA 02233191 1998-03-2~
algorithm evaluates the series number stored in the memory line for the relevant virtual connection as well as the contents of the memory space A. The determination of the message cell immediately following can ensue by incrementation of the stored series number of the last-routed message cell and a comparison of the incremented series number with the series number of a message cell just switched through. The determination of the message cell immediately following thus is accomplished by an easily performed comparison of the series numbers.
In general, the message cell arriving first in the output unit LICO (i.e., in the selection stage RPC therein) is routed to a group of message cells. A message cell arriving in the selection stage RPC later than a message cell of the same group that was previously selected for routing is rejected. European Applications 0 384 936, 0 453 606 (corresponding to United States Patent No. 5,222,063) and 0 453 607 (corresponding to United States Patent No. 5,200,950), for example, teach particular recombination algorithms for determining the respective message cell to be routed next for a virtual connection.
In addition, a determination of the error rate of a transmission path can ensue through progressive evaluation of the contents of the memory space A with the aid of a sorted algorithm, for example.
If the recombination algorithm for the recombination of RT connections with real-time requirements is used as well for NRT connections with non-real-time requirements, the message cells on a transmission path rejected for reasons of overload are replaced by redundant mess~ge cells transmitted on another transmission path, which leads to CA 02233191 1998-03-2~
a load of greater than 100 percent and thus to an overflow of the RPC buffer at the exit of the output unit LICO.
In accordance with the invention the NRT connections without real-time requirements and the RT connections with real-time requirements are distinguishable by identification characters. As shown in Figure 2, this can ensue by means of an identification character CSP (for: Conditional Single Plane) carried in the switch-through information ROUT of the message cell for NRT connections without real-time requirements, for example. In the exemplary embodiment an identification character ICSP (for: local Conditional Single Plane) is set in the memory line for NRT connections without real-time requirements. The entries in a memory line of the output unit LICO
for a connection may ensue simultaneously with the entries in the input unit LICI in the course of the buildup of the connection~ (The entries for a connection are erased with the dismantling of this connection.) The connections for which the identification character is set in an active condition, e.g. the logic HIGH condition, form a class. A global selection identification character rCSP (for: regional Conditional Single Plane) designates exactly one transmission path. The global selection identification character rCSP defines the transmission path by which message cells of the connection belonging to the class are received for further processing.
Upon the arrival of a message cell, the recombination algorithm first checks whether an identification character ICSP is set for the appertaining connection. If an active identification character ICSP is set, then the contents of the memory space A are of no importance and the recombination algorithm further checks whether the message g . CA 02233191 1998-03-2~
cell was transmitted on the transmission path designated by the global selection identification character rCSP. A message cell which was transmitted on the transmission path designated by the global selection identification character rCSP is received for further processing. A message cell which was not transmitted on the transmission path designated by the global selection identification character rCSP is rejected.
In the method according to the invention, the message cells of connections which are allocated to a class are only received for further processing if they are transmitted by a transmission path just designated. The method according to the invention realizes a connection-dependent transmission via a single transmission path in a transmission system with redundant transmission paths, i.e. a single-path transmission. By setting and resetting a global activation character rCSPEN (for:
regional Conditional Single Plane Enable), the single-path transmission can be switched into an active mode or into an inactive mode.
If the global selection identification character rCSP is switched over to designate of another transmission path, then message cells of connections allocated to the class are received exclusively by transmission paths with the current designation. In the method according to the invention, a switchover of the global selection identification character rCSP, which can be performed in one step, effects a switchover from one transmission path to another transmission path for all the connections belonging to the class. A switchover of the global selection identification character rCSP can ensue through the board controller PCP with a register con""and. A switchover of the global selection identification character rCSP can ensue as a reaction to reaching a prescribed CA 02233191 1998-03-2~
error rate or to reaching a determination of a failure of the transmission path just switched into the active mode.
With the switchover from one transmission path to another transmission path a global pause identification character rCSPPause (for: regional Conditional Single Plane Pause) may be simultaneously set. The pause identification character, which is cleared after the expiration of a strictly prescribed time-span t pause~ effects the rejection of all the message cells of the connections belonging to the class for as long as this pause identification character remains set. Thus, multiplications or repetitions of message cells due to the switchover are prevented. The strictly prescribed time-span tpauSe may be equally as long as the maximum expected difference between the transit times of the transmission paths, or as long as the duration of a message cell sequence cycle.
Figure 3 shows the basic flow of the message cell streams in a switchover from the transmission path ASNO to the transmission path ASN1 with a pause of strictly prescribed time-span t pause~ The original message cell stream transmitted by the transmission path ASNO is routed at the lower margin of Figure 3 with a determination for further processing. A pause of the time-span t pause follows this message cell stream with the beginning of the switchover, during which pause message cells cannot be routed. Following the expiration of the prescribed time-span the message cell stream transmitted via the transmission path ASN1 is routed. The loss of message cells occurring during the prescribed time-span t pause iS permissible for NRT connections without real-time requirements.
Alternatively to the blocking of the interconnection with the use of the pause character, a repetition of previously transmitted cells following switchover of the CA 02233191 1998-03-2~
transmission path can ensue by the application of the algorithm with blocking windows as described in the aforementioned United States patent application of the present applicant filed simultaneously herewith.
For easier and clearer demonstrability, the subject matter of the invention has been described above only for two transmission paths, but the inventive method can be employed for transmission systems with a larger number of transmission paths.
Although modifications and changes may be suggested by those skilled in the art, it is the intention of the inventor to embody within the patent warranted hereon all changes and modifications as reasonably and properly come within the scope of his contribution to the art.
Claims (7)
1. A method for routing message cells from connections of different priority via redundant transmission paths, comprising the steps of:
transmitting redundant message cells respective via redundant transmission paths, resulting in a plurality of received redundant message cells;
selecting only one of the received redundant message cells for further processing;
assigning an identification bit to each connection having a low ranking priority and defining a class of connections respectively designated by the same identification bit;
during reception of a message cell, evaluating said identification bit; and providing each message cell with a selection condition character defining the transmission path by which message cells received on connections in said class are accepted for further processing.
transmitting redundant message cells respective via redundant transmission paths, resulting in a plurality of received redundant message cells;
selecting only one of the received redundant message cells for further processing;
assigning an identification bit to each connection having a low ranking priority and defining a class of connections respectively designated by the same identification bit;
during reception of a message cell, evaluating said identification bit; and providing each message cell with a selection condition character defining the transmission path by which message cells received on connections in said class are accepted for further processing.
2. A method as claimed in claim 1 comprising the additional step of carrying said identification bit in each message cell in a connection having said low ranking priority.
3. A method as claimed in claim 1 wherein the step of evaluating said identification bit comprises evaluating said identification bit immediately upon receipt of a message cell.
4. A method as claimed in claim 1 comprising the additional step of switching said selection condition character into an active mode or into an inactive mode.
5. A method as claimed in claim 1 comprising the additional step of:
when switching from one transmission path to another transmission path, interrupting acceptance of message cells at a reception location for a predetermined time span.
when switching from one transmission path to another transmission path, interrupting acceptance of message cells at a reception location for a predetermined time span.
6. A method as claimed in claim 1 comprising the additional step of:
when switching from one transmission path to another transmission path, preventing repetition of cells already designated for routing by employing a blocking window.
when switching from one transmission path to another transmission path, preventing repetition of cells already designated for routing by employing a blocking window.
7. A method as claimed in claim 6 comprising the additional step of forming a random combination with said blocking window causing cells for high priority connections to be conducted via redundant transmission paths a plurality of times, with only one copy of each cell being routed.
Applications Claiming Priority (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| DE19713062 | 1997-03-27 | ||
| DE19713062.3 | 1997-03-27 |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CA2233191A1 true CA2233191A1 (en) | 1998-09-27 |
Family
ID=7824904
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CA002233191A Abandoned CA2233191A1 (en) | 1997-03-27 | 1998-03-25 | Method for the reception of message cells from low-priority connections from only one of a number of redundant transmission paths |
Country Status (3)
| Country | Link |
|---|---|
| US (1) | US6304569B1 (en) |
| EP (1) | EP0868103A3 (en) |
| CA (1) | CA2233191A1 (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110015252A (en) * | 2019-04-16 | 2019-07-16 | 无锡商业职业技术学院 | A kind of automobile storage battery replacement device for preventing power failure and its method |
Families Citing this family (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| DE19921589C2 (en) * | 1999-05-05 | 2002-10-24 | Siemens Ag | Method for operating a data transmission system |
| US7099327B1 (en) * | 2000-10-12 | 2006-08-29 | Lucent Technologies Inc. | Data communications networks with high performance and reliability |
| US20060013210A1 (en) * | 2004-06-18 | 2006-01-19 | Bordogna Mark A | Method and apparatus for per-service fault protection and restoration in a packet network |
| US9826039B2 (en) | 2014-02-04 | 2017-11-21 | Honeywell International Inc. | Configurable communication systems and methods for communication |
| CN110086728B (en) * | 2018-01-26 | 2021-01-29 | 华为技术有限公司 | Method for sending message, first network equipment and computer readable storage medium |
Family Cites Families (18)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| GB8724208D0 (en) | 1987-10-15 | 1987-11-18 | Newman P | Self-routing switching element |
| ATE107452T1 (en) | 1989-03-03 | 1994-07-15 | Siemens Ag | METHOD AND CIRCUIT ARRANGEMENT FOR FORWARDING MESSAGE PACKETS TRANSMITTED ON SUPPLY CIRCUITS VIA A PACKET SWITCH. |
| ATE111277T1 (en) | 1990-04-27 | 1994-09-15 | Siemens Ag | METHOD AND CIRCUIT ARRANGEMENT FOR REDUCING THE LOSS OF MESSAGE PACKETS TRANSMITTED VIA A PACKET SWITCH. |
| DE59007070D1 (en) | 1990-04-27 | 1994-10-13 | Siemens Ag | Method and circuit arrangement for reducing the loss of message packets which are transmitted via a packet switching device. |
| US5740157A (en) * | 1992-05-21 | 1998-04-14 | Alcatel Network Systems, Inc. | Distributed control methodology and mechanism for implementing automatic protection switching |
| DE59209931D1 (en) * | 1992-06-26 | 2001-12-20 | Siemens Ag | Method for handling the information contained in the header of message cells transmitted in the asynchronous transfer mode |
| SE516073C2 (en) * | 1993-02-15 | 2001-11-12 | Ericsson Telefon Ab L M | Methods for handling redundant selector planes in packet switches and packet switches for execution of the method |
| SE515421C2 (en) * | 1993-02-15 | 2001-07-30 | Ericsson Telefon Ab L M | Methods for handling redundant selector plan in package selector and selector for execution of the method |
| JP3249648B2 (en) * | 1993-07-19 | 2002-01-21 | 富士通株式会社 | ATM switch and test method thereof |
| DE4331579C2 (en) * | 1993-09-16 | 1995-07-06 | Siemens Ag | Method for transmitting message cells over redundant virtual path pairs of an ATM communication network |
| FI95637C (en) * | 1994-02-28 | 1996-02-26 | Nokia Telecommunications Oy | Procedure for route switching on a packet data connection |
| ES2137296T3 (en) * | 1994-09-28 | 1999-12-16 | Siemens Ag | ATM COMMUNICATION SYSTEM FOR STATISTICAL CELL MULTIPLEXION. |
| US6067286A (en) * | 1995-04-11 | 2000-05-23 | General Datacomm, Inc. | Data network switch with fault tolerance |
| AU6501496A (en) * | 1995-07-19 | 1997-02-18 | Ascom Nexion Inc. | Point-to-multipoint transmission using subqueues |
| SE9600388L (en) * | 1996-02-02 | 1997-08-03 | Ericsson Telefon Ab L M | Gear |
| US5959995A (en) * | 1996-02-22 | 1999-09-28 | Fujitsu, Ltd. | Asynchronous packet switching |
| US6052373A (en) * | 1996-10-07 | 2000-04-18 | Lau; Peter S. Y. | Fault tolerant multicast ATM switch fabric, scalable speed and port expansion configurations |
| US6011780A (en) * | 1997-05-23 | 2000-01-04 | Stevens Institute Of Technology | Transparant non-disruptable ATM network |
-
1998
- 1998-03-04 EP EP98103826A patent/EP0868103A3/en not_active Withdrawn
- 1998-03-25 CA CA002233191A patent/CA2233191A1/en not_active Abandoned
- 1998-03-27 US US09/049,709 patent/US6304569B1/en not_active Expired - Fee Related
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110015252A (en) * | 2019-04-16 | 2019-07-16 | 无锡商业职业技术学院 | A kind of automobile storage battery replacement device for preventing power failure and its method |
| CN110015252B (en) * | 2019-04-16 | 2024-01-30 | 无锡商业职业技术学院 | Device and method for replacing and preventing power failure of automobile storage battery |
Also Published As
| Publication number | Publication date |
|---|---|
| EP0868103A3 (en) | 2002-10-16 |
| US6304569B1 (en) | 2001-10-16 |
| EP0868103A2 (en) | 1998-09-30 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US5373504A (en) | Apparatus and a method for setting a communication path | |
| US5757770A (en) | Method and device for the control of congestion in sporadic exchanges of data packets in a digital transmission network | |
| US6295295B1 (en) | Scheduler for an information packet switch | |
| US5745489A (en) | Buffered crosspoint matrix for an asynchronous transfer mode switch and method of operation | |
| US5485453A (en) | Method for handling redundant switching planes in packet switches and a packet switch for carrying out the method | |
| US5761191A (en) | Statistics collection for ATM networks | |
| USRE41970E1 (en) | Method for the control of flows within an ATM switch with distributed architecture | |
| US5295135A (en) | Arrangement for monitoring the bit rate in ATM networks | |
| KR0161613B1 (en) | Atm interface and shaping method | |
| EP0512495A2 (en) | Switching node in a network with label multiplexed information | |
| JPH06335079A (en) | Cell multiplexer in atm network | |
| IL124011A (en) | Atm switch | |
| CA2235287A1 (en) | Improvements in or relating to an atm switch | |
| Chao et al. | Design of a generalized priority queue manager for ATM switches | |
| US5729530A (en) | ATM switch | |
| CA2235135A1 (en) | Improvements in or relating to an atm switch | |
| US6088359A (en) | ABR server | |
| US20020018474A1 (en) | Efficient packet transmission over ATM | |
| CA2233121C (en) | Redundant transmission system with diconnection of a transmission path exhibiting faulty transmission behavior | |
| US6304569B1 (en) | Method for the reception of message cells from low-priority connections from only one of a number of redundant transmission paths | |
| US6937607B2 (en) | Random early discard for cell-switched data switch | |
| US7218608B1 (en) | Random early detection algorithm using an indicator bit to detect congestion in a computer network | |
| EP0861534B1 (en) | Instrument for test and measurement of atm network virtual connections | |
| EP1093263B1 (en) | Method and device for cell loss detection in ATM telecommunication devices | |
| EP0817435B1 (en) | A switch for a packet communication system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| EEER | Examination request | ||
| FZDE | Discontinued |