WO1998015155A1 - Method of multi-point connection in an atm transmission system with individual connection waiting queues - Google Patents

Method of multi-point connection in an atm transmission system with individual connection waiting queues

Info

Publication number
WO1998015155A1
WO1998015155A1 PCT/DE1997/002165 DE9702165W WO9815155A1 WO 1998015155 A1 WO1998015155 A1 WO 1998015155A1 DE 9702165 W DE9702165 W DE 9702165W WO 9815155 A1 WO9815155 A1 WO 9815155A1
Authority
WO
Grant status
Application
Patent type
Prior art keywords
message
cell
connection
memory
cells
Prior art date
Application number
PCT/DE1997/002165
Other languages
German (de)
French (fr)
Inventor
Robert Stemplinger
Original Assignee
Siemens Aktiengesellschaft
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

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00Data switching networks
    • H04L12/54Store-and-forward switching systems
    • H04L12/56Packet switching systems
    • H04L12/5601Transfer mode dependent, e.g. ATM
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L49/00Packet switching elements
    • H04L49/10Switching fabric construction
    • H04L49/104ATM switching fabrics
    • H04L49/105ATM switching elements
    • H04L49/108ATM switching elements using shared central buffer
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L49/00Packet switching elements
    • H04L49/20Support for services or operations
    • H04L49/201Multicast or broadcast
    • H04L49/203ATM switching fabrics with multicast or broadcast capabilities
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04QSELECTING
    • H04Q11/00Selecting arrangements for multiplex systems
    • H04Q11/04Selecting arrangements for multiplex systems for time-division multiplexing
    • H04Q11/0428Integrated services digital network, i.e. systems for transmission of different types of digitised signals, e.g. speech, data, telecentral, television signals
    • H04Q11/0478Provisions for broadband connections
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00Data switching networks
    • H04L12/54Store-and-forward switching systems
    • H04L12/56Packet switching systems
    • H04L12/5601Transfer mode dependent, e.g. ATM
    • H04L2012/5678Traffic aspects, e.g. arbitration, load balancing, smoothing, buffer management
    • H04L2012/5679Arbitration or scheduling
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00Data switching networks
    • H04L12/54Store-and-forward switching systems
    • H04L12/56Packet switching systems
    • H04L12/5601Transfer mode dependent, e.g. ATM
    • H04L2012/5678Traffic aspects, e.g. arbitration, load balancing, smoothing, buffer management
    • H04L2012/5681Buffer or queue management

Abstract

Method for a traffic management system designed to be implemented in an integrated circuit module, indicating the manner in which information cells transmitted in ATM mode can be forwarded to a plurality of, for instance, more than 1000 output connections in a multicast connection system in non-real time.

Description

description

A method for multi-point connection in an ATM transmission system with connection-specific queues

ATM nodes can provide different classes of services with different requirements (real time, non real time) to the transmission simultaneously, or transferred. Especially not real-time services require large memory and complex algorithms to manage this memory.

Subject of the application relates to a method for forwarding a virtual connection associated Nachrich- tenzellen as part of a multi-point connection to a plurality of virtual connections accordingly

- an incoming message cell is stored in a free space of a plurality of memory locations having cell memory - refers to a cell connection list at the address of the memory location address to the memory location in which the next successive, belonging to the same virtual circuit message cell is stored

- are held forth for each outgoing virtual connection control data that the address of the currently first message cell (Head) of the virtual link in question, the address of the currently last message cell (tail) of the virtual link in question and the current number of message cells of the virtual circuit in question refer to a message cell cycle of the transmission duration of a message cell is similar.

For multi-point communication with a plurality, beispiels-, more than 1,000, outgoing calls to set up the outgoing connections is difficult, since they can not be set simultaneously.

the task of the subject application is based on the one- gangs method outlined in an ATM traffic management develop a building block for multi-point connections without real-time requirements.

The object is DA when the initially methods outlined solved by that

- a parent compound (tree) forms the multicast message cells supplying virtual connection and form the message cells forwarding virtual connections of the multipoint connection outgoing branch connections

- a message cell a multipoint connection is stored only once in the cell memory

- points in the cell connection list at the address of the memory location of the multipoint connection associated message cell an address to the memory location in which the next successive, belonging to the multicast message cell is stored

- are kept for each branch connection control data

- a newly arriving message cell of the parent compound is stored in a free space of the cell memory, the address being included in the cell connection list at the address of the previously last storage location of the parent compound, which points to the memory location of the newly arriving message cell - in the subsequent message cell cycles the control data the branch connections are updated on the designation of the address of the location of the newly coming information cell

