GB2344029A - Transmission of data packets of different size and priority - Google Patents

Transmission of data packets of different size and priority Download PDF

Info

Publication number
GB2344029A
GB2344029A GB9821555A GB9821555A GB2344029A GB 2344029 A GB2344029 A GB 2344029A GB 9821555 A GB9821555 A GB 9821555A GB 9821555 A GB9821555 A GB 9821555A GB 2344029 A GB2344029 A GB 2344029A
Authority
GB
United Kingdom
Prior art keywords
data
packet
network
data packet
packets
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Withdrawn
Application number
GB9821555A
Other versions
GB9821555D0 (en
Inventor
David Banes
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
GEN DATACOMM ADV RES
General Datacomm Inc
Original Assignee
GEN DATACOMM ADV RES
General Datacomm Inc
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by GEN DATACOMM ADV RES, General Datacomm Inc filed Critical GEN DATACOMM ADV RES
Priority to GB9821555A priority Critical patent/GB2344029A/en
Publication of GB9821555D0 publication Critical patent/GB9821555D0/en
Priority to PCT/US1999/022653 priority patent/WO2000020876A1/en
Publication of GB2344029A publication Critical patent/GB2344029A/en
Withdrawn legal-status Critical Current

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic control in data switching networks
    • H04L47/10Flow control; Congestion control
    • H04L47/24Traffic characterised by specific attributes, e.g. priority or QoS
    • H04L47/2408Traffic characterised by specific attributes, e.g. priority or QoS for supporting different services, e.g. a differentiated services [DiffServ] type of service
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic control in data switching networks
    • H04L47/10Flow control; Congestion control
    • H04L47/24Traffic characterised by specific attributes, e.g. priority or QoS
    • H04L47/245Traffic characterised by specific attributes, e.g. priority or QoS using preemption
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic control in data switching networks
    • H04L47/10Flow control; Congestion control
    • H04L47/43Assembling or disassembling of packets, e.g. segmentation and reassembly [SAR]

Landscapes

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

Abstract

The transmission of a lower priority data packet over a network is interrupted so that a data packet of a higher priority can be transmitted, after which the transmission of the lower priority data packet is resumed. A code is inserted into the lower priority packet signifying interruption. Interruption may be decline if a count of interrupions reaches a maximum count. Data packets have a length or type field in the header signifying long or short packets. The packet size is selected according to voice or data applications. Application is to ATM or Ethernet networks.

Description

2344029 COMMUNICATION NETWORK The present invention relates to a data
communication network.
There are a number of data communication protocols in common usage.
As is well-known, a data communication protocol is defined as a series of hierarchal layers, the lowest layer defining the physical characteristics of the transfer medium (for example cable or fibre optic), and higher levels defining software interfacing to applications.
One example of a known communications network is an Ethernet network. In such a network data is transported in packets of a variable length of up to approximately 1500 bytes. This type of network is well suited to local area network (LAN) applications for transferring computer data files or for transferring TCP/IP data, which is generally transferred in large blocks. It is not, however, as well suited to voice or to telecommunications networks in which data needs to be switched rapidly and frequently between destinations.
Another example of a network is an ATM network. In such a network, data is transmitted in fixed length cells of 53 bytes, 48 bytes of which contain the data or "payload" and 5 bytes of which contain a header. Because of the small size of the packets, packets can be readily switched between several different destinations, and the network is well suited to the needs of telecommunications and voice traffic. Larger blocks of data can be accommodated simply by transmitting them over a series of ATM packets.
ATM networks have been successfully used to carry both voice and computer data. The small size of the packets enables efficient statistical multiplexing.
In both the above prior art systems, the data packets are of a fixed maximum length. Division of a long data block into separate packets is performed at a higher level, by software.
The inventor has appreciated that, whilst an ATM network can provide 2 an efficient and effective network for transmitting both voice and data, efficiency can be impaired when large amounts of data are transmitted. On the other hand, a network such as an ethernet may cause unacceptable delays between packets and cannot readily be used for voice traffic. Accordingly, it is an aim of the present invention to provide a network which can efficiently transfer both voice and computer data or which can transfer large blocks of data efficiently without unduly delaying transit of smaller or more important data packets.
In a first method aspect, the invention provides a method of communicating data over a network comprising transmitting a first data packet, receiving a higher priority data packet, interrupting transmitting the first data packet to transmit the higher priority data packet, and resuming transmission of the first data packet.
In this way, large blocks of data can be efficiently transmitted, without incurring the overhead associated with splitting them into several smaller packets, but without creating a bottleneck and holding up more urgent data.
Preferably interrupting transmission comprises sending a special code to signify interruption. For example, in the case of high speed Ethernet, 10 bit coding is used to carry 8 bit data, and an unused code can be used to flag an interruption.
Interruptions may be nested and a variety of priority levels may be provided. Preferably, however, only two priority levels are provided, as this reduces the risk of multiple interruptions and possible corruption of a long data packet.
A count may be kept of the number of interruptions of a lower priority packet, and further interruptions may be denied after a maximum count is reached, or the priority threshold required for interruption may be increased.
3 This may prevent long data packets from being unduly delayed by multiple interruptions.
In a related apparatus aspect, the invention provides apparatus for communicating data over a network comprising means for transmitting a first data packet, means for receiving a higher priority data packet, means for interrupting transmitting the first data packet to transmit the higher priority data packet, and means for resuming transmission of the first data packet.
In a second method aspect, the invention provides a method of communicating data over a network comprising selecting one of at least two predetermined packet sizes based on the data type and transmitting a packet of the selected size over the network.
In this way, rather than using fixed length packets, a packet size is "intelligently" selected to be appropriate to the data being transmitted. For example, voice data may be transmitted in a relatively short packet, preferably of approximately 64 bytes or less, and other data may be transmitted in a relatively long packet, preferably of at least about 256 bytes, one kilobyte, or more. Of course, such a method may require a more complex routing system and physical arrangement, which must deal with data packets of different sizes. Surprisingly, however, an improvement in network performance may be gained by dividing data in this way prior to transmission.
The length of the data packet could be determined by routing and receiving components simply by monitoring data wave forms on the network.
More preferably, however, the method includes providing at least one flag bit indicating the length of the data packet, preferably in a header associated with the data packet.
As well as differing in size, the internal format of the packets may differ. For example, short packets may be similar to ATM cells and long packets may 4 be similar to Ethernet frames. Both types of packet may be packaged and efficiently transported over a common medium, and readily separated for transmission over dedicated networks.
In a second apparatus aspect, the invention provides a data network including means for transmitting data of a first type as a series of packets of a first length over a communication medium and means for transmitting data of a second type as packets of a second length over the same communication medium.
The network preferably further includes routing means connected to the communication medium for routing packets of both said first length and said second length.
By providing only a relatively limited discrete number of packet lengths, the advantages of hardware routing available in conventional networks which employ a fixed single packet length may still be attained with only a slight increase in router complexity. For example, if two packet lengths are provided only a single bit is required in the header to identify the packet as long or short.
A plurality of discrete packet lengths may, however, be provided.
Indeed, the packet length may be variable. However, with variable length data packets, some of the advantages of predicability of packet length and statistical multiplexing may be lost, and more complex routers, with a greater quantity of redundant buffer memory may be required.
In a third aspect, the invention provides a transmitter for connection to a communication network comprising means for selecting a data packet length from a plurality of predetermined packet lengths; means for providing a header for the data packet, the header including at least one flag bit indicating the length or format of the data packet; and means for transmitting the data packet over the communication medium.
In a fourth aspect, the invention provides a receiver for receiving data from a communication network, the receiver including means for reading a flag bit contained in the header of a data packet transmitted on the communication medium; means for determining the size or format of data packet to receive based on the information; and means for receiving a data packet of said size or format.
Embodiments of the invention will now be described by way of example with reference to the accompanying drawings in which:
Fig. 1 is a schematic diagram of data packets according to the second aspect of the invention; Fig. 2 is a schematic diagram of a computer network embodying the invention; Fig. 3 is a simplified schematic diagram of a switch for use in a network of Fig. 2; Fig. 4 is a schematic diagram of transmission of data packets according to the first aspect of the invention; and Fig. 5 is a schematic diagram of apparatus for implementing the transmission of Fig. 4.
An embodiment of the invention based on an ATM network will be described. Whilst this embodiment is based closely on ATM protocol, for ease of implementation by modification of existing ATM network components it is to be understood that the principles are applicable to other data formats.
Referring to Fig. I a data packet according to the invention comprises a header 10 and a data portion 20. The header comprises routing information 12 and a length or type field 14, which in this embodiment comprises a single bit signifying "long" or "short". The header may also contain information such as priority information.
6 The lengths of the short and long packets may be determined according to the intended application of the network. The short data packets are preferably adapted for voice communication and have a data portion of no more than about 64 bytes, preferably no more than about 48 bytes or even no more than about 32 or 16 bytes. The total length of a short packet including the header is preferably less than about 128 bytes. The long data packets are preferably significantly longer than the short data packets, preferably at least about 256 bytes, more preferably about 512, 1 K 2K bytes or more.
Advantageously, each long data packet is sufficiently long to contain a conventional disk block of a data file.
In this embodiment, the short data packets are very similar to the packets used in a conventional ATM network; this enables the embodiment to be implemented by modifying existing ATM network components. The flag bit may be anywhere in the packet, preferably in the header, and advantageously as early as possible in the header, to enable routing or identification of the packet to commence without substantial delay of the remainder of the packet.
In this embodiment, the flag bit is a single bit appended to the front of the packet, and this enables packets to be directed either to a conventional ATM router or to a modified "long ATM" router arranged to handle ATM-type packets having a data content of 1024 bytes in a similar way to a conventional router.
A network as shown in Fig. 2 includes a "short" packet assemblerld isassem bier 40 for interfacing a voice communication device such as a telephone 42 to the network. The short PAD 40 may receive signals in either analog or digital form from the telephone 42 and produces ATM-type packets with an additional initial flag bit signifying that the packet is a short packet. A single PAD 40 may be coupled to a plurality of voice input devices; in such a case, the PAD 40 is arranged to perform final routing of received packets to the appropriate voice terminal.
7 In a similar manner, a iong PAD 50 is arranged to receive data from the data input terminals such as a computer 52. This produces packets similar to conventional ATM packets, but having a considerably longer data field, and an initial flag bit indicating that the packet is long. Optionally, the packet may contain a cyclic redundancy check (CRC) or other error-correcting or error detecting information, either in the header, or appended to the data. Referring back to Figure 1, it will be noted that the header for the short packets and for the long packets is not necessarily of the same length, nor is it necessarily in the same format.
The above describ--d PADs 40, 50 are dedicated to either short or long packets. This may offer some advantages in terms of simplicity of hardware required.
In this embodiment, a network also includes a combined PAD 60, which incorporates a data type identifier, with a connection 62 for receiving combined data from a further telephone 42, a further computer 52, and a facsimile machine 64. The PAD 60 identifies the data, and in the case of voice data, assembles the data into short packets, but assembles data from the facsimile machine or computer 52 into long packets.
The three PADs 40, 50, 60 are connected to a multiplexer 70, which combines all packets, both short and long, for transmission along a common transmission medium 72, for example optical fibre, for example using a SONET protocol. It will appreciated that the multiplexer also serves as a demultiplexer, and performs routing of received data packets to the appropriate PAD. In this embodiment, transmission along the common transmission medium 72 is via separate physical optical fibres or received in transmifted data, as is conventional with ATM network.
It will be appreciated that the functions of the PAD and multiplexer may be distributed differently. For example, packets may be assembled and 8 dissembled directly within a telephone 42 or a computer 52.
Refening to Fig. 3, one possible implementation of a switch suitable for use in such a network will be described. This implementation has the advantage that it can readily be implemented with only minor modifications to conventional hardware. In the switch 80, an input stream of data is fed to a packet splitter 82. This identifies the incoming data cells as either short or long based on the contents of the additional type flag, strips the type flag from the packets, and produces separated streams of either short or long cells. In this embodiment, the short cells are identical to sta-ndard ATM cells, and the cells can be fed directly to a conventional ATM switch. In the simplified embodiment depicted, the switch has a single input, and two outputs, but, in a practical implementation, a complex multichannel switch, such as a General DataComm Apex switch or the like may be employed.
The long packets are fed to a "long ATM" switch. This behaves in a similar manner to a standard ATM switch, but is arranged to handle ATM- type packets having a longer data payload, for example of 1 K bytes. The long packets are routed in exactly the same manner as the short packets. Packets coming out of a first set of outputs of the ATM switch 84 and the "long ATM" switch 86 are combined iri a first re-packetizer 88a, to provide a first combined output of the switch. In the re-packetizer 88a, a type bit is added to each packet output from the ATM switch and the long ATM switch to regenerate packets of similar format to the input packets. In a similar manner, the second output of the ATM switch and the long ATM switch feed the second re packetizer 88b, which produces a second output. As will be appreciated further re-packetizers may be connected to further outputs of each of the switches. Likewise, for more than one input, each input would have an associated packet splitter.
An advantage of this arrangement is that the throughput capabilities of the ATM switch 84 and the long ATM switch 86 need not be the same. For 9 example, in a network in which predominately voice traffic is expected, the ATM switch may be a high bandwidth switch, and the long ATM switch may have a relatively low bandwidth. Then, if the amount of data traffic on the network increases, the long ATM switch 86 can be upgraded, without needing to upgrade the ATM switch 84. Of course, the packet splitter 82 and re packetizers 88 must be capable of handling the combined throughput for each input/output.
Another advantage with this arrangement is that, the environment seen by each ATM switch 84 is not distinguishable from a standard ATM environment. Indeed, the ATM switch can have inputs or outputs connected directly to a conventional ATM network, in addition to the inputs and outputs which pass through packet splitters and re-packetizers connected to the combined network. This may allow easy upgrading of a existing network, in which the added data-carrying functionality is "bolted on" to an existing ATM network, to enhance the data-carrying capacity of the network without rendering the existing network redundant. Similarly, dedicated data networks may be coupled directly to the long ATM switch 86. This may be useful, for example for connecting a large scale "local" area network directly into the combined network.
It has been previously mentioned that the long and short packets need not necessarily be of similar format. In an alternative implementation, the long data packets may be of similar format to Ethernet data packets, and the packets output by the packet splitter 82 may be of standard Ethernet packet format. In such an embodiment, the switch 86 may be based on a conventional Ethernet router, and may be connected directly into one or more Ethernet local area networks.
It will appreciated that the above embodiments are purely exemplary, and a number of variations may be made.
For example, if two flag bits are used to signify packet type, this allows four different types of data packet to be sent. One type could be optimised for voice, another optimised for, for example compressed video (for example MPEG-2), another for computer data file transfer, and a fourth for interactive computer data. Alternatively, three fixed length data types and a fourth variable data type could be used, to facilitate transfer of long data blocks. The variable length data packet would, of course, include a length field in the packet header. As mentioned above, a potential drawback of using variable length data packets is that more complicated hardware may be required to perform hardware routing.
An alternative possibility would be to have a slightly larger number of discrete fixed packet lengths. For example, three bits could encode eight different discrete lengths, and the precise lengths could be arbitrary if a look up table were used to correlate the data type identifier bits to the packet length. If look-up tables are used to correlate packet length to the indicator bits, the look-up tables could be soft-coded, and could be updated dynamically in response to changes in network requirements. For example, traffic analysis software may be used to determine optimum packet sizes based on network usage history, and sizes could be adjusted by sending housekeeping cells to all devices connected to the network to effect an update in packet size. In such an arrangement, it would be preferable to have indicator bits capable of encoding more packet lengths than are used at any one time on the network.
For example three bits may be used to encode packet size, but only four different packet sizes may be used at any one time. Assuming that packets codes 0-3 are defined, housekeeping cells may be issued to all devices indicating that henceforth packet code 4 corresponds to a new desired packet size. Thereafter, a command may be issued prohibiting further use of packet code 0. Thus, data in transit using the packet size corresponding to packet code 0 may be successfully delivered, but thereafter, a network will use packet size corresponding to packet code 4 in place of the packet size corresponding to packet code 0. This determination of packet size may be made, as discussed, by network management apparatus, based on analysis of network 11 traffic. It is also possible for a user who expects to transmit a significant amount of data which can conveniently be packaged into packets of a known size to request definition of an appropriate size packet. Usually, however, the amount of network bandwidth consumed by an individual user will not be sufficient to justify re-configuring the network for an individual request, so it is not desirable that a user request controls network configuration directly. User requests may, however, be used by the network controlling software in determination of appropriate packet sizes for the network.
To facilitate inter-connection with other netwo rks, it may be desirable to provide means for converting a long packet into a series of shorter packets, or vice versa. Particularly where the embodiment uses an extended ATM based arrangement, as described above, it is desirable to provide means for converting a long data packet into a plurality of ATM cells. In this way, a large network including a conventional ATM network and a network according to the embodiment may be freely mixed, and, at the boundaries of the network according to the embodiment, data may continue to be routed to its destination over the conventional ATM network.
Referring now to Fig. 4, a second embodiment will now be described; this schematic diagram illustrates the order of data transmission when a high priority packet interrupts a lower priority packet. A first, lengthy, data packet is transmitted as a header 100 including a priority flag 101 and an initial data portion 102a. During transmission of the initial data portion 102a, a higher priority packet is received for sending along the same path. The higher priority packet comprises a header portion 120 including a priority flag 121, in this case set to high priority, and a data portion 122. To send this packet without having to wait until the first packet has finished, an interrupt code I 10 is inserted in the data portion 102a, which signals to an appropriately configured receiver that sending of the first packet has been interrupted. The higher priority packet is then sent, followed by a resumption code I 11, followed by the remainder 102b of the data of the first packet.
12 Referring to Fig. 5, apparatus for performing the interruption described above will now be described. A network interface 130 is arranged to receive data packets for onward transmission. Received packets pass by priority detector 132 which determines whether interruption is required, by reference to the priority of the packet in transit stored in current priority store 133. In the normal course of events, packets are passed to transmitter 134 in the order received for transmission over a network, here a IGbit/s ethernet 138.
However, if the priority detector determines that interruption is required, a signal is sent to interrupt device 136 which inserts an interrupt code, here chosen to be a pre-determined "spare" code from-the 10bit coding scheme used for the Ethernet, buffers the remainder of the packet in transit as necessary, and instructs the transmitter to commence output of the higher priority packet. After the higher priority packet has been sent, a resume code is sent (this may not always be necessary, as the header 120 of the higher priority packet will contain the packet length, but this may simplify reassembly of the fragmented packets and increase fault tolerance), followed by the remainder of the first packet.
Signalling of interruption is preferably implemented at the physical layer, for example by using an otherwise unused 10 bit code in the case of Ethernet.
It will be appreciated from the above that the precise details of the implementation may be varied considerably, and also that each of the features discussed above may be provided independently in the context of other embodiments, unless otherwise stated.
13

Claims (16)

Claims
1. A method of communicating data over a network comprising transmitting a first data packet, receiving a higher priority data packet,, interrupting transmitting the first data packet to transmit the higher priority data packet, and resuming transmission of the first data packet.
2. A method according to Claim 1, wherein interrupting includes inserting a code signifying interruption into the transmitted data packet.
3. A method according to Claim 1 or Claim 2, further comprising maintaining a count of interruptions to a lower priority packet and declining interruption by a higher priority packet when a maximum count is reached.
4. A method according to any preceding claim wherein interruption is signalled at the physical layer.
5. A method according to any preceding claim wherein only two priority levels are provided.
6. A method according to any of Claims 1 to 4, wherein multiple priority levels are provided.
7. Apparatus for communicating data over a network comprising means for transmitting a first data packet, means for receiving a higher priority data packet, means for interrupting transmitting the first data packet to transmit the 20 higher priority data packet, and means for resuming transmission of the first data packet.
8. Apparatus according to Claim 7 including means for signalling interruption at the physical layer.
9. A method of communicating data over a network comprising selecting 25 one of at least two predetermined packet sizes based on the data type and 14 transmitting a packet of the selected size over the network.
10. A method according to Claim 9, wherein the packet formats differ depending on the data type.
11. A data network including means for transmitting data of a first type as a series of packets of a first length over a communication medium and means for transmitting data of a second type as packets of a second length over the same communication medium.
12. A network according to Claim I I further including routing means connected to the communication medium for routing packets of both said first length and said second length.
13. A transmitter for connection to a communication network comprising means for selecting a data packet format or length from a plurality of predetermined formats or packet lengths; means for providing a header for the data packet, the header including at least one flag bit indicating the length or format of the data packet; and means for transmitting the data packet over the communication medium.
14. A receiver for receiving data from a communication network, the receiver including means for reading a flag bit contained in the header of a data packet transmitted on the communication medium; means for determining the size or format of data packet to receive based on the information; and means for receiving a data packet of said size or format.
15. A network or network device substantially as any one herein described or as illustrated in any figure.
16. A method of communicating data substantially as any one herein described.
GB9821555A 1998-10-02 1998-10-02 Transmission of data packets of different size and priority Withdrawn GB2344029A (en)

Priority Applications (2)

Application Number Priority Date Filing Date Title
GB9821555A GB2344029A (en) 1998-10-02 1998-10-02 Transmission of data packets of different size and priority
PCT/US1999/022653 WO2000020876A1 (en) 1998-10-02 1999-09-29 Communication network

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
GB9821555A GB2344029A (en) 1998-10-02 1998-10-02 Transmission of data packets of different size and priority

Publications (2)

Publication Number Publication Date
GB9821555D0 GB9821555D0 (en) 1998-11-25
GB2344029A true GB2344029A (en) 2000-05-24

Family

ID=10839930

Family Applications (1)

Application Number Title Priority Date Filing Date
GB9821555A Withdrawn GB2344029A (en) 1998-10-02 1998-10-02 Transmission of data packets of different size and priority

Country Status (2)

Country Link
GB (1) GB2344029A (en)
WO (1) WO2000020876A1 (en)

Cited By (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
GB2348344B (en) * 1999-01-27 2001-12-05 Motorola Inc Priority enhanced messaging and method therefor
GB2380026A (en) * 2001-08-13 2003-03-26 Hewlett Packard Co Bandwidth management for packetized image data
GB2389493A (en) * 2002-06-05 2003-12-10 Nec Corp Voice packet preferential control equipment
GB2412815A (en) * 2004-08-18 2005-10-05 Wecomm Ltd Transmitting data over a network
GB2417388A (en) * 2004-08-18 2006-02-22 Wecomm Ltd Transmitting data
US7643415B2 (en) * 2000-12-19 2010-01-05 Robert Bosch Gmbh Method for controlling link connections in a communication system and corresponding communication system
US9819705B2 (en) 2015-08-18 2017-11-14 Gn Hearing A/S Method of exchanging data packages between first and second portable communication devices using a favoured frequency band
US9831988B2 (en) 2015-08-18 2017-11-28 Gn Hearing A/S Method of exchanging data packages between first and second portable communication devices
US9894447B2 (en) 2010-10-14 2018-02-13 Gn Resound A/S Hearing device and a method of selecting an optimal transceiver channel in a wireless network
US10003896B2 (en) 2015-08-18 2018-06-19 Gn Hearing A/S Method of exchanging data packages of different sizes between first and second portable communication devices

Families Citing this family (16)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20020063932A1 (en) * 2000-05-30 2002-05-30 Brian Unitt Multiple access system for communications network
AU2001293783A1 (en) * 2000-09-29 2002-04-08 Telefonaktiebolaget Lm Ericsson (Publ) Method and system for transmitting data
EP1193938A1 (en) * 2000-09-29 2002-04-03 Telefonaktiebolaget L M Ericsson (Publ) Method and system for transmitting data
US7292530B2 (en) 2000-12-29 2007-11-06 Intel Corporation Method and apparatus to manage packet fragmentation
GB2373671B (en) * 2001-03-23 2004-04-07 Vodafone Ltd Telecommunications systems and methods
CN1547835A (en) 2001-08-24 2004-11-17 Method for the transmission of data packets in a radio communication system
JP2003069603A (en) * 2001-08-27 2003-03-07 Fujikura Ltd Packet communication controller
US7187688B2 (en) * 2002-06-28 2007-03-06 International Business Machines Corporation Priority arbitration mechanism
FR2876529B1 (en) * 2004-10-07 2006-12-01 Schneider Electric Ind Sas PRIORITY CONTROL COMMUNICATION DEVICE AND METHOD
EP1734700A1 (en) * 2005-06-16 2006-12-20 Siemens Aktiengesellschaft Method and apparatus for realtime data transmission in an Ethernet data network
US20070047572A1 (en) * 2005-08-25 2007-03-01 P.A. Semi, Inc. Explicit flow control in Gigabit/10 Gigabit Ethernet system
US8687489B2 (en) 2007-06-15 2014-04-01 Qualcomm Incorporated Aborting a packetized wireless communication
PL2446600T3 (en) 2009-06-25 2017-03-31 Koninklijke Philips N.V. Method and device for processing data packets
EP2538618A1 (en) * 2011-06-22 2012-12-26 Siemens Aktiengesellschaft Method for transferring data packets
EP2579511A1 (en) * 2011-09-27 2013-04-10 Siemens Aktiengesellschaft Method for operating an automation device for prioritising telegrams and corresponding data transfer method
US11283573B2 (en) * 2017-08-22 2022-03-22 Qualcomm Incorporated Reference signal design supporting ultra-reliable low-latency communication (URLLC) interruption

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPS58173932A (en) * 1982-04-05 1983-10-12 Oki Electric Ind Co Ltd Packet transmission system
GB2166320A (en) * 1984-10-25 1986-04-30 Stc Plc Packet switching system
GB2187917A (en) * 1986-03-13 1987-09-16 Univ Strathclyde Local area network priority control system
US5251209A (en) * 1991-03-28 1993-10-05 Sprint International Communications Corp. Prioritizing attributes in integrated services networks
WO1995012265A1 (en) * 1993-10-26 1995-05-04 Northern Telecom Limited Digital telecommunication link for efficiently transporting mixed classes of packets

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5043981A (en) * 1990-05-29 1991-08-27 Advanced Micro Devices, Inc. Method of and system for transferring multiple priority queues into multiple logical FIFOs using a single physical FIFO
US5469545A (en) * 1991-10-03 1995-11-21 Compaq Computer Corp. Expandable communication system with data flow control
US5729544A (en) * 1994-05-09 1998-03-17 Motorola, Inc. Method for transmitting data packets based on message type

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPS58173932A (en) * 1982-04-05 1983-10-12 Oki Electric Ind Co Ltd Packet transmission system
GB2166320A (en) * 1984-10-25 1986-04-30 Stc Plc Packet switching system
GB2187917A (en) * 1986-03-13 1987-09-16 Univ Strathclyde Local area network priority control system
US5251209A (en) * 1991-03-28 1993-10-05 Sprint International Communications Corp. Prioritizing attributes in integrated services networks
WO1995012265A1 (en) * 1993-10-26 1995-05-04 Northern Telecom Limited Digital telecommunication link for efficiently transporting mixed classes of packets

Cited By (19)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
GB2348344B (en) * 1999-01-27 2001-12-05 Motorola Inc Priority enhanced messaging and method therefor
US7643415B2 (en) * 2000-12-19 2010-01-05 Robert Bosch Gmbh Method for controlling link connections in a communication system and corresponding communication system
GB2380026A (en) * 2001-08-13 2003-03-26 Hewlett Packard Co Bandwidth management for packetized image data
GB2380026B (en) * 2001-08-13 2005-08-24 Hewlett Packard Co Bandwidth management for packetized image data
GB2389493A (en) * 2002-06-05 2003-12-10 Nec Corp Voice packet preferential control equipment
GB2389493B (en) * 2002-06-05 2005-08-17 Nec Corp Voice packet preferential control equipment and control method thereof
GB2417388B (en) * 2004-08-18 2007-08-08 Wecomm Ltd Transmitting data
GB2412815B (en) * 2004-08-18 2006-03-22 Wecomm Ltd Transmitting data over a network
GB2417388A (en) * 2004-08-18 2006-02-22 Wecomm Ltd Transmitting data
US7570658B2 (en) 2004-08-18 2009-08-04 Wecomm Limited Transmitting data
GB2412815A (en) * 2004-08-18 2005-10-05 Wecomm Ltd Transmitting data over a network
US9894447B2 (en) 2010-10-14 2018-02-13 Gn Resound A/S Hearing device and a method of selecting an optimal transceiver channel in a wireless network
US10313804B2 (en) 2010-10-14 2019-06-04 Gn Hearing A/S Hearing device and a method of selecting an optimal transceiver channel in a wireless network
US11006224B2 (en) 2010-10-14 2021-05-11 Gn Hearing A/S Hearing device and a method of selecting an optimal transceiver channel in a wireless network
US9819705B2 (en) 2015-08-18 2017-11-14 Gn Hearing A/S Method of exchanging data packages between first and second portable communication devices using a favoured frequency band
US9831988B2 (en) 2015-08-18 2017-11-28 Gn Hearing A/S Method of exchanging data packages between first and second portable communication devices
US10003896B2 (en) 2015-08-18 2018-06-19 Gn Hearing A/S Method of exchanging data packages of different sizes between first and second portable communication devices
US10595137B2 (en) 2015-08-18 2020-03-17 Gn Hearing A/S Method of exchanging data packages of different sizes between first and second portable communication devices
US11463824B2 (en) 2015-08-18 2022-10-04 Gn Hearing A/S Method of exchanging data packages of different sizes between first and second portable communication devices

Also Published As

Publication number Publication date
WO2000020876A1 (en) 2000-04-13
GB9821555D0 (en) 1998-11-25

Similar Documents

Publication Publication Date Title
GB2344029A (en) Transmission of data packets of different size and priority
US7697529B2 (en) Fabric channel control apparatus and method
US6094439A (en) Arrangement for transmitting high speed packet data from a media access controller across multiple physical links
US6876669B2 (en) Packet fragmentation with nested interruptions
EP1348265B1 (en) Maintaining quality of packet traffic in optical network when a failure of an optical link occurs
US20070242693A1 (en) Allocation of packets in a wireless communication system
US20210243668A1 (en) Radio Link Aggregation
EP0676879A2 (en) Packet management device for fast-packet network
US20050135419A1 (en) Downstream synchronous multichannels for a communications management system
CN113595934A (en) Service flow transmission method, device and communication system based on flexible Ethernet
US8804763B2 (en) Transmission of data over parallel links
US20060209812A1 (en) Parallel Channel Architecture
US6829240B1 (en) System for, and method of, ATM segmentation and re-assembly of cells providing streaming data
JP3342649B2 (en) Bandwidth reducing ATM network and method thereof
US7346058B1 (en) Multiprotocol encapsulation system and method
Greaves et al. The Cambridge backbone ring
US5781554A (en) Method and apparatus for communicating between nodes in a communications network
EP2077637B1 (en) System and method for protecting payload information in radio transmission
WO2011026508A1 (en) Method for distributing data traffic over radio links
US8565610B2 (en) Maintaining correlated virtual data streams through a network
JP2003078496A (en) Path control method
US6529512B1 (en) Statistical method of data compression and decompression
US7042845B1 (en) System and method for time division multiplexed switching of data using a high-speed packet switch
CA2448987A1 (en) Method for transmitting information stream, corresponding transmission system transmitter receiver and computer product
KR100369369B1 (en) A Virtual Channel Merge Apparatus MutiProtocol Label Switch System

Legal Events

Date Code Title Description
COOA Change in applicant's name or ownership of the application
WAP Application withdrawn, taken to be withdrawn or refused ** after publication under section 16(1)