Abstract: A scheduling device for managing a packet queue of a communication gateway includes a receiving portion configured to receive data packets according to at least one communication protocol, a processor, and classification module configured to separate the received data packets into a first traffic queue and a second traffic queue separate from the first traffic queue. The first traffic queue includes a low latency service flow classified to have strict priority. The second traffic queue includes a primary service flow classified as having a classic priority. The classification module separates the received data packets so that those with a first indicator are sent to the first traffic queue and those without the first indicator are sent to the second traffic queue.

Abstract: A scheduling device for managing a packet queue of a communication gateway includes a receiving portion configured to receive data packets according to at least one communication protocol, a processor, and classification module configured to separate the received data packets into a first traffic queue and a second traffic queue separate from the first traffic queue. The first traffic queue includes a low latency service flow classified to have strict priority. The second traffic queue includes a primary service flow classified as having a classic priority. The classification module separates the received data packets so that those with a first indicator are sent to the first traffic queue and those without the first indicator are sent to the second traffic queue.

Abstract: A scheduling device for managing a packet queue of a communication gateway includes a receiving portion configured to receive data packets according to at least one communication protocol, a processor, and classification module configured to separate the received data packets into a first traffic queue and a second traffic queue separate from the first traffic queue. The first traffic queue includes a low latency service flow classified to have strict priority. The second traffic queue includes a primary service flow classified as having a classic priority. The classification module separates the received data packets so that those with a first indicator are sent to the first traffic queue and those without the first indicator are sent to the second traffic queue.

Abstract: Congestion in respect to a network element operable to forward data items in a telecommunications networks, and in respect to a processing element operable to process requests for service is signaled. In either, the element is operable to perform its processing function at up to a processing rate which is subject to variation, and has a queue for items awaiting processing having a counter associated therewith which maintains a count from which a queue metric is derivable. A method comprises: updating the count at a rate dependent on the processing rate; further updating the count in response to receipt of items awaiting processing; and signalling a measure of congestion in respect of the element in dependence on the queue metric; then altering the rate at which the count is being updated and adjusting the counter whereby to cause a change in the queue metric if the processing rate has changed.

Abstract: Downstream path congestion is measured in respect of a node via which a plurality of data units are traversing an end-to-end path from a sender to a receiver. Each data unit has a first indication settable in dependence on information from the receiver to each of at least two states whereby to indicate different levels of congestion experienced on the end-to-end path by data units previously received by the receiver, and a second indication settable to an initial state and to at least one updated state indicative of congestion experienced by data units on their path from the sender to said node. A plurality of data units are received at the node, and the downstream path congestion measure is determined in dependence on an inflation factor itself dependent on the proportion of a set of the data units whose second indication on receipt at the node is in the initial state.

Abstract: Apparatus and methods for policing flows of data units (15) along a path in a data network in dependence on congestion indications associated with said data units indicating whether or not said data units have experienced, or are expected to experience, congestion on the path, said apparatus and methods allowing for a high but not unlimited short-term burst rate (wST) of data units having congestion indications associated therewith, the short-term burst rate being high when compared with a long-term average rate (wLT) at which data units having congestion indications associated therewith may be forwarded without the data units being subjected to a policing action such as dropping, delaying or marking for possible sanction.

Abstract: Methods and apparatus for providing path characterization information relating to a network characteristic such as network congestion to nodes in a data network using data units being forwarded from a source to a destination via a plurality of nodes in the network, the method comprising: receiving, at a first proxy node, data units from a source, each data unit comprising a destination indication indicative of an intended destination; identifying, in respect of an intended destination indicated, a second proxy node in the network to which data units may be forwarded before being forwarded to the intended destination; and forwarding a first and at least one subsequent data unit from the first to the second proxy node via ‘one or more intermediate nodes; the method further comprising assigning conditions to path characterization metrics in respect of data units traversing a path across the network from the first to the second proxy node, the initial condition being dependent on information received by the first

Abstract: Methods and systems for policing usage by one or more users (12) of a data network (14), said one or more users (12) being able to send, to receive, or to send and receive data over the network via one or more of a plurality of access nodes (42), the usage of the data network resulting from respective data units consuming network resources along respective paths across the data network (14), each of said data units being associated with one of a plurality of subsets of the usage of the data network, said data units having congestion indications associated therewith indicating a measure of their congestion impact.

Abstract: Methods and systems for assigning information indicative of a network characteristic to one of a plurality of data units traversing a path across a network, said data units having associated therewith values indicative of said network characteristic, said path having at least one portion passing through a lower-capability region and at least one portion passing through a higher-capability region, said lower-capability region being a region in which information indicative of said network characteristic may be represented by values having a first resolution, and said higher-capability region being a region in which information indicative of said network characteristic may be represented by values having a second resolution, said second resolution being greater than said first resolution, said one data unit being a data unit entering said higher-capability region.

Abstract: The present invention provides a method and system wherein congestion information is taken from a lower level in the protocol stack and used for congestion marking in a higher layer. In particular, the method and system of the invention from a first aspect provide for congestion information in the lower layer to be generated downstream at a congested node, and to be fed back upstream to a source node. The source node then passes the congestion information, or information derived therefrom, up to the corresponding network element responsible for higher layer functions in the protocol stack, where higher level congestion marking can then be performed in dependence on the received lower level congestion information. Thus, congestion information from the lower layer which can typically be generated earlier before significant congestion occurs can be used in higher layer congestion control functions. Preferably the lower layer is the data link layer, and the higher layer is the network layer.

