WO1997002687A1 - Technique de temporisation et synchronisation d'un systeme atm (mode transfert asynchrone) - Google Patents

Technique de temporisation et synchronisation d'un systeme atm (mode transfert asynchrone) Download PDF

Info

Publication number
WO1997002687A1
WO1997002687A1 PCT/SE1996/000907 SE9600907W WO9702687A1 WO 1997002687 A1 WO1997002687 A1 WO 1997002687A1 SE 9600907 W SE9600907 W SE 9600907W WO 9702687 A1 WO9702687 A1 WO 9702687A1
Authority
WO
WIPO (PCT)
Prior art keywords
data
cell
transmission
ecp
time
Prior art date
Application number
PCT/SE1996/000907
Other languages
English (en)
Inventor
Olle Martinsson
Original Assignee
Telefonaktiebolaget Lm Ericsson (Publ)
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
Priority claimed from SE9502468A external-priority patent/SE506955C2/sv
Application filed by Telefonaktiebolaget Lm Ericsson (Publ) filed Critical Telefonaktiebolaget Lm Ericsson (Publ)
Priority to AU63749/96A priority Critical patent/AU6374996A/en
Publication of WO1997002687A1 publication Critical patent/WO1997002687A1/fr

Links

Classifications

    • 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
    • H04L12/5602—Bandwidth control in ATM Networks, e.g. leaky bucket
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q11/00—Selecting arrangements for multiplex systems
    • H04Q11/04—Selecting arrangements for multiplex systems for time-division multiplexing
    • H04Q11/0428—Integrated services digital network, i.e. systems for transmission of different types of digitised signals, e.g. speech, data, telecentral, television signals
    • H04Q11/0478—Provisions for broadband connections
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L7/00—Arrangements for synchronising receiver with transmitter
    • H04L7/04—Speed or phase control by synchronisation signals
    • H04L7/041—Speed or phase control by synchronisation signals using special codes as synchronising signal
    • H04L2007/045—Fill bit or bits, idle words
    • 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/5629—Admission control
    • H04L2012/5631—Resource management and allocation
    • H04L2012/5632—Bandwidth allocation
    • H04L2012/5635—Backpressure, e.g. for ABR
    • 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
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/54—Store-and-forward switching systems 
    • H04L12/56—Packet switching systems
    • H04L12/5601—Transfer mode dependent, e.g. ATM
    • H04L2012/5672—Multiplexing, e.g. coding, scrambling
    • H04L2012/5674—Synchronisation, timing recovery or alignment
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/54—Store-and-forward switching systems 
    • H04L12/56—Packet switching systems
    • H04L12/5601—Transfer mode dependent, e.g. ATM
    • H04L2012/5678—Traffic aspects, e.g. arbitration, load balancing, smoothing, buffer management
    • H04L2012/568—Load balancing, smoothing or shaping

