EP0453607B1 - Méthode et dispositif pour réduire la perte de paquets d'information, transmis par un commutateur de paquets - Google Patents

Méthode et dispositif pour réduire la perte de paquets d'information, transmis par un commutateur de paquets Download PDF

Info

Publication number
EP0453607B1
EP0453607B1 EP90108055A EP90108055A EP0453607B1 EP 0453607 B1 EP0453607 B1 EP 0453607B1 EP 90108055 A EP90108055 A EP 90108055A EP 90108055 A EP90108055 A EP 90108055A EP 0453607 B1 EP0453607 B1 EP 0453607B1
Authority
EP
European Patent Office
Prior art keywords
information
transmitted
case
packet
information packets
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Expired - Lifetime
Application number
EP90108055A
Other languages
German (de)
English (en)
Other versions
EP0453607A1 (fr
Inventor
Andreas Dipl.-Phys. Foglar
Peter Dr. Dipl.-Phys. Rau
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Siemens AG
Original Assignee
Siemens AG
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Siemens AG filed Critical Siemens AG
Priority to AT90108055T priority Critical patent/ATE111278T1/de
Priority to EP90108055A priority patent/EP0453607B1/fr
Priority to DE59007070T priority patent/DE59007070D1/de
Priority to JP3119022A priority patent/JPH04229749A/ja
Priority to US07/690,360 priority patent/US5200950A/en
Priority to CA002041176A priority patent/CA2041176A1/fr
Publication of EP0453607A1 publication Critical patent/EP0453607A1/fr
Application granted granted Critical
Publication of EP0453607B1 publication Critical patent/EP0453607B1/fr
Anticipated expiration legal-status Critical
Expired - Lifetime legal-status Critical Current

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L49/00—Packet switching elements
    • H04L49/55—Prevention, detection or correction of errors
    • H04L49/552—Prevention, detection or correction of errors by ensuring the integrity of packets received through redundant connections
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L49/00—Packet switching elements
    • H04L49/30—Peripheral units, e.g. input or output ports
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L49/00—Packet switching elements
    • H04L49/55—Prevention, detection or correction of errors
    • H04L49/555—Error detection

Definitions

  • the invention relates to a method and a circuit arrangement for forwarding message packets transmitted on feeder lines in the course of virtual connections according to an asynchronous transmission method and having a packet header which designates the respective virtual connection, via a packet switching device having at least two redundant switching multiples, to customer lines connected to the latter each of the message packets transmitted on one of the feeder lines in the course of a virtual connection is formed by multiplying a message packet group with a number of identical message packets corresponding to the number of redundant switching multiples, and wherein each of the message packets of a message packet group has an identical one for successive message packet groups.
  • Groups changing changing additional identifier is added, and the message packets of a message packet group separately via the r redundant switching matrixes are transmitted in the direction of the customer line in question for the respective virtual connection, and after such a transmission via the redundant switching matrixes using the additional identifier attached to the message packets, only one of the message packets belonging to a message packet group is sent to the one in question incoming customer line is forwarded.
  • an entire message packet cycle which may include a number of 64 message packets, for example, may be lost.
  • the object of the invention is now to specify a method and a circuit arrangement of the type mentioned at the outset which reduces the possible loss of message packets.
  • the object outlined above is achieved in a method of the type mentioned at the outset according to the invention in that after the separate transmission of the message packets of a message packet group via the redundant switching multiples, the first arriving, error-free transmitted message packet of a message packet group, the message packets of which in each case correspond to the Additional identifier of the last transmitted message packet have the next following additional identifier, is forwarded to the customer line in question and / or that the switching matrix is determined in each case, via which the transmission of message packets takes place the slowest and that message packets which are the first of their respective message packet via the respective slowest switching matrix Group are transferred without errors, to the relevant customer line to be forwarded.
  • This method has the advantage that if the message packet with the additional identifier next to the message packet last transmitted is not received, the loss of a number of message packets corresponding to a message packet cycle, which may include a number of 64 message packets, for example, is not accepted must rather be forwarded from each message packet group as the first message packet transmitted without errors regardless of its additional identifier.
  • the respective slowest switching matrix for a respective virtual connection is determined by setting an average counter reading for each switching matrix provided in the packet switching device in the course of establishing a virtual connection and that the associated counter reading of the switching matrix, via which the the message packet forwarded to the relevant customer line was increased by a value which corresponds to the number of coupling multiples provided in the packet switching device, which is reduced by 1 and, in conjunction therewith, the count of the coupling multiples which did not transmit the message packet just forwarded by a value of 1 are, wherein a switching matrix whose counter reading has a respective lowest counter reading for the respective virtual connection is a respective slowest switching matrix.
  • This measure has the advantage that a respective slowest switching matrix can be determined for each virtual connection in a particularly simple manner via a large number of transmitted message packets, random fluctuations in the transmission speed of the switching matrixes being compensated for.
  • This measure has the advantage that, if the redundant transmission paths for a virtual connection fail, each error-free transmitted message packet is forwarded to the relevant customer line via the switching matrix considered to be the only one capable of transmission.
  • a circuit arrangement for performing the method of the type mentioned has a treatment device for each feeder line and an evaluation device for each customer line, such a circuit arrangement according to the invention being characterized in that the respective evaluation device forwards the message packet of a message packet group to the assigned output line , which first arrives error-free with an additional identifier that follows the additional identifier of the last transmitted message packet, and that the evaluation device determines the switching matrix over which the transmission of message packets takes place the slowest and that the evaluation device sends message packets, which are each the first of their message packet group are transmitted without errors via the slowest switching matrix.
  • This circuit arrangement for carrying out the method according to the present invention has the advantage of low circuit complexity for the forwarding of message packets via the redundantly designed packet switching device. Advantageous further developments of this circuit arrangement result from patent claims 5 and 6.
  • FIG. 1 schematically shows a packet switching system PVE to which a plurality of feeder lines E1 to En and a plurality of customer lines A1 to An are connected. Of these, only the feeder lines E1 and En and the customer lines A1 and An are shown in FIG.
  • Message packets are transmitted on the feeder lines and customer lines in the course of virtual connections using an asynchronous transfer method ("Asynchronous Transfer Mode").
  • the message packets may be packets of fixed length, each of which has a packet header with a respective virtual channel number and an information part.
  • the respective virtual channel number which is referred to as VCI, determines in accordance with the virtual connection to which relevant subscriber line Ahin the respective message packet is transmitted.
  • the actual message signals are transmitted in the information section.
  • Message signals should be understood to mean data and text signals as well as voice or image signals in digital form. It can further be provided that the message packets are each accompanied by test information which is formed from the message packet using the preceding signal status sequence.
  • a treatment device BHE is assigned to each of the feeder lines E1 to En.
  • This treatment device BHE which can be provided, for example, by a treatment device proposed in EP-A 89103798.8, adds an additional identifier, which changes for successive message packets of the respective virtual connection, to the message packets transmitted via the respective feeder line E and belonging to a virtual connection.
  • the additional identifier consists of a sequence number which is set individually for each virtual connection in the course of establishing a connection and is incremented for each successive message packet.
  • a number of, for example, 64 successive message packets can form a message packet cycle.
  • the sequence number can then preferably assume a number of states which corresponds to the number that a message packet cycle comprises message packets.
  • the treatment device BHE forms two identical message packets from the message packets supplemented by the additional identifier, which are referred to below as the message packet group, and forwards these two redundant switching matrixes KV1 and KV2 to the packet switching device PVE.
  • 1 schematically indicates using the switching matrix KV1 that the two switching matrixes KV may each have a plurality of interconnected switch modules SM. Since the structure and mode of operation of such coupling multiples KV are already known, they will not be discussed in more detail below.
  • Each of the switching matrixes KV has a plurality of output lines L11 ... L1m, L21 ... L2m.
  • An output line L1 of the switching matrix KV1 and an output line L2 of the switching matrix KV2 are each supplied to a separate evaluation device AWE.
  • These evaluation devices AWE are each connected to one of the customer lines A1 to An.
  • Such an evaluation device AWE takes over the message packets transmitted via the two switching matrixes KV and transmits them an evaluation of the additional identifier attached to each of the message packets of only one of the message packets belonging to a message packet group to the assigned customer line Aab, which will be explained in more detail below.
  • the packet switching device PVE just explained, it should also be pointed out that, according to FIG. 1, it has two redundant switching multiples.
  • the number of redundant switching matrixes can, however, also be increased correspondingly depending on the failure probability of each of the switching matrixes KV and the required values for the availability of the packet switching device PVE.
  • FIG. 2 shows a possible structure of the evaluation device AWE shown in FIG.
  • the message packets of a message packet group transmitted via the respective output lines L1, L2 first pass through interface devices designated S1 and S2.
  • the start of a message packet is identified and the received message packets are synchronized with the system clock with which the evaluation device AWE is controlled.
  • the transmitted message packets are checked for error-free transmission, and in the event that the message packets are each accompanied by check information, a check based on this check information can be added. If such an error-free transmission is present, the interface packet S1 feeds the message packet that has just been checked to an intermediate register ZR1.
  • the interface device S2 feeds the message packet that has just been checked to an intermediate register ZR2 in the event of an error-free transmission.
  • the packet header which in each case has a channel number VCI associated with the respective virtual connection and a sequence number assigned continuously by the treatment device BHE at the input of the packet switching device PVE, is additionally fed to a selection circuit AS.
  • the respective packet header is fed from the selection circuit AS to a control device MP, which can be formed, for example, with a microprocessor and which, as indicated by an interrupted arrow, is connected to a higher-level control of the packet switching device PVE (not shown).
  • the virtual channel number VCI contained in the respective packet header is fed to a memory SP and is used there for addressing a plurality of memory cells in which, among other things, the connection-specific sequence number is stored, which is set to a fixed initial value in the course of the establishment of the respective virtual connection.
  • the memory content of the respective addressed memory cells is transferred to the control device MP.
  • the control device MP it is checked whether the sequence number supplied by the selection circuit AS is the next sequence number following the message packet that was forwarded last.
  • the control device MP effects the forwarding of the respective message packet from the relevant intermediate register ZR into a buffer memory PSP using additional information W carried by the selection circuit AS with the packet header, which indicates which switching matrix KV the respective message packet was transmitted from forwarded message packets in the order in which they were written to the receiving line A connected to the respective evaluation unit AWE, thereby adapting the transmission speed prevailing within the packet switching device PVE to the lower transmission speed on the respective customer line A.
  • the individual message packets pass through a converter CONV in which the additional identifier added to the message packets in the input-side treatment facility BHE is removed.
  • the respective sequence number of the message packet currently being transmitted which is located in the control device MP, is stored in the connection-specific memory cells; the respective sequence number can be incremented, whereby the determination of the next message packet is limited to a comparison of the respective sequence numbers.
  • a message packet is the next message packet to the message packet that was forwarded last, if a comparison of the sequence number carried by the message packet just transmitted with the sequence number that was last stored in the memory SP for the respective virtual connection results in a match.
  • Message packets which are each temporarily stored in the intermediate register ZR and are not forwarded by the control device MP, are overwritten by the message packet which is respectively written next in the intermediate register ZR.
  • the sequence number corresponding to the respectively transmitted message packet which can be given, for example, by the incremented sequence number carried in the packet header of the respective message packet, is stored in the memory SP with the virtual channel number VCI as the address.
  • the information designated W, a number of counter readings Z and information designated V are stored individually in the connection SP in the connection.
  • a switching matrix KV can be determined, via which the transmission of message packets is slowest.
  • the associated meter readings Z which are each assigned to a switching matrix KV, are set to an average meter reading of the highest possible meter reading. For example, if the highest possible counter reading is 1024, the associated counter readings can be set to a counter reading 512 when a connection is established.
  • the count of the switching matrix KV, via which the relevant message packet was transmitted is increased by a value that corresponds to the number of redundant switching matrixes KV in the packet switching device PVE reduced by one, while accompanying so that the counter values of the switching matrixes KV that have not transmitted the message packet in question are decremented. If, for example, four switching matrixes KV are provided in a packet switching device PVE, the counter reading of the switching matrix KV that has transmitted the respective forwarded message packet is increased by the value 3, while the counter values of the other switching matrixes KV are each reduced by the value 1.
  • a switching matrix KV, which has the lowest counter reading is rated as the slowest switching matrix KV.
  • the message packet transmitted via the redundant switching matrixes KV is forwarded to the customer line in question with the next sequence number to the sequence number of the last transmitted message packet, which proves to be error-free when checked in the evaluation unit AWE and is the first of its message packet. Group is included in the respective evaluation unit AWE.
  • each message packet that has a sequence number that follows the message packet last transmitted and that was the first of its associated message packet group to be transmitted without errors is forwarded to the customer line A in question by the slowest switching matrix KV.
  • a failure of the associated switching matrix KV for the respective virtual connection can be assumed and measures can be taken, which can be that a fault message is initiated, or that when forwarding subsequent message packets for the virtual connection concerned to update the associated counter readings, a correspondingly reduced number of redundant switching multiples is assumed.
  • the information V is used to identify a slowest switching matrix KV. For example, a bit can be provided for each switching matrix KV, the bit set being able to identify a slowest switching matrix in each case. If only two redundant switching matrixes KV are provided in a packet switching unit PVE, one bit is sufficient for the information V, the set bit being able to identify one coupling matrix KV as the slowest coupling matrix, whereas the non-set bit is the other coupling matrix KV as the slowest coupling matrix can mark.
  • the information V is formed by evaluating the connection-specific counter readings Z.
  • the counter readings Z in the control device MP are determined by comparing the counter readings Z associated with the respective virtual connection, which has the lowest counter reading and thus a respective associated switching matrix KV identifies KV as the slowest switching matrix and sets the information V assigned to such a switching matrix KV in a corresponding manner.
  • the information V is stored in the connection-specific memory cells of the memory SP together with the counter readings Z, the information W and the sequence number corresponding to the packet which has just been forwarded saved.
  • the data associated with the respective virtual connection such as the stored sequence number, the counter readings Z, the information W and the information V, are transferred to the control device MP, a decision being made on the basis of this associated data. how the respective message packet is to be treated.

Claims (7)

1. Procédé pour retransmettre des paquets d'informations, qui sont transmis dans des lignes d'arrivée (E1...En) au cours de liaisons virtuelles selon un procédé de transmission asynchrone et possèdent une tête de paquet qui désigne la liaison virtuelle respective, par l'intermédiaire d'un dispositif de commutation de paquets (PVE), qui possède au moins deux multiples de couplage redondants (KV1, KV2), à des lignes de départ (A1...An) reliées à ce dispositif,
selon lequel, pour chacun des paquets d'informations transmis dans l'une des lignes d'arrivée au cours d'une liaison virtuelle, un groupe de paquets d'informations comportant un nombre de paquets identiques d'informations, qui correspond au nombre des multiples de couplage (KV1,KV2) redondants, est formé par multiplication,
selon lequel à chacun des paquets d'informations d'un groupe de paquets d'informations est adjointe une caractérisation identique supplémentaire, qui varie pour des groupes successifs de paquets d'informations, et les paquets d'informations d'un groupe de paquets d'informations sont transmis séparément par l'intermédiaire des multiples de couplage (KV1,KV2) redondants en direction de la ligne de départ qui entre en jeu pour la liaison virtuelle respective, et
selon lequel après une telle transmission par l'intermédiaire des multiples de couplage (KV1, KV2) redondants, sur la base de la caractérisation supplémentaire adjointe respectivement aux paquets d'informations, seul l'un des paquets d'informations, qui est associé à un groupe de paquets d'informations, est retransmis à la ligne de départ (A) en question,

caractérisé par le fait
qu'après la transmission séparée des paquets d'informations d'un groupe de paquets d'informations par l'intermédiaire des multiples de couplage (KV1, KV2) redondants, le paquet d'informations, qui arrive le premier et qui est transmis sans erreur, d'un groupe de paquets d'informations, dont les paquets d'informations possèdent respectivement la caractérisation supplémentaire qui succède immédiatement à la caractérisation supplémentaire du paquet d'informations transmis en dernier lieu, est retransmis à la ligne de départ (A) en question et/ou que respectivement le multiple de couplage, au moyen duquel la transmission d'informations s'effectue depuis le plus lentement, est déterminé et que des paquets d'informations, qui sont transmis sans erreur par l'intermédiaire de multiples de couplage respectivement le plus lent, respectivement en tant que premier de leurs groupes de paquets d'informations, sont retransmis à la ligne de départ (A) entrant en jeu.
2. Procédé suivant la revendication 1, caractérisé par le fait que le multiple de couplage respectif (KV1; KV2) le plus lent est déterminé pour une liaison virtuelle respective par le fait qu'au cours de l'établissement d'une liaison virtuelle pour chacun des multiples de couplage (KV1; KV2) prévus dans le dispositif de commutation de paquets (PVE), un état de comptage moyen est réglé et que l'état de comptage associé du multiple de couplage (KV1; KV2), au moyen duquel a été transmis le paquet d'informations précisément envoyé à la ligne d'abonné considérée (A), est accru d'une valeur qui correspond au nombre, diminué de 1, de multiples de couplage (KV1, KV2), prévus dans le dispositif de commutation de paquets (PVE), et que, par conséquent, l'état de comptage des multiples de couplage (KV1, KV2), qui n'ont pas transmis le paquet d'informations précisément retransmis, est diminué d'une valeur 1, le multiple de couplage (KV1; KV2), dont l'état de comptage possède la plus faible valeur respective pour la liaison virtuelle respective, étant un multiple de couplage respectif (KV1; KV2) extrêmement lent.
3. Procédé suivant la revendication 2, caractérisé par le fait qu'une signalisation de perturbation se produit dans le cas où un compteur atteint, pendant le déroulement d'une liaison, un état de comptage qui caractérise un multiple de couplage (KV1; KV2), qui n'a pas transmis lui-même une multiplicité de paquets d'informations retransmises.
4. Procédé suivant la revendication 2 ou 3, caractérisé par le fait que dans le cas où tous les compteurs possèdent un état de comptage allant jusqu'à l'état de comptage le plus élevé ou le plus bas, qui caractérise respectivement un multiple de couplage (KV1; KV2) au moyen duquel aucun paquet d'informations n'a été retransmis pendant un intervalle de temps assez long à la ligne de départ (A), chaque paquet d'informations transmis sans erreur, qui succède au paquet d'informations retransmis en dernier lieu, est retransmis par l'intermédiaire du multiple de couplage (KV1; KV2), qui est associé au compteur respectif.
5. Montage pour la retransmission de paquets d'informations, qui sont transmis dans des lignes d'arrivée au cours de liaisons virtuelles selon un procédé de transmission asynchrone et possèdent une tête de paquet désignant la liaison virtuelle respective, par l'intermédiaire d'un dispositif de commutation de paquets (PVE) comportant au moins deux multiples de couplage redondant (KV1, KV2), à des lignes de départ (A) reliées à ce dispositif, et dans lequel à chacune des lignes d'arrivée est associé un dispositif de traitement (BWE), qui, d'une part, adjoint respectivement une caractérisation supplémentaire qui varie pour des paquets d'informations successifs, aux paquets d'informations transmis par l'intermédiaire de la ligne d'arrivée respective, et, d'autre part, forme, à partir des paquets d'informations complètant la caractérisation supplémentaire, respectivement un groupe de paquets d'informations possédant un nombre, qui correspond au nombre des multiples de couplage (KV1, KV2) redondants, de paquets d'informations identiques qui sont envoyés aux multiples de couplage redondants (KV1, KV2), et dans lequel à chacune des lignes de départ (A) est associé un dispositif d'évaluation (AWE), qui reçoit des paquets d'informations transmis par l'intermédiaire des multiples de couplage redondants (KV1, KV2) et délivre, sur la base de la caractérisation supplémentaire respectivement adjointe aux paquets d'informations et éventuellement de la caractérisation supplémentaire disponible, qui est utilisée par le dispositif de traitement (BHE) précisément lors de la formation d'un groupe de paquets d'informations pour la liaison virtuelle respective, uniquement l'un des paquets d'informations, qui font partie d'un groupe de paquets d'informations, à la ligne de sortie associée (A),
caractérisé par le fait
que le dispositif d'évaluation respective (AWE) retransmet à la ligne de sortie associée (A) respectivement le paquet d'informations d'un groupe de paquets d'informations qui apparaît en premier avec la caractérisation supplémentaire qui succède à la caractérisation supplémentaire du paquet d'informations transmis en dernier lieu, et
que le dispositif d'évaluation (AWE) détermine respectivement le multiple de couplage (KV1; KV2), et au moyen duquel la transmission de paquets d'informations s'effectue plus lentement, et
que le dispositif d'évaluation (AWE) retransmet des paquets d'informations qui sont transmis sans erreur, respectivement en tant que premier de leurs groupes de paquets d'informations, par l'intermédiaire du multiple de couplage (KV1; KV2) respectivement le plus lent.
6. Montage suivant la revendication 5, caractérisé par le fait que dans le dispositif d'évaluation (AWE) est prévue respectivement une mémoire (SP) possédant une multiplicité de cellules de mémoire dans lesquelles est mémorisée individuellement, pour les différentes liaisons virtuelles, la caractérisation supplémentaire précisément actuelle pour l'évaluation d'un groupe de paquets d'informations, et que les cellules de mémoire peuvent être commandées respectivement par des indications, qui désignent la liaison virtuelle respective et sont contenues respectivement dans la tête des paquets d'informations, pour une préparation de la caractérisation supplémentaire mémorisée, et que lors de chaque commande d'une cellule de mémoire, la caractérisation supplémentaire mémorisée dans cette cellule est actualisée.
7. Montage suivant la revendication 6, caractérisé par le fait que dans les cellules de mémoire est mémorisée, respectivement, en plus de la caractérisation supplémentaire actuelle respective, une information, à partir de laquelle on peut déterminer un multiple de couplage respectif (KV) travaillant le plus lentement, pour la liaison virtuelle respective.
EP90108055A 1990-04-27 1990-04-27 Méthode et dispositif pour réduire la perte de paquets d'information, transmis par un commutateur de paquets Expired - Lifetime EP0453607B1 (fr)

Priority Applications (6)

Application Number Priority Date Filing Date Title
AT90108055T ATE111278T1 (de) 1990-04-27 1990-04-27 Verfahren und schaltungsanordnung zur reduzierung des verlustes von nachrichtenpaketen, die über eine paketvermittlungseinrichtung übertragen werden.
EP90108055A EP0453607B1 (fr) 1990-04-27 1990-04-27 Méthode et dispositif pour réduire la perte de paquets d'information, transmis par un commutateur de paquets
DE59007070T DE59007070D1 (de) 1990-04-27 1990-04-27 Verfahren und Schaltungsanordnung zur Reduzierung des Verlustes von Nachrichtenpaketen, die über eine Paketvermittlungseinrichtung übertragen werden.
JP3119022A JPH04229749A (ja) 1990-04-27 1991-04-24 メッセージパケットの経路選択方法および回路装置
US07/690,360 US5200950A (en) 1990-04-27 1991-04-24 Method and circuit arrangement for reducing the loss of message packets that are transmitted via a packet switching equipment
CA002041176A CA2041176A1 (fr) 1990-04-27 1991-04-25 Methode et circuit pour reduire les pertes de paquets d'information transmis via un materiel de commutation de paquets

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
EP90108055A EP0453607B1 (fr) 1990-04-27 1990-04-27 Méthode et dispositif pour réduire la perte de paquets d'information, transmis par un commutateur de paquets

Publications (2)

Publication Number Publication Date
EP0453607A1 EP0453607A1 (fr) 1991-10-30
EP0453607B1 true EP0453607B1 (fr) 1994-09-07

Family

ID=8203922

Family Applications (1)

Application Number Title Priority Date Filing Date
EP90108055A Expired - Lifetime EP0453607B1 (fr) 1990-04-27 1990-04-27 Méthode et dispositif pour réduire la perte de paquets d'information, transmis par un commutateur de paquets

Country Status (6)

Country Link
US (1) US5200950A (fr)
EP (1) EP0453607B1 (fr)
JP (1) JPH04229749A (fr)
AT (1) ATE111278T1 (fr)
CA (1) CA2041176A1 (fr)
DE (1) DE59007070D1 (fr)

Families Citing this family (29)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0512141A1 (fr) * 1991-05-07 1992-11-11 Siemens Aktiengesellschaft Procédé pour commuter un flux de données du type ATM à grand débit dans un réseau de commutation à débit faible
US6295615B1 (en) 1991-12-09 2001-09-25 Sprint Communications Company, L. P. Automatic restoration of communication channels
US5402426A (en) * 1992-04-23 1995-03-28 Siemens Aktiengesellschaft Method and arrangement for checking the observance of prescribed transmission bit rates in an ATM switching equipment
US5479608A (en) * 1992-07-17 1995-12-26 Alcatel Network Systems, Inc. Group facility protection in a digital telecommunications system
SE515421C2 (sv) * 1993-02-15 2001-07-30 Ericsson Telefon Ab L M Sätt för hantering av redundanta väljarplan i paketväljare och väljare för utförande av sättet
SE516073C2 (sv) * 1993-02-15 2001-11-12 Ericsson Telefon Ab L M Sätt för hantering av redundanta väljarplan i paketväljare och paketväljare för utförande av sättet
US5577196A (en) * 1993-04-07 1996-11-19 Sprint Communications Co. L.P. Intelligent digital signal hitless protection switch
US5506956A (en) * 1993-04-07 1996-04-09 Sprint Communications Company L.P. Error correction and channel restoration apparatus for T1 digital links
DE4331579C2 (de) * 1993-09-16 1995-07-06 Siemens Ag Verfahren zum Übertragen von Nachrichtenzellen über redundante virtuelle Pfadpaare eines ATM-Kommunikationsnetzes
FI98773C (fi) * 1994-02-28 1997-08-11 Nokia Telecommunications Oy Menetelmä liikenteen jakamiseksi ATM-tekniikalla toteutetussa tietoliikenneverkossa
US5515370A (en) * 1994-03-31 1996-05-07 Siemens Aktiengesellschaft Circuit arrangement for line units of an ATM switching equipment
US5450411A (en) * 1994-09-02 1995-09-12 At&T Global Information Solutions Company Network interface for multiplexing and demultiplexing isochronous and bursty data streams in ATM networks
US5740173A (en) * 1996-02-28 1998-04-14 Telefonaktiebolaget Lm Ericsson Asynchronous transfer mode (ATM) cell arrival monitoring system
US5781530A (en) * 1996-04-01 1998-07-14 Motorola, Inc. Redundant local area network
DE19653123C2 (de) * 1996-12-19 1998-10-29 Siemens Ag Übertragung einer langen Folgenummer in einer Nachrichtenzelle mit Platz nur für eine kurze Folgenummer
DE19713066C1 (de) * 1997-03-27 1998-10-22 Siemens Ag Verfahren zum frühzeitigen Umschalten zwischen redundanten Übertragungsstrecken
EP0868103A3 (fr) 1997-03-27 2002-10-16 Siemens Aktiengesellschaft Acceptation des connexions avec priorité inférieure, en particulier du traffic en temps non reél (NRT), seulement par des voies redondantes
DE19713049C2 (de) * 1997-03-27 1999-07-15 Siemens Ag Verfahren zur Ermittlung der Differenz der Übertragungsdauer zwischen redundanten Übertragungswegen
ATE389995T1 (de) 1997-03-27 2008-04-15 Nokia Siemens Networks Gmbh Redundantes übertragungssystem mit abschaltung einer übertragungsstrecke fehlerhaften übertragungsverhaltens
AU9011898A (en) * 1997-08-15 1999-03-08 Telefonaktiebolaget Lm Ericsson (Publ) Cell selection for atm switch having redundant switch planes
DE59911944D1 (de) * 1998-02-04 2005-05-25 Siemens Ag Verfahren zur synchronisierung von atm-zellen aufweisenden datenströmen
US7099282B1 (en) 1998-12-24 2006-08-29 Mci, Inc. Determining the effects of new types of impairments on perceived quality of a voice service
US6370120B1 (en) * 1998-12-24 2002-04-09 Mci Worldcom, Inc. Method and system for evaluating the quality of packet-switched voice signals
US7085230B2 (en) * 1998-12-24 2006-08-01 Mci, Llc Method and system for evaluating the quality of packet-switched voice signals
US6985559B2 (en) * 1998-12-24 2006-01-10 Mci, Inc. Method and apparatus for estimating quality in a telephonic voice connection
US7653002B2 (en) * 1998-12-24 2010-01-26 Verizon Business Global Llc Real time monitoring of perceived quality of packet voice transmission
US6553061B1 (en) 2001-02-08 2003-04-22 Worldcom, Inc. Method and apparatus for detecting a waveform
US7085225B2 (en) * 2001-09-27 2006-08-01 Alcatel Canada Inc. System and method for providing detection of faults and switching of fabrics in a redundant-architecture communication system
US8140980B2 (en) 2003-08-05 2012-03-20 Verizon Business Global Llc Method and system for providing conferencing services

Family Cites Families (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPS5726955A (en) * 1980-07-25 1982-02-13 Hitachi Ltd Backup control system
US4512011A (en) * 1982-11-01 1985-04-16 At&T Bell Laboratories Duplicated network arrays and control facilities for packet switching
JPS61295800A (ja) * 1985-06-24 1986-12-26 Nec Corp 遠隔局制御方式
DE3742748A1 (de) * 1987-12-17 1989-07-06 Philips Patentverwaltung Koppelfeld und koppelfeldsteuerung fuer einen vermittlungsknoten eines breitband-vermittlungssystems
JPH03104451A (ja) * 1989-09-19 1991-05-01 Fujitsu Ltd 多段リンク交換システムのルート切替え方式

Also Published As

Publication number Publication date
CA2041176A1 (fr) 1991-10-28
US5200950A (en) 1993-04-06
EP0453607A1 (fr) 1991-10-30
DE59007070D1 (de) 1994-10-13
JPH04229749A (ja) 1992-08-19
ATE111278T1 (de) 1994-09-15

Similar Documents

Publication Publication Date Title
EP0453607B1 (fr) Méthode et dispositif pour réduire la perte de paquets d'information, transmis par un commutateur de paquets
EP0384936B1 (fr) Procédé et dispositif pour transmettre des paquets d'information provenant de lignes d'entrée via un dispositif à communication de paquets
DE4331579C2 (de) Verfahren zum Übertragen von Nachrichtenzellen über redundante virtuelle Pfadpaare eines ATM-Kommunikationsnetzes
EP0584398B1 (fr) Procédé et circuit pour transmettre des cellules d'information dans un réseau ATM
EP0453606B1 (fr) Méthode et dispositif pour réduire la perte de paquets d'information, transmis par un commutateur de paquets
DE4331577C2 (de) Verfahren und Schaltungsanordnung zum Übertragen von Nachrichtenzellen über redundante virtuelle Pfadpaare eines ATM-Kommunikationsnetzes
EP0645913A2 (fr) Procédé et dispositif pour transmettre des cellules ATM sur des chemins virtuels
EP0329005B1 (fr) Procédé pour l'établissement de circuits virtuels à travers les commutateurs d'un dispositif de commutation à plusieurs étages
EP0701348A2 (fr) Système de transmission de paquets
EP0566961A2 (fr) Procédé et circuit pour faire respecter le débit de transmission préaccordé dans un dispositif de commutation ATM
EP0004307B1 (fr) Procédé pour la réalisation de connexions en conférence dans un système de commutation temporelle MIC
EP0682422A2 (fr) Méthode et dispositif pour synchroniser un train de cellules transmis avec redondance
EP0254855B1 (fr) Montage pour centraux de télécommunication à multiplexage temporel et à commande centrale, en particulier des centraux téléphoniques MIC, pourvus de groupes de lignes connectés à un champ de couplage
EP0576856A2 (fr) Procédé et circuit pour la transmission d'un flux ATM continu de bits
EP0572831B1 (fr) Méthode pour surveiller la participation et réduire les erreurs de bit pour communications commutées dans un système numérique
EP0291790A1 (fr) Circuits pour centraux de télécommunication, en particulier centraux téléphoniques MIC à multiplexage temporel, avec des étages de commutation décentralisés connectés à un réseau de commutation central
EP0163288B1 (fr) Méthode pour tester des chemins commutés d'un réseau de connexion multiplex à division dans l'espace
EP0173274B1 (fr) Méthode et montage pour la réalisation et la maintenance d'une liaison à division temporelle à large bande
DE4446248C2 (de) Übertragungssystem
EP0584387B1 (fr) Procédé et circuit pour surveiller l'agencement de cellules pendant la transmission des cellules d'information
EP0475180A1 (fr) Procédé de transmission de paquets de communication entre des lignes de raccordement existantes dans un commutateur
EP0414930B1 (fr) Procédé et agencement de circuit pour éviter le routage erroné de blocs de données transmis par des lignes d'entrée à travers un central de commutation de blocs
DE19511178C2 (de) Datenübertragungssystem mit Diagnosefunktion zur Fehlerortbestimmung
DE2522759C3 (de) Verfahren und Schaltungsanordnung zur Übertragung von digitalen Nachrichtensignalen von Signalsendern zu Signalempfängern über eine Koppeleinrichtung
EP0603424A1 (fr) Procédé et circuit pour transmettre des cellules de communication par un dispositif de communication à ATM

Legal Events

Date Code Title Description
PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

17P Request for examination filed

Effective date: 19901205

AK Designated contracting states

Kind code of ref document: A1

Designated state(s): AT BE CH DE FR GB IT LI LU NL SE

RBV Designated contracting states (corrected)

Designated state(s): AT BE CH DE FR GB IT LI NL SE

17Q First examination report despatched

Effective date: 19931025

GRAA (expected) grant

Free format text: ORIGINAL CODE: 0009210

AK Designated contracting states

Kind code of ref document: B1

Designated state(s): AT BE CH DE FR GB IT LI NL SE

REF Corresponds to:

Ref document number: 111278

Country of ref document: AT

Date of ref document: 19940915

Kind code of ref document: T

REF Corresponds to:

Ref document number: 59007070

Country of ref document: DE

Date of ref document: 19941013

ITF It: translation for a ep patent filed

Owner name: STUDIO JAUMANN

GBT Gb: translation of ep patent filed (gb section 77(6)(a)/1977)

Effective date: 19941111

ET Fr: translation filed
EAL Se: european patent in force in sweden

Ref document number: 90108055.6

PLBE No opposition filed within time limit

Free format text: ORIGINAL CODE: 0009261

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: NO OPPOSITION FILED WITHIN TIME LIMIT

26N No opposition filed
PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: GB

Payment date: 19970321

Year of fee payment: 8

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: AT

Payment date: 19970326

Year of fee payment: 8

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: BE

Payment date: 19970410

Year of fee payment: 8

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: SE

Payment date: 19970421

Year of fee payment: 8

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: FR

Payment date: 19970422

Year of fee payment: 8

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: NL

Payment date: 19970428

Year of fee payment: 8

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: DE

Payment date: 19970617

Year of fee payment: 8

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: CH

Payment date: 19970715

Year of fee payment: 8

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: GB

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 19980427

Ref country code: AT

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 19980427

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: SE

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 19980428

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: LI

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 19980430

Ref country code: FR

Free format text: THE PATENT HAS BEEN ANNULLED BY A DECISION OF A NATIONAL AUTHORITY

Effective date: 19980430

Ref country code: CH

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 19980430

Ref country code: BE

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 19980430

BERE Be: lapsed

Owner name: SIEMENS A.G.

Effective date: 19980430

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: NL

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 19981101

REG Reference to a national code

Ref country code: CH

Ref legal event code: PL

GBPC Gb: european patent ceased through non-payment of renewal fee

Effective date: 19980427

NLV4 Nl: lapsed or anulled due to non-payment of the annual fee

Effective date: 19981101

EUG Se: european patent has lapsed

Ref document number: 90108055.6

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: DE

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 19990202

REG Reference to a national code

Ref country code: FR

Ref legal event code: ST

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: IT

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES;WARNING: LAPSES OF ITALIAN PATENTS WITH EFFECTIVE DATE BEFORE 2007 MAY HAVE OCCURRED AT ANY TIME BEFORE 2007. THE CORRECT EFFECTIVE DATE MAY BE DIFFERENT FROM THE ONE RECORDED.

Effective date: 20050427