No abstract

No abstract

SUMMARYWe present an approximation for the tail asymptotics in an infinite capacity single server queue serviced at a constant rate driven by general multifractal input process. We show that in the special and important case of the monofractal fractional Brownian motion input traffic our result gives the well-known Weibullian tail. We prove that the class of Gaussian processes with scaling properties is in the class of monofractal processes and we derive the related characterization functions. Our formula in the case of Gaussian input processes also gives a queueing result which is in good agreement with the theory of Gaussian processes. Applying the approximation we provide a new practical method for queueing performance estimation of general multifractal traffic. The validation of the method based on both analysis of simulations and measured network traffic have also been presented.

Abstract. The paper is aimed at a methodological development in biological pest control. The 10 considered one pest two-agent system is modelled as a verticum-type system. Originally, linear 11 verticum-type systems were introduced by one of the authors for modelling certain industrial 12 systems. These systems are hierarchically composed of linear subsystems such that a part of the 13 state variables of each subsystem affect the dynamics of the next subsystem. Recently, 14 verticum-type system models have been applied to population ecology as well, which required 15 the extension of the concept a verticum-type system to the nonlinear case. 16In the present paper the general concepts and technics of nonlinear verticum-type control 17 systems are used to obtain biological control strategies in a two-agent system. For the 18 illustration of this verticum-type control, these tools of mathematical systems theory are applied 19 to a dynamic model of interactions between the egg and larvae populations of the sugarcane 20 borer (Diatraea saccharalis) and its parasitoids: the egg parasitoid Trichogramma galloi and the 21 larvae parasitoid Cotesia flavipes. 22In this application a key role is played by the concept of controllability, which means that it is 23 possible to steer the system to an equilibrium in given time. In addition to a usual linearization, 24 the basic idea is a decomposition of the control of the whole system into the control of the 25 subsystems, making use of the verticum structure of the population system. The main aim of 26 this study is to show several advantages of the verticum (or decomposition) approach over the 27 classical control theoretical model (without decomposition). For example, in the case of 28 verticum control the pest larval density decreases below the critical threshold value much 29 quicker than without decomposition. Furthermore, it is also shown that the verticum approach 30 may be better even in terms of cost effectiveness. The presented optimal control methodology 31 also turned out to be an efficient tool for the "in silico" analysis of the cost-effectiveness of 32 different biocontrol strategies, e.g. by answering the question how far it is cost-effective to 33 speed up the reduction of the pest larvae density, or along which trajectory this reduction should 34 be carried out. 35 36

No abstract

<p class="MsoNormal" style="text-align: left; margin: 0cm 0cm 0pt; layout-grid-mode: char;" align="left"><span class="text"><span style="font-family: ";Arial";,";sans-serif";; font-size: 9pt;">Recent measurement studies report that a significant portion of Internet traffic is unknown. It is very likely that the majority of the unidentified traffic originates from peer-to-peer (P2P) applications. However, traditional techniques to identify P2P traffic seem to fail since these applications usually disguise their existence by using arbitrary ports. In addition to the identification of actual P2P traffic, the characteristics of that type of traffic are also scarcely known.The main purpose of this paper is twofold. First, we propose a novel identification method to reveal P2P traffic from traffic aggregation. Our method does not rely on packet payload so we avoid the difficulties arising from legal, privacy-related, financial and technical obstacles. Instead, our method is based on a set of heuristics derived from the robust properties of P2P traffic. We demonstrate our method with current traffic data obtained from one of the largest Internet providers in Hungary. We also show the high accuracy of the proposed algorithm by means of a validation study.Second, several results of a comprehensive traffic analysis study are reported in the paper. We show the daily behavior of P2P users compared to the non-P2P users. We present our important finding about the almost constant ratio of the P2P and total number of users. Flow sizes and holding times are also analyzed and results of a heavy-tail analysis are described. Finally, we discuss the popularity distribution properties of P2P applications. Our results show that the unique properties of P2P application traffic seem to fade away during aggregation and characteristics of the traffic will be similar to that of other non-P2P traffic aggregation.</span></span><span style="font-family: ";Arial";,";sans-serif";; font-size: 9pt;"></span></p>

No abstract

No abstract