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

This paper presents how to model and carry out the performance analysis of message-oriented middleware (MOM) using generalised stochastic Petri Net (GSPN) models. The results obtained from the Petri net analysis are compared against ones measured in a commercial MOM. Additionally, some results are presented in order to demonstrate the flexibility and the benefits of the proposed model. This research also focuses on how to improve the MOM performance by suggesting appropriated techniques and adjustments to the MOM basic architecture. Finally, we point out some decisions usually taken by systems administrators that may have a major impact on the performance of MOM systems.

On the generalised stochastic Petri net modeling of message-oriented middleware systems

In this paper we present implementation guidelines of the Distributed Cloud Resource Allocation System (D-CRAS). D-CRAS ensures an automatic monitoring and control of resources to guarantee the optimal functioning of the Cloud while meeting developers' requirements. Additionally, this work establishes the necessary technologies that meet the construction of the proposed system.

D-CRAS: Distributed cloud resource allocation system

The Internet’s default inter-domain routing protocol is the Border Gateway Protocol (BGP). With the BGP, dozens of thousands of Autonomous Systems (ASs) exchange network layer reachability information to manage connectivity among them. The BGP was introduced in the early stages of the Internet, and although the BGP is one of the most successful protocols, new desirable features have been difficult to incorporate into the network over the decades. Thus, this paper classifies previous works to evolve the control plane of inter-domain routing into three types of approaches: brand new design; incremental improvement; inter-domain communication. The main goal of this paper is to provide an understanding of what approaches have been taken to evolve the inter-domain routing control plane. This survey also discusses why the control plane’s issues are hard to evolve and future perspectives for that topic.

A Survey on Efforts to Evolve the Control Plane of Inter-Domain Routing

RIP - A robust IP access architecture

The future generation of computer networks brings us several challenges. Automation is one of the most pursued functionalities for such networks. It means that research around this area goes toward the auto- and self- technologies such as self-management, self-addressing and self-healing. This paper presents a novel approach for self-addressing in dynamic networks. It is a stateful and distributed protocol, which relies on addressing servers spread in the network. These servers have the objective of executing addressing tasks, aiming an address conflict-free environment. We also present the results of the first experiments on the proposed approach, where its performance and behavior were evaluated. To validate these results, comparisons between our proposed protocol and a classic stateless addressing mechanism were done.

Djamel Sadok

Papers

On the generalised stochastic Petri net modeling of message-oriented middleware systems

D-CRAS: Distributed cloud resource allocation system

A Survey on Efforts to Evolve the Control Plane of Inter-Domain Routing

RIP - A robust IP access architecture

An autonomous addressing mechanism as support for auto-configuration in dynamic networks