SomeCast: A Paradigm for Real-Time Adaptive Reliable Multicast

SomeCast is a novel paradigm for the reliable multicast of real-time data to a large set of receivers over the Internet. SomeCast is receiver-initiated and thus scalable in the number of receivers, the diverse characteristics of paths between senders and receivers (e.g. maximum bandwidth and round-trip-time), and the dynamic conditions of such paths (e.g. congestion-induced delays and losses). SomeCast enables receivers to dynamically adjust the rate at which they receive multicast information to enable the satisfaction of real-time QoS constraints (e.g. rate, deadlines, or jitter). This is done by enabling a receiver to join SOME number of concurrent multiCAST sessions, whereby each session delivers a portion of an encoding of the real-time data. By adjusting the number of such sessions dynamically, client-specific QoS constraints can be met independently. The SomeCast paradigm can be thought of as a generalization of the AnyCast (e.g. Dynamic Server Selection) and ManyCast (e.g. Digital Fountain) paradigms, which have been proposed in the literature to address issues of scalability of UniCast and MultiCast environments, respectively. In this paper we overview the SomeCast paradigm, describe an instance of a SomeCast protocol, and present simulation results that quantify the significant advantages gained from adopting such a protocol for the reliable multicast of data to a diverse set of receivers subject to real-time QoS constraints.

NETEMBED: A Network Resource Mapping Service for Distributed Applications

Emerging configurable infrastructures such as large-scale overlays and grids, distributed testbeds, and sensor networks comprise diverse sets of available computing resources (e.g., CPU and OS capabilities and memory constraints) and network conditions (e.g., link delay, bandwidth, loss rate, and jitter) whose characteristics are both complex and time-varying. At the same time, distributed applications to be deployed on these infrastructures exhibit increasingly complex constraints and requirements on resources they wish to utilize. Examples include selecting nodes and links to schedule an overlay multicast file transfer across the Grid, or embedding a network experiment with specific resource constraints in a distributed testbed such as PlanetLab. Thus, a common problem facing the efficient deployment of distributed applications on these infrastructures is that of "mapping" application-level requirements onto the network in such a manner that the requirements of the application are realized, assuming that the underlying characteristics of the network are known. We refer to this problem as the network embedding problem. In this paper, we propose a new approach to tackle this combinatorially-hard problem. Thanks to a number of heuristics, our approach greatly improves performance and scalability over previously existing techniques. It does so by pruning large portions of the search space without overlooking any valid embedding. We present a construction that allows a compact representation of candidate embeddings, which is maintained by carefully controlling the order via which candidate mappings are inserted and invalid mappings are removed. We present an implementation of our proposed technique, which we call NETEMBED – a service that identify feasible mappings of a virtual network configuration (the query network) to an existing real infrastructure or testbed (the hosting network). We present results of extensive performance evaluation experiments of NETEMBED using several combinations of real and synthetic network topologies. Our results show that our NETEMBED service is quite effective in identifying one (or all) possible embeddings for quite sizable queries and hosting networks – much larger than what any of the existing techniques or services are able to handle.

Miniature Eye Movements Enhance Fine Spatial Details

Our eyes are constantly in motion. Even during visual fixation, small eye movements continually jitter the location of gaze. It is known that visual percepts tend to fade when retinal image motion is eliminated in the laboratory. However, it has long been debated whether, during natural viewing, fixational eye movements have functions in addition to preventing the visual scene from fading. In this study, we analysed the influence in humans of fixational eye movements on the discrimination of gratings masked by noise that has a power spectrum similar to that of natural images. Using a new method of retinal image stabilization18, we selectively eliminated the motion of the retinal image that normally occurs during the intersaccadic intervals of visual fixation. Here we show that fixational eye movements improve discrimination of high spatial frequency stimuli, but not of low spatial frequency stimuli. This improvement originates from the temporal modulations introduced by fixational eye movements in the visual input to the retina, which emphasize the high spatial frequency harmonics of the stimulus. In a natural visual world dominated by low spatial frequencies, fixational eye movements appear to constitute an effective sampling strategy by which the visual system enhances the processing of spatial detail.

Properties and applications of injection locking in 1.55 μm quantum-dash mode-locked semiconductor lasers

