Intelligent Distributed Computing X:

Proceedings of the 10th International

Symposium on Intelligent Distributed
Computing – IDC 2016, Paris, France,
October 10-12 2016 1st Edition Costin
Badica
Visit to download the full and correct content document:
https://textbookfull.com/product/intelligent-distributed-computing-x-proceedings-of-the
-10th-international-symposium-on-intelligent-distributed-computing-idc-2016-paris-fra
nce-october-10-12-2016-1st-edition-costin-badic/
More products digital (pdf, epub, mobi) instant
download maybe you interests ...

Biota Grow 2C gather 2C cook Loucas

https://textbookfull.com/product/biota-grow-2c-gather-2c-cook-
loucas/

Internet and Distributed Computing Systems 12th

International Conference IDCS 2019 Naples Italy October
10 12 2019 Proceedings Raffaele Montella

https://textbookfull.com/product/internet-and-distributed-
computing-systems-12th-international-conference-idcs-2019-naples-
italy-october-10-12-2019-proceedings-raffaele-montella/

Internet and Distributed Computing Systems 9th

International Conference IDCS 2016 Wuhan China
September 28 30 2016 Proceedings 1st Edition Wenfeng Li

https://textbookfull.com/product/internet-and-distributed-
computing-systems-9th-international-conference-idcs-2016-wuhan-
china-september-28-30-2016-proceedings-1st-edition-wenfeng-li/

International Proceedings on Advances in Soft Computing

Intelligent Systems and Applications ASISA 2016 1st
Edition M. Sreenivasa Reddy

https://textbookfull.com/product/international-proceedings-on-
advances-in-soft-computing-intelligent-systems-and-applications-
asisa-2016-1st-edition-m-sreenivasa-reddy/
Progress in Advanced Computing and Intelligent
Engineering Proceedings of ICACIE 2016 Volume 2 1st
Edition Khalid Saeed

https://textbookfull.com/product/progress-in-advanced-computing-
and-intelligent-engineering-proceedings-of-
icacie-2016-volume-2-1st-edition-khalid-saeed/

Progress in Advanced Computing and Intelligent

Engineering Proceedings of ICACIE 2016 Volume 1 1st
Edition Khalid Saeed

https://textbookfull.com/product/progress-in-advanced-computing-
and-intelligent-engineering-proceedings-of-
icacie-2016-volume-1-1st-edition-khalid-saeed/

Advances in Visual Computing 12th International

Symposium ISVC 2016 Las Vegas NV USA December 12 14
2016 Proceedings Part II 1st Edition George Bebis

https://textbookfull.com/product/advances-in-visual-
computing-12th-international-symposium-isvc-2016-las-vegas-nv-
usa-december-12-14-2016-proceedings-part-ii-1st-edition-george-
bebis/

Advances in Visual Computing 12th International

Symposium ISVC 2016 Las Vegas NV USA December 12 14
2016 Proceedings Part I 1st Edition George Bebis

https://textbookfull.com/product/advances-in-visual-
computing-12th-international-symposium-isvc-2016-las-vegas-nv-
usa-december-12-14-2016-proceedings-part-i-1st-edition-george-
bebis/

Formal Techniques for Distributed Objects Components

and Systems 36th IFIP WG 6 1 International Conference
FORTE 2016 Held as Part of the 11th International
Federated Conference on Distributed Computing
Techniques DisCoTec 2016 Heraklion Crete Gr 1st Edition
https://textbookfull.com/product/formal-techniques-for-
distributed-objects-components-and-systems-36th-ifip-
Elvira Albert
wg-6-1-international-conference-forte-2016-held-as-part-of-
Studies in Computational Intelligence 678

Costin Badica
Amal El Fallah Seghrouchni
Aurélie Beynier · David Camacho
Cédric Herpson · Koen Hindriks
Paulo Novais Editors

Intelligent
Distributed
Computing X
Proceeding of the 10th International
Symposium on Intelligent Distributed
Computing – IDC 2016, Paris, France,
October 10–12 2016
Studies in Computational Intelligence

Volume 678

Series editor
Janusz Kacprzyk, Polish Academy of Sciences, Warsaw, Poland
e-mail: kacprzyk@ibspan.waw.pl
About this Series

The series “Studies in Computational Intelligence” (SCI) publishes new develop-

ments and advances in the various areas of computational intelligence—quickly and
with a high quality. The intent is to cover the theory, applications, and design
methods of computational intelligence, as embedded in the fields of engineering,
computer science, physics and life sciences, as well as the methodologies behind
them. The series contains monographs, lecture notes and edited volumes in
computational intelligence spanning the areas of neural networks, connectionist
systems, genetic algorithms, evolutionary computation, artificial intelligence,
cellular automata, self-organizing systems, soft computing, fuzzy systems, and
hybrid intelligent systems. Of particular value to both the contributors and the
readership are the short publication timeframe and the worldwide distribution,
which enable both wide and rapid dissemination of research output.

More information about this series at http://www.springer.com/series/7092

Costin Badica Amal El Fallah Seghrouchni
•

Aurélie Beynier David Camacho

•

Cédric Herpson Koen Hindriks

•

Paulo Novais
Editors

Intelligent Distributed
Computing X
Proceeding of the 10th International
Symposium on Intelligent Distributed
Computing – IDC 2016, Paris, France,
October 10–12 2016

123
Editors
Costin Badica David Camacho
Faculty of Automatics, Computer Science Universidad Autonoma de Madrid
and Electronics C. Francisco Tomas y Valiente, 11
University of Craiova Madrid
Craiova Spain
Romania
Cédric Herpson
Amal El Fallah Seghrouchni Sorbonne Universités
Sorbonne Universités UPMC Univ Paris 06, CNRS,
UPMC Univ Paris 06, CNRS, LIP6 UMR 7606
LIP6 UMR 7606 Paris
Paris France
France
Koen Hindriks
Aurélie Beynier Faculty of EEMCS
Sorbonne Universités Delft University of Technology
UPMC Univ Paris 06, CNRS, Delft, Zuid-Holland
LIP6 UMR 7606 The Netherlands
Paris
France Paulo Novais
Universidade do Minho
Campus of Gualtar
Braga
Portugal

ISSN 1860-949X ISSN 1860-9503 (electronic)

Studies in Computational Intelligence
ISBN 978-3-319-48828-8 ISBN 978-3-319-48829-5 (eBook)
DOI 10.1007/978-3-319-48829-5

Library of Congress Control Number: 2016954716

© Springer International Publishing AG 2017

This work is subject to copyright. All rights are reserved by the Publisher, whether the whole or part
of the material is concerned, specifically the rights of translation, reprinting, reuse of illustrations,
recitation, broadcasting, reproduction on microfilms or in any other physical way, and transmission
or information storage and retrieval, electronic adaptation, computer software, or by similar or dissimilar
methodology now known or hereafter developed.
The use of general descriptive names, registered names, trademarks, service marks, etc. in this
publication does not imply, even in the absence of a specific statement, that such names are exempt from
the relevant protective laws and regulations and therefore free for general use.
The publisher, the authors and the editors are safe to assume that the advice and information in this
book are believed to be true and accurate at the date of publication. Neither the publisher nor the
authors or the editors give a warranty, express or implied, with respect to the material contained herein or
for any errors or omissions that may have been made.

Printed on acid-free paper

This Springer imprint is published by Springer Nature

The registered company is Springer International Publishing AG
The registered company address is: Gewerbestrasse 11, 6330 Cham, Switzerland
 Preface

Intelligent Distributed Computing emerged as the result of the fusion and cross-
fertilization of ideas and research results in Intelligent Computing and Dis-
tributed Computing. Its main outcome was the development of the new gen-
eration of intelligent distributed systems, by combining methods and technol-
ogy from classical artificial intelligence, computational intelligence, multi-agent-
systems, and distributed systems.
The 10th Intelligent Distributed Computing IDC2016 continues the tradition
of the IDC Symposium Series that started 10 years ago as an initiative of two
research groups from:
1. Systems Research Institute, Polish Academy of Sciences, Warsaw, Poland
2. Software Engineering Department, University of Craiova, Craiova, Romania
The IDC Symposium welcomes submissions of original papers on all aspects
of intelligent distributed computing ranging from concepts and theoretical devel-
opments to advanced technologies and innovative applications. The symposium
aims to bring together researchers and practitioners involved in all aspects of
Intelligent Distributed Computing. IDC is interested in works that are relevant
for both Distributed Computing and Intelligent Computing, with scientific merit
in these areas.

This volume contains the proceedings of the 10th International Symposium

on Intelligent Distributed Computing, IDC2016. The symposium was hosted by
the Laboratoire d’Informatique de Paris 6 from the University Pierre and Marie
Curie, in Paris, France, between the 10th and the 12th of October, 2016.

The IDC2016 event comprised the main conference organized in eight ses-
sions: Dynamic Systems, Internet of Things, Security, Space-Based Coordination,
Behavioral Analysis, Optimization, Data Management and IC-Smart.
The proceedings book contains contributions, with 23 regular papers selected
from a total of 38 received submissions from 18 countries (counting the coun-
try of each co-author for each paper submitted). Each submission was carefully
reviewed by at least three members of the Program Committee. Acceptance
and publication were judged based on the relevance to the symposium topics,
clarity of presentation, originality and accuracy of results, and proposed solu-
tions. The acceptance rates were 60%, counting only regular papers. The con-
tributions published in this book address many topics related to theory and
applications of intelligent distributed computing including: cloud computing,
P2P networks, agent-based distributed simulation, ambient agents, smart and
context-driven environments, Internet of Things, network security, mobile com-
puting, Unmanned Vehicles, augmented physical reality, swarm computing, team
and social computing, constraints and optimization, and information fusion.

v
vi Preface

We would like to thank Janusz Kacprzyk, editor of Studies in Computational

Intelligence series and member of the Steering Committee, for his continuous
support and encouragement for the development of the IDC Symposium Series.
Also, we would like to thank the IDC2016 Program Committee members for
their work in promoting the event and refereeing submissions and also to all
colleagues who submitted their work to this event.
We deeply appreciate the efforts of our invited speakers Pr. Serge Haddad
from ENS Cachan, France, and Pr. Carlos COTTA from Universidad de Mlaga,
Spain, and thank them for their interesting lectures.
A special thanks also go to organizers of the special session IC-Smart : Amal
El Fallah Seghrouchni and Kenji Tei. Finally, we appreciate the efforts of local
organizers on behalf of the Laboratoire d’Informatique de Paris 6 (LIP6) from
the University Pierre and Marie Curie, Sorbonnes Universities, in Paris, France,
for hosting and organizing this event.

Craiova Costin Badica

Paris Amal El Fallah Seghrouchni
Paris Aurélie Beynier
Madrid David Camacho
Paris Cédric Herpson
Zuid-Holland Koen Hindriks
Braga Paulo Novais

July 2016
 Organization

Organizer
MultiAgent System team (SMA)
Laboratoire d’Informatique de Paris 6 (LIP6)
Sorbonne Universités, UPMC Univ Paris 06, France

