arXiv subjects

Liang Wang

Publications and source records attributed to Liang Wang.

676 records · Page 38Linked to original sources

arXiv2013

Effects of Cooperation Policy and Network Topology on Performance of In-Network Caching

We model the cooperation policy with only two parameters -- search radius $r$ and number of copies in the network $N_{copy}$. These two parameters represent the range of cooperation and tolerance of duplicates. We show how cooperation policy impacts content distribution, and further illustrate the relation between content popularity and topological properties. Our work leads many implications on how to take advantage of topological properties in in-network caching strategy design.

cs.NI↗

arXiv2013

In-Network Caching vs. Redundancy Elimination

Network-level Redundancy Elimination (RE) techniques have been proposed to reduce the amount of traffic in the Internet. and the costs of the WAN access in the Internet. RE middleboxes are usually placed in the network access gateways and strip off the repeated data from the packets. More recently, generic network-level caching architectures have been proposed as alternative to reduce the redundant data traffic in the network, presenting benefits and drawbacks compared to RE. In this paper, we compare a generic in-network caching architecture against state-of-the-art redundancy elimination (RE) solutions on real network topologies, presenting the advantages of each technique. Our results show that in-network caching architectures outperform state-of-the-art RE solutions across a wide range of traffic characteristics and parameters.

cs.NI↗

arXiv2013

LiteLab: Efficient Large-scale Network Experiments

Large-scale network experiments is a challenging problem. Simulations, emulations, and real-world testbeds all have their advantages and disadvantages. In this paper we present LiteLab, a light-weight platform specialized for large-scale networking experiments. We cover in detail its design, key features, and architecture. We also perform an extensive evaluation of LiteLab's performance and accuracy and show that it is able to both simulate network parameters with high accuracy, and also able to scale up to very large networks. LiteLab is flexible, easy to deploy, and allows researchers to perform large-scale network experiments with a short development cycle. We have used LiteLab for many different kinds of network experiments and are planning to make it available for others to use as well.

cs.DC↗

arXiv2013

Experimenting with BitTorrent on a Cluster: A Good or a Bad Idea?

Evaluation of large-scale network systems and applications is usually done in one of three ways: simulations, real deployment on Internet, or on an emulated network testbed such as a cluster. Simulations can study very large systems but often abstract out many practical details, whereas real world tests are often quite small, on the order of a few hundred nodes at most, but have very realistic conditions. Clusters and other dedicated testbeds offer a middle ground between the two: large systems with real application code. They also typically allow configuring the testbed to enable repeatable experiments. In this paper we explore how to run large BitTorrent experiments in a cluster setup. We have chosen BitTorrent because the source code is available and it has been a popular target for research. Our contribution is twofold. First, we show how to tweak and configure the BitTorrent client to allow for a maximum number of clients to be run on a single machine, without running into any physical limits of the machine. Second, our results show that the behavior of BitTorrent can be very sensitive to the configuration and we revisit some existing BitTorrent research and consider the implications of our findings on previously published results. As we show in this paper, BitTorrent can change its behavior in subtle ways which are sometimes ignored in published works.

cs.DC↗

arXiv2013

Robustness of Link-prediction Algorithm Based on Similarity and Application to Biological Networks

Many algorithms have been proposed to predict missing links in a variety of real networks. These studies focus on mainly both accuracy and efficiency of these algorithms. However, little attention is paid to their robustness against either noise or irrationality of a link existing in almost all of real networks. In this paper, we investigate the robustness of several typical node-similarity-based algorithms and find that these algorithms are sensitive to the strength of noise. Moreover, we find that it also depends on networks' structure properties, especially on network efficiency, clustering coefficient and average degree. In addition, we make an attempt to enhance the robustness by using link weighting method to transform un-weighted network to weighted one and then make use of weights of links to characterize their reliability. The result shows that proper link weighting scheme can enhance both robustness and accuracy of these algorithms significantly in biological networks while it brings little computational effort.

physics.soc-ph↗

arXiv2011

A Possible Substellar Companion to the Intermediate-mass Giant HD 175679

We report the discovery of a substellar companion around the intermediatemass giant HD 175679. Precise radial velocity data of the star from Xinglong Station and Okayama Astrophysical Observatory (OAO) revealed a Keplerian velocity variation with an orbital period of 1366.8 \pm 5.7 days, a semiamplitude of 380.2 \pm 3.2m s.1, and an eccentricity of 0.378 \pm 0.008. Adopting a stellar mass of 2.7 \pm 0.3 M\odot, we obtain the minimum mass of the HD 175679 b is 37.3 \pm 2.8 MJ, and the semimajor axis is 3.36 \pm 0.12 AU. This discovery is the second brown dwarf companion candidate from a joint planet-search program between China and Japan.

astro-ph.EP↗

arXiv2011

Stellar Parameters and Chemical Abundances of G Giants

We present basic stellar parameters of 99 late-type G giants based on high resolution spectra obtained by the High Dispersion Spectrograph attached to Subaru Telescope. These stars are targets of a Doppler survey program searching for extra-solar planets among evolved stars, with a metallicity of -0.8<[Fe/H]<+0.2. We also derived their abundances of 15 chemical elements, including four $α$-elements (Mg, Si, Ca, Ti), three odd-Z light elements (Al, K, Sc), four iron peak elements (V, Cr, Fe, Ni), and four neutron-capture elements (Y, Ba, La, Eu). Kinematic properties reveal that most of the program stars belong to the thin disk.

astro-ph.SR↗

arXiv2011

The Pan-Pacific Planet Search: A southern hemisphere search for planets orbiting evolved massive stars

The vast majority of known extrasolar planets orbit stars with a narrow range of masses (0.7-1.3 M_sun). Recent years have seen rapid growth in our knowledge about the properties of planetary systems with host stars significantly more massive than the Sun. Planet formation models predict that giant planets are more common around higher-mass stars (M>1.5M_sun). However, these types of stars pose severe observational challenges while on the main sequence, resulting in a strong bias against them in current planet searches. Fortunately, it is possible to obtain high-precision Doppler velocities for these massive stars as they evolve off the main sequence and cool as subgiants. We describe the Pan-Pacific Planet Search, a survey of 170 subgiant stars using the 3.9m Australian Astronomical Telescope. In collaboration with J. Johnson's Keck survey of Northern retired A stars, we are monitoring nearly every subgiant brighter than V=8. This survey will provide critical statistics on the frequency and characteristics of planetary systems formed around higher-mass stars.

astro-ph.EP↗

arXiv2010

Across Browsers SVG Implementation

In this work SVG will be translated into VML or HTML by using Javascript based on Backbase Client Framework. The target of this project is to implement SVG to be viewed in Internet Explorer without any plug-in and work together with other Backbase Client Framework languages. The result of this project will be added as an extension to the current Backbase Client Framework.

cs.GR↗

arXiv2003

Make search become the internal function of Internet

Domain Resource Integrated System (DRIS) is introduced in this paper. DRIS is a distributed information retrieval system, which will solve problems like poor coverage, long update interval in current web search system. The most distinct character of DRIS is that it's a public opening system, and acts as an internal component of Internet, but not the production of a company. The implementation of DRIS is also represented.

cs.IR↗