Mode-locked semiconductor lasers are compact pulsed sources with ultra-narrow pulse widths and high repetition-rates. In order to use these sources in real applications, their performance needs to be optimised in several aspects, usually by external control. We experimentally investigate the behaviour of recently-developed quantum-dash mode-locked lasers (QDMLLs) emitting at 1.55 μm under external optical injection. Single-section and two-section lasers with different repetition frequencies and active-region structures are studied. Particularly, we are interested in a regime which the laser remains mode-locked and the individual modes are simultaneously phase-locked to the external laser. Injection-locked self-mode-locked lasers demonstrate tunable microwave generation at first or second harmonic of the free-running repetition frequency with sub-MHz RF linewidth. For two-section mode-locked lasers, using dual-mode optical injection (injection of two coherent CW lines), narrowing the RF linewidth close to that of the electrical source, narrowing the optical linewidths and reduction in the time-bandwidth product is achieved. Under optimised bias conditions of the slave laser, a repetition frequency tuning ratio >2% is achieved, a record for a monolithic semiconductor mode-locked laser. In addition, we demonstrate a novel all-optical stabilisation technique for mode-locked semiconductor lasers by combination of CW optical injection and optical feedback to simultaneously improve the time-bandwidth product and timing-jitter of the laser. This scheme does not need an RF source and no optical to electrical conversion is required and thus is ideal for photonic integration. Finally, an application of injection-locked mode-locked lasers is introduced in a multichannel phase-sensitive amplifier (PSA). We show that with dual-mode injection-locking, simultaneous phase-synchronisation of two channels to local pump sources is realised through one injection-locking stage. An experimental proof of concept is demonstrated for two 10 Gbps phase-encoded (DPSK) channels showing more than 7 dB phase-sensitive gain and less than 1 dB penalty of the receiver sensitivity.

Interaction of additive and quantization noises in digital PLLs

Phase-locked loops (PLLs) are a crucial component in modern communications systems. Comprising of a phase-detector, linear filter, and controllable oscillator, they are widely used in radio receivers to retrieve the information content from remote signals. As such, they are capable of signal demodulation, phase and carrier recovery, frequency synthesis, and clock synchronization. Continuous-time PLLs are a mature area of study, and have been covered in the literature since the early classical work by Viterbi [1] in the 1950s. With the rise of computing in recent decades, discrete-time digital PLLs (DPLLs) are a more recent discipline; most of the literature published dates from the 1990s onwards. Gardner [2] is a pioneer in this area. It is our aim in this work to address the difficulties encountered by Gardner [3] in his investigation of the DPLL output phase-jitter where additive noise to the input signal is combined with frequency quantization in the local oscillator. The model we use in our novel analysis of the system is also applicable to another of the cases looked at by Gardner, that is the DPLL with a delay element integrated in the loop. This gives us the opportunity to look at this system in more detail, our analysis providing some unique insights into the variance `dip' seen by Gardner in [3]. We initially provide background on the probability theory and stochastic processes. These branches of mathematics are the basis for the study of noisy analogue and digital PLLs. We give an overview of the classical analogue PLL theory as well as the background on both the digital PLL and circle map, referencing the model proposed by Teplinsky et al. [4, 5]. For our novel work, the case of the combined frequency quantization and noisy input from [3] is investigated first numerically, and then analytically as a Markov chain via its Chapman-Kolmogorov equation. The resulting delay equation for the steady-state jitter distribution is treated using two separate asymptotic analyses to obtain approximate solutions. It is shown how the variance obtained in each case matches well to the numerical results. Other properties of the output jitter, such as the mean, are also investigated. In this way, we arrive at a more complete understanding of the interaction between quantization and input noise in the first order DPLL than is possible using simulation alone. We also do an asymptotic analysis of a particular case of the noisy first-order DPLL with delay, previously investigated by Gardner [3]. We show a unique feature of the simulation results, namely the variance `dip' seen for certain levels of input noise, is explained by this analysis. Finally, we look at the second-order DPLL with additive noise, using numerical simulations to see the effects of low levels of noise on the limit cycles. We show how these effects are similar to those seen in the noise-free loop with non-zero initial conditions.

Numerical Simulations and Coherence Properties of Supercontinuum Generation in Photonic Crystal and Tapered Optical Fibers

Numerical simulations have been used to study broad-band supercontinuum generation in optical fibers with dispersion and nonlinearity characteristics typical and photonic crystal or tapered fibers structures. The simulations include optical shock and Raman nonlinearity terms, with quantum noise taken into account phenomenologically by including in the input field a noise seed of one photon per mode with random phase. For input pulses of 150-fs duration injected in the anomalous dispersion regime, the effect of modulational instability is shown to lead to severe temporal jitter in the output, and associated fluctuations in the spectral amplitude and phase across the generated supercontinuum. The spectral phase fluctuations are quantified by performing multiple simulations and calculating both the standard deviation of the phase and, more rigorously, the degree of first-order coherence as a function of wavelength across the spectrum. By performing simulations over a range of input pulse durations and wavelengths, we can identify the conditions under which coherent supercontinua with a well-defined spectral phase are generated.

Traffic policing in ATM networks with multimedia traffic: the super leaky bucket

