Abstract: A fuel mixture characterized by reduced SOx and NOx emissions from combustion of the fuel, comprising: fuel; and an ester additive derived from reaction of i) a C6-C16 aliphatic straight chain or branched chain monocarboxylic acid, wherein aliphatic is defined as of or relating to a major group of organic compounds, structured in open or branched chains, including alkanes, e.g. paraffins, alkenes, e.g. olefins, and alkynes e.g., acetylenes, and either, ii) an aliphatic polyhydric alcohol having three or more primary alcohol groups, or iii) a C1-C16 aliphatic straight or branched chain monohydric alcohol. A method of reducing SOx and NOx emissions from combustion of the fuel, comprising: mixing fuel and an ester additive; and combusting the mixture, wherein SOx and NOx emissions are at least about 20% to about 40% w/w of the SOx and NOx emissions from combustion of the fuel without admixture with the ester additive.

Abstract: Methods and apparatus are disclosed for scheduling packets, such as in systems having a non-blocking switching fabric and homogeneous or heterogeneous line card interfaces. In one implementation, multiple request generators, grant arbiters, and acceptance arbiters work in conjunction to determine this scheduling. A set of requests for sending packets from a particular input is generated. From a grant starting position, a first n requests in a predetermined sequence are identified, where n is less than or equal to the maximum number of connections that can be used in a single packet time to the particular output. The grant starting position is updated in response to the first n grants including a particular grant corresponding to a grant advancement position. In one embodiment, the set of grants generated based on the set of requests is similarly determined using an acceptance starting position and an acceptance advancement position.

Abstract: Methods and apparatus are disclosed for scheduling packets, such as in systems having a non-blocking switching fabric and homogeneous or heterogeneous line card interfaces. In one implementation, multiple request generators, grant arbiters, and acceptance arbiters work in conjunction to determine this scheduling. A set of requests for sending packets from a particular input is generated. From a grant starting position, a first n requests in a predetermined sequence are identified, where n is less than or equal to the maximum number of connections that can be used in a single packet time to the particular output. The grant starting position is updated in response to the first n grants including a particular grant corresponding to a grant advancement position. In one embodiment, the set of grants generated based on the set of requests is similarly determined using an acceptance starting position and an acceptance advancement position.