General Chairs
Amal El Fallah Seghrouchni LIP6 - UPMC Sorbonne Universités, France
Costin Badica University of Craiova, Romania

Program Committee Chairs

Aurélie Beynier UPMC Sorbonne Universités, LIP6, France
David Camacho Universidad Autonoma de Madrid, Spain
Koen Hindriks Delft Robotics Institute, The Netherlands
Paulo Novais University of Minho, Portugal

Invited Speakers
Carlos Cotta Universidad de Malaga, Spain
Serge Haddad ENS Cachan, France

Program Comittee
Ajith Abraham Machine Intelligence Research Labs (MIR Labs)
Salvador Abreu JFLI-CNRS / LISP / CRI, University of Evora
Amparo Alonso-Betanzos University of A Corua
Ricardo Anacleto ISEP
Cesar Analide University of Minho
Razvan Andonie Central Washington University
Javier Bajo .Universidad Politécnica de Madrid
Nick Bassiliades Aristotle University of Thessaloniki
David Bednrek Charles University Prague
Doina Bein California State University, Fullerton
Gema Bello Orgaz Universidad Autonoma de Madrid
Nik Bessis Edge Hill University
Lars Braubach University of Hamburg
Dumitru Dan Burdescu University of Craiova
Giacomo Cabri Universit di Modena e Reggio Emilia
Davide Carneiro Universidade do Minho
Andre Carvalho USP
vii
viii Organization

Jose Carlos Castillo Montoya Universidad Carlos III de Madrid

Jen-Yao Chung IBM
Dorian Cojocaru University of Craiova
Rem Collier UCD
Phan Cong-Vinh Nguyen Tat Thanh University
Lus Correia University of Lisbon
Ängelo Costa Universidade do Minho
Paul Davidsson Malm University
Javier Del Ser Tecnalia Resaerch & Innovation
Giuseppe Di Fatta University of Reading
Amal El Fallah Seghrouchni UPMC Sorbonne Universités, LIP6, France
Vadim Ermolayev Zaporozhye National Univ.
Antonio Fernndez-Caballero Universidad de Castilla-La Mancha
Adina Magda Florea University Politehnica of Bucharest,
AI-MAS Laboratory
Giancarlo Fortino University of Calabria
Maria Ganzha University of Gdask
Antonio Gonzalez-Pardo Universidad Autonoma de Madrid
Bertha Guijarro-Berdias University of A Corua
Marjan Gusev UKIM University St Cyril and Methodius
Adnan Hashmi University of Lahore
Cédric Herpson UPMC Sorbonne Universités, LIP6, France
Dosam Hwang Yeungnam University
Barna Laszlo Iantovics Petru Maior University of Tg. Mures
Fuyuki Ishikawa National Institute of Informatics
Mirjana Ivanovic University of Novi Sad, Faculty of Sciences
Vicente Julian GTI-IA DSIC UPV
Jason Jung Chung-Ang University
Igor Kotenko St. Petersburg Institute for Informatics and
Automation
Dariusz Krol Wrocaw University of Technology
Florin Leon Technical University ”Gheorghe Asachi” of Iasi
Alessandro Longheu DIEEI - University of Catania
José Machado University of Minho, Computer Science and
Technology Centre
Ana Madureira Departamento de Engenharia Informtica
Giuseppe Mangioni DIEEI - University of Catania
Goreti Marreiros ISEP/IPP-GECAD
Ester Martinez-Martin Universitat Jaume I
Viviana Mascardi Department of Informatics, University of Genova
Ficco Massimo Second University of Naples (SUN)
Héctor Menéndez University Autonoma of Madrid
Organization ix

John-Jules Meyer Utrecht University

Paulo Moura Oliveira UTAD University
Grzegorz J Nalepa AGH University of Science and Technology
Jose Neves Universidade do Minho
David Obdrzalek Charles University in Prague
Andrea Omicini Alma Mater StudiorumUniversit di Bologna
Fernando Otero University of Kent
Juan Pavn Universidad Complutense de Madrid
Pawel Pawlewski Poznan University of Technology
Stefan-Gheorghe Pentiuc University Stefan cel Mare Suceava
Antonio Pereira Escola Superior de Tecnologia e Gesto do
IPLeiria
Dana Petcu West University of Timisoara
Florin Pop University Politehnica of Bucharest
Antonio Portilla-Figueras Universidad de Alcala
Maria Potop-Butucaru UPMC Sorbonne Universités, LIP6, Paris
Radu-Emil Precup Politehnica University of Timisoara
Maria D. R-Moreno Universidad de Alcala
Shahram Rahimi Southern Illinois University
Alessandro Ricci University of Bologna
Joel J.P.C. Rodrigues Instituto de Telecomunicaes, University of
Beira Interior
Domenico Rosaci DIMET Department, University Mediterranea
of Reggio Calabria
Sancho Salcedo-Sanz Universidad de Alcal
Corrado Santoro University of Catania - Dipartimento di
Matematica e Informatica
Ichiro Satoh National Institute of Informatics
Weiming Shen National Research Council
Fbio Silva Universidade do Minho
Safeeullah Soomro Indus University
Giandomenico Spezzano CNR-ICAR and University of Calabria
Stanimir Stoyanov University of Plovdiv ”Paisii Hilendarski”
Anna Toporkova National Research University Higher
School of Economics
Rainer Unland University of Duisburg-Essen, ICB
Salvatore Venticinque Seconda Universit di Napoli
Lucian Vintan ”Lucian Blaga” University of Sibiu
Martijn Warnier Delft University of Technology
Michal Wozniak Wroclaw University of Technology
Jakub Yaghob Charles University in Prague
Filip Zavoral Charles University in Prague
x Organization

Organizing Committee
Aurélie Beynier UPMC Sorbonne Universités, LIP6, France
Amal El Fallah Seghrouchni UPMC Sorbonne Universités, LIP6, France
Cédric Herpson UPMC Sorbonne Universités, LIP6, France

Sponsoring Institutions

Sorbonne Universités, UPMC Univ Paris 06

Laboratoire d’Informatique de Paris 6 (LIP6)
Faculté d’Ingénierie, UFR 919, UPMC
 Table of Contents

I Dynamic Systems

Adaptive Scaling Up/Down for Elasitc Clouds . . . . . . . . . . . . . . . . . . . . . . . . 3

Ichiro Satoh

A Dynamic Model to enhance the Distributed Discovery of SWs in P2P

Overlay Networks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13
Adel Boukhadra, Karima Benatchba and Amar Balla

Simulation of Dynamic Systems Using BDI Agents: Initial Steps . . . . . . . . 23

Amelia Bădică and Costin Bădică and Marius Brezovan

II Internet of Things
A Multi-Agent Middleware for the Deployment of Distributed
Applications in Smart Environments . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 37
Ferdinand Pierre, Cédric Dinont, Amal El Fallah Seghrouchni and
Patrick Taillibert

A Guidance of Ambient Agents Adapted to Opportunistic Situations . . . . 47

Ahmed-Chawki Chaouche, Jean-Michel Ilié and Djamel Eddine
Saı̈douni

Extended Context Patterns – A Visual Language for Context-Aware

Applications . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 57
Andrei Olaru and Adina Magda Florea

MDE4IoT: Supporting the Internet of Things with Model-Driven

Engineering . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 67
Federico Ciccozzi and Romina Spalazzese

III Security
Detection of traffic anomalies in multi-service networks based on a
fuzzy logical inference . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 79
Igor Saenko, Sergey Ageev, and Igor Kotenko

Reconfiguration of RBAC schemes by genetic algorithms . . . . . . . . . . . . . . . 89

Igor Saenko and Igor Kotenko

String-based Malware Detection for Android Environments . . . . . . . . . . . . . 99

Alejandro Martı́n, Héctor D. Menéndez and David Camacho
xi
xii Table of Contents

IV Space-Based Coordination

Optimal Configuration Model of a Fleet of Unmanned Vehicles for

Interoperable Missions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 111
Gabriella Gigante, Domenico Pascarella, Salvatore Luongo, Carlo
Di Benedetto, Angela Vozella, and Giuseppe Persechino

Spatial Tuples: Augmenting Physical Reality with Tuple Spaces . . . . . . . . . 121

Alessandro Ricci , Mirko Viroli, Andrea Omicini, Stefano Mariani,
Angelo Croatti and Danilo Poanini

Exploring unknown environments with multi-modal locomotion swarm . . . 131

Zedadra Ouarda, Jouandeau Nicolas, Seridi Hamid and Fortino
Giancarlo

V Behavioral Analysis

GroupTrust: Finding Trust-based Group Structures in Social Communities 143

Antonello Comi, Lidia Fotia, Fabrizio Messina, Domenico Rosaci
and Giuseppe M.L. Sarné

Non-intrusive Monitoring of Attentional Behavior in Teams . . . . . . . . . . . . 153

Davide Carneiro, Dalila Dures, Javier Bajo and Paulo Novais

A Speculative Computation Approach for Conflict Styles Assessment

with Incomplete Information . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 163
Marco Gomes, Tiago Oliveira and Paulo Novais

Forming Classes in an e-Learning Social Network Scenario . . . . . . . . . . . . . 173

Pasquale De Meo, Lidia Fotia, Fabrizio Messina, Domenico Rosaci,
Giuseppe M. L. Sarné

VI Optimization

Scheduling Optimization in Grid with VO Stakeholders’ Preferences . . . . . 185

V. Toporkov, A. Toporkova, D. Yemelyanov, A. Bobchenkov and A.
Tselishchev

On the Application of Bio-inspired Heuristics for Network Routing

with Multiple QoS Constraints . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 195
Miren Nekane Bilbao, Cristina Perfecto, Javier Del Ser, Xabier
Landa
Table of Contents xiii

Dealing with the Best Attachment Problem via Heuristics . . . . . . . . . . . . . . 205

M. Buzzanca, V. Carchiolo, A. Longheu, M. Malgeri and
G. Mangioni

VII Data Management

Towards Collaborative Sensing using Dynamic Intelligent Virtual Sensors 217
Radu-Casian Mihailescu, Jan Persson, Paul Davidsson, Ulrik
Eklund

Intelligent Data Metrics for Urban Driving with Data Fusion and
Distributed Machine Learning . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 227
Fbio Silva, Artur Quintas, Jason J. Jung, Paulo Novais and Cesar
Analide

A Probabilistic Sample Matchmaking Strategy for Imbalanced Data

Streams with Concept Drift . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 237
Jesus L. Lobo, Javier Del Ser, Miren Nekane Bilbao, Ibai Laña,
Sancho Salcedo Sanz

Author Index . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 247

 Part I

Dynamic Systems
 Adaptive Scaling Up/Down for Elastic Clouds

Ichiro Satoh

National Institute of Informatics

2-1-2 Hitotsubashi, Chiyoda-ku, Tokyo, Japan
ichiro@nii.ac.jp

Abstract. An approach for adapting distributed applications in response to changes

