When network is undergoing problems such as congestion, scan attack, DDoS etc., measurements are much more important than usual. In this case, traffic characteristics including available bandwidth, packet rate, and flow size distribution vary drastically, significantly degrading the performance of measurements. To address issue, we propose Elastic sketch. It adaptive to currently characteristics. Besides, it generic measurement tasks platforms. We implement sketch on six platforms: P4, FPGA,...

Peer-to-peer networks often use incentive policies to encourage cooperation between nodes. Such systems are generally susceptible collusion by groups of users in order gain unfair advantages over others. While techniques have been proposed combat Web spam collusion, there few measurements real deployed systems. In this paper, we report analysis and measurement results user Maze, a large-scale peer-to-peer file sharing system with non-net-zero point-based policy. We search for colluding...

The development of drugs for the control tumor angiogenesis requires a simple, accurate, and economical assay tumor-induced vascularization. We have adapted orthotopic implantation model to measurement by using human tumors labeled with Aequorea victoria green fluorescent protein grafting into nude mice. nonluminous induced capillaries are clearly visible against very bright fluorescence examined either intravitally or whole-body luminance in real time. cancer has been well characterized,...

As the study of large graphs over hundreds gigabytes becomes increasingly popular for various data-intensive applications in cloud computing, developing graph processing systems has become a hot and fruitful research area. Many those existing support vertex-oriented execution model allow users to develop custom logics on vertices. However, inherently random access pattern computation generates significant amount network traffic. While partitioning is known be effective reduce traffic...

Set queries are fundamental operations in computer systems and applications. This paper addresses the problem of designing a probabilistic data structure that can quickly process set using small amount memory. We propose Shifting Bloom Filter (ShBF) framework for representing querying sets. demonstrate effectiveness ShBF three types popular queries: membership, association, multiplicity queries. The key novelty is on encoding auxiliary information element location offset. In contrast, prior...

Neighbor discovery plays a crucial role in the formation of wireless sensor networks and mobile where power sensors (or devices) is constrained. Due to difficulty clock synchronization, many asynchronous protocols based on wake-up scheduling have been developed over years order enable timely neighbor between neighboring while saving energy. However, existing are not fine-grained enough support all heterogeneous battery duty cycles, which can lead more rapid deterioration long-term health for...

Recent improvements in vehicular ad hoc networks are accelerating the realization of intelligent transportation system (ITS), which not only provides road safety and driving efficiency, but also enables infotainment services. Since data dissemination plays an important part ITS, recent studies have found caching as a promising way to promote efficiency against rapid variation network topology. In this paper, we focus on scenario roadside unit (RSU) caching, where multiple content providers...

This study numerically investigates the effects of damping ratios on flow-induced vibration (FIV) two-degree-of-freedom elastically mounted tandem cylinders. By setting spacing between cylinder centers to four diameters, FIV problem was solved using two-dimensional unsteady Reynolds-averaged Navier–Stokes equations and shear stress transport k−ω turbulence model. Four typical 0.0036, 0.036, 0.198, 0.36 are employed explore response. Simulation results show that peak transverse amplitudes...

In cognitive radio (CR) networks, a pair of CR nodes have to ``rendezvous'' on common channel for link establishment. Channel hopping (CH) protocols been proposed creating rendezvous over multiple channels reduce the possibility failures caused by detection primary user signals. Rendezvous within minimal bounded time is challenging problem in heterogeneous networks where two may asynchronous clocks, different sensing capabilities, no universal set, and index systems. this paper, we present...

Edge devices with sensing, storage, and communication resources (e.g., smartphones, tablets, connected vehicles, IoT nodes) are increasingly penetrating our daily lives. Many novel applications can be created through sharing data among nearby peer edge devices. In such applications, caching at some greatly improve availability, retrieval robustness, delivery latency. this paper, we study the unique problem of fairness in computing environments. Due to heterogeneity devices, load balance is a...

Edge devices (e.g., smartphones, tablets, connected vehicles, IoT nodes) with sensing, storage and communication resources are increasingly penetrating our environments. Many novel applications can be created when nearby peer edge share data. Caching greatly improve the data availability, retrieval robustness latency. In this paper, we study unique issue of caching fairness in environment. Due to distinct ownership devices, load balance is critical. We consider metrics formulate an integer...

Recently proposed wireless proactive caching has opened up a promising avenue for reducing the redundant traffic load of future network. In addition to infrastructure updating, schemes different scenarios are also essential problems concern. Along with benefits brought by caching, cost should be taken into account, since can influenced interest relevant parties in networks. this article, we discuss several typical and apply corresponding game theoretical models illustrate how selfishness may...

Per-flow measurement is a critical issue in computer networks, and one of its key tasks to count the number packets each flow (for big streaming data). The literature has demonstrated that sketch most memory-efficient data structure for counting task, widely used distributed systems. Existing sketches often use many counters are same size record flow, thus forced be large enough accommodate largest flow. Unfortunately, as flows small (i.e., mice flows) only very few elephant flows),...

Set queries are fundamental operations in computer networks. This paper addresses the problem of designing a probabilistic data structure that can quickly process set using small amount memory. We propose shifting bloom filter (ShBF) framework for representing and querying sets. demonstrate effectiveness ShBF three types popular queries: membership, association, multiplicity queries. The key novelty is on encoding auxiliary information element location offset. In contrast, prior BF-based...

Abstract The three-body problem is common in astronomy, examples of which are the solar system, exoplanets, and stellar systems. Due to its chaotic characteristic, discovered by Poincaré, only three families periodic orbits were found 300 years, until 2013 when Šuvakov Dmitrašinović (2013, Phys. Rev. Lett., 110, 114301) 13 new a Newtonian planar with equal mass. Recently, more than 600 triple systems mass Li Liao (2017, Sci. China-Phys. Mech. Astron., 60, 129511). Here, we report 1349 system...

The famous three-body problem can be traced back to Newton in 1687, but quite few families of periodic orbits were found 300 years thereafter. In this paper, we propose an effective approach and roadmap numerically gain planar systems with arbitrary masses by means machine learning based on artificial neural network (ANN) model. Given any a known orbit as starting point, provide more (of the same family name) variable masses, while mass domain having becomes larger larger, ANN model wiser...