Efficient dissemination of personalized information using content-based multicast

There has been a surge of interest in the delivery of personalized information to users (e.g., personalized stocks or travel information), particularly as mobile users with limited terminal device capabilities increasingly desire updated and targeted information in real time. When the number of information recipients is large and there is sufficient commonality in their interests, as is often the case, IP multicast is an efficient way of delivering the information. However, IP multicast services do not consider the structure and semantics of the information in the multicast process. We propose the use of Content-Based Multicast (CBM) where extra content filtering is performed at the interior nodes of the IP multicast tree; this will reduce network bandwidth usage and delivery delay, as well as the computation required at the sources and sinks. We evaluate the situations in which CBM is advantageous. The benefits of CBM depend critically upon how well filters are placed at interior nodes of the IP multicast tree and the costs depend upon those introduced by filters themselves. Further, we consider the benefits of allowing the filters to be mobile so as to respond to user mobility or changes in user interests and the corresponding costs of filter mobility. The criterion that we consider is the total network bandwidth utilization. For this criterion, we develop an optimal filter placement algorithm, as well as a heuristic that executes faster than the optimal algorithm. We evaluate the algorithms by means of simulation experiments. Our results indicate that filters can be effective in substantially reducing bandwidth. We also find filter mobility is worthwhile if there is marked large-scale user mobility. We conclude with suggestions for further work.     

Proposal for st-Routing Protocol

A routing protocol chooses one of the several paths (routes) from a source node to a destination node in the computer network, to send a packet of information. In this paper, we propose a new routing protocol, which we call st-routing protocol, based on st-numbering of a graph. The protocol fits well in noisy environments where robustness of routing using alternative paths is a major issue. The proposed routing protocol provides a systematic way to retry alternative paths without generating any duplicate packets. The protocol works for only those networks that can be represented by biconnected graphs.     

Randomized scheduling algorithms for high-aggregate bandwidth switches

The aggregate bandwidth of a switch is its port count multiplied by its operating line rate. We consider switches with high-aggregate bandwidths; for example, a 30-port switch operating at 40 Gb/s or a 1000-port switch operating at 1 Gb/s. Designing high-performance schedulers for such switches with input queues is a challenging problem for the following reasons: (1) high performance requires finding good matchings; (2) good matchings take time to find; and (3) in high-aggregate bandwidth switches there is either too little time (due to high line rates) or there is too much work to do (due to a high port count). We exploit the following features of the switching problem to devise simple-to-implement, high-performance schedulers for high-aggregate bandwidth switches: (1) the state of the switch (carried in the lengths of its queues) changes slowly with time, implying that heavy matchings will likely stay heavy over a period of time and (2) observing arriving packets will convey useful information about the state of the switch. The above features are exploited using hardware parallelism and randomization to yield three scheduling algorithms - APSARA, LAURA, and SERENA. These algorithms are shown to achieve 100% throughput and simulations show that their delay performance is quite close to that of the maximum weight matching, even when the traffic is correlated. We also consider the stability property of these algorithms under generic admissible traffic using the fluid-model technique. The main contribution of this paper is a suite of simple to implement, high-performance scheduling algorithms for input-queued switches. We exploit a novel operation, called MERGE, which combines the edges of two matchings to produce a heavier match, and study of the properties of this operation via simulations and theory. The stability proof of the randomized algorithms we present involves a derandomization procedure and uses methods which may have wider applicability.     

Novel Approach of Key Predistribution for Grid Based Sensor Networks

Wireless Personal Communications - Grid based sensor networks are significant for applications such as monitoring goods in a warehouse, studying traffic level of city streets, monitoring energy...     

Queue length‐based load balancing in data center networks

Traffic load balancing in data centers is an important requirement. Traffic dynamics and possibilities of changes in the topology (e.g., failures and asymmetries) make load balancing a challenging task. Existing end‐host–based schemes either employ the predominantly used ECN or combine it with RTT to get congestion information of paths. Both congestion signals, ECN and RTT, have limitations; ECN only tells whether the queue length is above or below a threshold value but does not inform about the extent of congestion; similarly, RTT in data center networks is on the scale of up to few hundreds of microseconds, and current data center operating systems lack fine‐grained microsecond‐level timers. Therefore, there is a need of a new congestion signal which should give accurate information of congestion along the path. Furthermore, in end‐host–based schemes, detecting asymmetries in the topology is challenging due to the inability to accurately measure RTT on the scale of microseconds. This paper presents QLLB, an end‐host–based, queue length–based load balancing scheme. QLLB employs a new queue length–based congestion signal that gives an exact measure of congestion along the paths. Furthermore, QLLB uses relative‐RTT to detect asymmetries in the topology. QLLB is implemented in ns‐3 and compared with ECMP, CONGA, and Hermes. The results show that QLLB significantly improves performance of short flows over the other schemes and performs within acceptable level, of CONGA and Hermes, for long flows. In addition, QLLB effectively detects asymmetric paths and performs better than Hermes under high loads.     

Epitaxial lift-off GaAs HEMT's

An extensive study of epitaxial lift-off (ELO) Al_0.3Ga _0.7As/GaAs modulation doped heterostructure high electron mobility field-effect transistors (HEMT's) is presented. Effects of ELO on electron transport properties of two-dimensional electron gas at AlGaAs/GaAs interface are investigated. An ELO HEMT with 1.5 μm gate length had a maximum extrinsic transconductance g_m-max=125 mS/mm, a unity current gain cut-off frequency f_t=10.5 GHz, and a maximum frequency of oscillation f_max=12 GHz. Statistical distributions of maximum intrinsic transconductance of ELO HEMT's are presented and compared with their on-wafer counterparts. Stability of the ELO HEMT's has also been evaluated by continuous operation at room temperature under dc bias     

An application of univariate marginal distribution algorithm in MIMO communication systems

The paper discusses a sequence detector based on univariate marginal distribution algorithm (UMDA) that jointly estimates the symbols transmitted in a multiple input multiple output (MIMO) communication system. While an optimal maximum likelihood detection using an exhaustive search method is prohibitively complex, it has been shown that sphere decoder (SD) achieves the optimal bit error rate (BER) performance with polynomial time complexity for smaller array sizes. However, the worst‐case complexity of SD is exponential in the problem dimensions, this brings in question its practical implementation for larger number of spatial layers and for higher‐order signal constellation. The proposed detector shows promising results for this overly difficult and complicated operating environment, confirmed through simulation results. A performance comparison of the UMDA detector with SD is presented for higher‐order complex MIMO architectures with limited average transmit power. The proposed detector achieves substantial performance gain for higher‐order systems attaining a near optimal BER performance with reduced computational complexity as compared with SD. Copyright © 2009 John Wiley & Sons, Ltd.     

Rough ZnO layers by LP-CVD process and their effect in improving performances of amorphous and microcrystalline silicon solar cells

Doped ZnO layers deposited by low-pressure chemical vapour deposition technique have been studied for their use as transparent contact layers for thin-film silicon solar cells.Surface roughness of these ZnO layers is related to their light-scattering capability; this is shown to be of prime importance to enhance the current generation in thin-film silicon solar cells. Surface roughness has been tuned over a large range of values, by varying thickness and/or doping concentration of the ZnO layers.A method is proposed to optimize the light-scattering capacity of ZnO layers, and the incorporation of these layers as front transparent conductive oxides for p–i–n thin-film microcrystalline silicon solar cells is studied.