in user requirements and resource availability is presented. The notion of elastic-
ity enables capabilities and resources to be dynamically provisioned and released.
However, existing applications do not inherently support elastic capabilities and
resources. To solve this problem, we propose two novel functions: dynamic de-
ployment of components and dividing and merging components. The former en-
ables components to relocate themselves at new servers when provisioning the
servers and at remaining servers when deprovisioning servers, while the latter
enables the states of components to be divided, passed to other components, and
merged with other components in accordance with user-deÀned functions. We
constructed a middleware system for Java-based general-purpose software com-
ponents with the two functions because they are useful to adapt applications to
elasticity in cloud computing. The proposed system is useful because it enables
applications be operated with elastic capabilities and resources in cloud comput-
ing.

1 Introduction

Elasticity in cloud computing was originally deÀned in physics as a material property

with the capability of returning to its original state after a deformation. The concept of
elasticity has been applied to computing and is commonly considered to be one of the
central attributes of cloud computing. For example, the NIST deÀnition of cloud com-
puting [10] states that capabilities can be elastically provisioned and released, in some
cases automatically, to scale rapidly outward and inward in accordance with demand.
To the consumer, the capabilities available for provisioning often appear to be unlimited
and can be appropriated in any quantity at any time.
However, the conventional design and development of application software are not
able to adapt themselves to elastically provisioning and deprovisioning resources in
cloud computing. Furthermore, it is difÀcult to deprive parts of the computational re-
sources that such applications have already used. There have been a few attempts to
solve this problem. For example, Mesos [4] is a platform for sharing commodity clus-
ters between distributed data processing frameworks such as Hadoop and Spark. These
frameworks themselves are elastic in the sense that they have the ability to scale their
resources up or down, i.e., they can start using resources as soon as applications want
to acquire the resources or release the resources as soon as the applications do not need
them.

© Springer International Publishing AG 2017 3

C. Badica et al. (eds.), Intelligent Distributed Computing X,
Studies in Computational Intelligence 678, DOI 10.1007/978-3-319-48829-5_1
4 I. Satoh

We assume that applications are running on dynamic distributed systems, includ-

ing cloud computing environments, in the sense that computational resources avail-
able from the applications may be dynamically changed due to elasticity. We propose a
framework for enabling distributed applications to be adapted to changes in their avail-
able resources on elastic distributed systems as much as possible. The key ideas behind
the framework are the duplication and migration of running software components and
the integration of multiple same components into single components. To adapt dis-
tributed applications, which consist of software components, to elasticity in cloud com-
puting, the framework divides applications into some of the components and deploys
the components at servers, which are provisioned, and merges the components running
at servers, which are deprovisioned, into other components running at other available
servers. We are constructing a middleware system for adapting general-purpose soft-
ware components to changes in elastic cloud computing.

2 Related Work

Cloud computing environments allow for novel ways of efÀcient execution and manage-
ment of complex distributed systems, such as elastic resource provisioning and global
distribution of application components. Resource allocation management has been stud-
ied for several decades in various contexts in distributed systems, including cloud com-
puting. We focus here on only the most relevant work in the context of large-scale server
clusters and cloud computing in distributed systems. Several recent studies have ana-
lyzed cluster traces from Yahoo!, Google, and Facebook and illustrate the challenges
of scale and heterogeneity inherent in these modern data centers and workloads. Mesos
[4] splits the resource management and placement functions between a central resource
manager and multiple data processing frameworks such as Hadoop and Spark by us-
ing an offer-based mechanism. Resource allocation is performed in a central kernel and
master-slave architecture with a two-level scheduling system. With Mesos, reclaim of
resources is handled for unallocated capacity that is given to a framework. The Google
Borg system [11] is an example of a monolithic scheduler that supports both batch jobs
and long-running services. It provides a single RPC interface to support both types of
workload. Each Borg cluster consists of multiple cells, and it scales by distributing the
master functions among multiple processes and using multi-threading. YARN [14] is a
Hadoop-centric cluster manager. Each application has a manager that negotiates for the
resources it needs with a central resource manager. These systems assume the execu-
tion of particular applications, e.g., Hadoop and Spark, or can assign resources to their
applications before the applications start. In contrast, our framework enables running
applications to adapt themselves to changes in their available resources.
Several academic and commercial projects have explored attempts to create auto-
scaling applications. Most of them have used static mechanisms in the sense that they
are based on models to be deÀned and tuned at design time. For example, Tamura et al.
[13] proposed an approach to identify system viability zones that are deÀned as states
in which the system operation is not compromised and to verify whether the current
available resources can satisfy the validation at the development of the applications.
The variety of available resources with different characteristics and costs, variability and
Adaptive Scaling Up/Down for Elastic Clouds 5

unpredictability of workload conditions, and different effects of various conÀgurations

of resource allocations make the problem extremely hard if not impossible to solve
algorithmically at design time.
ReconÀguration of software systems at runtime to achieve speciÀc goals has been
studied by several researchers. For example, Jaeger et al. [6] introduced the notion of
self-organization to an object request broker and a publish / subscribe system. Lym-
beropoulos et al. [9] proposed a speciÀcation for adaptations based on their policy spec-
iÀcation, Ponder [1], but it was aimed at specifying management and security policies
rather than application-speciÀc processing and did not support the mobility of compo-
nents. Lupu and Sloman [8] described typical conÁicts between multiple adaptations
based on the Ponder language. Garlan et al. [3] presented a framework called Rainbow
that provided a language for specifying self-adaptation. The framework supported adap-
tive connections between operators of components that might be running on different
computers. They intended to adapt coordinations between existing software compo-
nents to changes in distributed systems, instead of increasing or decreasing the number
of components.
Most existing attempts have been aimed at provisioning of resources, e.g., the work
of Sharman at al. [12]. Therefore, there have been a few attempts to adapt applica-
tions to deprovisioned resources. Nevertheless, they explicitly or implicitly assume that
their target applications are initially constructed on the basis of master-slave and redun-
dant architectures. Several academic and commercial systems tried introducing live-
migration of virtual machines (VMs) into their systems, but they could not merge be-
tween applications, because they were running on different VMs.1 Jung et al.[7] have
focused on controllers that take into account the costs of system adaptation actions con-
sidering both the applications (e.g., the horizontal scaling) and the infrastructure (e.g.,
the live migration of virtual machines and virtual machine CPU allocation) concerns.
Thus, they differ from most cloud providers, which maintain a separation of concerns,
hiding infrastructural control decisions from cloud clients.

3 Approach

As mentioned in the Àrst section, elasticity, which is one of the most important features
of cloud computing, is the degree to which a system is able to adapt to workload changes
by provisioning and de-provisioning resources in an autonomic manner. Applications
need to adapt themselves to changes in their available resources due to elasticity.

3.1 Requirements

We will propose a framework to adapt applications to the provisioning and deprovi-

sioning of servers, which may be running on physical or virtual machines, and software
containers, such as Docker, by providing an additional layer of abstraction and automa-
tion of virtualization. Our framework assumes that each application consists of one or
1
Unlike private cloud environments, most commercial ones do not support live migrations be-
cause they tend to need wide-band and low-latency networks between servers.
6 I. Satoh

more software components that may be running on different computers. It has Àve re-
quirements.
– Supports elasticity: Elasticity allows applications to use more resources when
needed and fall back afterwards. Therefore, applications need to be adapted to dy-
namically increasing and decreasing their available resources.
– Separation of concerns: All software components should be deÀned indepen-
dently of our adaptation mechanism as much as possible. This will enable develop-
ers to concentrate on their own application-speciÀc processing.
– Self-adaptation: Distributed systems essentially lack a global view due to com-
munication latency between computers. Software components, which may be run-
ning on different computers, need to coordinate themselves to support their appli-
cations with partial knowledge about other computers.
– Non-centralized management: There is no central entity to control and coordinate
computers. Our adaptation should be managed without any centralized manage-
ment so that we can avoid any single points of failures and performance bottlenecks
to ensure reliability and scalability.
– General purpose: There are various applications running on a variety of dis-
tributed systems. Therefore, the framework should be implemented as a practical
middleware system to support general-purpose applications.
We assume that, before the existence of deprovisioning servers, the target cloud com-
puting environment can notify servers about the deprovisioning after a certain time.
Cloud computing environments can be classiÀed into three types: Infrastructure as a
Service (IaaS), Platform as a Service (PaaS), and Software as a Service (SaaS). The
framework is intended to be used in the second and third, but as much as possible it
does not distinguish between the two.

3.2 Adaptation for elasticity in cloud computing

To adapt applications to changes in their available resources due to elasticity, the frame-
work adapts the applications to provisioning and de-provisioning resources (Fig. 1).
– Adaptation to provisioning resources When provisioning servers, if a particular
component is busy and the servers can satisfy the requirement of that component,
the framework divides the component into two components and deploys one of
them at the servers, where the divided components have the same programs but their
internal data can be replicated or divided in accordance with application-speciÀc
data divisions.
– Adaptation to deprovisioning resources When deprovisioning servers, compo-
nents running on the servers are relocated to other servers that can satisfy the re-
quirements of the components. If other components whose programs are the same
as the former components co-exist on the latter servers, the framework instructs the
deployed components to be merged to the original components.
The Àrst and second adaptations need to deploy components at different computers.
Our framework introduces mobile agent technology. When migrating and duplicating
components, their internal states stored in their heap areas are transmitted to their des-
tinations and are replicated at their clones.
Adaptive Scaling Up/Down for Elastic Clouds 7

Partitioning function &

Adaptation of component to provisioning server

Step 1. Step 2. Duplication with Step 3. Migration

partitioning function

Heap space Heap space Heap space Heap space Heap space
Heap space
Program
gram C
Code
Program Code Program Code Program Code Program Code Program Code

Server 1 Server 2 Server 1 Server 2 Server 1 Server 2

Provisioned server

Adaptation of component to deprovisioning server

Merging components with
Step 1. Step 2. Step 3.
reduce function

Migration

Heap space Heap space Heap space Heap space Heap space
Heap space
Program Code Program Code
Program Code Program Code Program Code Program Code

Server 1 Server 2 Server 1 Server 2 Server 1 Server 2

Deprovisioned server (deprovisioned)
after certain time
Key Value
Key Value Key Value
e.g., Reduce function
(sum)
“A1” 50
“A2” 30 , “A2” 100
“A3” 200
= “A1” 50
“A2” 130
“A3” 200

Fig. 1. Adaptation to (de)provisioning servers

3.3 Data stores for dividing and merging components

The framework provides another data store for dividing and merging components. To
do this, it introduces two notions: key-value store (KVS) and reduce functions of the
MapReduce processing. The KVS offers a range of simple functions for manipulation
of unstructured data objects, called values, each of which is identiÀed by a unique key.
Such a KVS is implemented as an array of key and value pairs. Our framework provides
KVSs for components so that each component can maintain its internal state in its KVS.
Our KVSs are used to pass the internal data of components to other components and
to merge the internal data of components into their uniÀed data. The framework also
provides a mechanism to divide and merge components with their internal states stored
at KVSs by using MapReduce processing. MapReduce is a most typical modern com-
puting models for processing large data sets in distributed systems. It was originally
studied by Google [2] and inspired by the map and reduce functions commonly used in
parallel list processing (LISP) and functional programming paradigms.