Definitions

  • the present invention relates to asynchronous transfer mode (ATM) data transfer and, more particularly, to a system and method for incorporating cell transfer timing and data resynchronization within such a system.
  • ATM asynchronous transfer mode
  • ATM asynchronous transfer mode
  • ATM is currently being implemented in an attempt to satisfy increasing communications needs by creating a bearer telecommunications network which has substantially "bandwidth granularity" and which is capable of coping with very high bandwidth connections.
  • bandwidth granularity refers to a characteristic of the network in which the bandwidth required by a call can vary freely throughout the duration of that call.
  • the use of ATM technology in both public and private telecommunications networks provides the capability of common switching and transport for related services, increased bandwidth granularity, support of variable-bit- rate services, and support of multimedia services. Because of these features, ATM has been chosen by the International Telecommunications Union (ITU) as the core technology for broadband ISDN (B-ISDN) services.
  • ITU International Telecommunications Union
  • an ATM cell has a fixed length of fifty-three bytes, or octets, divided into a five-octet header and a forty-eight-octet information field (also known as the "payload") .
  • the ATM cell header is structured as a number of fields and one of its principal functions is to assist in the routing of an ATM cell from its point of origin to its point of destination through one or more ATM switching nodes.
  • the ATM cell header also contains, in the fifth octet thereof, error detection information in the form of cyclic redundancy check (CRC) bits.
  • CRC cyclic redundancy check
  • the ATM standard that has been adopted by the ITU does not presently embody either error correction of the header segment or even error detection of the payload segment.
  • the present standard embodies only error detection and not error correction.
  • the error detection is limited to the header segment and does not include the payload segment of an ATM cell. This trade-off shows that the present standard is focused on preventing the misdelivery of ATM cells through the corruption of envelopes (i.e. the ATM cell headers) than on preventing the mistransmission of messages through the corruption of the contents (i.e. the ATM cell payload) .
  • the detection and/or correction of message corruption has been left to higher levels of the protocol.
  • each ATM cell is kept relatively small in order to keep the data packaging/disassembly time within a range that is compatible with low-bandwidth telephony applications where the transmission latency needs to be minimized (e.g., voice links) . If the size of the standard ATM cell header were to be increased, then the delay arising from the time needed to assemble a slow stream of data into a standard sized package would be unacceptably high. Conversely, if cells were transmitted before they were full, then the utilization rate of the available bandwidth would be unacceptably low.
  • Another reason for keeping the size of a standard ATM cell low is to have the fine granularity needed to send variable-length data messages. Since data is commonly stored in multiples of eight bits, the size of the payload segment of an ATM cell needs to be a multiple of this size. If the multiple were to be too small, then the transmission overhead would be very high because the header would be large in comparison to the payload. If on the other hand, the multiple were to be too large, then there would be low bandwidth utilization because the final ATM cell cf each data message is likely to be only partially filled. Additional reasons for keeping the size of an ATM cell low include the need to reduce the size of the internal buffers in the switching nodes and to limit the queuing delays in those buffers.
  • the principal function of the ATM cell header is the identification of the virtual connection. Routing information carried by the ATM cell is contained within two fields: a virtual path identifier (VPI), which determines which virtual path the ATM cell belongs to, and a virtual channel identifier (VCI), which determines which virtual channel within a virtual path the ATM cell belongs to.
  • VPN virtual path identifier
  • VCI virtual channel identifier
  • a virtual channel is a dynamically allocable end-to- end connection.
  • Optical transmission links are capable of transporting hundreds of megabits per second, whereas virtual channels may fill only a few kilobits per second of a link.
  • a virtual path is a semi ⁇ permanent connection between end points.
  • Each of the virtual paths can transport a large number of simultaneously-connected virtual channels. Since a large group of virtual channels are handled and switched together as a single unit, the total processing requirements of a virtual path are less than that of a virtual circuit, consequently there is faster processing per (virtual) circuit, resulting in a significantly more efficient use of network resources.
  • each logical connection In the transmission of data within an ATM network, each logical connection is assigned a predetermined transmission rate. The assigned transmission rate is determined by either the transmitter or the receiver of the data transmission. Each connection's transmission rate is a fraction of the total inter-node network transmission capacity with increased transmission rates resulting in greater costs to the user of the connection. Thus, limiting and maintaining cell transmission rates from a data source within the network is an important operational requirement.
  • data cells must not be generated and transmitted into the network at a rate greater than a predetermined allowable value based upon agreements with the network operator.
  • the timing between transfer of successive cells both into and within a network is an important issue in ATM cell generation and transmission systems.
  • Another important issue in ATM transmission systems is that of cell alignment within the various data buffers and the receiving and transmitting modules. For example, when a data buffer first begins receiving a sequence of ATM cells it knows because of the regularity of the cell structure where each cell begins and ends. However, in the event of a data error or a power outage or some perturbation in the system, it may lose track of the location of the particular bit at which one cell ends and another begins within a continuous stream of data flowing through the buffer.
  • the system of the present invention incorporates an improved technique for controlling the timing of the transmission of ATM data cells at various selectable data rates and at the same time providing for the reestablishment of ATM cell alignment in the event misalignment occurs.
  • the system may be used within a module which is generating and transferring data cells into an ATM network or for the transfer of cells between two separate modules outside a network.
  • the system and method of the present invention relates to a technique for regulating the rate of transmission of data cells in a telecommunications environment.
  • the regulation is performed by generating and placing marker cells called Empty Cell Position (ECP) patterns between and amongst a sequence of ATM cells.
  • ECP Empty Cell Position
  • Each ECP pattern comprises a bit sequence that is readily distinguishable from an ATM cell but which can occupy a transmission time slot of the same size as that needed by a standard ATM cell. This permits control of the relative transmission times of each of a sequence of sequentially ordered ATM cells.
  • the system and method of the present invention includes the generation or processing of a sequence of data cells having a fixed format for transmission at various times and at various data rates.
  • Each data cell has a data portion and an associated timing tag that is indicative of the time at which the data cell is to be transmitted relative to the time of transmission of the immediately preceding data cell.
  • Each data cell is stored in a first-in-first-out (FIFO) buffer register.
  • An empty cell position (ECP) pattern is generated which contains information indicative of an user- selectable delay time for the transmission of the next data cell, the structure of the ECP word being distinguishably different from the structure of the data cells.
  • ECP empty cell position
  • Zero or more ECP patterns are stored in the buffer after each data cell with the number and contents of the ECP words corresponding to the desired time delay before the transmission of the next data cell in the buffer. Data is read from the output of the buffer. Each data cell emerging from the buffer is transmitted after a time delay that is determined by the number and contents of the ECP patterns preceding that data cell.
  • FIGURE 1 is a block diagram schematically illustrating an ATM network
  • FIGURE 2 is a block diagram of an illustrative terminal which may be used within the ATM network of FIGURE 1;
  • FIGURE 3 is a flow chart illustrating the sequence of steps performed by the reception function of the terminal illustrated in FIGURE 2;
  • FIGURE 4 is a block diagram illustrating a terminal within which ATM cells may be generated and transferred along with timing information into an ATM network in accordance with the principles of the invention
  • FIGURE 5 is an illustrative diagram of the organization of the data buffer depicted in the block diagram of FIGURE 4;
  • FIGURE 6 is a flow chart illustrating the process steps performed by the cell generator illustrated in FIGURE 4; and FIGURE 7 is a flow chart illustrating the process steps performed in the transmitting module of the terminal of FIGURE 4.DESCRIPTION OF THE PREFERRED EMBODIMENT
  • the system of the present invention may be used in the transfer of ATM data cells between discrete modules or within a data network within which ATM data are transmitted from one node to another.
  • a standard ATM cell contains 53 octets or bytes of digital data.
  • An ATM data packet may comprise and extend over several successive cells.
  • a data call message or data file is generally transmitted through the ATM network as one data packet and will thus always comprise a sequence of several successive data cells and frequently a very large number of cells. However, in the following description, only individual cells will be considered.
  • FIGURE 1 there is shown an ATM data network 1 intended for the transfer of data packets from an input data terminal 3 to an output or destination data terminal 5.
  • the terminals 3 and 5 may comprise both transmitters and receivers of data packets and may be connected to the network 1 in any number.
  • the ATM network 1 generally comprises a plurality of intermediate switching nodes only one of which is illustrated at 7. Switching unit 7 is connected to other similar switching nodes (not shown) .
  • a signal indicative thereof is sent to a switching node within the network.
  • This message also contains information requesting the specification of a transmission data rate for the cells to be transmitted.
  • a logical signal path is set up through the network and various messages and control information are exchanged between the different switching nodes 7 in the network 1.
  • an appropriate message is transmitted from the network 1 to the terminal 3 that connection is now established and ready to be used for the transfer of data packets at the assigned rate from the input station 3 towards the destination station 5.
  • the input or source terminal 3 also receives messages or calls from other sources: for example, from another network 9 through a data bridge 11 and from a local area computer network (LAN) 13 through a bridge 15 connected to a communications computer or file server 17 within the LAN 13.
  • LAN 13 interconnects a plurality of personal computers or workstations 19 to a file server 20, and is controlled by networking software well known in the industry.
  • a high-speed Reduced Instruction Set Computing (RISC) workstation 21 can also be connected to the input terminal 3 using a suitable workstation adapter and a bridge 22.
  • the input terminal 3 may itself be an integrated part of a communication device, for example, an accessory board mounted in a dedicated communications server.
  • a certain sequence of discrete operations must be performed within the input terminal 3 in order to transmit cells from different logical connections at discrete data rates which have been established for each connection.
  • a source of data communicated into a network normally wants the data to be transferred to the destination as fast as possible.
  • the cost of data transfer may be different for the various transmission rates available through the network.
  • the circuits and/or data storage devices of the destination terminal may not have the -li ⁇ ability to receive data at every rate provided for in a telecommunications standard.
  • certain types of data sources may desire to have its data transferred through the network at a constant bit rate, for example, in the case of devices issuing real time data such as video data from a video teleconference or other moving images.
  • One solution to the data rate problem is to allot a maximum data rate which is equal to or slightly greater than that which would be required by the source if there was a direct data path through the network from one end to the other, i.e., if the path did not pass through intervening switching nodes and was not subject to interruptions in transmission by other data traffic through the network.
  • Another solution would be to configure the network so that certain channels would pass the information directly through the network without interruption.
  • this type of arrangement increases the complexity of the system.
  • the time for transmission is considered to be divided into a plurality of uniform time slots (TSs) . During each TS interval either one cell or no cell is transmitted from the terminal.
  • TSs uniform time slots
  • the typical time between the beginnings of two successive time slots would then correspond in order of magnitude to the maximum output rate of the data link being used for transmission.
  • a transmission rate of approximately 10 megabits per second and an ATM cell size of fifty-three octets a single time slot increment is 42.4 microseconds.
  • the time slot period is equal to 2.73 microseconds.
  • a maximum transmission rate is defined for each logical connection within the network.
  • the inverse of the maximum transmission rate corresponds to the minimum distance between time slots (MDTS) .
  • the MDTS can be expressed in multiples of the minimum inter-cell time interval i.e. the least possible time between successive cells passing through the network. If a transmission rate is assumed to be 10 megabits per second with a minimum time slot value of 42.4 microseconds, then an unit MDTS is the equivalent of the maximum output rate, i.e., a cell transmission time of 42.4 microseconds.
  • An MDTS of two represents half the maximum output rate (i.e., 5 megabits per second) ; an MDTS of 3 is a third of the maximum output rate (i.e., 3.3 megabits per second), and so on.
  • the same processing of data within the input terminal 3 may also be executed in an internal node 7 of the network 1 since a modification of the data cell transfer rate may be needed within the network as well in order to balance the data flow through the network. For example, some nodes within the network may sometimes become inactive, data cells may be lost, there may be differing capacities of the internal buffers located within the various nodes, etc. Buffering is necessary to make it possible for the network to handle the fluctuations in the cell flow rate that inevitably arise from the multiplexing of data traffic from multiple independent sources.
  • a reception function 201 administers messages, files, data packets and cells which are respectively arriving at the terminal by segmenting or dividing the arriving data into suitable segments such as standard ATM cells.
  • the reception function 201 manages the storage of the cells in cell queues with each logical connection having a connection identifier (CEI) .
  • CEI connection identifier
  • the reception function 201 illustrated in FIGURE 2 handles the segmenting of data arriving at the input terminal 3 and the storing of cell ⁇ obtained from the data in queues arranged in accordance with logical destination connections.
  • data arriving at the input register 207 are stored in reception registers or input buffers 209.
  • One buffer 209 is established for each currently active or open logical connection.
  • the buffer for each such logical connection is referred to as a CEI queue.
  • the CEI queues are serially numbered "CEI No. 0", "CEI No. 1", etc.
  • Registers or storage cells are provided for each such CEI queue for holding the data necessary for administration of the buffers.
  • the buffers are preferably cyclically organized.
  • connection number of the cells in the buffer is stored in a register 211; the rate selector MDTS of the connection is stored in a register 213; a pointer to the stored cell in the buffer is stored in the field 215; and a pointer to the next position in the buffer where a new cell can be stored is stored in register 217.
  • an indicator for active state is stored to designate whether or not the queue is active; that is, whether the queue participates in the throttling process.
  • the cells which are stored in the buffer 209 have not yet been transmitted from the station or node and a cell which is physically sent by the transmission function 205 is, accordingly in one embodiment of the system, always removed from its CEI buffer 209.
  • the terminal also includes a throttling process 203 which regulates the transmission function of the cell generator 205 and controls which cells will be transmitted so that cells are sent at a predetermined desired rate. This is done by supplying a list of output connection identifiers (CEIs)to the transmission function 205.
  • CEIs output connection identifiers
  • the throttling process 203 it is not necessary that the throttling process 203 exactly define which cell to transmit, but may only give the queue numbers or, equivalently, the logical connections in a correct sequential order so that the transmission function takes the next connection number from the list and transmits the next cell in the queue destined for this particular connection.
  • the basic procedure performed in the reception function 201 is illustrated by the flow diagram of FIGURE 3.
  • this new information is processed at 303 to assign a logical connection number to the incoming data.
  • a logical connection number, or equivalent information, pointing to a logical connection can be retrieved directly from the incoming data according to the protocol being used.
  • Such information may also be contained within the header portion of a standard ATM cell. Thereafter, some bits in the header or, in some cases in the entire header itself, of a data packet or cell can be removed from the rest of the cell.
  • the number of ATM cells to be generated from a received data packet or message is also calculated.
  • the input buffer for the logical connection to the information is already active or not; that is, whether it is participating in the throttling process and thus present in a TS queue.
  • This step is performed by testing the indicator stored in the memory field 219 (shown in FIGURE 2) for active state. If the indicator is inactive, then at 307, a signal is sent to the throttling function 203 informing it that the queue under consideration has now become active and that the state indicator in field 221 should be changed to indicate that active condition.
  • a cell is stored within its associated buffer 209 (shown in FIGURE 2) at the position specified by the end position pointers stored in field 217 and the end position pointer is incremented by one unit. Thereafter, it is determined at 311 whether or not there are more cells to be stored and, if not, the procedure loops back to the start block 301. If, however, it is determined at 311 that there is another cell to be stored, the system moves to 313 where it is determined whether or not there is space in the buffer under consideration for the storage of an additional cell.
  • This process is performed by comparing the start and end position pointers stored in the fields 215 and 217 (FIGURE 2), respectively. If those values are equal, then the buffer is full and the procedure must wait until there is an empty space in the buffer by looping repeatedly through the decision block 313. Alternatively, the cell for which there is no space in the buffer, may be discarded as suggested at 315. When buffer space is found, execution of the process continues from 309.
  • the system of the present invention advantageously provides for the generation and use of special empty cell position (ECP) data patterns.
  • ECP empty cell position
  • the ATM cell generating function within the terminal 3 can be performed by either hardware or software elements. Such a function generates each data cell in accordance with a preselected pattern and thereafter controls the sequence and timing of all data cell transmissions from the terminal.
  • some cells may not lend themselves to generation in real time, for example, due to different levels of complexity within the data comprising the cells; due to dependence on access to some common resource not available in real time; or, in the case of software- implemented cell generation, due to other tasks within a multitasking environment which require real time service by the software. Because of these factors, it is highly desirable to include a cell buffer function that is connected to the cell transmitter. Such functions are typically implemented in hardware, however, such implementations only require relatively simple functionality in each of the cell generator, the cell buffer, and the cell transmitter.
  • FIGURE 4 there is shown an illustrative diagram of a system constructed in accordance with the principles of the present invention for generating ATM cells and moving those cells into an ATM network through a physical link.
  • the cell generator 401 produces or retransmits ATM cells 402 each of which includes a header 402a and a payload 402b.
  • the cell generator also associates each ATM cell with a time tag 406.
  • the time tag 406 defines the relative time within which the respective ATM cell with which it is associated is to be transmitted into the network with respect to the adjacent cells which are contiguous in time.
  • the cell generator 401 delivers the ATM cells into a data buffer 403 illustratively shown as a first-in- first-out (FIFO) register.
  • the output of the buffer 403 delivers the ATM cells to a transmitting module 404 which, in turn, moves each successive cell into a physical ATM link 405.
  • Each of the cells 402 are transmitted along the ATM physical link spaced from one another by appropriate time period determined by their relative time tags, generated and appended by the cell generator 401.
  • the cell generator 401 may be implemented within the software of a processor. Such software generates data cells and defines the relative time for eventual transmission of each cell with respect to the contiguously adjacent cells produced by the cell generator.
  • the processor within which the cell generation software is running is coupled by means of a hardware interface to the buffer 403 which is, in turn, linked to the transmitting module 404 and which comprises a hardware module connected to the physical link 405 of the ATM network.
  • data buffer 403 is a standard FIFO register circuit n bits in width.
  • Each ATM cell will occupy m number of words within the storage registers of the buffer 403.
  • the parameters m and n are correlated to the size of the ATM data cells so that the product of m and n equals the number of bits per ATM cell.
  • the eight CRC bits of an ATM cell header are usually set aside during the internal processing of an ATM cell.
  • the first word of each cell in the buffer usually contains all or part of the ATM cell header.
  • the patterns of each header of each cell are generally different from one another and dependent for their value upon the particular logical ATM connection for which they are destined.
  • the timing defined by the time tags associated with each ATM cell produced by the cell generator 401 establishes the generation and transfer into the buffer of a number of empty cell position (ECP) patterns positioned between the adjacent cells stored in the buffer.
  • ECP empty cell position
  • Each ECP pattern is preferably constructed so that it is one word in length and the pattern is chosen so that the same pattern never occurs in the first word of any of the data carrying ATM cells stored in the buffer, i.e. an ECP pattern is uniquely identifiable from a data cell.
  • the number of ECP patterns located between any two consecutive ATM cells within the buffer can consist of any number greater than or equal to zero. If it is assumed that the time represented by each ATM cell or ECP corresponds to that of a single time slot (TS) , then the time interval between any two contiguous cells is the duration of each time slot multiplied by one more than the number of ECPs.
  • the cell generator can precisely specify the time (within the unit time resolution, TS) for transmission of each of the ATM cells into the network. For the example illustrated in FIGURE 5, if cell 1 is transmitted at time t, then cell 2 will be transmitted at time (t+2xTS) and cell 3 will be transmitted at time (t+5xTS) .
  • the buffer 403 generates and sends a signal back to the cell generator 402 to indicate when the buffer is full. Such a full signal may be generated in response to a physical capacity limit being reached within the buffer and which is activated when the empty space remaining in the buffer corresponds to less than the length of one ATM cell.
  • the latency time for the cell transmission from the buffer is not directly defined by the physical fill level of the buffer. Instead, the latency time is governed by the current number of cells plus the number of ECPs in the buffer. Thus, for a system that is sensitive to latency time, the buffer full signal could instead be generated by some threshold function connected to a counter that counts the current number of cells plus ECPs in the buffer. It is unnecessary for the transmitting module 404 to receive an empty signal from the buffer, for example, if the cell generator guarantees that the buffer will never become completely empty.
  • FIGURE 6 shows a flow chart for part of the cell generator 401 shown in FIGURE 4. Here it is assumed that the cell generator 401 contains a TS counter whose value corresponds to the real time of the cell transmission.
  • the system obtains the next cell for transmission along with its time tag and moves to 602 where it inquires whether or not the buffer is full. If so, it simply loops at 602 and waits until it can move to 603 at which it increments the time slot counter by one and moves to 604 where it checks to see if the time slot counter is equal to the time tag. If the answer to this question is in the negative, the system writes an ECP pattern to the buffer at 605 and jumps to 602. If, at 604, the time slot counter is determined to be equal to the time tag associated with the next ATM cell, the system writes the ATM cell into the buffer at 606 and returns to 601 for processing the next ATM cell.
  • FIGURE 7 there is shown a flow chart for the operation of the transmitting module 404 illustrated in FIGURE 4.
  • the system inquires whether or not the time slot timer has expired. If not, the system waits. If so, however, the system moves to 702 at which it reads the next word in the buffer and evaluates at 703 whether or not the word is an ECP pattern. If so, it cycles back to 701. If, however, at 703 it is determined that the word read is not an ECP pattern, and is thus a portion of an ATM cell, the system reads the following m-l words at 704 and then transmits the cell into the physical link of the ATM network at 705. Thereafter, the system cycles back to 701.
  • the inherent cell alignment function achieved by the system of the present invention is illustrated by the operation of the transmitting function illustrated in FIGURE 7. That is, in the event the transmitting function loses cell alignment, sooner or later it comes across a true ECP pattern and, at that point, ATM cell synchronization is immediately reestablished. In any case, cell realignment can be achieved following m-l ECP patterns in a row located within the registers of the buffer.
  • the system of the present invention can also be used for transferring cells between two data modules via a buffer in order to achieve cell alignment in that process, i.e. when cell timing features are not used at all.
  • the system of the present invention is particularly useful in the case where the source for ATM cells being generated is a computer and that computer cannot itself provide the physical link connected to the ATM network and requires some interface between the two.
  • the cell generator computer controls the timing for each cell and accurately regulates data transmission speed while at the same time allowing ready realignment of cells for the device which is receiving those cells from the buffer.
  • the goal within a cell generator is that of providing an adequate supply of ATM cells within a system employing a multi-processing or multi-tasking environment.
  • the system of the present invention can also be used to transfer ATM cells either between two physical or logical modules or within the components of an ATM network.
  • the present system is used to transfer timing information regarding the respective timing distance between adjacent ATM cells while at the same time providing an inherent cell alignment function which facilitates recoupment of lost cell alignment between two modules and which will automatically be reestablished after a certain period of time.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