Abstract: Data networks, nodes making up parts of data networks, and information are related to the characterization of paths taken by data travelling between nodes in the networks. Path characterization information is arranged to be conveyed to nodes such that it may be used by nodes subsequently forwarding data. In particular, the invention relates to nodes receiving such path characterization information from upstream nodes, deriving therefrom information indicative of characteristics of a path downstream of said nodes, and using such information to make informed decisions such as routing decisions when forwarding data onward in data networks.

Abstract: Path characterization information is provided to a data sender relating to a network characteristic such as congestion experienced by data units traversing a path across a data network from the data sender towards one of a plurality of data receivers. The data units have associated therewith information indicative of the network characteristic. The path is traversed by the data units having at least a first path portion between the data sender and a proxy node along which data units may traverse conveying a measure indicative of the network characteristic that is representable by any of a first set of codepoints. The data receivers are operable to provide data acknowledgement units in respect of data units they receive via a second path portion in which information indicative of the network characteristic may only be representable using codepoints of a second set of codepoints having less codepoints than the first set.

Abstract: Methods and apparatus for determining measures indicative of downstream path congestion in respect of a node via which a plurality of data units are traversing an end-to-end path from a sender to a receiver, each data unit having a first indication settable in dependence on information from the receiver to each of at least two states whereby to indicate different levels of congestion experienced on the end-to-end path by data units previously received by the receiver; and a second indication settable to an initial state and to at least one updated state indicative of congestion experienced by data units on their path from the sender to said node; the method comprising receiving a plurality of said data units at said node, and determining said downstream path congestion measure in dependence on an inflation factor itself dependent on the proportion of a set of said data units whose second indication on receipt at said node is in said initial state.

Abstract: Methods and apparatus for encoding a number of small dynamic values over an n-bit field. Also methods and apparatus allowing for the stateless extraction of separate sequences from repetitions of a single field whereby to communicate more than one signal at once.

Abstract: Methods, apparatus and other means for providing path characterisation information to a data sender relating to a network characteristic such as congestion experienced by data units traversing a path across a data network from the data sender towards one of a plurality of data receivers, the data units having associated therewith information indicative of the network characteristic, the path being traversed by the data units having at least a first path portion between said data sender and a proxy node along which data units may traverse conveying a measure indicative of the network characteristic that is representable by any of a first set of codepoints, the data receivers being operable to provide data acknowledgement units in respect of data units they receive via a second path portion in which information indicative of the network characteristic may only be representable using codepoints of a second set of codepoints having less codepoints than the first set of codepoints.

Abstract: Methods and systems for determining a correction factor for use in monitoring network traffic, said network traffic comprising a plurality of flows of data units, each flow having associated therewith a flow identifier, said data units having associated therewith a path characterization metric; the method comprising the steps of: selecting a subset of flow identifiers from the overall set of flow identifiers; determining, in respect of flows having associated therewith flow identifiers from said selected subset of flow identifiers, which flows if any are persistently irregular flows; determining a first measure of the total of the accumulated path characterization metrics associated with data units of said selected subset of flows; determining a second measure indicative of the proportion of said total measure contributed by said persistently irregular flows; and determining a correction factor in dependence on the first and second measures.

Abstract: Methods and systems for policing usage by one or more users (12) of a data network (14), said one or more users (12) being able to send, to receive, or to send and receive data over the network via one or more of a plurality of access nodes (42), the usage of the data network resulting from respective data units consuming network resources along respective paths across the data network (14), each of said data units being associated with one of a plurality of subsets of the usage of the data network, said data units having congestion indications associated therewith indicating a measure of their congestion impact.

Abstract: One or more users of a present state are notified of at least one property of an entity. A request message is received from a user over a first communications channel, the message containing information indicative of at least one property of an entity in which the user is interested. The present state of the at least one property is determined, as is an identifier of a second communications channel onto which future messages containing information relating to future changes of state of the at least one property of the entity will be transmitted. A reply message is transmitted to the user, the reply message containing information indicative of the present state of the at least one property and of the identifier of the second communications channel.

Abstract: Apparatus and methods for policing flows of data units (15) along a path in a data network in dependence on congestion indications associated with said data units indicating whether or not said data units have experienced, or are expected to experience, congestion on the path, said apparatus and methods allowing for a high but not unlimited short-term burst rate (wST) of data units having congestion indications associated therewith, the short-term burst rate being high when compared with a long-term average rate (wLT) at which data units having congestion indications associated therewith may be forwarded without the data units being subjected to a policing action such as dropping, delaying or marking for possible sanction.

Abstract: Methods and apparatus for providing path characterisation information relating to a network characteristic such as network congestion to nodes in a data network (10) using data units being forwarded from a source (11) to a destination (19) via a plurality of nodes (15) in the network, the method comprising: receiving, at a first proxy node (13), data units from a source (11), each data unit comprising a destination indication indicative of an intended destination; identifying, in respect of an intended destination indicated, a second proxy node (17) in the network to which data units may be forwarded before being forwarded to the intended destination; and forwarding a first and at least one subsequent data unit from the first to the second proxy node via one or more intermediate nodes (15); the method further comprising assigning conditions to path characterisation metrics in respect of data units traversing a path across the network from the first to the second proxy node, the initial condition being depende