– Component division Each duplicated component can inherit partial or all data
stored in its original component in accordance with user-deÀned partitioning func-
tions, where each function map of each item of data in its original component’s
KVS is stored in either the original component’s KVS or the duplicated compo-
nent’s KVS without any redundancy.
– Component fusion When unifying two components that generated from the same
programs into a single component, the data stored in the KVSs of the two com-
ponents are merged by using user-deÀned reduce functions. These functions are
similar to the reduce functions of MapReduce processing. Each of our reduce func-
tions processes two values of the same keys and then maps the results to the entries
of the keys. Figure 1 shows two examples of reduce functions. The Àrst concate-
8 I. Satoh

nates values in the same keys of the KVSs of the two components, and the second
sums the values in the same keys of their KVSs.

4 Implementation
Our framework consists of two parts: component runtime system and components. The
former is responsible for executing, duplicating, and migrating components. The later
is autonomous programmable entities like software agents. The current implementation
is built on our original mobile agent platform as existing mobile agent platforms are not
optimized for data processing.

4.1 Adaptation for elasticity

When provisioning servers, the framework can divide a component into two compo-
nents whose data can be divided before deploying one of them at the servers. When
deprovisioning servers, the framework can merge components that are running on the
servers into other components.

Dividing component When dividing a component into two, the framework has two
approaches for sharing between the states of the original and clone components.
– Sharing data in heap space Each runtime system makes one or more copies of
components. The runtime system can store the states of each agent in heap space in
addition to the codes of the agent in a bit-stream formed in Java’s JAR Àle format,
which can support digital signatures for authentication. The current system basi-
cally uses the Java object serialization package for marshalling agents. The package
does not support the capturing of stack frames of threads. Instead, when an agent is
duplicated, the runtime system issues events to it to invoke their speciÀed methods,
which should be executed before it is duplicated, and it then suspends their active
threads.
– Sharing data in KVS When dividing a component into two components, the KVS
inside the former is divided into two KVSs in accordance with user-deÀned parti-
tioning functions in addition to built-in functions, and the divided KVSs are main-
tained inside the latter. Partitioning functions are responsible for dividing the inter-
mediate key space and assigning intermediate key-value pairs to the original and
duplicated components. In other words, the partition functions specify the com-
ponents to which an intermediate key-value pair must be copied. KVSs are con-
structed as in-memory storage to exchange data between components. It provides
tree-structured KVSs inside components. In the current implementation, each KVS
in each data processing agent is implemented as a hash table whose keys, given as
pairs of arbitrary string values, and values are byte array data, and it is carried with
its agent between nodes,
where a default partitioning function is provided that uses hashing. This tends to result
in fairly well-balanced partitions. The simplest partitioning functions involve comput-
ing the hash value of the key and then taking the mod of that value using the number of
the original and duplicated components.
Adaptive Scaling Up/Down for Elastic Clouds 9

Merging components The framework provides a mechanism to merge the data stored
in the KVSs of different components instead of the data stored inside their heap spaces.
Like the reduce of MapReduce processing, the framework enables us to deÀne a reduce
function that merges all intermediate values associated with the same intermediate key.
When merging two components, the framework can discard the states of their heap
spaces or keep the state of the heap space of one of them. Instead, the data stored in
the KVSs of different components can be shared. A reduce function is applied to all
values associated with the same intermediate key to generate output key-value pairs.
The framework can merge more than two components at the same computers because
components can migrate to the computers that execute co-components that the former
wants to merge to.

5 Evaluation

We outline our current implementation. A prototype implementation of this framework

was constructed with Java Developer Kit (JDK) version 1.7 or later. The implementation
enabled graphical user interfaces to operate the mobile agents. Although the current
implementation was not constructed for performance, we evaluated the performance of
our framework with CoreOS, which is a lightweight operating system based on Linux
with JDK version 1.8 with Docker, which is software-based environment that automates
the deployment of applications inside software containers by providing an additional
layer of abstraction and automation of operating-system-level virtualization on Linux,
on Amazon EC2. For each dimension of the adaptation process with respect to a speciÀc
resource type, elasticity captures the following core aspects of the adaptation:

– Adaptation speed at provisioning servers The speed of scaling up is deÀned as

the time it takes to switch from provisioning of servers by the underlying system,
e.g., cloud computing environment.
– Adaptation speed at deprovisioning servers The speed of scaling down is deÀned
as the time it takes to switch from deprovisioning of servers by the underlying
system, e.g., cloud computing environment.

The speed of scaling up/down does not correspond directly to the technical resource
provisioning/deprovisioning time. Table 1 shows the basic performance. The compo-
nent was simple and consisted of basic callback methods. The cost included that of in-
voking two callback methods. The cost of component migration included that of open-
ing TCP transmission, marshaling the agents, migrating the agents from their source
computers to their destination computers, unmarshalling the components, and verifying
security.

Table 1. Basic operation performance

Latency (ms)
Duplicating component 10
Merging component 8
Migrating component between two servers 32
10 I. Satoh

Figure 2 shows the speed of the number of divided and merged components at pro-
visioning and deprovisioning servers. The experiment provided only one server to run
our target component, which was a simple HTTP server (its size was about 100 KB). It
added one server every ten seconds until there were eight servers and then removed one
server every ten seconds after 80 seconds had passed. The number of components was
measured as the average of the numbers in ten experiments. Although elasticity is al-
ways considered with respect to one or more resource types, the experiment presented in
this paper focuses on computing environments for executing components, e.g., servers.
There are two metrics in an adaptation to elastic resources, scalability and efÀciency,
where scalability is the ability of the system to sustain increasing workloads by making
use of additional resources, and efÀciency expresses the amount of resources consumed
for processing a given amount of work.

8
Number of servers

0 10 20 30 40 50 60 70 80 90 100 110 120 130 140 150

Time (sec)
Number of (de)provisioning servers notified from Cloud
Number of components by the proposed framework
Under-provisioning state (the numbers of components and available servers)
Over-provisioning state (the numbers of components and available servers)

Fig. 2. Number of components at (de)provisioning servers

– A is the average time to switch from an underprovisioned state to an optimal or

overprovisioned state and corresponds to the average speed of scaling up or scaling
down.
– U is the
average amount of underprovisioned resources during an underprovisioned
period. U is the accumulated amount of underprovisioned resources and corre-
sponds to the blue areas in Fig. 2.
– D is theaverage amount of overprovisioned resources during an overprovisioned
period. D is the accumulated amount of underprovisioned resources and corre-
sponds to the red areas in Fig. 2.
The precision of scaling up or down is deÀned as the absolute deviation of the current
amount of allocated resources from the actual resource provisioning or deprovisioning.
We deÀne the average precision of scaling up Pu and that of scaling down Pd . The
efÀciency of scaling up or down is deÀned as the absolute deviation of the accumu-
lated amount of underprovisioned or overprovisioned resources from the accumulated
amount of provisioned or deprovisioned resources, speciÀed as EU or ED .
   
U D U D
Pu = Pd = Eu = Ed =
Tu Td Ru Rd
Adaptive Scaling Up/Down for Elastic Clouds 11

where Tu and Td are the total durations of the evaluation periods and Ru and Rd are
the accumulated amounts of provisioned resources when scaling up and scaling down
phases, respectively.2 Table 2 shows the precision and efÀciency of our framework.
Table 2. Basic operation efÀciency

Rate
Pu (Precision of scaling up) 99.2 %
Pd (Precision of scaling down) 99.1 %
Eu (EfÀciency of scaling up) 99.6 %
Ed (EfÀciency of scaling down) 99.4 %

Our component corresponds to an HTTP server, since web applications have very
dynamic workloads generated by variable numbers of users, and they face sudden peaks
in the case of unexpected events. Therefore, dynamic resource allocation is necessary
not only to avoid application performance degradation but also to avoid under-utilized
resources. The experimental results showed that our framework could follow the elasti-
cally provisioning and deprovisioning of resources quickly, and the number of the com-
ponents followed the number of elastic provisioning and deprovisioning of resources
exactly. The framework was scalable because its adaptation speed was independent of
the number of servers.

6 Conclusion

This paper presented a framework for enabling distributed applications to be adapted

to changes in their available resources in distributed systems. It was useful for adapt-
ing applications to elasticity in cloud computing. The key ideas behind the framework
are dynamic deployment of components and dividing and merging components. The
former enabled components to relocate themselves at new servers when provisioning
the servers and at remaining servers when de-provisioning the servers, and the latter
enables the states of components to be divided, and passed to other components, and
merged with other components in accordance with user-deÀned functions. We believe
that our framework is useful because it enables applications to be operated with elastic
capabilities and resources in cloud computing.

References
1. N. Damianou, N. Dulay, E. Lupu, and M. Sloman: The Ponder Policy SpeciÀcation Language,
in Proceedings of Workshop on Policies for Distributed Systems and Networks (POLICY’95),
pp.18–39, Springer-Verlag, 1995.
2. J. Dean and S. Ghemawat: MapReduce: simpliÀed data processing on large clusters, in Pro-
ceedings of the 6th conference on Symposium on Opearting Systems Design and Implemen-
tation (OSDI’04), 2004.
2
Ru and Rd correspond to the amount of provisioned resources according to cloud computing
environments.
12 I. Satoh

3. D. Garlan, S.W. Cheng, A.C.Huang, B. R. Schmerl, P. Steenkiste: Rainbow: Architecture-