Système et procédé de régulation du temps de transfert des cellules et de rétablissement de la resynchronisation dans un système de télécommunications à commutation par paquets. Une ou plusieurs cellules repères, appelées marques de position de cellules vides (ECP), sont placées entre et parmi une séquence de cellules. Chaque marque ECP comprend une séquence binaire pouvant facilement se distinguer d'une cellule, mais ayant la capacité de se substituer à une cellule standard dans une tranche de temps de transmission de départ. Ceci permet de réguler les temps de transmission relatifs de chaque cellule de la séquence. Les cellules et les marques ECP sont placées dans un tampon élastique tel qu'un tampon premier entré, premier sorti qui permet d'effectuer une génération de cellules de manière relativement indépendante de la transmission de cellules. Ce procédé et ce système permettent également à un transmetteur de cellules de rétablir la synchronisation chaque fois qu'il détecte une marque ECP. Différentes marques ECP peuvent être utilisées pour représenter divers intervalles entre les cellules. Un générateur de cellules place les cellules et les marques ECP dans un tampon. Un transmetteur de cellules extrait les cellules et les marques ECP du tampon et transmet les cellules (705) au bout d'un temps de propagation qui dépend du nombre et du contenu des marques ECP précédant immédiatement ces cellules.
PCT/SE1996/000907 1995-07-06 1996-07-03 Technique de temporisation et synchronisation d'un systeme atm (mode transfert asynchrone) WO1997002687A1 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
AU63749/96A AU6374996A (en) 1995-07-06 1996-07-03 Timing and synchronization technique for atm system