- for a branch connection, the processing algorithm in accordance with a forward each permission to forward a

Message cell receives a message cell of the memory is passed, which is addressed by the control data of the currently last message cell of this branch connection - for a branch connection that has forwarded a message cell, the control data for the address of the currently first message cell to the address of the previously is updated second message cell of the memory cell of a message that has been forwarded to all of the branch connections, is released.

Subject of the application is a convenient way for low-effort realization of multipoint connections in an ATM Traffic Management System. The message cells of the off outgoing calls can be forwarded at different rates.

Subject of the application is referred to as execution example described in more detail by figures in a scope required for understanding Toggle hand. They show:

Figure 1 shows a schematic representation of an arrangement, in the subject of the application is applied

Figure 2 is a schematic representation of a known cell memory, which is common to several logical FIFO queues

Figure 3 is a schematic view of a memory cell with a memory organization of the multi-point connections Figure 4 is a schematic view of a memory cell with data for a parent compound.

The arrangement of Figure 1 the input side according to an asynchronous transmission method, in particular the ATM (Asynchronous Transfer Mode), transmitted Nachrichtenzel- len fixed length supplied. The transmission duration of a message cell is like a message cell cycle. In a multiple MC (for: multic_ast) is further escort as vermehrfachte message cells with the same useful data on a plurality of branch connections to a parent compound, an incoming message cell. Message cells which belong to a multiple, may be indicated as such by an entrained in its header information. Message cells that belong to a multiple, be a queue means MC queue (for: multicast queue) supplied (for: not multicast) while the other information cells on a queue means bypassing path non MC to be forwarded. The output from the queue means and the message cells are cells other message forwarding device shed (viewed sheduler) supplied. The relay device allocated according to a predetermined algorithm to the branch connections and on the virtual connections, the other message cells are forwarded in the course of which, permissions for forwarding message cells. The algorithm may by the well-known in the trade rate shaping - algorithm or especially by the well-known in the art, weighted fair queuing - algorithm that awards the permissions in accordance with the agreed data transfer rate and according to a dependent of a weighting priority given be.

Figure 2 shows a known memory array, wherein the plurality of queues a cell memory in common. The queues, each applied as a FIFO queue, are organized as a linked list of memory addresses.

Each message cell is under a memory address in the common memory cells. Furthermore, under this address is a pointer to the subsequent storage of the cells in CLL connection list (for: Cell Linked List). Thus, multiple queues as linked lists (queues) can create. Control data is stored for each queue. The control data denotes a pointer to the beginning (head) and the end (tail) of the queue, and the length (fill) of the respective queue. The pointer that points to the beginning of the queue ,, referred to as next pending for forwarding currently first message cell. The pointer points to the end of the queue, is the last message cell currently to Weiterleitung.Die unused cell locations are in a free list (free cell list) held in the same manner.

In the memory array of Figure 3, the message cells of a multi-point connection are each stored only once. The message cells of the multi-point connection are stored as a linked list, wherein points in the cell connection list at the address of the memory location of the multipoint connection associated message cell an address to the memory location in which the next successive, belonging to the multicast message cell is stored. For the branch connections to ma md control data are held. A newly arriving message cell of the parent compound is stored in a free memory location of Zellenspeicherε, wherein in the cell connection list at the address of the previously last storage location of the parent compound fertil the address is added to that points to the memory location of the newly arriving message cell. In this and the following message cell cycles, the addresses of branch connections which indicate the currently last message cells are updated to the designation of the address of the location of the newly coming information cell. In Fig 3 is shown a state in which a newly arrived message cell already m6 in the queues of the branch connections ma and mb registered and is not yet entered in the queue of the branch connections mc and md. due to different consideration in the previous allocations of permissions for forwarding message cells - - for addressing the respective first message cell (Head) different entries have up further in that the individual queues can be seen from the dargeteilten in Figure 3 condition.

The relay device shed holding of each non-empty queue an entry, issued according to an algorithm which enables the timing of the reading and sorting by the smallest time permissions for forwarding a message cell in each of the queues.

The use of all of the memory locations of the memory cell is best if all traffic classes take full advantage of this (shared memory). This is achieved when messages low priority cells favor later incoming messages higher priority cells are removed from the cell memory. Is in the storage device is a low-priority multipoint connection without real-time requirements

(Non real time) stored, can be created by deleting the entries for the multipoint connection space for message cells that belong to a high-priority connection.

