Abstract: Systems, methods, and other embodiments for sorting-based assignment to optimize order fulfillment with short supply. One embodiment includes identifying a set of one or more distributions within a series of days. Sorting all demands of a first priority level occurring in the series of days by ascending order of size of the demand. For each demand of the first priority level in sorted order, (a) selecting an initial distribution during which the demand is scheduled to be fulfilled from the set of distributions, and (b) generating an indication that the demand can cannot be completely fulfilled, based on the size of the demand and the amount of supply available. Automatically arranging a graphical representation of a schedule of supplies and met and unmet demands for the series of days in a graphical user interface based at least on the indications generated for each demand.

Abstract: Methods and apparatus are disclosed for processing digital content service requests from user devices (1), each service request relating to digital content provided by a content provider, and comprising a server location request and a content request. The server location request comprises an indication of a network name of a content provider from which digital content is desired. The content request comprises an indication of a desired content item and a routing identifier indicating the network location of an applicable content server (9).

Abstract: Methods and apparatus are disclosed for processing digital content service requests from user devices (1), each service request relating to digital content provided by a content provider, and comprising a server location request and a content request. The server location request comprises an indication of a network name of a content provider from which digital content is desired. The content request comprises an indication of a desired content item and a routing identifier indicating the network location of an applicable content server (9).

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 apparatus for controlling the forwarding of a flow (12) of data units across a network from a sender node (11) to a receiver node (19) via at least one intermediate node (15), the data units each having one of a plurality of different types of class indication associated therewith, each type of class indication providing, to an intermediate node currently processing the data unit with which the class indication is associated, an indication denoting a particular class of treatment, selected from a plurality of different classes of treatment, according to which the data unit is to be processed by that intermediate node, such that different proportions of the data units of the flow are forwarded as different sub-flows each comprising data units having class indications of different types thereby providing indications denoting different classes of treatment.

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 controlling the forwarding of a flow (12) of data units across a network from a sender node (11) to a receiver node (19) via at least one intermediate node (15), the data units each having one of a plurality of different types of class indication associated therewith, each type of class indication providing, to an intermediate node currently processing the data unit with which the class indication is associated, an indication denoting a particular class of treatment, selected from a plurality of different classes of treatment, according to which the data unit is to be processed by that intermediate node, such that different proportions of the data units of the flow are forwarded as different sub-flows each comprising data units having class indications of different types thereby providing indications denoting different classes of treatment.

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: A method for determining flop circuit types includes performing a layout of an IC design including arranging master and slave latches of each of a plurality of flops to receive first and second clock signals, respectively. The initial IC design may then be implemented (e.g., on a silicon substrate). After implementation, the IC may be operated in first and second modes. In the first mode, the master latch of each flop is coupled to receive a first clock signal. In the second mode, the first clock signal is inhibited and the master latch is held transparent. The slave latch of each flop operates according to a second clock signal in both the first and second modes. The method further includes determining, for each flop, whether that flop is to operate as a master-slave flip-flop or as a pulse flop in a subsequent revision of the IC.

Abstract: A method for determining flop circuit types includes performing a layout of an IC design including arranging master and slave latches of each of a plurality of flops to receive first and second clock signals, respectively. The initial IC design may then be implemented (e.g., on a silicon substrate). After implementation, the IC may be operated in first and second modes. In the first mode, the master latch of each flop is coupled to receive a first clock signal. In the second mode, the first clock signal is inhibited and the master latch is held transparent. The slave latch of each flop operates according to a second clock signal in both the first and second modes. The method further includes determining, for each flop, whether that flop is to operate as a master-slave flip-flop or as a pulse flop in a subsequent revision of the IC.

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

Abstract: Performance of an integrated circuit design, whether embodied as a design encoding or as a fabricated integrated circuit, can be improved by selectively substituting low Vt transistors in a way that prioritizes substitution opportunities based on multi-path timing analysis and evaluates such opportunities based on one or more substitution constraints. By valuing, in a prioritization of substitution opportunities, contributions for all or substantially all timing paths through the substitution opportunity that violate a max-time constraint, repeated passes through a timing analysis phase can be advantageously avoided or limited. In addition, by recognizing one or more constraints on actual low Vt substitutions, particular noise-oriented constraints, the scope of post substitution design analysis can be greatly reduced. In some realizations, substitutions are performed so long as a leakage current budget is not expended.

Abstract: A Component-based Software Distribution Channel allows Component Service Providers (10) to advertise component services via a Service Directory (12) to service developers. The component services are advertised in a format which encapsulates a legally binding contract which must be accepted before the components may be incorporated into a client service. The service developer may combine together a number of different component services to create a combined client service. That service may be announced in a Session Directory (16) in an encapsulated format which incorporates a legally binding agreement which must be accepted by a client before the resultant session may be accessed.

Abstract: Performance of an integrated circuit design, whether embodied as a design encoding or as a fabricated integrated circuit, can be improved by selectively substituting low Vt transistors in a way that prioritizes substitution opportunities based on multi-path timing analysis and evaluates such opportunities based on one or more substitution constraints. By valuing, in a prioritization of substitution opportunities, contributions for all or substantially all timing paths through the substitution opportunity that violate a max-time constraint, repeated passes through a timing analysis phase can be advantageously avoided or limited. In addition, by recognizing one or more constraints on actual low Vt substitutions, particular noise-oriented. constraints, the scope of post substitution design analysis can be greatly reduced. In some realizations, substitutions are performed so long as a leakage current budget is not expended.

Abstract: A method of providing a service over a plurality of terminals connected over a network comprises determining resources required for a service to be provided, determining resources currently available at each terminal, comparing the required resources with the available resources, and controlling the service provided at each terminal as a result of the comparison.