Applications Claiming Priority (4)

Application Number Priority Date Filing Date Title
SE9502468-3 1995-07-06
SE9502468A SE506955C2 (sv) 1995-07-06 1995-07-06 ATM-flödesstyrning
US08/581,325 1995-12-29
US08/581,325 US5729529A (en) 1995-07-06 1995-12-29 Timing and synchronization technique for ATM system

Publications (1)

Publication Number Publication Date
WO1997002687A1 true WO1997002687A1 (fr) 1997-01-23

Family

ID=26662338

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/SE1996/000907 WO1997002687A1 (fr) 1995-07-06 1996-07-03 Technique de temporisation et synchronisation d'un systeme atm (mode transfert asynchrone)

Country Status (2)

Country Link
AU (1) AU6374996A (fr)
WO (1) WO1997002687A1 (fr)

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1298833A2 (fr) * 2001-09-27 2003-04-02 Alcatel Canada Inc. Procédé de synchronisation de liaisons optiques parallèles entre des componsants de communications
US7020393B2 (en) 2001-09-27 2006-03-28 Alcatel Canada Inc. Method of synchronizing parallel optical links between communications components
EP1855429A2 (fr) * 1999-10-22 2007-11-14 Nomadix, Inc. Systèmes et méthodes pour la gestion dynamique de largeur de bande par abonné dans un réseau de communications
US9118578B2 (en) 2011-01-18 2015-08-25 Nomadix, Inc. Systems and methods for group bandwidth management in a communication systems network
US9160672B2 (en) 1998-12-08 2015-10-13 Nomadix, Inc. Systems and methods for controlling user perceived connection speed

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
DE4316225A1 (de) * 1993-05-14 1994-11-17 Deutsche Bundespost Telekom Verfahren und Anordnung zur störungsfreien empfangsseitigen Taktrückgewinnung für Digitalsignale mit konstanter Bitrate

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
DE4316225A1 (de) * 1993-05-14 1994-11-17 Deutsche Bundespost Telekom Verfahren und Anordnung zur störungsfreien empfangsseitigen Taktrückgewinnung für Digitalsignale mit konstanter Bitrate

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
CHAO H J ET AL: "A VLSI SEQUENCER CHIP FOR ATM TRAFFIC SHAPER AND QUEUE MANAGER", IEEE JOURNAL OF SOLID-STATE CIRCUITS, vol. 27, no. 11, 1 November 1992 (1992-11-01), pages 1634 - 1643, XP000320793 *
GUILLEMIN F ET AL: "The spacer-controller: Architecture and first assessments", BROADBAND COMMUNICATIONS. IFIP TC6 WORKSHOP, ESTORIL, PORTUGAL, 20-22 JAN. 1992, vol. C-4, ISSN 0926-549X, IFIP TRANSACTIONS C (COMMUNICATION SYSTEMS), 1992, NETHERLANDS, pages 313 - 323, XP000430627 *