Based Self-Adaptation with Reusable Infrastructure, IEEE Computer Vol.37, No.10, pp.46-
54, 2004.
4. B. Hindman, A. Konwinski, M. Zaharia, A. Ghodsi, A. Joseph, R. Katz, S. Shenker, and I.
Stoica. Mesos: a platform for Àne-grained resource sharing in the data center In Proceedings
of USENIX Symposium on Networked Systems Design and Implementation (NSDI), 2011.
5. C. Inzinger, at al., Decisions, Models, and Monitoring–A Lifecycle Model for the Evolution
of Service-Based Systems, In Proceedings of Enterprise Distributed Object Computing Con-
ference (EDOC), pp.185-194, IEEE Computer Society, 2013.
6. M. A. Jaeger, H. Parzyjegla, G. Muhl, K. Herrmann: Self-organizing broker topologies
for publish/subscribe systems, in Proceedings of ACM symposium on Applied Computing
(SAC’2007), pp.543-550, ACM, 2007.
7. G. Jung, et. al.: A Cost-Sensitive Adaptation Engine for Server Consolidation of Multitier
Applications, In Proceedings of Middleware’2009, LNCS, Vol.5896, pp.163183, Springer,
2009.
8. E. Lupu and M. Sloman: ConÁicts in Policy-Based Distributed Systems Management, IEEE
Transaction on Software Engineering, Vol.25, No.6, pp.852-869, 1999.
9. L. Lymberopoulos, E. Lupu, M. Sloman: An Adaptive Policy Based Management Frame-
work for Differentiated Services Networks, in Proceedings of 3rd International Workshop on
Policies for Distributed Systems and Networks (POLICY 2002), pp.147-158, IEEE Computer
Society, 2002.
10. P. Mell, T. Grance: The NIST DeÀnition of Cloud Computing, Technical report of U.S. Na-
tional Institute of Standards and Technology (NIST), Special Publication 800-145, 2011.
11. A. Verma, L. Pedrosa, M. Korupolu, D. Oppenheimer, E. Tune, and J. Wilkes: Large-scale
cluster management at Google with Borg, EuroSys15, ACM 2015.
12. U. Sharma, P. Shenoy, S. Sahu, A. Shaikh: A cost-aware elasticity provisioning system
for the cloud In Proceedings of International Conference on Distributed Computing Systems
(ICDCS’2011), pp.559570, IEEE Computer Society, 2011.
13. G. Tamura et. al.,: Towards Practical Runtime VeriÀcation and Validation of Self-Adaptive
Software Systems, Proceedings of Self-Adaptive Systems, LNCS 7475, pp. 108132, 2013.
14. V. K. Vavilapalli, el. al.,: Apache Hadoop YARN: Yet Another Resource Negotiator, In Pro-
ceedings of Symposium on Cloud Computing (SoCC’2013), ACM, 2013.
15. World Wide Web Consortium (W3C): Composite Capability/Preference ProÀles (CC/PP),
http://www.w3.org/TR/NOTE-CCPP, 1999.
 A Dynamic Model to enhance the Distributed
Discovery of services in P2P Overlay Networks

Adel Boukhadra, Karima Benatchba, and Amar Balla

Ecole national Supérieur d’Informatique, BP 68M, Oued-Smar, 16309, Alger, Algérie

a boukhadra@esi.dz, k benatchba@esi.dz, a balla@esi.dz

Abstract. In Service Computing (SC), online Semantic Web services

(SWs) is evolving over time and the increasing number of SWs with
the same function on the Internet, a great amount of candidate services
emerge. So, efficiency and effectiveness has become a stern challenge for
distributed discovery to tackle uniformed behavior evolution of service
and maintain high efficiency for large-scale computing. The distributed
discovery of SWs according to their functionality increases the capability
of an application to fulfill their own goals. In this paper, we describe an
efficient and an effective approach for improving the performance and
effectiveness of distributed discovery of SWs in P2P systems. As most
Web services lack a rich semantic description, we extend the distributed
discovery process by exploiting collaborative ranking to estimate the sim-
ilarity of a SWs being used by existing hybrid matching technique of
OWL-S (Ontology Web Language for Services) process models in order
to reduce costs and execution time. We mapped our distributed discov-
ery of OWL-S process models by developing a real application based
on Gamma Distribution; a technique used to decrease the bandwidth
consumption and to enhance the scalability of P2P systems. The partic-
ularity of the Gamma Distribution is then integrated for disseminating
request about the P2P networks to perform quality based ranking so
that the best SWs can be recommended first. The experimental result
indicates that our approach is efficient and able to reduce considerably
the execution time and the number of message overhead, while preserv-
ing high levels of the distributed discovery of SWs on large-size P2P
networks.

Keywords: SWs, Distributed Discovery, P2P Computing, Gamma Dis-

tribution, Matching of Ontology, OWL-S process model.

1 Introduction

Service-oriented computing (SOC) has emerged as an effective means of devel-

oping distributed applications and an accurate assessment the full potential of
reputation which is essential for discovering between alternative Web services.
Discovery of Web service is a great interest and is a fundamental area of research
in distributed computing [6].

© Springer International Publishing AG 2017 13

C. Badica et al. (eds.), Intelligent Distributed Computing X,
Studies in Computational Intelligence 678, DOI 10.1007/978-3-319-48829-5_2
14 A. Boukhadra et al.

Actually, with the increasing number of SWs with the same function, in an
open and dynamic environment, such as Internet, a great amount of candidate
services emerge. Moreover, the number of registries that offer available Web
services is also increasing significantly. It is not always easy to find services
that matching users queries. Find a service from the candidate Web service set,
according to the requirements of end-users has become a key hindrance and a
strenuous task even for an experienced user. The Web service discovery satisfying
the query is led by an optimization process, aiming to achieve the best SWs in
the end [1] [4] [5] [7].
This could be very challenging to end-users given the huge number of avail-
able Web services online, who have to decide where to fulfill their requests: on
local directory or to a replace this structure by several registries properly orga-
nized to support the dynamic, flexible and more efficient request propagation in a
highly-dynamic distributed computing. Due to low accuracy, poor performance,
high operational and maintenance cost, and sometimes for low availability of
the functionality of SWs, the distributed discovery of SWs on the P2P systems
provides a unique opportunity to address the above challenges [1] [7]. In recent
years, the rise of P2P networks is attested by the increasing amount of interest in
both commercial and academic areas to develop systems for data sharing simple
and effective with many advantages such as decentralization, self-organization,
autonomy, etc. At the same time, the SWs community has been slowly evolving
toward a higher degree of distribution [4] [5] [6].
In this paper, we propose an efficient and an effective approach that addresses
some aspects related to problems the time complexity of collaboration in the pro-
cess of automatic discovery for SWs in P2P computing. For this purpose, our
approach is based on P2P computing that proved to be scalable, more fault tol-
erant by eliminating the single point of failure, efficient by reducing the overhead
of centralized update of the service discovery and robust solutions for distributed
discovery of SWs. Specifically, our contributions in this work are summarized as
follows. We exploit hybrid matching technique of OWL-S process models to de-
velop functional features of Web services and the desired specification given by
the user. Both the Web services and request can be then represented as OWL-S
process model. We incorporate Gamma Distribution based collaborative ranking
to identify additional functionally relevant Web services, in order to efficiently
and effectively discover appropriate Web services distributed among all peers in
a large-size P2P network. The idea of using Gamma Distribution is to manage
large and continuously growing spaces of Web services with reasonable resolu-
tion times. The top-k most possible Web services are discovered, which are all
considered as functionally relevant to the new Web services.
The remainder of this work is organized as follows: Section 2 describes the
related work. In Section 3 we focus on the proposed distributed approach for dis-
covering SWs in the unstructured P2P computing. An experimental evaluation
is presented in Section 4, and, finally, in Section 5, we present our conclusion
and highlight our future work directions.
A Dynamic Model to enhance the Distributed Discovery … 15

2 Related Work
In this section, we discuss several representative related work and differentiate
them with our work.
In [2], authors propose the P2P-based Semantic Driven Service Discovery
(P2P-SDSD) framework to enable cooperation and communication based on a se-
mantic overlay that organizes semantically the P2P-integrated knowledge space
and emerges from local interactions between peers. The semantic overlay can be
seen as a continuously evolving conceptual map across collaborative peers that
provide similar services and constitute synergic service centers in a given domain.
The semantic overlay enables effective similarity based service search and opti-
mization strategies are defined for request propagation over the unstructured
P2P network keeping low the generated network overload. Each collaborative
peer in the unstructured P2P network has a local knowledge infrastructure con-
stituted by: (i) UDDI Registry; (ii) Peer Ontological Knowledge, that provides
a conceptualization of abstract service operations and Input/output parame-
ters through a given domain ontology; a conceptualization of service categories
through a Service Category Taxonomy (SCT).
In [7], present a technique to improve discovery in unstructured P2P ser-
vice networks, based on a probabilistic forwarding algorithm driven by network
knowledge, such as network density, and traces of already discovered service
compositions (CONs). The technique aims at reducing the composition time
and the messages exchanged during composition, relying on two considerations:
if the network is dense, forwarding can be limited to a small number of neigh-
bors; if the network is semi structured in CONs, forwarding can be directed to
the super peers that may own the desired information. The approach improves
the discovery and composition process by using distributed bidirectional search.
The benefit is twofold: first, it is possible to have concurrent searches in a P2P
service network in both goal directions (from pre- to post- and from post to pre-
conditions), reducing the response time when solutions are present; second, when
no complete solution for a goal is present, gaps in partial found solutions can be
identified. This way, it is possible to have feedbacks about users’ most required
unavailable business operations, allowing providers to discover new business op-
portunities.
In [11], authors present a distributed approach to SWs publication and dis-
covery by leveraging structured P2P network. In this work, the computers con-
cerned constitute a P2P network to maintain the sharable domain and service
ontologies to facilitate SWs discovery. When a requestor submits a semantic
query for desired services, the P2P network can effectively obtain semantically
qualified services. The main contributions of this work can be summarized as
follows: this approach introduces a semantic-based service matching rule. In or-
der to achieve the optimal match between a query, it proposes a concept of
Ordered-Concept-Tree (OCT) to semantically sort the relevant concepts for ser-
vice matching. In addition, to freely share and make full use of the semantic
concepts defined in ontologies for OCT construction, it also proposes a method
to publish ontologies to structured P2P network.
16 A. Boukhadra et al.

3 The Proposed Approach

In this section, we describe in detail the proposed approach that uses dynamic
topology adaptation to improve the efficiency and the effectiveness of distributed
discovery of SWs.

Fig. 1. Unstructured P2P Approach for Discovering SWs.

We propose further model which defines the topology of the P2P computing
for supporting communication and collaboration between different Web service
by the means of an effective use of the resources of P2P network and the man-
agement of scalability in an integrated and practical way. Such our model can
support scalability, maximize search recall, reduce the query traffic and must
also be able to achieve an acceptable performance. There are mainly three dif-
ferent architectures for P2P systems: hybrid, pure and unstructured; but the
unstructured P2P systems are most commonly used in today’s Internet [5] [6]
[11].
In unstructured P2P network, we distinguish between two types of peers,
neighbor and ultra-peer. Each peer is linked to a set of other peers in the P2P
network via bi-directional connections, that is, each peer has a limited number of
neighbors and it can choose the appropriate other neighbors it wishes to connect
when necessary. When a peer receives a search request, it manages the discovery
process locally and/or it will forward the query from other neighbors in the P2P
network using the dynamic querying algorithm.
If a peer frequently returns good results of a large number of queries from
one of its neighbors, it is likely to have common collaboration with the request-
ing peer to discover the appropriate Web services. It will mark this neighbor
(the requesting peer) as an ultra-peer of the requesting peer (see Figure 1). To
illustrate our model, consider the sample network depicted in Figure 1, in which
each peer has a several neighbors and ultra-peers. Peer 11 has Peer 2, Peer 5,
Peer 15 and Peer 17 as neighbors; and Peer 11 as ultra-peer.
Another random document with
no related content on Scribd:
plate, and both had settled down to a long and peaceful life in Nova
Scotia.
 CHAPTER V.
A FEARFULL FEMALE TRAVAILLER.

