Improved models for drop-on-demand ink-jet shortening

A previous 1-D model for the shortening of an unbroken drop-on-demand ink-jet ligament has been extended to the case of an arbitrary attached tail mass, and can also include extensional viscosity (which has ∼ 2% effect) as well as linear elasticity in the fluid. Predictions from the improved model are shown to be very similar to results from 2-D axisymmetric numerical simulations of DoD ink-jet ligaments and also to the results of recent experiments on Newtonian fluids jetted without satellite formation.

Jetting behaviour of polymer solutions in drop-on-demand inkjet printing

The jetting of dilute polymer solutions in drop-on-demand printing is investigated. A quantitative model is presented which predicts three different regimes of behaviour depending upon the jet Weissenberg number Wi and extensibility of the polymer molecules. In regime I (Wi < ½) the polymer chains are relaxed and the fluid behaves in a Newtonian manner. In regime II (½ < Wi < L) where L is the extensibility of the polymer chain the fluid is viscoelastic, but the polymer do not reach their extensibility limit. In regime III (Wi > L) the chains remain fully extended in the thinning ligament. The maximum polymer concentration at which a jet of a certain speed can be formed scales with molecular weight to the power of (1-3ν), (1-6ν) and -2ν in the three regimes respectively, where ν is the solvent quality coefficient. Experimental data obtained with solutions of mono-disperse polystyrene in diethyl phthalate with molecular weights between 24 - 488 kDa, previous numerical simulations of this system, and previously published data for this and another linear polymer in a variety of “good” solvents, all show good agreement with the scaling predictions of the model.

Optimal Scheduling of Secondary Content for Aggregation in Video-on-Demand Systems

Dynamic service aggregation techniques can exploit skewed access popularity patterns to reduce the costs of building interactive VoD systems. These schemes seek to cluster and merge users into single streams by bridging the temporal skew between them, thus improving server and network utilization. Rate adaptation and secondary content insertion are two such schemes. In this paper, we present and evaluate an optimal scheduling algorithm for inserting secondary content in this scenario. The algorithm runs in polynomial time, and is optimal with respect to the total bandwidth usage over the merging interval. We present constraints on content insertion which make the overall QoS of the delivered stream acceptable, and show how our algorithm can satisfy these constraints. We report simulation results which quantify the excellent gains due to content insertion. We discuss dynamic scenarios with user arrivals and interactions, and show that content insertion reduces the channel bandwidth requirement to almost half. We also discuss differentiated service techniques, such as N-VoD and premium no-advertisement service, and show how our algorithm can support these as well.

An On Demand Queue Management Architecture for a Programmable Traffic Manager

A queue manager (QM) is a core traffic management (TM) function used to provide per-flow queuing in access andmetro networks; however current designs have limited scalability. An on-demand QM (OD-QM) which is part of a new modular field-programmable gate-array (FPGA)-based TM is presented that dynamically maps active flows to the available physical resources; its scalability is derived from exploiting the observation that there are only a few hundred active flows in a high speed network. Simulations with real traffic show that it is a scalable, cost-effective approach that enhances per-flow queuing performance, thereby allowing per-flow QM without the need for extra external memory at speeds up to 10 Gbps. It utilizes 2.3%–16.3% of a Xilinx XC5VSX50t FPGA and works at 111 MHz.