EP0914750A1 - Procede de reduction d'adresse dans des systemes de commutation en mode de transfert asynchrone (mta) - Google Patents
Procede de reduction d'adresse dans des systemes de commutation en mode de transfert asynchrone (mta)Info
- Publication number
- EP0914750A1 EP0914750A1 EP97929128A EP97929128A EP0914750A1 EP 0914750 A1 EP0914750 A1 EP 0914750A1 EP 97929128 A EP97929128 A EP 97929128A EP 97929128 A EP97929128 A EP 97929128A EP 0914750 A1 EP0914750 A1 EP 0914750A1
- Authority
- EP
- European Patent Office
- Prior art keywords
- node
- search
- vpi
- vci
- memory
- 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.)
- Withdrawn
Links
Classifications
-
- 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
- H04L49/3081—ATM peripheral units, e.g. policing, insertion or extraction
-
- 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
- H04L49/3009—Header conversion, routing tables or routing tags
-
- 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/5652—Cell construction, e.g. including header, packetisation, depacketisation, assembly, reassembly
Definitions
- the invention relates to a method according to the preamble of patent claim 1.
- ATM connections Asynchronous Transfer Mode
- information is transmitted from one transmitter to one or more receivers. This is done by packing and transmitting the information to be transmitted in ATM cells.
- the useful information is stored in the information section of the relevant ATM cell and signaling information relating to the connection is stored in the cell header preceding the information section.
- the signaling information is designed as virtual channel numbers or as virtual path numbers (VPI / VCI connection parameters).
- connection-related data In order to be able to take that connection-related data from the table, the associated memory cells must be addressed in a corresponding manner. In principle, this could be done using the VPI / VCI connection parameters. This is however not practical with 2 28 addresses. For this reason, a number of methods for address reduction have become established in the prior art.
- the 28-bit VPI / VCI address is converted into a shorter one with about 13 bits. With this address, the connection data are now addressed and taken from the relevant table.
- VPI / VCI connection parameters in shorter internal addresses ⁇ such as 13 bits
- CAM content-addressable memories
- the invention has for its object to show a way how the conversion of connection parameters of an ATM cell into internal addresses with simple means without large Effort can be carried out quickly and efficiently without impairing dynamic expandability.
- a particular advantage of the invention is that this conversion is carried out using a sequential search method in a binary search tree.
- This is done according to the invention in that the VPI / VCI connection parameters taken from the cell header of an ATM cell are fed as an input variable to a binary search tree having a plurality of nodes, starting with the uppermost node and then being compared in descending order with numerical values stored in the further nodes until equality is achieved in one of the comparison operations.
- This has the advantage that no complex memory modules, such as the content-addressable memories used in the prior art, need be used.
- a memory system which is split into a logic part and a memory part, the comparison operations being carried out in the logic part and the nodes being implemented as list entries in the memory part, and that several fields being defined in each of these list entries are updated each time a connection is established or disconnected.
- This has the advantage that the memory portion is easily expandable in terms of hardware.
- the algorithm implementing the search tree can also be easily changed in software. The easy expandability in hardware and software is given by the strict separation of logic part and memory part.
- the termination criterion is the equality of the values linked in the comparison operation. This has the advantage that the different shortest address is completely determined and can be used for addressing the memory containing the connection-related data.
- At least two search accesses to the memory portion are nested in a chronological order. This is associated with the advantage that the time gaps resulting from the accesses are optimally utilized, as a result of which a further dynamization of the method is achieved.
- changes to the list - entries are carried out by using at least two databases, one of these databases having an active operating state and the remaining database having a passive operating state, and that at defined times, both databases are each assigned to them - Reported operating status from those in the remaining database.
- FIG. 1 the method according to the invention using an abstract search strategy using a binary search tree
- FIG. 2 the implementation of the method according to the invention
- FIG. 3 nested search accesses for dynamization
- FIG. 4 the changes in the search memory.
- the method according to the invention is shown in FIG. 1 on the basis of an abstractly represented search strategy with the aid of a binary search tree.
- This is a height-balanced, binary AVL tree.
- Such trees are described in "Algorithms & Data Structures, N.Wirth".
- the search tree itself is made up of a large number of nodes, each node being connected by connecting lines, which in the sense of the graph Theories are referred to as edges with a maximum of 2 successor nodes.
- the distances between the top node and all end nodes, which are also referred to as depth, are kept small. In this way, the search time is also kept short.
- each node is assigned a numerical value, which is formed from the higher bit positions of the VPI part and the lower bit positions of the VCI part of the connection parameters VPI / VCI, which will be described in more detail later.
- the numerical values of all nodes in the left subtree of the search tree are smaller and in the right part
- the tree of the search tree is larger than that of the respective node above it.
- connection parameters VPI / VCI are taken from the cell header K and compared with the numerical value of the topmost node of the search tree. If the connection parameter value VPI / VCI taken from cell Z is greater than the numerical value entered here, a branch is made to the right to the next lower node. Otherwise it branches to the left to the next lower node. A further comparison is then made there. Depending on the result, there may be a further branching until equality is reached. It is important to note that equality can already be determined in the top node.
- the reduced address is output. This address is usually made up of 13 bit positions, which means a significant reduction compared to the 28 bit positions described above. If no equality is reached in the comparison just mentioned, this means that a cell has arrived for a connection that does not exist and the search is terminated with an acknowledgment of a corresponding message.
- search memory SP shows how the search tree is implemented in a memory system SP of the ATM switching system, hereinafter referred to as search memory SP.
- the search memory SP is now split into a logic component ASIC and a memory component RAM.
- the comparison operations are carried out in the logic part ASIC, while the connection parameter values VPI / VCI and further values to be specified are stored in the memory part RAM.
- This division has the advantage that the search algorithm is easy to configure and the hardware portion of the RAM can be expanded easily in terms of hardware.
- the entries in the RAM portion are organized in the form of a list and are made when the connection is established. When a connection is ended, these entries are deleted again. So there is an image in the RAM portion the current status of all connections existing in the ATM switching system in question.
- N entries are shown in the memory portion RAM.
- Each of these entries has a total of 8 fields.
- the first field is formed by the connection parameter value VPI and has a size of 12 bit positions (possibly up to 16 bits).
- the numerical value of the node (higher value part) is defined here.
- the next field is the connection parameter value VCI, which has 16 bit positions and defines the least significant part of the numerical value of the node. This is followed by a field P, which is only 1 bit in size and functions as an indicator as to whether or not the connection parameter value VCI should be taken into account in the comparison.
- connection parameters VPI / VCI are stored in the cell header K.
- the search memory SP with logic component ASIC and memory component RAM is shown. In the latter, the search tree shown in FIG. 1 is implemented with nodes.
- the memory S is disclosed, which contains the connection-related data in the table T. The internal processes of the method according to the invention are discussed in more detail below.
- the connection parameters VPI / VCI are taken from the cell Z arriving in the ATM switching system and compared with a numerical value which is formed from the higher value part of the connection parameter value VPI and the lower value part of the connection parameter value VCI.
- This numerical value is entered in the node of the search tree shown in FIG. 1.
- a branch is made to the list entries in question.
- the branching takes place according to the values entered in the fields LPTR or RPTR. 2 shows branches to the list entries 3 and N as examples.
- connection parameter value VPI / VCI the numerical value entered here is compared with the connection parameter value VPI / VCI or only with the connection parameter value VPI, depending on the value of the bit contained in field P.
- This uppermost node of the search tree does not necessarily have to be identical to the uppermost first entry - in the exemplary embodiment this would be the entry with the number 1 according to FIG. 2 - in the search memory SP. Rather, the search can also be carried out from any entry, but it is always started from the top node, regardless of where this node is implemented in the RAM. Depending on the result "greater”, “less” or “equal” of this comparison, the search is continued with the right or left successor node.
- This branching is implemented in the RAM portion of the memory by means of the fields LPTR and RPTR. Pointer) to other entry fields (eg 2 ... N). If equality is found, the search is terminated by issuing a "Single match" acknowledgment. Furthermore, the list address AD of the node is sent as the return value. The table entries of table T are then addressed in memory S. If the search is continued because no equality has yet been determined, the selection of the successor node continues to be made using the pointing operators of the fields RPTR, LPTR, taking into account the bits stored in the fields RV and LV. If the search process is not ended after a predetermined number of steps, it is terminated with an error message ("mismatch", ie no suitable entry found).
- FIG. 4 shows how the entries in the RAM memory portion are reorganized when the connection is established or cleared down. This is necessary because otherwise adding or removing entries in the search memory would take place at the same time.
- two databases are used, which are designated Bank1, Bank2 in FIG. 4.
- the reference symbol M the original content in the entry of the search memory SP
- the reference symbol dM the difference in the memory content.
- One of the databases e.g. B. the database Bankl, is only used for search access and should accordingly have an active operating state.
- the remaining database, the Bank2 database should only be used for changes that can be entered in the new search list and are in a passive operating state.
- the nested search accesses A, B according to FIG. 3 should begin in neighboring time slots if possible. The switchover must under no circumstances take place during a search access.
- a height-balanced, binary AVL tree was used in particular.
- the invention is not restricted to this type of search tree. Rather, the search can also be carried out using other search trees without restriction.
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
Afin d'effectuer un adressage efficace de données liées à la connexion, mises en mémoire dans un tableau d'un système de commutation MTA, l'adresse nécessaire à l'adressage doit être courte. A cet effet, les paramètres de connexion VPI/VCI (identificateur de trajet virtuel/identificateur de canal virtuel) prélevés à la tête d'une cellule MTA sont acheminés en tant que données d'entrée vers un arbre de recherche binaire présentant une pluralité de noeuds, et sont comparés en commençant par le noeud supérieur, puis par ordre décroissant, à des valeurs numériques mémorisées dans les noeuds suivants, jusqu'à ce que l'une des comparaisons donne une relation d'égalité.
Applications Claiming Priority (3)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
DE19629765 | 1996-07-23 | ||
DE19629765A DE19629765A1 (de) | 1996-07-23 | 1996-07-23 | Verfahren zur Adreßreduktion in ATM-Vermittlungssystemen |
PCT/DE1997/001274 WO1998004099A1 (fr) | 1996-07-23 | 1997-06-19 | Procede de reduction d'adresse dans des systemes de commutation en mode de transfert asynchrone (mta) |
Publications (1)
Publication Number | Publication Date |
---|---|
EP0914750A1 true EP0914750A1 (fr) | 1999-05-12 |
Family
ID=7800639
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
EP97929128A Withdrawn EP0914750A1 (fr) | 1996-07-23 | 1997-06-19 | Procede de reduction d'adresse dans des systemes de commutation en mode de transfert asynchrone (mta) |
Country Status (6)
Country | Link |
---|---|
EP (1) | EP0914750A1 (fr) |
JP (1) | JP3821854B2 (fr) |
AU (1) | AU719083B2 (fr) |
CA (1) | CA2261169A1 (fr) |
DE (1) | DE19629765A1 (fr) |
WO (1) | WO1998004099A1 (fr) |
Families Citing this family (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
DE19825541A1 (de) * | 1998-06-08 | 1999-12-09 | Bosch Gmbh Robert | Vorrichtung und Verfahren zur Abbildung von Objektadressen |
EP1189394A3 (fr) * | 2000-09-19 | 2004-01-07 | Siemens Aktiengesellschaft | Procedé et dispositif pour la reduction des adresses pour un réseau ATM ou IP |
Family Cites Families (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
WO1994001828A1 (fr) * | 1992-07-02 | 1994-01-20 | Wellfleet Communications | Procede et appareil de traitement de paquets de donnees |
US5323389A (en) * | 1992-08-14 | 1994-06-21 | Fore Systems, Inc. | ATM cell interface and method for dispatching an ATM cell |
EP0600683B1 (fr) * | 1992-12-04 | 2001-10-10 | AT&T Corp. | Interface pour un réseau de paguets |
SE515422C2 (sv) * | 1993-03-10 | 2001-07-30 | Ericsson Telefon Ab L M | Etiketthantering i paketnät |
GB9326476D0 (en) * | 1993-12-24 | 1994-02-23 | Newbridge Networks Corp | Network |
-
1996
- 1996-07-23 DE DE19629765A patent/DE19629765A1/de not_active Withdrawn
-
1997
- 1997-06-19 JP JP50643998A patent/JP3821854B2/ja not_active Expired - Fee Related
- 1997-06-19 AU AU33351/97A patent/AU719083B2/en not_active Ceased
- 1997-06-19 EP EP97929128A patent/EP0914750A1/fr not_active Withdrawn
- 1997-06-19 WO PCT/DE1997/001274 patent/WO1998004099A1/fr not_active Application Discontinuation
- 1997-06-19 CA CA002261169A patent/CA2261169A1/fr not_active Abandoned
Non-Patent Citations (1)
Title |
---|
See references of WO9804099A1 * |
Also Published As
Publication number | Publication date |
---|---|
JP3821854B2 (ja) | 2006-09-13 |
CA2261169A1 (fr) | 1998-01-29 |
JP2000514972A (ja) | 2000-11-07 |
AU719083B2 (en) | 2000-05-04 |
AU3335197A (en) | 1998-02-10 |
WO1998004099A1 (fr) | 1998-01-29 |
DE19629765A1 (de) | 1998-01-29 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
EP0384936B1 (fr) | Procédé et dispositif pour transmettre des paquets d'information provenant de lignes d'entrée via un dispositif à communication de paquets | |
EP0447841A2 (fr) | Méthode pour établir des liaisons virtuelles dans un système de commutation travaillant selon le mode de transfert asynchrone (ATM) | |
DE3214189C2 (fr) | ||
EP0453607B1 (fr) | Méthode et dispositif pour réduire la perte de paquets d'information, transmis par un commutateur de paquets | |
EP0619667A1 (fr) | Procédé d'accès à des caractéristiques d'adresse de participants à des communications avec un premier champ d'adresse lors d'un envoi de paquet de données | |
DE3044792A1 (de) | Elektronisches multiprozessor-system zur behandlung digitaler und analoger daten | |
DE2249371C2 (de) | Zeitvielfachvermittlungsanlage | |
EP0523276B1 (fr) | Procédé et circuit pour arranger des liaisons virtuelles à travers un faisceau de lignes de liaison-ATM (mode de transfert asynchrone) | |
EP0914750A1 (fr) | Procede de reduction d'adresse dans des systemes de commutation en mode de transfert asynchrone (mta) | |
DE69919118T2 (de) | Verfahren und Anordnung zur Verkehrsweglenkung von Nachrichtenpaketen mit durch numerische Ketten repräsentierten Adressen | |
EP0927476B1 (fr) | Procede servant a affecter des adresses a des ensembles de valeurs representant differents parametres | |
DE69839171T2 (de) | Vorrichtung und Verfahren zur ATM-Gruppenvermittlung mit Zugehörigen Endfunktionen im Eingang und Ausgang | |
EP0173274A2 (fr) | Méthode et montage pour la réalisation et la maintenance d'une liaison à division temporelle à large bande | |
EP1357477B1 (fr) | Dispositif connecté à un système de bus | |
EP0732828A2 (fr) | Réseau de communication optimisé en redondance pour la transmission de signaux de données | |
EP0509126B1 (fr) | Méthode de routage de messages vers des addresses de destination dans un réseau multi-niveau par des éléments de routage | |
DE19603296C2 (de) | Verfahren und Feldbussystem zur seriellen Datenübertragung in objektorientierten Anwendungen | |
DE1487637B2 (de) | Verfahren und anordnung zur wegesuche in mit schalt matrizen aufgebauten koppelfeldern | |
DE69930366T2 (de) | Schaltmatrix zwischen untergeordneten Kanälen eines Fernmeldenetzes und Verwaltungsverfahren dafür | |
DE10218645A1 (de) | An einen Bus angeschlossene Einrichtung | |
DE2848163A1 (de) | Datenspeichersystem | |
DE2530301C3 (de) | Verfahren zur Übertragung der Betriebszustandsdaten von peripheren Geräten an eine Steuereinrichtung in einer Fernmelde-, insbesondere Fernsprechvermittlungsanlage | |
EP0991226A1 (fr) | Méthode pour accéder des données dans des éléments d'un réseau | |
EP1178633A1 (fr) | Système de groupage de canaux et dispositif de commutation | |
EP1111957A2 (fr) | Noeud de réseau pour pour la commutation d'information numérique suivant differents protocoles |
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: 19990120 |
|
AK | Designated contracting states |
Kind code of ref document: A1 Designated state(s): AT BE CH DE DK ES FR GB IT LI SE |
|
17Q | First examination report despatched |
Effective date: 20070425 |
|
STAA | Information on the status of an ep patent application or granted ep patent |
Free format text: STATUS: THE APPLICATION IS DEEMED TO BE WITHDRAWN |
|
18D | Application deemed to be withdrawn |
Effective date: 20070906 |