In the autumn and winter of the year 1704, Madam Sarah Knight,
a resident of Boston, made a journey on horseback from Boston to
New York, and returned in the same manner. It was a journey difficult
and perilous, “full of buggbears to a fearfull female travailler,” and
which “startled a masculine courage,” but which was performed by
this woman with the company and protection only of hired guides,
the “Western Post,” or whatever chance traveller she might find
journeying her way, at a time when brave men feared to travel
through New England, and asked for public prayers in church before
starting on a journey of twenty miles. She was probably the first
woman who made such a journey, in such a manner, in this country.
Madam Knight was the daughter of Captain Kemble, of Boston,
who was in 1656 set two hours in the public stocks as a punishment
for his “lewd and unseemly behavior,” which consisted in his kissing
his wife “publicquely” on the Sabbath Day, upon the doorstep of his
house, when he had just returned from a voyage and absence of
three years.
The diary which Madam kept on this eventful trip contains the
names of no persons of great historical interest, though many of
historical mention; but it is such a vivacious and sprightly picture of
the customs of the time, and such a valuable description of localities
as they then appeared, that it has an historical interest of its own,
and is a welcome addition to the few diaries and records of the times
which we possess.
Everything was not all serene and pleasant in the years 1704 and
1705 in New England. Events had occurred which could not have
been cheerful for Madam Knight to think of when riding through the
lonely Narragansett woods and along the shores of the Sound. News
of the frightful Indian massacre at Deerfield had chilled the very
hearts of the colonists. At Northampton shocking and most
unexpected cruelties had been perpetrated by the red men. At
Lancaster, not any too far from Boston, the Indians had been most
obstreperous. We can imagine Madam Knight had no very pleasant
thoughts of these horrors when she wrote her description of the red
men whom she saw in such numbers in Connecticut. Bears and
wolves, too, abounded in the lonely woods of Massachusetts and
Connecticut. The howls of wolves were heard every night, and
rewards were paid by New England towns for the heads of wolves
that were killed, provided the heads were brought into town and
nailed to the side of the meeting-house. Twenty-one years later than
Madam Knight’s journey, in 1725, twenty bears were killed in one
week in September, within two miles of Boston, so says the History
of Roxbury; and all through the eighteenth century bears were
hunted and killed in upper Narragansett. Hence “buggbears” were
not the only bears to be dreaded on the lonely journey.
The year 1704 was memorable also because it gave birth to the
first newspaper in the colonies, the Boston News-Letter. Only a few
copies were printed each week, and each copy contained but four or
five square feet of print, and the first number contained but one
advertisement—that of the man who printed it.
When Madam Knight’s journal was published in New York by Mr.
Theodore Dwight, in 1825, the editor knew nothing of the diarist, not
even her family name; hence it was confidently believed by many
that the journal was merely a clever and entertaining fiction. In 1852,
however, Miss Caulkins published her history of the town of New
London, and contradicted that belief, for she gave an account of the
last days of Madam Knight, which were spent in Norwich and New
London. Madam Knight’s daughter married the Colonel Livingston
who is mentioned in the journal, and left no children. From a
descendant of Mrs. Livingston’s administratrix, Mrs. Christopher, the
manuscript of the journal was obtained for publication in 1825, it
having been carefully preserved all those years. In Blackwood’s
Magazine for the same year an article appeared, entitled Travelling
in America, which reprinted nearly all of Madam Knight’s journal, and
which showed a high appreciation of its literary and historical merits.
In 1858 it was again printed by request in Littell’s Living Age, with
some notes of Madam Knight’s life, chiefly compiled from Miss
Caulkins’ History of New London, and again provoked much inquiry
and discussion. Recently a large portion of the journal has been
reprinted in the Library of American Literature, with many alterations,
however, in the spelling, use of capitals, and punctuation, thus
detracting much from the interest and quaintness of the work; and
most unnecessarily, since it is perfectly easy to read and understand
it as first printed, when, as the editor said, “the original orthography
was carefully preserved for fear of introducing any unwarrantable
modernism.”
The first edition is now seldom seen for sale, and being rare is
consequently high-priced. The little shabby, salmon-colored copy of
the book which I saw was made interesting by two manuscript
accounts of Sarah Knight, which were inserted at the end of the
book, and which are very valuable, since they give positive proof of
the reality of the fair traveller, as well as additional facts of her life.
The first account was in a fine old-fashioned, unpunctuated
handwriting, on yellow, time-stained paper, and read thus:—
Madam Knight was born in Boston She was the daughter of
Capt. Kemble who was a rich merchant of Boston he was a
native of Great Britain settled in Boston built him a large
house for that day near New North Square in the year 1676
this daughter Sarah Kemble was married to a son of a
London trader by the name of Knight he died abroad and left
her a smart young widow in October 1703 she made a
journey to New York to claim some property of his there. She
returned on horse-backe March 1705 Soon after her return
she opened a school for children Dr. Frankelin and Dr Saml
Mather secured their first rudiments of Education from her her
parents both died and as She was the only child they left she
continued to keep school in the Mansion house till the year
1714. She then sold the estate to Peter Papillion he died not
long after in the year 1736 Thomas Hutchinson Esqr
purchased the estate of John Wolcott, who was administrator
 of the Papillion estate Mr Hutchinson gave the estate to his
daughter Hannah who was the wife of Dr Saml Mather. The
force of Madam Knight’s Diamond Ring was displayed on
several panes of glass in the old house in the year 1763 Dr
Mather had the house new glazed and one pane of glass was
preserved as a curiosity for years till 1775 it was lost at the
conflagration when Charlestown was burnt by the British June
17th. The lines on the pane of glass were committed to
memory by the present writer. She was an original genius our
ideas of Madam are formed from hearing Dr Frankelin and Dr
Mather converse about their old school misstress

Through many toils and many frights

I have returned poor Sarah Knights
Over great rocks and many stones
God has preserv’d from fractur’d bones

as spelt on the pane of glass.

Underneath this account was written in the clear, distinct
chirography of Isaiah Thomas, the veteran printer, this endorsement:
—
The above was written by Mrs. Hannabell Crocker, of
Boston, granddaughter of the Rev. Cotton Mather, and
presented to me by that lady.—Isaiah Thomas.
The other manuscript account is substantially the same, though in
a different handwriting; it tells of the pane of glass with the rhymed
inscription being “preserved as a curiosity by an antiquicrity” (which
is a delightful and useful old word-concoction), “until the British set
fire to the town,” in Revolutionary times, and “Poor Madam Knight’s
poetrys, with other curiosities, were consumed.” It says, “She
obtained the honorable title of Madam by being a famous
schoolmistress in her day. She taught Dr. Franklin to write. She was
highly respected by Dr. Cotton Mather as a woman of good wit &
pleasant humour.”
 Sarah Knight was born in 1666, and thus was about thirty-eight
years old when she made her “perilous journey.” She started
October 2d, and did not reach New York until December 6th. Of
course much of this time was spent visiting friends and kinsfolk in
New London and New Haven, and often, too, she had to wait to
obtain companion travellers. She rode upon the first night of her
journey until very late in order to “overtake the post,” and this is the
account of her reception at her first lodging-place:—
My guide dismounted and very complasently and shewed
the door signing to me with his hand to Go in, which I Gladly
did. But had not gone many steps into the room ere I was
interrogated by a young Lady I understood afterwards was the
Eldest daughter of the family, with these, or words to this
purpose, (viz) Law for mee—what in the world brings you
here at this time-a-night? I never see a woman on the Rode
so Dreadfull late in all my Varsall Life. Who are You? Where
are you going? I’m scar’d out of my witts—with much now of
the same Kind I stood aghast Prepareing no reply—when in
come my Guide—to him Madam turn’d roreing out: Lawfull
heart John is it You? how de do? Where in the world are you
going with this woman? Who is She? John made no Ans’r but
sat down in the corner, fumbled out his black Junk, and
saluted that instead of Debb. She then turned agen to mee
and fell anew into her silly questions without asking mee to sit
down. I told her she treated mee very Rudely and I did not
think it my duty to answer her unmannerly Questions. But to
gett ridd of them I told her I come there to have the Posts
company with me to-morrow on my Journey &c. Miss stared
awhile, drew a chair bid me sitt And then run upstairs and
putts on two or three Rings (or else I had not seen them
before) and returning sett herself just before me shewing the
way to Reding, that I might see her Ornaments.
It appears from this account that human nature, or rather feminine
love of display, was the same in colonial times as in the present day.
Very vivid are her descriptions of the various beds upon which she
reposed. This is her entry in her diary after the first night of her
journey:—
I pray’d Miss to shew me where I must Lodg. Shee
conducted me to a parlour in a little back Lento, which was
almost filled with the bedstead, which was so high that I was
forced to climb on a chair to gitt up to ye wretched bed that
lay on it, on which having Strecht my tired Limbs, and lay’d
my head on a Sad-colour’d pillow, I began to think on the
transactions of ye past day.
We can imagine her (if such an intrusive fancy is not impertinent
after one hundred and eighty years), attired in her night-hood and
her “flowered calico night-rayle with high collared neck,” climbing
wearily upon a chair and thence to the mountainous bed with its
dingy pillow. The fashion of wearing “immoderate great rayles” had
been prohibited by law in Massachusetts in 1634, but the garment
mentioned must have been some kind of a loose gown worn in the
day-time, for we cannot fancy that even the meddlesome
interference and aspiring ambition for omnipotence of those Puritan
magistrates would make them dare to attempt to control what kind of
a nightgown a woman should wear.
Here is another vivid description of a night’s lodging, where her
room was shared, as was the country custom of that time (and
indeed for many years later), by the men who had journeyed with
her:—
Arriving at my apartment found it to be a little Lento
Chamber furnished amongst other Rubbish with a High Bedd
and a Low one, a Long Table, a Bench and a Bottomless
chair. Little Miss went to scratch up my Kennell which
Russelled as if shee’d bin in the Barn amongst the Husks,
and supose such was the contents of the tickin—nevertheless
being exceeding weary-down I laid my poor Carkes (never
more tired) and found my Covering as scanty as my Bed was
hard. Anon I heard another Russelling noise in Ye Room—
called to know the matter—Little Miss said shee was making
a bed for the men; who, when they were in Bed complained
their leggs lay out of it by reason of its shortness—my poor
 bones complained bitterly not being used to such Lodgings,
