Global stability of Internet congestion controllers with heterogeneous delays

In this paper, we study the problem of designing globally stable, scalable congestion control algorithms for the Internet. Prior work has primarily used linear stability as the criterion for such a design. Global stability has been studied only for single node, single source problems. Here, we obtain conditions for a general topology network accessed by sources with heterogeneous delays. We obtain a sufficient condition for global stability in terms of the increase/decrease parameters of the congestion control algorithm and the price functions used at the links.     

End-to-end congestion control schemes: utility functions, random losses and ECN marks

We present a framework for designing end-to-end congestion control schemes in a network where each user may have a different utility function and may experience noncongestion-related losses. We first show that there exists an additive-increase-multiplicative-decrease scheme using only end-to-end measurable losses such that a socially optimal solution can be reached. We incorporate round-trip delay in this model, and show that one can generalize observations regarding TCP-type congestion avoidance to more general window flow control schemes. We then consider explicit congestion notification (ECN) as an alternate mechanism (instead of losses) for signaling congestion and show that ECN marking levels can be designed to nearly eliminate losses in the network by choosing the marking level independently for each node in the network. While the ECN marking level at each node may depend on the number of flows through the node, the appropriate marking level can be estimated using only aggregate flow measurements, i.e., per-flow measurements are not required.     

Stable scheduling policies for fading wireless channels

We study the problem of stable scheduling for a class of wireless networks. The goal is to stabilize the queues holding information to be transmitted over a fading channel. Few assumptions are made on the arrival process statistics other than the assumption that their mean values lie within the capacity region and that they satisfy a version of the law of large numbers. We prove that, for any mean arrival rate that lies in the capacity region, the queues will be stable under our policy. Moreover, we show that it is easy to incorporate imperfect queue length information and other approximations that can simplify the implementation of our policy.     

Vibration and damping characteristics of CNTR viscoelastic skewed shell structures under the influence of hygrothermal conditions

Engineering with Computers - The vibration and damping characteristics of carbon nanotubes reinforced (CNTR) skewed shell structure under a hygrothermal environment have been investigated using the...     

Compiler-assisted power optimization for clustered VLIW architectures

Clustered VLIW architectures solve the scalability problem associated with flat VLIW architectures by partitioning the register file and connecting only a subset of the functional units to a register file. However, inter-cluster communication in clustered architectures leads to increased leakage in functional components and a high number of register accesses. In this paper, we propose compiler scheduling algorithms targeting two previously ignored power-hungry components in clustered VLIW architectures, viz., instruction decoder and register file.We consider a split decoder design and propose a new energy-aware instruction scheduling algorithm that provides 14.5% and 17.3% benefit in the decoder power consumption on an average over a purely hardware based scheme in the context of 2-clustered and 4-clustered VLIW machines. In the case of register files, we propose two new scheduling algorithms that exploit limited register snooping capability to reduce extra register file accesses. The proposed algorithms reduce register file power consumption on an average by 6.85% and 11.90% (10.39% and 17.78%), respectively, along with performance improvement of 4.81% and 5.34% (9.39% and 11.16%) over a traditional greedy algorithm for 2-clustered (4-clustered) VLIW machine.     

Failure-prone production systems with uncertain demand

We consider a failure-prone manufacturing system with bursty demand arrivals. We prove that the hedging-point policy is optimal for this problem and provide analytical expressions to compute the hedging point. This allows us to compare our exact results to simpler approximations. We also show that our result leads to the solution for the constant demand rate problem, under an appropriate scaling of the demand process. We also provide a necessary and sufficient condition under which the just-in-time (JIT) policy is optimal for the case of linear, absolute value instantaneous cost     

Compiler-assisted energy optimization for clustered VLIW processors