Cited By (17)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9160672B2 (en) 1998-12-08 2015-10-13 Nomadix, Inc. Systems and methods for controlling user perceived connection speed
US10341243B2 (en) 1998-12-08 2019-07-02 Nomadix, Inc. Systems and methods for providing content and services on a network system
US10110436B2 (en) 1998-12-08 2018-10-23 Nomadix, Inc. Systems and methods for providing content and services on a network system
US9548935B2 (en) 1998-12-08 2017-01-17 Nomadix, Inc. Systems and methods for providing content and services on a network system
EP1855429A3 (fr) * 1999-10-22 2010-03-24 Nomadix, Inc. Systèmes et méthodes pour la gestion dynamique de largeur de bande par abonné dans un réseau de communications
US7698432B2 (en) 1999-10-22 2010-04-13 Nomadix, Inc. Systems and methods for dynamic bandwidth management on a per subscriber basis in a communications network
US7739383B1 (en) 1999-10-22 2010-06-15 Nomadix, Inc. Systems and methods for dynamic bandwidth management on a per subscriber basis in a communications network
US7953857B2 (en) 1999-10-22 2011-05-31 Nomadix, Inc. Systems and methods for dynamic data transfer management on a per subscriber basis in a communications network
US8626922B2 (en) 1999-10-22 2014-01-07 Nomadix, Inc. Systems and methods for dynamic data transfer management on a per subscriber basis in a communications network
US9160674B2 (en) 1999-10-22 2015-10-13 Nomadix, Inc. Systems and methods for dynamic data transfer management on a per subscriber basis in a communications network
EP1855429A2 (fr) * 1999-10-22 2007-11-14 Nomadix, Inc. Systèmes et méthodes pour la gestion dynamique de largeur de bande par abonné dans un réseau de communications
US10367748B2 (en) 1999-10-22 2019-07-30 Nomadix, Inc. Systems and methods for dynamic data transfer management on a per subscriber basis in a communications network
EP1298833A2 (fr) * 2001-09-27 2003-04-02 Alcatel Canada Inc. Procédé de synchronisation de liaisons optiques parallèles entre des componsants de communications
US7020393B2 (en) 2001-09-27 2006-03-28 Alcatel Canada Inc. Method of synchronizing parallel optical links between communications components
EP1298833A3 (fr) * 2001-09-27 2005-08-10 Alcatel Canada Inc. Procédé de synchronisation de liaisons optiques parallèles entre des componsants de communications
US9118578B2 (en) 2011-01-18 2015-08-25 Nomadix, Inc. Systems and methods for group bandwidth management in a communication systems network
US11949562B2 (en) 2011-01-18 2024-04-02 Nomadix, Inc. Systems and methods for group bandwidth management in a communication systems network