and so did the man who was with us; and poor I made but
one Grone, which was from the time I went to bed to the time
I Riss, which was about three in the morning, Setting up by
the Fire till Light.
The word “lento,” or “lean to,” was sometimes called “linter,” and
you will still hear old-fashioned or aged country-people use the word.
The “lean-to” was the rear portion of a form of house peculiar to New
England, which was two stories high in front, with a roof which
sloped down from a steep gable to a very low single story at the rear.
Madam Sarah speaks with some surprise throughout her travels of
the height of the beds, so it is evident that very towering beds were
not in high fashion in Boston in 1704, in spite of the exceeding tall
four-posters that have descended to us from our ancestors, and
which surely no one could mount in modern days without a chair as
an accessory. Even a chair was not always a sufficient stepping-
block by the bedsides that Madam Sarah found, for she thus writes:
“He invited us to his house, and shewed me two pair of stairs, viz,
one up the loft, and tother up the Bedd, which was as hard as it was
high, and warmed with a hott stone at the foot.”
After the good old Puritan custom of contumelious reviling, in
which clergymen, laymen, and legal lights alike joined, Madam
Knight could show a rare choice of epithets and great fluency of
uncomplimentary description when angered. Having expected to
lodge at the house of a Mr. DeVille in Narragansett, and being
refused, she writes thus of the DeVilles:—
I questioned whether we ought to go to the Devil to be helpt
out of the affliction. However, like the Rest of Deluded souls
that post to ye Infernall denn, Wee made all possible speed to
this Devil’s Habitation; where alliting, in full assurance of good
accommodation, wee were going in. But meeting his two
daughters, as I suposed twins, they so neerly resembled each
other both in features and habit and look’t as old as the Divel
himself, and quite as Ugly. We desired entertainment, but
could hardly get a word out of ’um, till with our Importunity
 telling them our necessity &c they call’d the old Sophister,
who was as sparing of his words as his daughters had bin,
and no or none, was the reply’s he made us to our demands.
Hee differed only in this from the old fellow in tother Country,
hee let us depart. However I thought it proper to warn poor
Travaillers to endeavour to Avoid falling into circumstances
like ours, which at our next Stage I sat down and did as
followeth:—

May all that dread the cruel fiend of night

Keep on and not at this curst Mansion light
Tis Hell: Tis Hell: and Devills here do dwell
Here Dwells the Devill—surely this is Hell.
Nothing but Wants: a drop to cool yo’re Tongue
Cant be procured those cruel Fiends among
Plenty of horrid grins and looks sevear
Hunger and thirst, But pitty’s banish’d here.
The Right hand keep, if Hell on Earth you fear—

Madam Knight had a habit of “dropping into poetry” very readily

and upon almost any subject. Upon the moon, upon poverty, even
upon the noise of drunken topers in the next room to her own. The
night-scene that brought forth the rhymes upon rum was graced by a
conversation upon the derivation of the word Narragansett, and her
report of it is of much interest, and is always placed among the many
and various authorities for, and suggestions about, the meaning of
the word:—
I went to bed which tho’ pretty hard Yet neet and handsome
but I could get no sleep because of the Clamor of some of the
Town-tope-ers in next Room who were entered into a strong
debate concerning ye Signifycation of the name of their
Country (viz) Narraganset. One said it was named so by ye
Indians because there grew a Brier there of a prodigious
Highth and bigness, the like hardly ever known, called by the
Indians Narragansett. And quotes an Indian of so Barberous a
 name for his Author that I could not write it. His Antagonist
Replyd No.—It was from a spring it had its name, which he
well knew where it was, which was extreem cold in summer,
and as Hott as could be imagined in the winter which was
much resorted to by the natives and by them called
Narragansett (Hott & Cold) and that was the originall of their
places name—with a thousand Impertinances not worth
notice, which He uttered with such a Roreing voice &
Thundering blows with the fist of wickedness on the Table that
it pierced my very head. I heartily fretted and wisht ’um
tonguetyed; but with little success.
They kept calling for tother Gill which while they were
swallowing, was some Intermission But presently like Oyle to
fire encreased the flame. I set my Candle on a Chest by the
bedside, and setting up fell to my old way of composing my
Resentments in the following manner:—

I ask thy aid O Potent Rum

To charm these wrangling Topers Dum
Thou hast their Giddy Brains possest
The man confounded with the Beast
And I, poor I, can get no rest
Intoxicate them with thy fumes
O still their Tongues till morning comes

And I know not but my wishes took effect for the dispute
soon ended with tother Dram.
To one who, unused to venturing abroad in boats on stormy
waters, has trusted her bodily safety to one of those ticklish Indian
vehicles, a canoe, this vivid account of the sensations of an early
female colonist in a similar situation may prove of interest; nor do I
think, after the lapse of centuries, could the description be improved
by the added words of our newer and more profuse vocabulary:—
 The Cannoo was very small & shallow so that when we
were in she seemd redy to take in water which greatly terrify’d
me, and caused me to be very circumspect, sitting with my
hands fast on each side, my eyes stedy, not daring so much
as to lodge my tongue a hairs breadth more on one side of
my mouth than tother, nor so much as think on Lotts wife, for
a very thought would have oversett our wherey.
We are so accustomed to hearing of the great veneration and
respect always shown in olden times by children toward their
parents, and the dignified reserve and absolute authority of parents
towards children, that the following scene rather shocks our
established notions:—
Thursday about 3 in the afternoon I set forward with
neighbour Polly & Jemima a girl about 18 years old, who her
father said he had been to fetch out of the Narragansetts and
said they had rode thirty miles that day on a sorry lean Jade
with only a Bagg under her for a pillion which the poor Girl
often complain’d was very uneasy. Wee made Good speed
along wch made poor Jemima make many a sowr face the
mare being a very hard trotter, and after many a hearty &
bitter Oh she at length low’d out: Lawful Heart father! this bare
mare hurts mee Dingeely. I’m direfull sore I vow, with many
words to that purpose. Poor Child—sais Gaffer—she us’t to
serve your mother so. I dont care how mother ust to do, quoth
Jemima in a passionate tone. At which the old man Laught
and kikt his Jade o’ the side, which made her Jolt ten times
harder. About seven that evening we came to New London
Ferry here by reason of a very high wind, we mett with great
difficulty in getting over. The boat tost exceedingly and our
Horses cappered at a very Surprising rate and set us all in a
fright especially poor Jemima who desired father to say So
Jack! to the Jade to make her stand. But the careless parent,
taking no notice of her repeated desires, She Rored out in a
Pasionate manner Pray Suth father Are you deaf? Say So
Jack to the Jade I tell you. The Dutiful Parent obeyed saying
So Jack So Jack as gravely as if he had bin saying Chatchise
 after young Miss who with her fright look’t all the Colours of ye
Rainbow.
It is very evident from entries in her Journal that Madam Knight
thought much of gratifying her appetite, for the food she obtained at
her different resting-places is often described. She says:—
Landlady told us shee had some mutton which shee would
broil. In a little time she bro’t it in but it being pickled and my
Guide said it smelt strong of head-sause we left it and paid six
pence apiece for our dinners which was only smell.
Again, she thus describes a meal:—
Having call’d for something to eat the woman bro’t in a
Twisted thing like a cable, but something whiter, laying it on
the bord, tugg’d for life to bring it into a capacity to spread;
which having with great pains accomplished shee served a
dish of Pork and Cabage I supose the remains of Dinner. The
sause was of a deep purple which I tho’t was boiled in her dye
Kettle; the bread was Indian and everything on the Table
service agreeable to these. I being hungry gott a little down,
but my stomach was soon cloy’d and what cabage I
swallowed served me for a Cudd the whole day after.
The early colonists never turned very readily to Indian meal and
pumpkins—pumpions as they called them in the “times wherein old
Pompion was a saint;” and Johnson, in his Wonder-Working
Providence, reproved them for making a jest of pumpkins, since they
were so good a food. Madam Knight had them offered to her very
often, “pumpkin sause” and “pumpkin bred.” “We would have eat a
morsell ourselves But the Pumpkin and Indian-mixt Bread had such
an aspect, and the Bare-legg’d Punch so awkerd or rather Awfull a
sound that we left both.”
She gives a glimpse of rather awkward table-manners when she
complains that in Connecticut masters permitted their slaves to sit
and eat with them, “and into the dish goes the black Hoof as freely
as the white hand.” Doubtless in those comparatively forkless days
fingers were very freely used at the table.
 She tells many curious facts about Connecticut. Divorces were
plentiful in that State, as they are at the present day. She writes:—
These uncomely Standaways are too much in Vogue
among the English in this Indulgent Colony as their Records
plentifully prove, and that on very trivial matters of which
some have been told me, but are not Proper to be Related by
a Female Pen.
She says they will not allow harmless kissing among the young
people, and she tells of a curious custom at weddings, where the
bridegroom ran away and had to be chased and dragged back by
force to the bride.
Her descriptions of the city of New York; of the public vendues
“where they give drinks;” of the Dutch houses and women; of the
“sley-riding” where she “mett fifty or sixty sleys,” are all very
entertaining. There were few sleighs in Boston at that date.
Everything is compared with “ours in Boston,” or said to be “not like
Boston,” after a fashion still somewhat followed by the Boston
“Female Pen” of the present day. As New York then was only a small
town of five thousand inhabitants, while Big Boston possessed ten
thousand inhabitants, such comparisons were certainly justifiable.
We must give her vivid and vivacious picture of a country “lubber”
in a merchant’s shop:—
In comes a tall country fellow with his Alfogeos full of
Tobaco. He advanced to the middle of the room, makes an
awkward nodd and spitting a large deal of Aromatic Tincture,
he gave a scrape with his shovel-like shoo, leaving a small
shovel-full of dirt on the floor, made a full stop, hugging his
own pretty body with his hands under his arms, Stood Staring
round him like a Catt let out of a Baskett. At last like the
creature Balaam rode on he opened his mouth and said Have
you any Ribinen for Hat bands to sell I pray? The Questions
and answers about the pay being past the Ribin is bro’t and
opened. Bumpkin simpers, cryes, Its confounded Gay I vow;
and beckoning to the door in comes Joan Tawdry, dropping
about 50 curtsies, and stands by him. He shews her the Ribin.
 Law You, sais shee, its right Gent, do you take it, its dreadful
pretty. Then she enquires: Have you any hood silk I pray?
which being brought and bought. Have you any Thred silk to
sew it with? says shee, which being accomodated with they
departed.
Though Madam Knight left no account of the costume which she
wore on her “perilous journey,” we know very well what the fashions
of the time were and of what her dress consisted. She wore a
woollen round-gown, perhaps of camlet, perhaps of calimanco, of
which the puffed sleeves came to the elbow and were finished with
knots of ribbons and ruffles. Riding-habits were then never worn. I
am sure she did not wear a neck-ruff on this journey, but a scarf or
neck-kerchief or “cross cloth” instead. Long gloves of leather or kid
protected her fair hands, and came to the elbow, and were firmly
secured at the top by “glove-tightens” made of braided black
horsehair. A pointed beaver or beaverette hat covered her head; the
hat and peruke had not then reached the excessive size which made
them for a lady’s “riding equipage” so bitterly and openly condemned
in 1737 as an exceeding and abominable affectation. She doubtless
wore instead of the fine, stately peruke, a cap, a “round cap,” which
did not cover the ears, or a “strap cap,” which came under the chin;
or perhaps a “quoif” or a “ciffer”—New England French for coiffure.
During her cold winter ride home she surely donned a hood. One is
described at that date thus: “A woman’s worsted camlet riding-hood
of grayish color faced with crimson coulour’d Persian.” Over her
shoulders she wore a heavy woollen short cloak, or a scarlet
“whittle,” and doubtless also added a “drugget-petticoat” for warmth,
or a “safeguard” for protection against mud. High-heeled pointed
shoes of leather, with knots of green ribbon or silver buckles,
completed Madam Sarah’s picturesque and comfortable attire. One
other useful article of dress, or rather of protection, she surely as a
lady of high gentility carried and wore: a riding-mask made of black
velvet with a silver mouthpiece, or with two little strings with a silver
bead at the end, which she placed in either corner of her mouth, to
hold her mask firmly in place.
 The “nagg” upon which Madam rode was without doubt a pacer,
