52,146 research outputs found

    A traffic classification method using machine learning algorithm

    Get PDF
    Applying concepts of attack investigation in IT industry, this idea has been developed to design a Traffic Classification Method using Data Mining techniques at the intersection of Machine Learning Algorithm, Which will classify the normal and malicious traffic. This classification will help to learn about the unknown attacks faced by IT industry. The notion of traffic classification is not a new concept; plenty of work has been done to classify the network traffic for heterogeneous application nowadays. Existing techniques such as (payload based, port based and statistical based) have their own pros and cons which will be discussed in this literature later, but classification using Machine Learning techniques is still an open field to explore and has provided very promising results up till now

    Towards the characterization of individual users through Web analytics

    Full text link
    We perform an analysis of the way individual users navigate in the Web. We focus primarily in the temporal patterns of they return to a given page. The return probability as a function of time as well as the distribution of time intervals between consecutive visits are measured and found to be independent of the level of activity of single users. The results indicate a rich variety of individual behaviors and seem to preclude the possibility of defining a characteristic frequency for each user in his/her visits to a single site.Comment: 8 pages, 4 figures. To appear in Proceeding of Complex'0

    Traffic on complex networks: Towards understanding global statistical properties from microscopic density fluctuations

    Get PDF
    We study the microscopic time fluctuations of traffic load and the global statistical properties of a dense traffic of particles on scale-free cyclic graphs. For a wide range of driving rates R the traffic is stationary and the load time series exhibits antipersistence due to the regulatory role of the superstructure associated with two hub nodes in the network. We discuss how the superstructure affects the functioning of the network at high traffic density and at the jamming threshold. The degree of correlations systematically decreases with increasing traffic density and eventually disappears when approaching a jamming density Rc. Already before jamming we observe qualitative changes in the global network-load distributions and the particle queuing times. These changes are related to the occurrence of temporary crises in which the network-load increases dramatically, and then slowly falls back to a value characterizing free flow

    Time- and Frequency-Varying KK-Factor of Non-Stationary Vehicular Channels for Safety Relevant Scenarios

    Full text link
    Vehicular communication channels are characterized by a non-stationary time- and frequency-selective fading process due to fast changes in the environment. We characterize the distribution of the envelope of the first delay bin in vehicle-to-vehicle channels by means of its Rician KK-factor. We analyze the time-frequency variability of this channel parameter using vehicular channel measurements at 5.6 GHz with a bandwidth of 240 MHz for safety-relevant scenarios in intelligent transportation systems (ITS). This data enables a frequency-variability analysis from an IEEE 802.11p system point of view, which uses 10 MHz channels. We show that the small-scale fading of the envelope of the first delay bin is Ricean distributed with a varying KK-factor. The later delay bins are Rayleigh distributed. We demonstrate that the KK-factor cannot be assumed to be constant in time and frequency. The causes of these variations are the frequency-varying antenna radiation patterns as well as the time-varying number of active scatterers, and the effects of vegetation. We also present a simple but accurate bi-modal Gaussian mixture model, that allows to capture the KK-factor variability in time for safety-relevant ITS scenarios.Comment: 26 pages, 12 figures, submitted to IEEE Transactions on Intelligent Transportation Systems for possible publicatio

    Agents, Bookmarks and Clicks: A topical model of Web traffic

    Full text link
    Analysis of aggregate and individual Web traffic has shown that PageRank is a poor model of how people navigate the Web. Using the empirical traffic patterns generated by a thousand users, we characterize several properties of Web traffic that cannot be reproduced by Markovian models. We examine both aggregate statistics capturing collective behavior, such as page and link traffic, and individual statistics, such as entropy and session size. No model currently explains all of these empirical observations simultaneously. We show that all of these traffic patterns can be explained by an agent-based model that takes into account several realistic browsing behaviors. First, agents maintain individual lists of bookmarks (a non-Markovian memory mechanism) that are used as teleportation targets. Second, agents can retreat along visited links, a branching mechanism that also allows us to reproduce behaviors such as the use of a back button and tabbed browsing. Finally, agents are sustained by visiting novel pages of topical interest, with adjacent pages being more topically related to each other than distant ones. This modulates the probability that an agent continues to browse or starts a new session, allowing us to recreate heterogeneous session lengths. The resulting model is capable of reproducing the collective and individual behaviors we observe in the empirical data, reconciling the narrowly focused browsing patterns of individual users with the extreme heterogeneity of aggregate traffic measurements. This result allows us to identify a few salient features that are necessary and sufficient to interpret the browsing patterns observed in our data. In addition to the descriptive and explanatory power of such a model, our results may lead the way to more sophisticated, realistic, and effective ranking and crawling algorithms.Comment: 10 pages, 16 figures, 1 table - Long version of paper to appear in Proceedings of the 21th ACM conference on Hypertext and Hypermedi
    • …
    corecore