Clustered architecture processors are preferred for embedded systems because centralized register file architectures scale poorly in terms of clock rate, chip area, and power consumption. Although clustering helps by improving the clock speed, reducing the energy consumption of the logic, and making the design simpler, it introduces extra overheads by way of inter-cluster communication. This communication happens over long global wires having high load capacitance which leads to delay in execution and significantly high energy consumption. Inter-cluster communication also introduces many short idle cycles, thereby significantly increasing the overall leakage energy consumption in the functional units. The trend towards miniaturization of devices (and associated reduction in threshold voltage) makes energy consumption in interconnects and functional units even worse, and limits the usability of clustered architectures in smaller technologies. However, technological advancements now permit the design of interconnects and functional units with varying performance and power modes. In this paper, we propose scheduling algorithms that aggregate the scheduling slack of instructions and communication slack of data values to exploit the low-power modes of functional units and interconnects. Finally, we present a synergistic combination of these algorithms that simultaneously saves energy in functional units and interconnects to improves the usability of clustered architectures by achieving better overall energy–performance trade-offs. Even with conservative estimates of the contribution of the functional units and interconnects to the overall processor energy consumption, the proposed combined scheme obtains on average 8% and 10% improvement in overall energy–delay product with 3.5% and 2% performance degradation for a 2-clustered and a 4-clustered machine, respectively. We present a detailed experimental evaluation of the proposed schemes. Our test bed uses the Trimaran compiler infrastructure.     

Stable, scalable, fair congestion control and AQM schemes that achieve high utilization in the Internet

Virtual queue-based active queue management schemes have been proposed to provide low-loss, low-delay service in the Internet. In an earlier work, we had proposed a particular scheme called the adaptive virtual queue (AVQ) algorithm where the capacity of the virtual queue is adapted to the traffic conditions to achieve a desired level of utilization in the network. Here, we study the choice of the parameters of the congestion-controllers at the sources and the AVQ scheme at the links that is required to ensure stability. In particular, we consider a system in which users with diverse round-trip delays and fairness requirements access a general topology network. For this system, we show that, by choosing the speed of adaptation at the sources and the links appropriately, one can guarantee the stability of the network.     

Synthesis and structural characterization of (Bi2O3)1?x (Y2O3)x and (Bi2O3)1?x (Gd2O3)x solid solutions

Solid solution series, (Bi₂O₃)_1−x (Y₂O₃)_x and (Bi₂O₃)_1−x (Gd₂O₃)_x, forx = 0.10, 0.20, 0.30 and 0.40 were synthesized by standard ceramic technique. The structural phase characterization was carried out using X-ray powder diffraction technique. It was found that the solid solution containing 20–40 mole% of Y₂O₃ had face-centred cubic structure. All samples of the solid solution series, (Bi₂O₃)_1−x (Gd₂O₃)_x, had rhombohedral single phase in the concentration range 0.10 ≤x ≤ 0.40. Lattice parameters offcc phase of Y₂O₃ doped samples were calculated from the X-ray diffraction data. The lattice constant ‘a’ gradually decreases with increasing content of dopant concentration (x) for the Y₂O₃ doped system and obeys Vegard’s rule. The unit cell parameters for the (Bi₂O₃)_1−x (Gd₂O₃)_x doped samples showing rhombohedral phase were obtained on hexagonal setting.     

OmniCon: a Mobile IP‐based vertical handoff system for wireless LAN and GPRS links

Wi‐Fi based hotspots offer mobile users broadband wireless Internet connectivity in public work spaces and corporate/university campuses. Despite the aggressive deployment of these hotspots in recent years, high‐speed wireless Internet access remains restricted to small geographical areas due to the limited physical coverage of wireless LANs. On the other hand, despite their lower throughput, cellular networks have a significantly wider coverage and are thus much more available. Recognizing that 2.5G or 3G cellular networks can effectively complement wireless LANs, we set out to develop a vertical handoff system that allows mobile users to seamlessly fall back to such cellular networks as the general packet radio service (GPRS) or 3G whenever wireless LAN connectivity is not available. The resulting handoff mechanism allows a network connection of a mobile node to operate over multiple wireless access networks in a way that is transparent to end user applications. In this paper, we present the design, implementation, and evaluation of a fully operational vertical handoff system, called OmniCon, which enables mobile nodes to automatically switch between wireless LAN and GPRS, based on wireless LAN availability, by introducing a simple extension to the existing Mobile IP implementation. We discuss the design issues in the proposed vertical handoff system for heterogeneous networks, including connection setup problems due to network address translation, and the disparity in link characteristics between wireless LANs and GPRS. A detailed performance evaluation study of the OmniCon prototype demonstrates its ability to migrate active network connections between these two wireless technologies with low handoff latency and close to zero packet loss. Copyright © 2006 John Wiley & Sons, Ltd.