The storage device of Figure 4 to control data relating to the parent compound, supplemented. The control data denotes the beginning (head) and the end (tail) as a pointer and the length (fill) of the queue (tree) for the parent compound.

Which currently last message cell of the parent compound m significant pointer is at entry of an incoming message cell of the multipoint connection, namely when attaching the message cell to the linked list is updated. Is a message cell forwarded to all branch connections, the address of that message cell will freige-, updates the cell connection list and updates the currently first message cell of the parent compound m significant address.

The presence of the data of the parent compound provides an opportunity to add the addresses of the area occupied by the parent compound locations of the free list. So is a way to release the space occupied by the parent memories in favor of a high-priority connection ben gege-. In the case of a Verwurfs a multipoint connection control data of Zweigverbidungen must be updated. This is not possible simultaneously and therefore takes place during successive message cells cycles. The control data of the parent compound are a status character QDS (for: queue discard status) supplements, which remains set until at discarding a parent all control data was updated. The update (Head - Tail = NE wCellAdress, fill = 1) will be updated when processing the next message cell of this tree at each 'copy' of this branch connection.

The Ausleseeinric ung shed has an entry QID (for: Queue Identifier) ​​for each established connection branch. If a parent compound deleted, it is not known whether a branch connection or had an entry in the router not. Therefore, the data of the relay device during the update phase (state character 'queue discard status active) not changed.

New message cell Enter (state character 'queue discard status active): Each copy in einezweigverbin- dung is checked whether a day in the router exists (old fill not 0). If there is no tag for this QID a registered, otherwise not (the old one is used). Request for discharge by the forwarding device (state character 'queue discard status is active): If a QID selected by the scheduler, this day is (maintaining status) again registered in the scheduler without further processing.

The order of reading of message cells to the individual branch connections can not be predetermined. Therefore must be recognized when all 'copies' of a message cell has been read. , individual queues have a lot of information cells, so it may be necessary to immediately and completely dismantle such a queue at multipoint connections without Echtzeitan- receivable (non-real time).

For each queue, the current number (fill) of the message cells is known from the control data. While the assignment of a newly arrived message cell to the individual branch connections, the queue is determined by the greatest length. This value is compared with the length of the parent compound and the difference of the lengths is to specify how many memories can be released. In order for a stem connection-specific counter is set, in which released a message cell with each read from a queue and the count of the counter is decremented by one.

Claims

claims
1. A method for forwarding a virtual connects fertil associated message cells in the course of a multi-point connection to a plurality of virtual connections accordingly
- an incoming message cell is stored in a free space of a plurality of memory locations having memory cells
- in a cellular communication list (CLL) at the address of the memory location references an address to the memory location in which the next successive, belonging to the same virtual circuit message cell is stored - are maintained for each outgoing virtual connection control data (the address of the currently first message cell Head designate) of the virtual link in question, the address of the currently last message cell (tail) of the virtual link in question and the current number of message cells of the virtual circuit in question
- a message cell cycle of the transmission duration of a message cell resembles characterized in that - the (tree) forms the multicast message cells supplying virtual link a parent compound to form the message cells forwarding virtual connections of the multipoint connection outgoing branch connections - a message cell of a multi-point connection is stored only once in the cell memory
- points in the cell connection list at the address of the memory location of the multipoint connection associated message cell an address to the memory location in which the next successive, belonging to the multicast message cell is stored - are maintained for each branch connection control data
- a newly arriving message cell of the parent compound is stored in a free space of the cell memory, the address being included in the cell connection list at the address of the previously last storage location of the parent compound, which points to the memory location of the newly arriving message cell
- to be updated to the designation of the address of the location of the newly coming message cell in the following message cell cycles, the control data of the branch connections
- for a branch connection which receives in accordance with a forward each processing algorithm an authorization for forwarding a message cell, a message cell of the memory is passed, which is addressed by the control data of the currently last message cell of this branch connection
- for a branch connection that has forwarded a message cell, the control data for the address is updated momen- tan first message cell to the address of the hitherto second message cell
- the storage of a message cell which has been forwarded to all of the branch connections, is released.
2. A method according to claim 1, characterized in that
- are held for the parent compound control data
- the difference between the largest number of message cells of all branch connections and the number of
Message cells of the parent compound is determined and the difference is equal to the end number of memory locations starting with the memory location to address the control data as the first currently the parent compound shall be released.
PCT/DE1997/002165 1996-09-30 1997-09-24 Method of multi-point connection in an atm transmission system with individual connection waiting queues WO1998015155A1 (en)

Priority Applications (2)

Application Number Priority Date Filing Date Title
DE19640234.4 1996-09-30
DE19640234 1996-09-30

Publications (1)

Publication Number Publication Date
WO1998015155A1 true true WO1998015155A1 (en) 1998-04-09

Family

ID=7807394

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/DE1997/002165 WO1998015155A1 (en) 1996-09-30 1997-09-24 Method of multi-point connection in an atm transmission system with individual connection waiting queues

Country Status (1)

Country Link
WO (1) WO1998015155A1 (en)

Cited By (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1090482A1 (en) * 1998-06-19 2001-04-11 Ascend Communications, Inc. Logical multicasting method and apparatus
EP1313273A1 (en) * 2001-11-20 2003-05-21 Broadcom Corporation System having two or more packet interfaces, a switch, and a shared packet DMA (Direct Memory Access) circuit
US6658658B1 (en) 2000-02-17 2003-12-02 International Business Machines Corporation Implicit forwarding and resolving of a reference made by an importing module to an exporting module for a specified export
US6748479B2 (en) 2001-11-20 2004-06-08 Broadcom Corporation System having interfaces and switch that separates coherent and packet traffic
US7206879B2 (en) 2001-11-20 2007-04-17 Broadcom Corporation Systems using mix of packet, coherent, and noncoherent traffic to optimize transmission between systems
US7227870B2 (en) 2001-11-20 2007-06-05 Broadcom Corporation Systems including packet interfaces, switches, and packet DMA circuits for splitting and merging packet streams
US7236489B1 (en) 2000-04-27 2007-06-26 Mosaid Technologies, Inc. Port packet queuing
US7394823B2 (en) 2001-11-20 2008-07-01 Broadcom Corporation System having configurable interfaces for flexible system configurations
US7752281B2 (en) 2001-11-20 2010-07-06 Broadcom Corporation Bridges performing remote reads and writes as uncacheable coherent operations

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0702500A2 (en) * 1994-09-14 1996-03-20 Fore Systems, Inc. Method of multicasting and multicast system

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0702500A2 (en) * 1994-09-14 1996-03-20 Fore Systems, Inc. Method of multicasting and multicast system

Non-Patent Citations (4)

* Cited by examiner, † Cited by third party
Title
"MULTICAST/BROADCAST MECHANISM FOR A SHARED BUFFER PACKET SWITCH", IBM TECHNICAL DISCLOSURE BULLETIN, vol. 34, no. 10A, 1 March 1992 (1992-03-01), pages 464 - 465, XP000302372 *
HIROSHI KUWAHARA ET AL: "A SHARED BUFFER MEMORY SWITCH FOR AN ATM EXCHANGE", WORLD PROSPERITY THROUGH COMMUNICATIONS, BOSTON, JUNE 11 - 14, 1989, vol. 1 OF 3, 11 June 1989 (1989-06-11), INSTITUTE OF ELECTRICAL AND ELECTRONICS ENGINEERS, pages 118 - 122, XP000075449 *
JUNG-SHYR WU ET AL: "TRAFFIC MANAGEMENT CIRCUIT FOR THE SHARED BUFFER MEMORY SWITCH WITH MULTICASTING", COMPUTER COMMUNICATIONS, vol. 16, no. 11, 1 November 1993 (1993-11-01), pages 736 - 739, XP000397896 *
SAITO H ET AL: "MULTICAST FUNCTION AND ITS LSI IMPLEMENTATION IN A SHARED MULTIBUFFER ATM SWITCH", PROCEEDINGS OF THE CONFERENCE ON COMPUTER COMMUNICATIONS (INFOCOM), TORONTO, JUNE 12 - 16, 1994, vol. 1, 12 June 1994 (1994-06-12), INSTITUTE OF ELECTRICAL AND ELECTRONICS ENGINEERS, pages 315 - 322, XP000496482 *

Cited By (16)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1090482A1 (en) * 1998-06-19 2001-04-11 Ascend Communications, Inc. Logical multicasting method and apparatus
EP1090482A4 (en) * 1998-06-19 2003-04-09 Ascend Communications Inc Logical multicasting method and apparatus
US6658658B1 (en) 2000-02-17 2003-12-02 International Business Machines Corporation Implicit forwarding and resolving of a reference made by an importing module to an exporting module for a specified export
US8184635B2 (en) 2000-04-27 2012-05-22 Mosaid Technologies Incorporated Port packet queuing
US7804834B2 (en) 2000-04-27 2010-09-28 Mosaid Technologies Incorporated Port packet queuing
DE10196135B4 (en) * 2000-04-27 2010-07-22 Mosaid Technologies Incorporated, Kanata Port-packet queuing
US7236489B1 (en) 2000-04-27 2007-06-26 Mosaid Technologies, Inc. Port packet queuing
US8837502B2 (en) 2000-04-27 2014-09-16 Conversant Intellectual Property Management Incorporated Port packet queuing
US7227870B2 (en) 2001-11-20 2007-06-05 Broadcom Corporation Systems including packet interfaces, switches, and packet DMA circuits for splitting and merging packet streams
US7206879B2 (en) 2001-11-20 2007-04-17 Broadcom Corporation Systems using mix of packet, coherent, and noncoherent traffic to optimize transmission between systems
US7424561B2 (en) * 2001-11-20 2008-09-09 Broadcom Corporation Systems using mix of packet, coherent, and noncoherent traffic to optimize transmission between systems
US7752281B2 (en) 2001-11-20 2010-07-06 Broadcom Corporation Bridges performing remote reads and writes as uncacheable coherent operations
US6912602B2 (en) 2001-11-20 2005-06-28 Broadcom Corporation System having two or more packet interfaces, a switch, and a shared packet DMA circuit
US6748479B2 (en) 2001-11-20 2004-06-08 Broadcom Corporation System having interfaces and switch that separates coherent and packet traffic
EP1313273A1 (en) * 2001-11-20 2003-05-21 Broadcom Corporation System having two or more packet interfaces, a switch, and a shared packet DMA (Direct Memory Access) circuit
US7394823B2 (en) 2001-11-20 2008-07-01 Broadcom Corporation System having configurable interfaces for flexible system configurations

Similar Documents

Publication Publication Date Title
US6438134B1 (en) Two-component bandwidth scheduler having application in multi-class digital communications systems
US6351466B1 (en) Switching systems and methods of operation of switching systems
US6934250B1 (en) Method and apparatus for an output packet organizer
US5689505A (en) Buffering of multicast cells in switching networks
US5982749A (en) ATM communication system interconnect/termination unit
US5848068A (en) ATM communication system interconnect/termination unit
US5920561A (en) ATM communication system interconnect/termination unit
US6414963B1 (en) Apparatus and method for proving multiple and simultaneous quality of service connects in a tunnel mode
US5506841A (en) Cell switch and a method for directing cells therethrough
US5726985A (en) ATM communication system interconnect/termination unit
US6141346A (en) Point-to-multipoint transmission using subqueues
US5457687A (en) Method and apparatus for backward explicit congestion notification (BECN) in an ATM network
US6940851B2 (en) Scheduling the dispatch of cells in non-empty virtual output queues of multistage switches using a pipelined arbitration scheme
US5835494A (en) Multi-level rate scheduler
US5521916A (en) Implementation of selective pushout for space priorities in a shared memory asynchronous transfer mode switch
US6292492B1 (en) Efficient method and apparatus for allocating memory space used for buffering cells received on several connections in an asynchronous transfer mode (ATM) switch
US7046661B2 (en) Scheduling the dispatch of cells in non-empty virtual output queues of multistage switches using a pipelined hierarchical arbitration scheme
US5694554A (en) ATM interface and shaping method
US5953336A (en) Method and apparatus for source rate pacing in an ATM network
US5748614A (en) Method for scheduling message cells leaving an ATM node
US6611527B1 (en) Packet switching apparatus with a common buffer
US6477144B1 (en) Time linked scheduling of cell-based traffic
US5600820A (en) Method for partitioning memory in a high speed network based on the type of service
US7031330B1 (en) Very wide memory TDM switching system
US6487212B1 (en) Queuing structure and method for prioritization of frames in a network switch

Legal Events

Date Code Title Description
AK Designated states

Kind code of ref document: A1

Designated state(s): CA JP US

AL Designated countries for regional patents

Kind code of ref document: A1

Designated state(s): AT BE CH DE DK ES FI FR GB GR IE IT LU MC NL PT SE

121 Ep: the epo has been informed by wipo that ep was designated in this application
122 Ep: pct application non-entry in european phase
NENP Non-entry into the national phase in:

Ref country code: CA

NENP Non-entry into the national phase in:

Ref country code: JP

Ref document number: 1998516125

Format of ref document f/p: F