Traffic policing and bandwidth management strategies at the User Network Interface (UNI) of an ATM network are investigated by simulation. The network is assumed to transport real time (RT) traffic like voice and video as well as non-real time (non-RT) data traffic. The proposed policing function, called the super leaky bucket (S-LB), is based on the leaky bucket (LB), but handles the three types of traffic differently according to their quality of service (QoS) requirements. Separate queues are maintained for RT and non-RT traffic. They are normally served alternately, but if the number of RT cells exceeds a threshold, it gets non-pre-emptive priority. Further increase of the RT queue causes low priority cells to be discarded. Non-RT cells are buffered and the sources are throttled back during periods of congestion. The simulations clearly demonstrate the advantages of the proposed strategy in providing improved levels of service (delay, jitter and loss) for all types of traffic.

Single-shot characterisation of independent femtosecond extreme ultraviolet free electron andf infrared laser pulses

Two-color above threshold ionization of helium and xenon has been used to analyze the synchronization between individual pulses of the femtosecond extreme ultraviolet (XUV) free electron laser in Hamburg and an independent intense 120 fs mode-locked Ti:sapphire laser. Characteristic sidebands appear in the photoelectron spectra when the two pulses overlap spatially and temporally. The cross-correlation curve points to a 250 fs rms jitter between the two sources at the experiment. A more precise determination of the temporal fluctuation between the XUV and infrared pulses is obtained through the analysis of the single-shot sideband intensities. ©2007 American Institute of Physics

Comparison of Image Transform-Based Features for Visual Speech Recognition in Clean and Corrupted Videos

We present results of a study into the performance of a variety of different image transform-based feature types for speaker-independent visual speech recognition of isolated digits. This includes the first reported use of features extracted using a discrete curvelet transform. The study will show a comparison of some methods for selecting features of each feature type and show the relative benefits of both static and dynamic visual features. The performance of the features will be tested on both clean video data and also video data corrupted in a variety of ways to assess each feature type's robustness to potential real-world conditions. One of the test conditions involves a novel form of video corruption we call jitter which simulates camera and/or head movement during recording.

A distributed contention-vector division multiple access (D-CVDMA) protocol for wireless networks

Traditional Time Division Multiple Access (TDMA) protocol provides deterministic periodic collision free data transmissions. However, TDMA lacks flexibility and exhibits low efficiency in dynamic environments such as wireless LANs. On the other hand contention-based MAC protocols such as the IEEE 802.11 DCF are adaptive to network dynamics but are generally inefficient in heavily loaded or large networks. To take advantage of the both types of protocols, a D-CVDMA protocol is proposed. It is based on the k-round elimination contention (k-EC) scheme, which provides fast contention resolution for Wireless LANs. D-CVDMA uses a contention mechanism to achieve TDMA-like collision-free data transmissions, which does not need to reserve time slots for forthcoming transmissions. These features make the D-CVDMA robust and adaptive to network dynamics such as node leaving and joining, changes in packet size and arrival rate, which in turn make it suitable for the delivery of hybrid traffic including multimedia and data content. Analyses and simulations demonstrate that D-CVDMA outperforms the IEEE 802.11 DCF and k-EC in terms of network throughput, delay, jitter, and fairness.

Providing QoS for networked peers in distributed haptic virtual environments

Haptic information originates from a different human sense (touch), therefore the quality of service (QoS) required to supporthaptic traffic is significantly different from that used to support conventional real-time traffic such as voice or video. Each type ofnetwork impairment has different (and severe) impacts on the user’s haptic experience. There has been no specific provision of QoSparameters for haptic interaction. Previous research into distributed haptic virtual environments (DHVEs) have concentrated onsynchronization of positions (haptic device or virtual objects), and are based on client-server architectures.We present a new peerto-peer DHVE architecture that further extends this to enable force interactions between two users whereby force data are sent tothe remote peer in addition to positional information. The work presented involves both simulation and practical experimentationwhere multimodal data is transmitted over a QoS-enabled IP network. Both forms of experiment produce consistent results whichshow that the use of specific QoS classes for haptic traffic will reduce network delay and jitter, leading to improvements in users’haptic experiences with these types of applications.

Neonatal facial and cry responses to invasive and non-invasive procedures