as were all good saddle-horses at that date. No one making any
pretension to fashion or good style would ride upon a trotting-horse,
nor indeed until Revolutionary times was a trotter regarded as of any
account or worth.
I do not think Madam Knight had a Narragansett pacer, for as soon
as they were raised in any numbers they were sent at once to the
West Indies for the use of the wives and daughters of the wealthy
sugar-planters, and few New England people could afford to own
them. The “horse furniture” of which she speaks included, of course,
her side-saddle and saddle-bag, which held her travelling-wardrobe
and her precious journal.
Madam Sarah Knight did not end her days in Boston. She
removed to Norwich, Conn., and in 1717 it is recorded that she gave
a silver cup for the communion-service of the church there. The town
in gratitude, by vote, gave her liberty to “sitt in the pue where she
was used to sitt in ye meeting house.” She also kept an inn on the
Livingston Farm near New London, and I doubt not a woman of her
large experience kept a good ordinary. No rustling beds, no sad-
colored pillow-bears, no saucy maids, no noisy midnight topers, no
doubtful fricassees, no pumpkin-bread, and, above all, no bare-
legged punch in her house.
It is painful to record, however, that in 1718 the teacher of
Benjamin Franklin and friend of Cotton Mather was indicted and
fined for “selling strong liquor to Indians.”
Altogether, Madam Knight was far ahead of the time in which she
lived. She was a woman of great energy and talent. She kept a
school when a woman-teacher was almost unheard of. She ran a
tavern, a shop. She wrote poetry and a diary. She cultivated a farm,
and owned mills, and speculated largely in Indian lands, and was
altogether a sharp business-woman; and she must have been
counted an extraordinary character in those early days.
 CHAPTER VI.
TWO COLONIAL ADVENTURESSES.

A “strange true story of Louisiana” so furnished with every

attractive element of romance, so calculated to satisfy every exaction
of literary art, that it seems marvellous it has not been eagerly seized
upon and frequently utilized by dramatists and novelists, is that of a
Louisiana princess—or pretender—whose death in a Parisian
convent in 1771 furnished a fruitful topic of speculation and
conversation in the courts of France, Austria, Russia, and Prussia.
This Louisiana princess (were she no pretender) was the daughter-
in-law of Peter the Great of Russia, wife of the Grand Duke Alexis,
and mother of Peter II. of Russia. The story, as gathered from a few
European authorities and some old French chronicles and histories
of Louisiana, is this.
The Princess Christine, daughter of a German princeling and wife
of the Grand Duke Alexis, is said by Russian official and historical
records to have died in 1716 after a short and most unhappy married
life with a brutal royal profligate, and to have been buried with proper
court honors and attendance. But there is another statement, half-
history, half-romance, which denies that she died at that time, and
asserts that her death and burial were but a carefully planned
deception, to permit her to escape her intolerable life in Russia, and
only concealed her successful flight from St. Petersburg and the
power of the Russian throne. Aided by the famous Countess
Königsmark, the princess, after some delay and frightened hiding in
France, sailed from the port of L’Orient, accompanied by an old
devoted court retainer named Walter. Of course there must always
be a lover to form a true romance, and a young officer named
D’Aubant successfully fills that rôle. He had often seen Christine in
the Russian court, and had rescued her from danger when she was
hunting in the Hartz Mountains, and had cherished for her a deep
though hopeless love. When the news of her death came to the
knowledge of Chevalier D’Aubant, he sadly left the Czar’s service
and went to France. Soon after he chanced to see at the cathedral in
Poitiers a woman who raised her veil, glanced at him with a look of
recognition, and apparently a face like that of his loved Christine.
After long search for the unknown, he found her temporary home,
only to learn that she, with her father Mons. De L’Ecluse (who was of
course Walter), had just sailed for the New World. But the woman of
the house gave him a slip of paper which the fair one had left for him
in case he called and asked concerning her. On it was written this
enigmatical lure:—

I have drunk of the waters of Lethe,

Hope yet remains to me.

Now, he would not have been an ideal court-lover, nor indeed but
a sorry hero, if, after such a message, he had not promply sailed
after the possible Christine. He learned that the vessel which bore
her was to land at Biloxi, Louisiana. He sailed for the same port with
his fortune in his pockets. But on arriving in Louisiana, Walter (or
Mons. De L’Ecluse) had taken the disguising name of Walter Holden,
and Christine posed as his daughter, Augustine Holden; so her
knight-errant thus lost trace of her. Christine-Augustine and her
father settled in the Colonie Roland on the Red River. D’Aubant, with
sixty colonists, founded a settlement but fifty miles away, which he
named the Valley of Christine. Of course in due time the lovers met,
and disguise was impossible and futile, and Augustine confessed her
identity with the Crown Princess. As her husband Alexis had by this
time conveniently died in prison, in Moscow, where he had been tried
and condemned to death (and probably been privately executed),
there was no reason, save the memory of her past exalted position,
why she should not become the wife of an honest planter. They were
married by a Spanish priest, and lived for twenty happy years in the
Valley of Christine.
 But D’Aubant’s health failed, and he sought physicians in Paris.
One day when Christine was walking in the garden of the Tuileries,
with her two daughters, the children of D’Aubant, the German
conversation of the mother attracted the attention of Marshal Saxe,
who was the son of the very Countess Königsmark who had aided
Christine’s escape. The marshal recognized the princess at once, in
spite of the lapse of years, and through his influence with Louis XV.
obtained for D’Aubant a commission as major of troops, and the
office of governor of the Isle of Bourbon. The King also informed the
Empress of Austria, who was a niece of Christine, that her aunt was
alive; and an invitation was sent from the Empress for the D’Aubant
family to become residents of the Austrian Court. They remained,
however, at the Isle of Bourbon until the death of D’Aubant and the
two daughters, when Christine came to Brunswick and was granted
a pension for life by the Empress. Her death in a convent, and her
burial, took place over half a century after her pretended legal
demise.
This is the Christine of romance, of court gossip, of court credulity,
but there is another aspect of her story. Judge Martin has written a
standard history of Louisiana. In it he says:—
Two hundred German settlers of Law’s grant were landed in
the month of March 1721 at Biloxi out of the twelve hundred
who had been recruited. There came among the German
new-comers a female adventurer. She had been attached to
the wardrobe of the wife of the Czarowitz Alexis Petrovitz, the
only son of Peter the Great. She imposed on the credulity of
many persons, particularly on that of an officer of the garrison
of Mobile (called by Bossu, the Chevalier D’Aubant, and by
the King of Prussia, Waldeck), who, having seen the princess
at St. Petersburg imagined he recognized her features in
those of her former servant, and gave credit to the report that
she was the Duke of Wolfenbuttel’s daughter, and the officer
married her.
Grimm and Voltaire in their letters, Levesque in his History, all
unite in pronouncing her an impostor. But you can choose your own
estimate of this creature of high romance; if you elect to deem her a
princess, you find yourself in the goodly company of the King of
France, the Empress of Austria, Marshal Saxe, and a vast number of
other folk of rank and intelligence.
In the year 1771 there was sent to this country from England a
woman convict, who had in her enforced home a most extraordinary
and romantic career of successful fraud.
The first account which I have seen of her was printed in the
Gentleman’s Magazine in 1771, and told simply of her startling
intrusion into the Queen’s apartments in London; but Dr. Doran’s
Lives of the Queens of England of the House of Hanover gives this
account of this interesting bit of Anglo-American romance.
Sarah Wilson, yielding to a strong temptation in the year
1771, filched one or two of the Queen’s jewels, and was
condemned to be executed. It was considered almost a
violation of justice that the thief should be saved from the
halter and be transported instead of hanged. She was sent to
America, where she was allotted as slave, or servant, to a Mr.
Dwale, Bud Creek, Frederick County. Queen Charlotte would
have thought nothing more of her, had her majesty not heard
with some surprise, that her sister Susannah Caroline Matilda
was keeping her court in the plantations. Never was surprise
more genuine than the Queen’s; it was exceeded only by her
hilarity when it was discovered that the Princess Susannah
was simply Sarah Wilson, at large. That somewhat clever girl
having stolen a Queen’s jewels, thought nothing, after
escaping from the penal service to which she was
condemned, of passing herself off as a Queen’s sister. The
Americans were not so acute as their descendants; so in love
were some of them with the greatness they affected to
despise, that they paid royal honors to the clever impostor.
She passed the most joyous of seasons before she was
consigned again to increase of penalty for daring to pretend
relationship with the consort of King George. The story of the
presuming girl, whose escapades, however, were not fully
known in England at that time, served, as far as knowledge of
 them had reached the court, to amuse the gossips who had
assembled about the cradle of the young Elizabeth.
In this account of Dr. Doran’s there are some errors. The real story
of the crime of Sarah Wilson and her subsequent career was this. In
August, 1770, a strange woman found her way by means of a private
staircase to the apartments of Queen Charlotte. She entered a room
where the Queen and the Duchess of Ancaster were sitting, to their
alarm. While she was taking a leisurely survey of the contents of the
room, a page was summoned, who expelled the intruder, but did not
succeed in arresting her. Shortly after, the Queen’s apartments were
broken into by a thief, who stole valuable jewels and a miniature of
the Queen. The thief proved to be a woman named Sarah Wilson,
who had been maid of the Honorable Miss Vernon, and this thief was
asserted to be the inquisitive intruder whose visit had so alarmed the
Queen.
Sarah Wilson was arrested, tried as a felon, and sentenced to
death; but by the exertions and influence of her former mistress the
sentence was commuted to transportation to the American colonies
for a seven years’ term of servitude. This leniency caused
considerable stir in London and some dissatisfaction.
In 1771, after passage in a convict ship, Sarah Wilson was sold to
a Mr. William Duvall, of Bush Creek, Frederick County, Maryland, for
seven years’ servitude. After a short time, in which she apparently
developed her plans of fraud, she escaped from her master, and
went to Virginia and the Carolinas, where she assumed the title of
Princess Susannah Caroline Matilda, and asserted she was the
sister of the Queen of England. She still owned the miniature of the
Queen, and some rich jewels, which gave apparent proof of her
assertion, and it is said some rich clothing. It is indeed mysterious
that a transported convict could retain in her possession, through all
her reverses, the very jewels for whose theft she was punished; yet
the story can scarcely be doubted.
She travelled through the South from plantation to plantation, with
plentiful promises of future English offices and court favors to all who
assisted her progress; and liberal sums of money were placed at her