Also Published As

Publication number Publication date
AU6374996A (en) 1997-02-05

Similar Documents

Publication Publication Date Title
US5729529A (en) Timing and synchronization technique for ATM system
US5600641A (en) Voice circuit emulation system in a packet switching network
US6253207B1 (en) Method and apparatus for transporting multimedia information over heterogeneous wide area networks
AU745753B2 (en) System supporting variable bandwidth asynchronous transfer mode network access for wireline and wireless communications
US6201792B1 (en) Backpressure responsive multicast queue
US5790770A (en) Method and apparatus for reducing information loss in a communications network
US5274768A (en) High-performance host interface for ATM networks
US6788686B1 (en) Method of maintaining packet order in multipath transmission systems having non-uniform traffic splitting
US5528591A (en) End-to-end credit-based flow control system in a digital communication network
JP2942875B2 (ja) ディジタル通信システム
EP0684719A1 (fr) Procédé et appareil pour la transmission de trafic à haute priorité sur des connections à basse vitesse
EP1128612A2 (fr) Procédé pour la transmission de trafic à haute priorité en temps réel sur des liens de communication à faible débit
WO1997035407A1 (fr) Dispositif de gestion de trafic mta
US20090185582A1 (en) Unified data packet for encapsulating data packets having diverse formats
US5386415A (en) Packet communiction method and packet communication apparatus
EP0685951B1 (fr) Interface de ligne pour réseau de paquets rapide
US6195346B1 (en) Method and system for processing an HDLC message
CA2120542C (fr) Mecanisme de transport a relais de trains de donnees
EP1172974B1 (fr) Procédé et dispositif pour le réassemblage des paquets dans un commutateur de télécommunication
US8477602B2 (en) Adaptively maintaining quality of service (QoS) in distributed PBX networks
WO1997004546A1 (fr) Procede et appareil reduisant les pertes d'information dans un reseau de telecommunications
JPH10126421A (ja) 固定サイズパケットでのデータの伝送用通信リンク
US6359862B1 (en) ATM network available bit rate (ABR) explicit rate flow control system
WO1997002687A1 (fr) Technique de temporisation et synchronisation d'un systeme atm (mode transfert asynchrone)
US20020126689A1 (en) System and method for dynamic local loop bandwidth multiplexing

Legal Events

Date Code Title Description
AK Designated states

Kind code of ref document: A1

Designated state(s): AL AM AT AU BB BG BR BY CA CH CN CZ DE DK EE ES FI GB GE HU IS JP KE KG KP KR KZ LK LR LS LT LU LV MD MG MK MN MW MX NO NZ PL PT RO RU SD SE SG SI SK TJ TM TT UA UG US UZ VN

AL Designated countries for regional patents

Kind code of ref document: A1

Designated state(s): KE LS MW SD SZ UG AT BE CH DE DK ES FI FR GB GR IE IT LU MC NL PT SE BF BJ CF CG CI CM GA GN ML MR NE SN TD TG

DFPE Request for preliminary examination filed prior to expiration of 19th month from priority date (pct application filed before 20040101)
121 Ep: the epo has been informed by wipo that ep was designated in this application
REG Reference to national code

Ref country code: DE

Ref legal event code: 8642

122 Ep: pct application non-entry in european phase
NENP Non-entry into the national phase

Ref country code: CA