Data Mining Practical Machine Learning Tools and Techniques

Praise for the Third Edition: "This is one of the best books available. Its excellent organizational structure allows quick reference to specific models and its clear presentation . . . solidifies the understanding of the concepts being presented."IIE Transactions on Operations EngineeringThoroughly revised and expanded to reflect the latest developments in the field, Fundamentals of Queueing Theory, Fourth Edition continues to present the basic statistical principles that are necessary to analyze the probabilistic nature of queues. Rather than presenting a narrow focus on the subject, this update illustrates the wide-reaching, fundamental concepts in queueing theory and its applications to diverse areas such as computer science, engineering, business, and operations research.This update takes a numerical approach to understanding and making probable estimations relating to queues, with a comprehensive outline of simple and more advanced queueing models. Newly featured topics of the Fourth Edition include:Retrial queuesApproximations for queueing networksNumerical inversion of transformsDetermining the appropriate number of servers to balance quality and cost of serviceEach chapter provides a self-contained presentation of key concepts and formulae, allowing readers to work with each section independently, while a summary table at the end of the book outlines the types of queues that have been discussed and their results. In addition, two new appendices have been added, discussing transforms and generating functions as well as the fundamentals of differential and difference equations. New examples are now included along with problems that incorporate QtsPlus software, which is freely available via the book's related Web site.With its accessible style and wealth of real-world examples, Fundamentals of Queueing Theory, Fourth Edition is an ideal book for courses on queueing theory at the upper-undergraduate and graduate levels. It is also a valuable resource for researchers and practitioners who analyze congestion in the fields of telecommunications, transportation, aviation, and management science.

Fundamentals of Queueing Theory

/pdf/a-break-in-the-clouds-towards-a-cloud-definition-svovsw1r5a.pdf

A Break in the Clouds: Towards a Cloud Definition

Network virtualization is recognized as an enabling technology for the future Internet. It aims to overcome the resistance of the current Internet to architectural change. Application of this technology relies on algorithms that can instantiate virtualized networks on a substrate infrastructure, optimizing the layout for service-relevant metrics. This class of algorithms is commonly known as "Virtual Network Embedding (VNE)" algorithms. This paper presents a survey of current research in the VNE area. Based upon a novel classification scheme for VNE algorithms a taxonomy of current approaches to the VNE problem is provided and opportunities for further research are discussed.

Virtual Network Embedding: A Survey

Network anomaly detection is an important and dynamic research area. Many network intrusion detection methods and systems (NIDS) have been proposed in the literature. In this paper, we provide a structured and comprehensive overview of various facets of network anomaly detection so that a researcher can become quickly familiar with every aspect of network anomaly detection. We present attacks normally encountered by network intrusion detection systems. We categorize existing network anomaly detection methods and systems based on the underlying computational techniques used. Within this framework, we briefly describe and compare a large number of network anomaly detection methods and systems. In addition, we also discuss tools that can be used by network defenders and datasets that researchers in network anomaly detection can use. We also highlight research directions in network anomaly detection.

Network Anomaly Detection: Methods, Systems and Tools

The emergence of Bluetooth as a default radio interface has allowed handheld electronic devices to be instantly interconnected as ad-hoc networks. These short range ad-hoc wireless networks, called piconets, operate in the unlicensed 2.45 GHz ISM (industrial-scientific-medical) band where up to eight devices may be used to configure single or overlapping piconets. As all piconets operating in the same frequency band, the presence of multiple piconets creates interference on signal reception. This paper employs a signal capture model to study the piconet MAC performance, taking inter-piconet interference into consideration. Furthermore, extensive simulation is performed to validate the throughput obtained from our model. These results indicate that Bluetooth throughput is sensibly affected by multiple piconet interference.

Piconet interference modeling and performance evaluation of Bluetooth MAC protocol

Internet Service Providers (ISP) have been recently relying on Deep Packet Inspection (DPI) systems, which are the most accurate techniques for traffic identification and classification. However, building high performance DPI systems requires an in-depth and careful computing system design due to the memory and processing power demands. DPI's accuracy mostly depends on string matching process and regular expression heuristics that go deep down on the packet payloads in a search for networked application signatures. As ISPs backbone links' speed and data volume soar, commodity hardware-based DPI systems start to face performance bottlenecks (e.g., packet losses), which interferes on traffic classification accuracy dramatically. In this paper we propose a lightweight DPI (LW-DPI) system that overcomes performance bottlenecks of traditional DPI systems, without a significant decrease on accuracy. We evaluate LW-DPI's accuracy by inspecting two factors: a limited number of full-payload packets in a given flow or a fraction of the packet payload. Our experiments were performed using more than 6TB of packet-level data from a large ISP and show that there is some interesting trade-offs between such factors and accuracy. Most flows can be classified with only their first 7 packets or a fraction of their payload. We also show that the impact on DPI's processing time may decrease around 75% as compared to analyzing all full-payload packets in a flow.

Slimming Down Deep Packet Inspection Systems

Despite of Cloud infrastructures can be used as High Performance Computing (HPC) platforms, many issues from virtualization overhead had kept them unrelated. However, with advent of container-based virtualizers, this scenario acquires new perspectives because this technique promises to decrease the virtualization overhead, achieving a near-native performance. In this work, we analyzed the performance of a container-based virtualization solution - Linux Container (LXC) - against a hyper visor-based virtualization solution - KVM - under HPC activities. For our experiments, we considered CPU and communication (network and inter-process communication), and results showed the virtualizer type can impact distinctly in performance according to resource used by application.

Performance Analysis of LXC for HPC Environments

There are several strategies in the literature to geolocate Internet hosts, however the accuracy of their estimates is a common issue. Furthermore, accurate Internet host location remains a challenge due to incomplete domain registers. In this paper, we propose a classification for geolocation strategies and present the Whois Based Geolocation (WBG) approach, a strategy developed to geolocate Internet hosts given their IP address information. This new mechanism is based on different strategies combination and uses a heuristic to improve the results. An analysis that considers both accuracy and completeness is made showing the effectiveness of our tool.

Whois Based Geolocation: A Strategy to Geolocate Internet Hosts

Virtual Worlds (VW), such as Massive Multiplayer Online Social Games, have been gaining increasing attention in the last few years, mainly due to the new way users interact with them. However, little effort has been devoted to understand their traffic profile and the implications to the traffic management area. With the current growing rate of VWs’ usage, their traffic demand could eventually impose a significant burden on the operation of a typical Internet Service Provider (ISP) network. In this paper, we seek to understand the traffic behavior of an increasingly popular VW application, namely Second Life (SL), from both the connection and network level perspectives. We also show results of a traffic analysis of a SL client, when an avatar performs different actions in the VW, at different places and under different network conditions. Our results show that SL makes intensive use of network resources (mostly bandwidth), since the capacity needed for having a full SL experience (listening to live music) may reach 500 kbps. We then extend the traffic analysis work on SL by providing analytical models for its traffic profile. We aim at helping the network management and planning area to estimate the impact of an intense use of such VW on access links or core networks. Such synthetic models are also useful to the networking research community for the use in network simulations.

Djamel Sadok

Papers

Piconet interference modeling and performance evaluation of Bluetooth MAC protocol

Slimming Down Deep Packet Inspection Systems

Performance Analysis of LXC for HPC Environments

Whois Based Geolocation: A Strategy to Geolocate Internet Hosts

Traffic analysis and synthetic models of second life