Analytic models for the latency and steady-state throughput of TCP Tahoe, Reno, and SACK

Continuing the process of improvements made to TCP through the addition of new algorithms in Tahoe and Reno, TCP SACK aims to provide robustness to TCP in the presence of multiple losses from the same window. In this paper we present analytic models to estimate the latency and steady-state throughput of TCP Tahoe, Reno, and SACK and validate our models using both simulations and TCP traces collected from the Internet. In addition to being the first models for the latency of finite Tahoe and SACK flows, our model for the latency of TCP Reno gives a more accurate estimation of the transfer times than existing models. The improved accuracy is partly due to a more accurate modeling of the timeouts, evolution of cwnd during slow start and the delayed ACK timer. Our models also show that, under the losses introduced by the droptail queues which dominate most routers in the Internet, current implementations of SACK can fail to provide adequate protection against timeouts and a loss of roughly more than half the packets in a round will lead to timeouts. We also show that with independent losses SACK performs better than Tahoe and Reno and, as losses become correlated, Tahoe can outperform both Reno and SACK.     

A VQ-based blind image restoration algorithm

Learning-based algorithms for image restoration and blind image restoration are proposed. Such algorithms deviate from the traditional approaches in this area, by utilizing priors that are learned from similar images. Original images and their degraded versions by the known degradation operator (restoration problem) are utilized for designing the VQ codebooks. The codevectors are designed using the blurred images. For each such vector, the high frequency information obtained from the original images is also available. During restoration, the high frequency information of a given degraded image is estimated from its low frequency information based on the codebooks. For the blind restoration problem, a number of codebooks are designed corresponding to various versions of the blurring function. Given a noisy and blurred image, one of the codebooks is chosen based on a similarity measure, therefore providing the identification of the blur. To make the restoration process computationally efficient, the principal component analysis (PCA) and VQ-nearest neighbor approaches are utilized. Simulation results are presented to demonstrate the effectiveness of the proposed algorithms.     

Synthesis of ZSM‐5 Films and Monoliths with Bimodal Micro/Mesoscopic Structures

A route to synthesize ZSM‐5 crystals with a bimodal micro/mesoscopic pore system has been developed in this study; the successful incorporation of the mesopores within the ZSM‐5 structure was performed using tetrapropylammonium hydroxide (TPAOH)‐impregnated mesoporous materials containing carbon nanotubes in the pores, which were encapsulated in the ZSM‐5 crystals during a solid rearrangement process within the framework. Such mesoporous ZSM‐5 zeolites can be readily obtained as powders, thin films, or monoliths.     

The First Template‐Free Growth of Crystalline Silicon Microtubes

A simple template‐free high‐temperature evaporation method was developed for the growth of crystalline Si microtubes for the first time. As‐grown Si microtubes were characterized using X‐ray diffraction, scanning electron microscopy, transmission electron microscopy, and room‐temperature photoluminescence. The lengths of the Si tubes can reach several hundreds of micrometers; some of them have lengths on the order of millimeters. Each tube has a uniform outer diameter along its entire length, and the typical outer diameter is ≈ 2–3 μm. Most of the tubes have a wall thickness of ≈ 400–500 nm, though a considerable number of them exhibit a very thin wall thickness of ≈ 50 nm. Room‐temperature photoluminescence measurement shows the as‐synthesized Si microtubes have two strong emission peaks centered at ≈ 589 nm and ≈ 617 nm and a weak emission peak centered at ≈ 455 nm. A possible mechanism for the formation of these Si tubes is proposed. We believe that the present discovery of the crystalline Si microtubes will promote further experimental studies on their physical properties and smart applications.     

Optimal pilot waveform assisted modulation for ultrawideband communications

Ultrawideband (UWB) transmissions induce pronounced frequency-selective fading effects in their multipath propagation. Multipath diversity gains can be collected to enhance performance, provided that the underlying channel can be estimated at the receiver. To this end, we develop a novel pilot waveform assisted modulation (PWAM) scheme that is tailored for UWB communications. We select our PWAM parameters by jointly optimizing channel estimation performance and information rate. The resulting transmitter design maximizes the average capacity, which is shown to be equivalent to minimizing the mean-square channel estimation error, and thereby achieves the Crame/spl acute/r-Rao lower bound. Application of PWAM to practical UWB systems is promising because it entails simple integrate-and-dump operations at the frame rate. Equally important, it offers a flexible UWB channel estimator, capable of striking desirable rate-performance tradeoffs depending on the channel coherence time.     

A Multilayer Optical Packet Switching Network Based on the Kautz Graph and Optical Passive Star Couplers

The multihop optical network is the most appropriate solution to satisfy the increasing applications of Internet services. This paper extends the regular Kautz graph to one with multiple layers in order to produce more architectural variations. The connectivity between adjacent layers utilizes the systematic connection patterns of a regular Kautz graph. A routing algorithm based on its property is presented. Optical passive star (OPS) couplers are adopted to implement our new topologies. Three scheduling criteria that can solve the contention problem in the intermediate nodes are evaluated and compared in terms of their capability to improve the accessibility.     

On trading wavelengths with fibers: a cost-performance based study

We consider the effect of multiple fibers on wavelength division multiplexing networks without wavelength conversion. We study networks with dynamic wavelength routing and develop accurate analytical models to compare various possible options using single- and multiple-fiber networks. We use results of an analytical model and simulation-based studies to evaluate the blocking performance and cost of multifiber networks. The number of fibers required providing high performance in multifiber networks and their costs are compared. A case is made for using multiple fibers in each link with fewer wavelengths instead of using a single fiber with many wavelengths. In particular, we show that a network with four fibers per link and with four wavelengths on each fiber without any wavelength conversion on any node yields similar same performance as the networks with one fiber per link and 16 wavelengths per fiber on each link and with full wavelength conversion capability on all nodes. In addition, the multifiber network may also offer the cost advantage depending on the relative cost of components. We develop a parametric cost model to show that multiple fibers in each link are an attractive option. Finally, such multifiber networks also has fault tolerance, with respect to a single fiber failure, already built into the system.     

QR factoring to compute the GCD of univariate approximate polynomials

We present a stable and practical algorithm that uses QR factors of the Sylvester matrix to compute the greatest common divisor (GCD) of univariate approximate polynomials over /spl Ropf/[x] or /spl Copf/[x]. An approximate polynomial is a polynomial with coefficients that are not known with certainty. The algorithm of this paper improves over previously published algorithms by handling the case when common roots are near to or outside the unit circle, by splitting and reversal if necessary. The algorithm has been tested on thousands of examples, including pairs of polynomials of up to degree 1000, and is now distributed as the program QRGCD in the SNAP package of Maple 9.     

Derivation of a second-order switching surface in the boundary control of buck converters

A second-order switching surface in the boundary control of buck converters is derived in this letter. The formulated switching surface can make the overall converter exhibit better steady-state and transient behaviors than the one with a first-order switching surface. The switching surface is derived by estimating the state trajectory movement after a switching action, resulting in a high state trajectory velocity along the switching surface. This phenomenon accelerates the trajectory moving toward the target operating point. The proposed control scheme has been successfully applied to a 120-W buck converter. The large-signal performance and a comparison with the first-order switching surface have been studied.