Evaluation of pain in neonates is difficult due to their limited means of communication. The aim was to determine whether behavioural reactions of cry and facial activity provoked by an invasive procedure could be discriminated from responses to non-invasive tactile events. Thirty-six healthy full-term infants (mean age 2.2 h) received 3 procedures in counterbalanced order: intramuscular injection, application of triple dye to the umbilical stub, and rubbing thigh with alcohol. Significant effects of procedure were found for total face activity and latency to face movement. A cluster of facial actions comprised of brow bulging, eyes squeezed shut, deepening of the naso-labial furrow and open mouth was associated most frequently with the invasive procedure. Comparisons between the 2 non-invasive procedures showed more facial activity to thigh swabbing and least to application of triple dye to the umbilical cord. Acoustic analysis of cry showed statistically significant differences across procedures only for latency to cry and cry duration for the group as a whole. However, babies who cried to two procedures showed higher pitch and greater intensity to the injection. There were no significant differences in melody, dysphonation, or jitter. Methodological difficulties for investigators in this area were examined, including criteria for the selection of cries for analysis, and the logical and statistical challenges of contrasting cries induced by different conditions when some babies do not always cry. It was concluded that facial expression, in combination with short latency to onset of cry and long duration of first cry cycle typifies reaction to acute invasive procedures.

RADIATIVE SIGNATURES OF RELATIVISTIC SHOCKS

Particle-in-cell simulations of relativistic, weakly magnetized collisionless shocks show that particles can gain energy by repeatedly crossing the shock front. This requires scattering off self-generated small length-scale magnetic fluctuations. The radiative signature of this first-order Fermi acceleration mechanism is important for models of both the prompt and afterglow emission in gamma-ray bursts and depends on the strength parameter a = lambda e/delta B/mc(2) of the fluctuations (lambda is the length scale and vertical bar delta B vertical bar is the magnitude of the fluctuations). For electrons (and positrons), acceleration saturates when the radiative losses produced by the scattering cannot be compensated by the energy gained on crossing the shock. We show that this sets an upper limit on both the electron Lorentz factor gamma <10(6) (n/1 cm(-3))(-1/6)(-1/6) and on the energy of the photons radiated during the scattering process h omega(max) <40Max(a, 1)(n/1 cm(-3))(1/6)(-1/6) eV, where n is the number density of the plasma and (gamma) over bar is the thermal Lorentz factor of the downstream plasma, provided a <a(crit) similar to 10(6). This rules out "jitter" radiation on self-excited fluctuations with a <I as a source of gamma rays, although high-energy photons might still be produced when the jitter photons are upscattered in an analog of the synchrotron self-Compton process. In fluctuations with a > 1, radiation is generated by the standard synchrotron mechanism, and the maximum photon energy rises linearly with a, until saturating at 70 MeV, when a = a(crit).

Finding exoplanets orbiting young active stars - I. Technique

Stellar activity, such as starspots, can induce radial velocity (RV) variations that can mask or even mimic the RV signature of orbiting exoplanets. For this reason RV exoplanet surveys have been unsuccessful when searching for planets around young, active stars and are therefore failing to explore an important regime which can help to reveal how planets form and migrate. This paper describes a new technique to remove spot signatures from the stellar line-profiles of moderately rotating, active stars (v sin i ranging from 10 to 50 km s(-1)). By doing so it allows planetary RV signals to be uncovered. We used simulated models of a G5V type star with differing dark spots on its surface along with archive data of the known active star HD 49933 to validate our method. The results showed that starspots could be effectively cleaned from the line-profiles so that the stellar RV jitter was reduced by more than 80 per cent. Applying this procedure to the same models and HD 49933 data, but with fake planets injected, enabled the effective removal of starspots so that Jupiter mass planets on short orbital periods were successfully recovered. These results show that this approach can be useful in the search for hot-Jupiter planets that orbit around young, active stars with a v sin i of similar to 10-50 km/s.

Investigation of the M2/G2/1/ ∞, N Queue with Restricted Admission of Priority Customers and its Application to HSDPA Mobile Systems

This paper investigates a queuing system for QoS optimization of multimedia traffic consisting of aggregated streams with diverse QoS requirements transmitted to a mobile terminal over a common downlink shared channel. The queuing system, proposed for buffer management of aggregated single-user traffic in the base station of High-Speed Downlink Packet Access (HSDPA), allows for optimum loss/delay/jitter performance for end-user multimedia traffic with delay-tolerant non-real-time streams and partially loss tolerant real-time streams. In the queuing system, the real-time stream has non-preemptive priority in service but the number of the packets in the system is restricted by a constant. The non-real-time stream has no service priority but is allowed unlimited access to the system. Both types of packets arrive in the stationary Poisson flow. Service times follow general distribution depending on the packet type. Stability condition for the model is derived. Queue length distribution for both types of customers is calculated at arbitrary epochs and service completion epochs. Loss probability for priority packets is computed. Waiting time distribution in terms of Laplace-Stieltjes transform is obtained for both types of packets. Mean waiting time and jitter are computed. Numerical examples presented demonstrate the effectiveness of the queuing system for QoS optimization of buffered end-user multimedia traffic with aggregated real-time and non-real-time streams.