WO1998051113A2 - Suppression et regeneration de donnees - Google Patents

Suppression et regeneration de donnees Download PDF

Info

Publication number
WO1998051113A2
WO1998051113A2 PCT/GB1998/001243 GB9801243W WO9851113A2 WO 1998051113 A2 WO1998051113 A2 WO 1998051113A2 GB 9801243 W GB9801243 W GB 9801243W WO 9851113 A2 WO9851113 A2 WO 9851113A2
Authority
WO
WIPO (PCT)
Prior art keywords
data
packets
packet
missing
sequence
Prior art date
Application number
PCT/GB1998/001243
Other languages
English (en)
Other versions
WO1998051113A3 (fr
Inventor
Riki Benjamin Dolby
Gyles Harvey
Nigel Phillip Jenkins
Rajakulasingam Raviraj
Original Assignee
Northern Telecom Limited
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 GBGB9709110.2A external-priority patent/GB9709110D0/en
Application filed by Northern Telecom Limited filed Critical Northern Telecom Limited
Priority to EP98919334A priority Critical patent/EP0979566B1/fr
Priority to DE69827379T priority patent/DE69827379T2/de
Priority to CA002285333A priority patent/CA2285333A1/fr
Priority to AU72211/98A priority patent/AU7221198A/en
Publication of WO1998051113A2 publication Critical patent/WO1998051113A2/fr
Publication of WO1998051113A3 publication Critical patent/WO1998051113A3/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
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/66—Arrangements for connecting between networks having differing types of switching systems, e.g. gateways
    • 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
    • H04Q—SELECTING
    • H04Q11/00—Selecting arrangements for multiplex systems
    • H04Q11/04—Selecting arrangements for multiplex systems for time-division multiplexing
    • H04Q11/0428—Integrated services digital network, i.e. systems for transmission of different types of digitised signals, e.g. speech, data, telecentral, television signals
    • H04Q11/0478—Provisions for broadband connections
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/54—Store-and-forward switching systems 
    • H04L12/56—Packet switching systems
    • H04L12/5601—Transfer mode dependent, e.g. ATM
    • H04L2012/5614—User Network Interface
    • H04L2012/5615—Network termination, e.g. NT1, NT2, PBX
    • 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/5614—User Network Interface
    • H04L2012/5616—Terminal equipment, e.g. codecs, synch.
    • 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/5619—Network Node Interface, e.g. tandem connections, transit switching
    • 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

  • This invention relates to a method of reducing bandwidth used on a telecommunications link, a method of operating an output of a telecommunications link on which bandwidth is being reduced, and to apparatus for performing these methods.
  • ATM Asynchronous Transfer Mode
  • Packet, cell and frame-based transport protocols are increasingly being used in telecommunications networks.
  • Asynchronous Transfer Mode (ATM) technology is a flexible form of transmission which allows various types of service traffic, such as voice, video or data, to be multiplexed together on to a common means of transmission, the traffic being carried in cells each having a payload and a header indicating the destination of the cell.
  • ATM statistically multiplexes traffic and removes the rigid relationship between traffic and the time-domain which exists in other multiplexing protocols.
  • ATM can accommodate both traffic whose information rate is constant during a call, and traffic whose information rate varies during a call. Operators are investing in ATM transmission equipment to accommodate users' increasingly diverse communications requirements.
  • a network operator wants to use his transmission network most efficiently.
  • One way of achieving efficiency is to make the best use of the bandwidth of the network.
  • One known way of reducing the amount of bandwidth which a telephone call uses on a transmission network is to suppress the periods of silence which occur during a telephone conversation.
  • Silence suppression detects silence at an input to a transmission network, does not send data representing silence across the network, and at an output of the network inserts 'comfort noise' in place of the removed silence.
  • the bandwidth that is saved by not transmitting the silent periods of a call allows other traffic such as bursty data traffic to be transported across the network. This sharing of the network is particularly easy to achieve in a cell-based network.
  • a technique for saving bandwidth on a cell-based transmission network is used in Northern Telecom's PASSPORTTM switch.
  • the PASSPORTTM switch looks for consecutive identical cells representing an idle channel condition. When enough identical cells are received, the switch stops transmitting cells onto the network. At the destination the PASSPORTTM switch continues to transmit the last cell that it received, thereby saving bandwidth on the network. In this scheme the data which is suppressed at the input to the network is not regenerated accurately at the output of the network.
  • the present invention seeks to provide an alternative method of saving bandwidth.
  • a method of reducing bandwidth used on a telecommunications link comprising, at an input to the link, the steps of:
  • each packet comprising data and a packet identifier
  • the packets use a reduced bandwidth of the telecommunications link.
  • the step of determining missing packets according to their identifiers allows redundant data to be regenerated more accurately at the output of the link.
  • the output of the link is able to determine how many packets were suppressed at the input to the link, thus maintaining bit count integrity between the data arriving at the input of the link and the data flowing out of the output of the link.
  • the regenerated data may be placed in packets for onward transmission across a further telecommunications link. Alternatively, it may be simply be regenerated, such as where the regeneration is performed at the interface between a packet-based network and a non-packet network.
  • the step of determining packets which contain redundant data comprises identifying a sequence of consecutive packets containing data that follows a predictable pattern and transmitting only the first packet or packets in the sequence.
  • the input identifies a sequence of packets containing the same data.
  • Each packet may comprise a plurality of identical units, such as an idle data flag, an alarm flag, or a group of data bytes. Rotated versions of the flags may be identified, the rotation being caused by the flags not being aligned exactly with the bytes of the packet payload.
  • Another pattern which may be identified is a ramp in data values.
  • the step of determining packets which contain redundant data examines only the portion of the packet containing user data. This allows the technique to work with partially-filled cells, such as are used in delay-sensitive applications.
  • the packet identifiers of a sequence of packets are a sequence of symbols and the step of determining missing packets according to the identifiers of received packets comprises identifying missing symbols in the sequence of identifiers of received packets.
  • Consecutive packets in a sequence have different identifier values, and the identifier values of a sequence of packets are preferably an incremental sequence.
  • the packet identifier is preferably a number, but it may alternatively be some other symbol.
  • the sequence of identifier values should be known by the output of the link so that the output can correctly identify missing packets which have been suppressed by the input.
  • the packet identifiers of a sequence of packets may be a recurring sequence of N symbols.
  • the input transmits at least one packet in every N packets such that the output can determine the exact number of missing packets. This ensures bit count integrity between the input to the link and the output of the link.
  • One example of a protocol in which the packet identifiers of a sequence of packets are a recurring sequence of N symbols is the ATM AAL1 protocol.
  • the identifier values of a sequence of consecutive packets are the recurring set of sequence numbers 0,1 ,2,3,4,5,6,7.
  • data for the missing packets is generated according to data carried in other packets received at the output.
  • the data for the missing packets is generated according to data carried in received packets preceding the missing packets, and in its simplest form replicates data carried in received packets preceding the missing packets.
  • Preferably data is generated for a missing packet only if the missing packet follows one or more packets whose pattern of data indicates that the missing packet may not have been transmitted across the link.
  • the packet preceding the missing packet may have a payload of data comprising a plurality of identical units, such as a sequence of idle flags; or a repeating pattern of n data bytes.
  • the missing packet may be preceded by two cells having identical payloads.
  • the output may store data patterns such as commonly occurring flags or byte patterns, for use in matching with received data.
  • Updated pattern information, for use in pattern matching may be sent to the output by the input or by a network management unit via a management communications channel.
  • Another aspect of the invention provides a method of operating an output of a telecommunications link on which bandwidth is being minimised by not transmitting packets containing redundant data comprising the steps of:
  • a further aspect of the invention provides apparatus for minimising bandwidth used on a telecommunications link comprising, at an input to the link:
  • a still further aspect of the invention provides apparatus for use at an output of a telecommunications link on which bandwidth is being minimised by not transmitting packets containing redundant data comprising:
  • bandwidth-saving feature with reference to an ATM network carrying constant bit rate services.
  • the invention has more general application to other packet, cell or frame-based transport mechanisms such as Switched Multimegabit Data Service (SMDS) or Connectionless Broadband Data Service (CBDS).
  • SMDS Switched Multimegabit Data Service
  • CBDS Connectionless Broadband Data Service
  • the bandwidth-saving feature is not limited to being used with packets carrying constant bit rate traffic, but can also be used with packets carrying variable bit rate traffic.
  • the packets, cells or frames may be full of user data or they may be only partially filled, such that part of a packet contains user data and the remainder of the packet contains padding data. Partial filling is a technique which is often used in delay-sensitive applications where it is undesirable to wait to fill an entire packet with user data.
  • Figure 1 shows terminal equipments which are interconnected by a conventional time-division multiplexed network
  • FIG. 2 shows terminal equipments which are interconnected by an ATM network
  • FIG 3 shows an example of a telecommunications network in which the invention may be used
  • Figure 4 shows the interworking part (IWF) of figure 3 in more detail
  • Figure 5 shows the format of cells which can be transmitted over the network of figure 3;
  • Figure 6 is an overview of the bandwidth-saving feature
  • Figure 7 shows one example of the bandwidth-saving feature
  • Figure 8 shows another example of the bandwidth-saving feature
  • Figure 9 is a flow-chart to illustrate the suppression algorithm performed at the ingress of the ATM network;
  • Figure 10 shows one way of inspecting the payload of a cell;
  • Figure 11 is a flow-chart to illustrate the marking algorithm performed at the egress of the ATM network
  • Figure 12 is a state machine for one way of performing the regeneration algorithm at the egress of the ATM network.
  • Figure 3 shows a communications network having a number of communications sources (video codec 30, PBX 34, Router 35) connected to similar devices 60, 61 , 63 via a combination of a time-division multiplexed network and an ATM network 40, 45, 46.
  • video codec 30, PBX 34, Router 35 video codec 30, PBX 34, Router 35
  • a TDM Multiplexer 36 receives inputs from terminal equipment 31, PBX 34 and router 35. Each input comprises a data signal which is a multiple of
  • Multiplexer 36 multiplexes the inputs into a time division multiplexed output data stream, such as a Plesiochronous Digital Hierarchy (PDH) DS1 or E1 link.
  • An interworking unit IWF 38 receives the data from the DS1/E1 links and packages it into a form for transmission over ATM network 40, 45, 46 to a further inter-working unit IWF 48.
  • IWF 48 converts the ATM packaged data to a form for onward transmission over a further DS1/E1 link to a further multiplexer 55.
  • Mux 55 demultiplexes the data for transmitting to equipment 58, 61 , 63.
  • equipments 30-36 may be sited at a customer's premises, and the ATM network may be part of a public network.
  • each input to Mux 36 must be a multiple of 64kbit/s.
  • video codec 30 generates data at a variable rate according to the activity and detail in a video picture.
  • Codec 30 connects to Mux 36 via a terminal equipment 31 which receives the variable bit rate data stream from codec 30 and generates a constant nx64bit/s output.
  • TE 31 achieves this by inserting idle flags into the data stream during idle periods.
  • an idle flag is represented by the byte '01111110'.
  • Idle periods may vary in length from being very short, such as where a video codec generates data at 30kbit/s but must be padded out to 64kbit/s, or very long, such as where a video conference has ended and codecs have been turned off but the connection has not been terminated.
  • Another condition which can occur is that a piece of terminal equipment, such as a telephone 33 generates an alarm signal, represented by a continuous stream of binary ones '11111 '.
  • TDM/ATM interworking units IWF The operation of the TDM/ATM interworking units IWF will now be described in more detail, with reference to figure 4.
  • the interworking unit enables users of PDH terminal equipment and services to operate over an ATM network, obtaining a Quality of Service (QoS) comparable with that offered by PDH-based networks.
  • QoS Quality of Service
  • This enables network operators to migrate to a broadband ATM network whilst continuing to offer support for existing PDH terminal equipment.
  • PDH data is transported via the ATM Adaptation Layer (AAL) type-1.
  • AAL ATM Adaptation Layer
  • AAL ATM Adaptation Layer
  • This service is tailored to continuous bit rate (CBR) services, known as class A, because it receives and delivers Protocol Data Units (PDUs) with the same constant bit rate to or from the next higher protocol layer.
  • CBR continuous bit rate
  • PDUs Protocol Data Units
  • an entire PDH bit stream including the frame overhead bit(s), is conveyed point-to-point across the ATM network without interpretation using ATM Adaptation Layer type-1 (AAL1) cells sharing a single virtual channel across the ATM network.
  • AAL1 ATM Adaptation Layer type-1
  • the complete PDH bit stream is inserted into the SAR-PDU payload of AAL1 cells without regard to ATM-PDH octet alignment.
  • the ATM network bandwidth demands can be reduced as the data from selected PDH time slots, corresponding to particular Nx64kb/sec services, is transported from the incoming PDH frames across the ATM network.
  • Each Nx64kb/sec service uses a separate virtual channel across the ATM network. Data from particular PDH time slots is inserted into the SAR-PDU payload of AAL1 cells.
  • the interworking unit is shown with one DS1 or E1 Plesiochronous Digital Hierarchy (PDH) interface 105 coupled to a single ATM Adaptation Layer type-1 (AAL1) processing function within the AAL1 Processing module 130.
  • PDH Plesiochronous Digital Hierarchy
  • AAL1 ATM Adaptation Layer type-1
  • the AAL1 Processing module is connected to separate ingress and egress ATM cell interfaces 140, 145.
  • PDH data received from each PDH interface is optionally framed and passed to the timeslot and queue function.
  • the incoming data bytes are assigned to channel queues according to their port and timeslot.
  • CAS Channel Associated Signalling
  • the amount of data may be a full cell payload or a partial cell payload depending on whether partial filling is being used.
  • a PDH service interface When a PDH service interface is operating in unstructured mode, all the receive data is placed directly in a single virtual channel queue.
  • the AAL1 processor 130 may add a pointer field to the data structure while generating AAL1 Segmentation and Reassembly Protocol Data Units (SAR- PDUs) which are then placed within cells, together with control and optional timing information.
  • a separate Virtual Path Identifier (VPI)/Virtual Channel Identifier (VCI) in the ATM cell header is used for cells of each service.
  • the cells from each AAL1 processing function are then passed to an ingress ATM cell interface 140 where the ingress part of the bandwidth-saving feature is performed by a redundant data identification block and a cell suppression block. ATM cells are then queued for transmission over the ATM network.
  • a pattern identification block identifies cells containing data having a predetermined pattern, and marks these cells.
  • the cells are then routed to an AAL1 processing function, via an internal cell demultiplexer, in accordance with the VCI/VPI labels contained in their ATM cell headers.
  • the SAR-PDU is extracted and the recovered PDH data is placed within a 'play-back', or reassembly buffer which is read at a rate determined by either an external clock reference, or timing information recovered from the Protocol Control Information (PCI) held within the SAR-PDU header.
  • PCI Protocol Control Information
  • FIG. 5 shows the structure of cells used in one format of AAL1 transmission.
  • ATM cells are 53 bytes long with a 5 byte ATM cell header and a 48 byte payload.
  • the ATM cell header CH includes information which determines the routing of the cell through the ATM network, i.e. the virtual channel.
  • the payload portion of the AAL1 cell comprises 46 or 47 bytes of constant bit-rate data (depending on the AAL1 format used) and a 1 or 2 byte AAL1 header.
  • the AAL1 header includes a sequence number SN and protection for the sequence number SNP. Within the sequence number block SN there is a sequence count SC which contains a value of 0, 1 , 2, 3, 4, 5, 6 or 7. For a particular virtual channel, consecutive cells in time have consecutive sequence numbers.
  • Consecutive cells have the sequence numbers 0, 1 , 2, 3, 4, 5, 6, 7, 0, 1 , 2.... i.e. the sequence number repeats after every 8 cells.
  • the count of sequence numbers for each virtual channel across the ATM network is independent of the count used on other virtual channels.
  • Figure 6 gives an overview of the process for saving bandwidth in the ATM network. The effect of the bandwidth-saving process on a small group of cells is shown at various points in the system.
  • Ingress ATM cell interface 140 identifies cells which contain redundant data, and suppresses them i.e. does not transmit them. This reduced group of cells is transmitted across the ATM network.
  • ATM interface 145 identifies cells which contain data having a particular pattern, such as cells containing a string of idle flags. These cells are marked (M). Missing cells are identified by examining the sequence numbers of received cells. Cells which were suppressed by the ingress ATM cell interface 140 are regenerated by the egress AAL1 cell processor 130. Cells are only regenerated when they are preceded by a marked cell, to avoid errors caused by regenerating data for cells which are missing due to reasons other than being suppressed at the ingress.
  • the egress IWF therefore outputs the same number of bits as were originally input at the ingress, these bits having exactly the same content as those originally input at the ingress.
  • redundant data examples include: - cells containing the same pattern of data bits or bytes; cells containing idle flags, where a source has become idle, but is transmitting idle flags to maintain a constant bit rate; cells containing alarm flags, where a source has a fault and transmits a stream of alarm flags.
  • the suppression method works by identifying one or more cells which contain a payload of data that follows a predetermined or predictable pattern.
  • the embodiment described here in detail identifies consecutive cells having identical payloads.
  • the first of the cells which contain the same data is sent and the subsequent matching cells are suppressed.
  • suppressed cells are identified by checking the sequence number of each received cell.
  • a cell which has been suppressed at the ingress results in a missing cell sequence number in the stream of cells received at the egress.
  • Data for a suppressed cell is regenerated by copying the payload content of a received cell which preceded the missing cell.
  • Figures 7 and 8 show two examples of cell suppression and regeneration. For clarity, these examples show a simplified case where there are only four numbers in the list of cell sequence numbers.
  • the cells having the sequence numbers 2 and 3 contain the same data.
  • the cell having sequence number 2 is transmitted and the cell having sequence number 3 is suppressed, such that the cells having the sequence numbers 1 , 2, 4, 1 , 2... are transmitted by the ingress and received at the egress.
  • the egress it is recognised that a cell having sequence number 3 is missing, and that cell together with its payload of data is regenerated.
  • Figure 8 shows an example where each cell in a long stream of cells contains the same pattern of data.
  • the first cell, having sequence number 1 is transmitted and the cell having sequence number 2 is suppressed.
  • the above examples show how cells which carry the same payload of data can be suppressed.
  • cells having payloads of data which follow a predetermined, or predictable, pattern can be suppressed.
  • the ingress looks for data following a predetermined pattern, suppresses redundant cells and the egress regenerates data based on the payload of the received cell preceding the missing cell and a generator which operates using the same rules as used in the ingress pattern matching unit.
  • One method of performing suppression at the ingress is now described with reference to figure 9. This method identifies cells having identical payloads and where the payload of each cell comprises a set of identical bytes.
  • a check is made as to whether the suppression feature is enabled.
  • the suppression feature is provisionable on a per-channel basis.
  • step 310 the payload of a cell is examined to see if all of its bytes are identical. If a cell is only partially filled with user data, it is only the part of the cell carrying user data that is examined. If the bytes are all the same, the method proceeds to step 310 where a check is made as to whether all of the payload bytes of the previous cell were identical. A flag 'Previous Match' indicates whether this is so. If so, the method proceeds to step 330 where a check is made whether the payload of this cell is the same as the previous cell. This is achieved by comparing the Payload Pattern of this cell with the previous one. If this is true, then the current cell matches the previous one identically, and could be suppressed.
  • the last check is to check whether seven consecutive cells have already been suppressed. If less than seven cells have been suppressed, the cell under test is suppressed and a match counter is incremented, to track the number of suppressed cells. The purpose of this last step is to ensure that one cell in every eight is transmitted so that the egress can identify the correct number of missing cells, as explained earlier with reference to figure 8. If the answer to tests 310, 320, 330 are false then the match counter is set to zero and the cell under test is sent.
  • each byte of a cell will be the same. This may be the HDLC idle flag '01111110' or some rotated version of this flag such as '11001111'. Rotation is caused by incoming data bytes not being aligned with the bytes of the AAL1 cell payload.
  • Figure 10 shows the process for checking whether all of the bytes in a cell's payload are the same, and equal to a predetermined byte such as an idle flag. The first byte D1 of the payload after the sequence number SN is compared with the idle flag byte in each of its rotated orientations until a match is found. All other payload bytes (D2, D3.... D47) are also compared with the provisioned byte in the same orientation.
  • the method just described looks for cells which contain an identical set of data bytes.
  • the byte could be a commonly occurring byte such as an idle flag which is stored at the ingress for ready comparison with the data, or any other byte which occurs.
  • the ingress and egress should be able to identify a wide range of patterns representative of redundant data in the data carried in cell payloads. Some other patterns will now be described.
  • the method described above for checking a single byte can be extended to look for repeating patterns of n bytes in length.
  • a set of commonly occurring patterns can be stored in a look-up table at the ingress for ready comparison with the cell data, or the ingress can examine the cell data to look for any repeating data pattern.
  • the egress pattern identification block similarly examines the data in received cells to identify repeating n byte patterns so as to mark the cell.
  • Consecutive cell payloads (not necessarily made up of a set of identical data bytes) can be examined to look for a match. There are two possibilities:
  • the ingress has a look-up table of data payloads that are compared with the incoming data. If a match is found then the ingress sends the first cell and suppresses the subsequent ones. At the egress the received cell payloads are compared with a similar look-up table. When a cell payload matches one of the stored payloads it is marked and if it is followed by a missing cell, the egress knows to replicate the cell payload.
  • the ingress identifies that there are identical cell payloads and sends the first two cells and suppresses subsequent ones in the sequence.
  • the egress receives two consecutive identical cell payloads followed by one or more missing cells.
  • the egress is programmed to recognise this, and replicates the last received payload. If only one cell were sent, the egress would not be able to identify that there was a pattern in the data and would therefore not regenerate any data for the missing cells.
  • two consecutive cells at the ingress contain data which uniformly increases in magnitude (i.e. a data ramp), and the ingress is set to recognise this pattern as redundant data.
  • the first cell is transmitted and the second cell is suppressed.
  • the egress is also set to identify cells which contain data that uniformly increases in magnitude.
  • the egress Upon receiving a cell in which the payload uniformly increases in magnitude followed by one or more missing cells the egress is able to regenerate the missing data by applying the rule of calculating data for the missing cells that uniformly increases in value, continuing on from the data contained in the last received cell.
  • the process of regenerating cells comprises the processes of: - inspecting the data payload of a cell to check whether it contains a pattern of data (e.g. a payload of identical bytes) which indicates that it may be followed by a missing cell; and, - looking for missing cell sequence numbers.
  • a pattern of data e.g. a payload of identical bytes
  • a missing sequence number preceded by a cell having a payload of identical bytes indicates that a cell has been suppressed with a high degree of reliability.
  • the data regeneration block in AAL1 processor 130 is informed of the data pattern that was matched to allow it to accurately regenerate the data.
  • a cell having a payload of identical bytes is marked.
  • One way in which a cell can be identified as 'marked' is to use a flag at a predetermined bit position in one of the bytes of the ATM cell header.
  • the egress pattern identification block 145 may receive information about new data patterns from the ingress or from a network management function using proprietary management communication channels. For example, where the ingress is aware that it is sending, or will be sending, repeated identical payloads of a particular data pattern it can inform the egress of this pattern, thereby allowing the egress to identify this pattern.
  • a state machine for processing received cells will now be described with reference to figure 12.
  • This state machine is based on the Fast SN algorithm for sequence number processing described in ITU 1.363.1 Appendix III.
  • the state machine described in this appendix describes how to deal with events where a cell is lost or misinserted, and in the case where a cell is missing inserts a dummy cell.
  • a decision in this algorithm is taken immediately after the analysis of the received cell. This means that when a cell is received the SN is immediately evaluated and the cell is eventually passed to the final destination to minimise transmission delay. In the state machine the action always refers to the last cell received.
  • a valid SN is defined as an SN which has no detected errors or it had an error that was corrected.
  • a Match cell is a cell which has been marked as a match by the ATM interface logic.
  • the payload is the provisioned dummy data byte.
  • suppressed cells are regenerated the payload is the same as the previously received matched cell.
  • the number of cells to be inserted can be calculated from the gap in the sequence number series. For example, receiving cells with the sequence numbers:
  • 1 2 3 7 0 ideally requires 3 cells to be inserted in between the cells having sequence numbers 3 and 7.
  • the sequence counting is not synchronized yet. if the SC is in sequence with the previous one, it goes to SYNC (No Match) or SYNC (Match) as appropriate; the received cell is accepted; • if the SC is out of sequence and not a match then remain in this state, discarding the received cell; if the SC is out of sequence and a match goto OUT;OF SYNC (Match), discarding the received cell; if the SN is invalid return to START, discarding the received cell;
  • sequence counting is considered to be synchronized: if the SC is in sequence with the previous one and the cell is not a match then remain in this state accepting the received cell; if the SC is in sequence with the previous one and the cell is a match, goto SYNC (Match) and accept the received cell; if the SC is not in sequence with the previous one and the cell is not a match, goto OUT OF SEQUENCE (No Match) accepting the received cell; if the SC is not in sequence with the previous one and the cell is a match, goto SYNC (Match) inserting dummy cells and accepting the received cell; if the SN is invalid then goto INVALID (Match) or INVALID (No Match) as appropriate, accepting the received cell;
  • the SN if the SN is invalid, discard the received cell and goto START; • if the SN is valid and the SC is in sequence with the last cell received with a valid SN, goto SYNC (Match) or SYNC (No Match) as appropriate; the received cell is considered to be misinserted and is discarded to keep bit count integrity because the previous cell is considered to be misinserted but is already sent; * if the SN is valid and the SC is in sequence with the SC of the previous cell, the system assumes that cells were lost; insert dummy cells, accept the received cell and goto SYNC (Match) or SYNC (No Match) as appropriate; if the SC is valid and the SC has a value exceeding by two the SC value of the last cell received in sequence (i.e. the SN error protection mechanism has failed) assume that the received cell was in sequence and therefore accept the received cell and goto SYNC (Match) or SYNC (No
  • the system shall take the following decisions on the received cell: if the SN is again invalid, goto START and discard the received cell; if the SN is valid and the SC is in sequence with the last cell received with a valid SN, goto SYNC (Match) or SYNC (No Match) as appropriate, but discard the received cell to keep bit count integrity because the previous cell is considered to be misinserted but is already sent; if the SN is valid and the SC has a value exceeding by two the SC of the last cell received with a valid SN, it is assumed that although there was an invalid SN the received cell is in sequence so therefore accept it and goto SYNC (Match) or SYNC (No Match) as appropriate; • if the SN is valid but is not in any of the previous situations, discard the received cell and goto OUT OF SYNC (Match) or OUT OF SYNC (No Match) as appropriate; h) INVALID (Match)

Landscapes

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

Abstract

L'invention concerne un procédé de réduction de la largeur de bande utilisée sur une liaison de télécommunication. Ce procédé comporte, au niveau d'une donnée d'entrée destinée à la liaison, les étapes suivantes qui consistent à recevoir une pluralité de paquets de données, chaque paquet contenant des données et un identificateur de paquets; à déterminer quels paquets contiennent des données redondantes; à transmettre, par l'intermédiaire de la liaison, les paquets qui ne contiennent pas de données redondantes. Ce procédé comporte en outre les étapes consistant, au niveau d'une sortie de la liaison de télécommunications, à recevoir les paquets transmis; à déterminer quels sont les paquets manquants en fonction des identificateurs de paquets reçus; et à générer les données concernant les paquets manquants, lesquelles données générées correspondent aux données redondantes non transmises par l'intermédiaire de la liaison. Ce procédé assure l'intégrité du nombre de bits entre l'entrée et la sortie de la liaison. Les données redondantes peuvent être des données suivant une configuration prévisible, telles que des données identiques. Lorsque les identificateurs de paquets sont une séquence récurrente de N symboles, l'entrée transmet au moins un paquet tous les N paquets.
PCT/GB1998/001243 1997-05-02 1998-04-29 Suppression et regeneration de donnees WO1998051113A2 (fr)

Priority Applications (4)

Application Number Priority Date Filing Date Title
EP98919334A EP0979566B1 (fr) 1997-05-02 1998-04-29 Suppression et regeneration de donnees
DE69827379T DE69827379T2 (de) 1997-05-02 1998-04-29 Datenunterdrückung und -regenerierung
CA002285333A CA2285333A1 (fr) 1997-05-02 1998-04-29 Suppression et regeneration de donnees
AU72211/98A AU7221198A (en) 1997-05-02 1998-04-29 Data suppression and regeneration

Applications Claiming Priority (4)

Application Number Priority Date Filing Date Title
GBGB9709110.2A GB9709110D0 (en) 1997-05-02 1997-05-02 Data suppression & regeneration
GB9709110.2 1997-05-02
US08/896,380 US6038231A (en) 1997-05-02 1997-07-18 Data suppression and regeneration
US08/896,380 1997-07-18

Publications (2)

Publication Number Publication Date
WO1998051113A2 true WO1998051113A2 (fr) 1998-11-12
WO1998051113A3 WO1998051113A3 (fr) 1999-02-11

Family

ID=26311490

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/GB1998/001243 WO1998051113A2 (fr) 1997-05-02 1998-04-29 Suppression et regeneration de donnees

Country Status (5)

Country Link
EP (1) EP0979566B1 (fr)
AU (1) AU7221198A (fr)
CA (1) CA2285333A1 (fr)
DE (1) DE69827379T2 (fr)
WO (1) WO1998051113A2 (fr)

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2001037599A1 (fr) * 1999-11-17 2001-05-25 Eci Telecom Ltd. Accroissement de la capacite des canaux dans des reseaux cellulaires fixes
WO2001047199A1 (fr) * 1999-12-21 2001-06-28 Telefonaktiebolaget Lm Ericsson (Publ) Procede et appareil de transmission transparente entre un reseau amrt et un reseau de paquets ou de cellules
WO2004110000A1 (fr) * 2003-06-05 2004-12-16 Telefonaktiebolaget Lm Ericsson (Publ) Reduction de la largeur de bande dans des reseaux commutes par paquet en n'envoyant pas d'intervalles de temps au repos
WO2006104638A2 (fr) 2005-03-28 2006-10-05 Cisco Technology, Inc. Systeme et procede destines a mettre en oeuvre une suppression et une recreation dynamiques de donnees dans un environnement de communication
US7376567B2 (en) 2004-02-16 2008-05-20 Celtro Ltd Method and system for efficiently transmitting encoded communication signals

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5020058A (en) * 1989-01-23 1991-05-28 Stratacom, Inc. Packet voice/data communication system having protocol independent repetitive packet suppression
JPH06164629A (ja) * 1992-11-26 1994-06-10 Fujitsu Ltd データ転送方式
US5535200A (en) * 1994-05-05 1996-07-09 Sprint Communications Company L.P. Signaling system for a telecommunications network
US5555244A (en) * 1994-05-19 1996-09-10 Integrated Network Corporation Scalable multimedia network
EP0756267A1 (fr) * 1995-07-24 1997-01-29 International Business Machines Corporation Méthode et système pour enlever des silences dans la communication vocale
US5600316A (en) * 1985-01-10 1997-02-04 Moll; Edward W. Data compression by removing repetition and unnecessary information

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5600316A (en) * 1985-01-10 1997-02-04 Moll; Edward W. Data compression by removing repetition and unnecessary information
US5020058A (en) * 1989-01-23 1991-05-28 Stratacom, Inc. Packet voice/data communication system having protocol independent repetitive packet suppression
JPH06164629A (ja) * 1992-11-26 1994-06-10 Fujitsu Ltd データ転送方式
US5535200A (en) * 1994-05-05 1996-07-09 Sprint Communications Company L.P. Signaling system for a telecommunications network
US5555244A (en) * 1994-05-19 1996-09-10 Integrated Network Corporation Scalable multimedia network
EP0756267A1 (fr) * 1995-07-24 1997-01-29 International Business Machines Corporation Méthode et système pour enlever des silences dans la communication vocale

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
PATENT ABSTRACTS OF JAPAN vol. 018, no. 486 (E-1604), 9 September 1994 & JP 06 164629 A (FUJITSU LTD), 10 June 1994 *
T ODA ETAL: 1989 AUTUMN NATIONAL CONVENTION RECORD IEICE, vol. b173, no. 3, 12 September 1989, page 22 XP002081019 Japan *

Cited By (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2001037599A1 (fr) * 1999-11-17 2001-05-25 Eci Telecom Ltd. Accroissement de la capacite des canaux dans des reseaux cellulaires fixes
USRE39990E1 (en) 1999-11-17 2008-01-01 Celtro Ltd. Increasing channel capacity in fixed cellular networks
WO2001047199A1 (fr) * 1999-12-21 2001-06-28 Telefonaktiebolaget Lm Ericsson (Publ) Procede et appareil de transmission transparente entre un reseau amrt et un reseau de paquets ou de cellules
ES2204342A1 (es) * 1999-12-21 2004-04-16 Telefonaktiebolaget Lm Ericsson (Publ) Metodo y aparato para transmision transparente entre redes tdm y una red basada en paquetes o celulas.
WO2004110000A1 (fr) * 2003-06-05 2004-12-16 Telefonaktiebolaget Lm Ericsson (Publ) Reduction de la largeur de bande dans des reseaux commutes par paquet en n'envoyant pas d'intervalles de temps au repos
US7292546B2 (en) 2003-06-05 2007-11-06 Telefonaktiebolaget Lm Ericsson (Publ) Bandwidth reduction within packet switched networks by not sending idle timeslots
US7376567B2 (en) 2004-02-16 2008-05-20 Celtro Ltd Method and system for efficiently transmitting encoded communication signals
WO2006104638A2 (fr) 2005-03-28 2006-10-05 Cisco Technology, Inc. Systeme et procede destines a mettre en oeuvre une suppression et une recreation dynamiques de donnees dans un environnement de communication

Also Published As

Publication number Publication date
WO1998051113A3 (fr) 1999-02-11
DE69827379T2 (de) 2005-03-17
EP0979566B1 (fr) 2004-11-03
AU7221198A (en) 1998-11-27
CA2285333A1 (fr) 1998-11-12
DE69827379D1 (de) 2004-12-09
EP0979566A2 (fr) 2000-02-16

Similar Documents

Publication Publication Date Title
US6038231A (en) Data suppression and regeneration
JP3834678B2 (ja) ハイブリッドａｔｍアダプテーション・レイヤ
US6148001A (en) Multipoint-to-point system which multiplexes complete packets comprised of ATM cells on to a single virtual channel connection
US6747977B1 (en) Packet interface and method of packetizing information
US5878045A (en) Method and apparatus for converting data streams in a cell based communications system
EP0909108B1 (fr) Méthode et dispositif pour l' interfonctionnement des formats de la couche d'adaptation ATM
US6519261B1 (en) Asynchronous transfer mode adaptation arrangements
WO1997038550A1 (fr) Segmentation en minicellules et reconstitution des paquets
US7349393B2 (en) Method and system for implementing an improved universal packet switching capability in a data switch
JPH08214010A (ja) ユーザパケットの多重化方法
US20040028051A1 (en) System and method for implementing combined packetized TDM streams and TDM cross connect functions
WO2003075499A1 (fr) Module de port atm avec une interface de commutation ethernet integree
JP2005253077A (ja) Ａｔｍデータをリアルタイムで再組立するシステム、方法、およびプログラム
JPH10303941A (ja) 統計的多重化を使用する可変長ミニパケットの直列データ送信
US6028861A (en) Method and apparatus for performing packet synchronized switch-over
US7254134B2 (en) Systems for transferring various data types across an ATM network
JPH08214009A (ja) 広帯域セルのペイロード生成方法
US6804229B2 (en) Multiple node network architecture
US5970068A (en) Telecommunication system with transport protocol device for mixing asynchronous signaling traffic with TDM traffic on a TDM backbone
US6788703B2 (en) DS0 on ATM, mapping and handling
EP0979566B1 (fr) Suppression et regeneration de donnees
US6885661B1 (en) Private branch exchange built using an ATM Network
US6778538B2 (en) Virtual junctors
US6721326B1 (en) Cell multiplexing system and method for an ATM network
JP2742004B2 (ja) Ａｔｍ交換網におけるノード間試験方式

Legal Events

Date Code Title Description
AK Designated states

Kind code of ref document: A2

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

AL Designated countries for regional patents

Kind code of ref document: A2

Designated state(s): GH GM KE LS MW SD SZ UG ZW AM AZ BY KG KZ MD RU TJ TM AT BE CH CY 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)
AK Designated states

Kind code of ref document: A3

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

AL Designated countries for regional patents

Kind code of ref document: A3

Designated state(s): GH GM KE LS MW SD SZ UG ZW AM AZ BY KG KZ MD RU TJ TM AT BE CH CY 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

121 Ep: the epo has been informed by wipo that ep was designated in this application
WWE Wipo information: entry into national phase

Ref document number: 1998919334

Country of ref document: EP

ENP Entry into the national phase

Ref document number: 2285333

Country of ref document: CA

Ref country code: CA

Ref document number: 2285333

Kind code of ref document: A

Format of ref document f/p: F

WWP Wipo information: published in national office

Ref document number: 1998919334

Country of ref document: EP

REG Reference to national code

Ref country code: DE

Ref legal event code: 8642

NENP Non-entry into the national phase

Ref country code: JP

Ref document number: 1998547816

Format of ref document f/p: F

WWG Wipo information: grant in national office

Ref document number: 1998919334

Country of ref document: EP