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 - The ebook with all chapters is available with just one click
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 - The ebook with all chapters is available with just one click
com
OR CLICK HERE
DOWLOAD EBOOK
https://textbookfull.com/product/biota-grow-2c-gather-2c-cook-loucas/
textbookfull.com
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: [email protected]
About this Series
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
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.
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
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
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
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
I Dynamic Systems
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
III Security
Detection of traffic anomalies in multi-service networks based on a
fuzzy logical inference . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 79
Igor Saenko, Sergey Ageev, and Igor Kotenko
IV Space-Based Coordination
V Behavioral Analysis
VI Optimization
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
Dynamic Systems
Adaptive Scaling Up/Down for Elastic Clouds
Ichiro Satoh
1 Introduction
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
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
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.
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
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
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.
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
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.
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
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
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
1 Introduction
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.
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.
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.
Exploring the Variety of Random
Documents with Different Content
The Project Gutenberg eBook of The Literary
History of the Adelphi and Its Neighbourhood
This ebook is for the use of anyone anywhere in the United
States and most other parts of the world at no cost and with
almost no restrictions whatsoever. You may copy it, give it away
or re-use it under the terms of the Project Gutenberg License
included with this ebook or online at www.gutenberg.org. If you
are not located in the United States, you will have to check the
laws of the country where you are located before using this
eBook.
Language: English
NEW YORK:
1909
Note
This book is intended for the general reader, as well as for the
antiquarian and the lover of London. To this end, the history of the
Adelphi and its immediate neighbourhood to the west and on the
south side of the Strand has been related in—as far as possible—
narrative form. At the same time, it need hardly be said, every care
has been taken to present the multitude of details correctly and as a
truthful picture of one of the most interesting parts of the great
metropolis. I should be ungrateful if I did not take this opportunity of
again—as in the case of my chronicle of the Lyceum and Henry Irving
—thanking Mr. E. Gardner for so courteously placing at my disposal
his unique and invaluable collection of London records and
engravings. The majority of the illustrations were kindly lent by him;
others were copied from prints in the British Museum. I have also to
thank the officials of St. Martin's Library for their ready help in
enabling me to consult, at my leisure, some scarce books connected
with the literature of historical London.
A.B.
INTRODUCTION
"The Literary History of the Adelphi" has journeyed from one side of
the neighbourhood to the other, from west to east. That is to say, its
publication has been acquired by Mr. Fisher Unwin, hence the
removal of the book from York Buildings to Adelphi—originally called
"Royal," and still so marked on the old plans—Terrace. This
peregrination gives me the opportunity of supplementing the original
work with some interesting particulars which have just come into my
possession. Who would think that within a short distance of the
Strand, if not actually within the proverbial stone's throw, there are
"cottages," and cottages, too, with trees and flowers and lawns, and
a mighty river, for prospect? Yet such is the case, although it is no
wonder that the rate collector who is new to this part of London has
much ado to find "Adelphi cottages." They belong to that mysterious
region which lies underneath the Strand level of the Adelphi and is
vaguely known as the "arches." If the reader will glance at the
illustration which faces page 32—"The Buildings called the Adelphi"—
he will see, at the top of the arches and under the terrace, some
fifteen semi-circular recesses. These are really capacious rooms, and
from the windows thereof the view of the Embankment Gardens and
the Thames is considerable compensation for the tediousness and
deviousness of the approach. The "cottages" were originally attached
to the houses on the terrace above, and, until recent years, they
were inhabited. Now, however, the majority of them are let
separately and are used as stores or workshops. One of them,
however, is still occupied as a dwelling-place, and, whatever else it
may be, this habitation is certainly unique.
Underneath the "Adelphi cottages," and extending below the houses
of the terrace, and John, Robert, and Adam Streets, are the famous
arches, which few people, either Londoners, who know nothing of
their own city, or Americans, who are versed in the lore of our
ancient streets, have ever visited. Truth to tell, the expedition to the
Adelphi arches is not to be undertaken with too light a heart. The
gloomy recesses do not conduce to joy, and, although the foot-pad
has scant opportunity for indulging in his nefarious practices, he
would be a venturesome person, a stranger to these parts, who
would wander alone in this underground world after the sun, which
never enters these passages, had ceased to illumine the earth above.
This very darkness and dismalness has its advantages at times. When
Messrs. Coutts, for instance, moved from their old premises in the
Strand, there was much speculation as to the manner in which they
transferred their immense stock of securities, deeds, and other
valuables from one side of the road to the other. There was great talk
at the time of armies of detectives and the use of the early hours of
Sundays, and other vague suggestions were allowed to be
promulgated. It was assumed that the transference would take place
from one side of the road to the other, and it was thought that there
might be some audacious attempts at robbery. In reality, the matter
was quite simple and there was not the slightest danger of any attack
upon the priceless possessions. Far removed from the noisy Strand—
in regard to atmosphere and surroundings—there is an arch, dark
indeed, and shut off from the outer world by huge gates, which are
some distance away. Here, many feet below the surface of the
streets, is a secret entrance to the premises of the old bank. And
here, in absolute security, never dreamt of by the enterprising thief,
the carts were loaded with their treasures.
The actual removal of these valuables was effected with great ease.
The carts wended their innocent way through the dreary arches, in
front of the "cottages," and passed out by a "right of way"
underneath the Hotel Cecil, towards Blackfriars. Thus, the would-be
thief was deluded of his prey. This "right of way" marks the bottom of
Ivy Lane, which is still in existence. It runs from the Strand and
denotes the boundary of the Duchy of Lancaster and the City of
Westminster. Formerly, it was an open thoroughfare, but there is
now, at the Strand entrance as well as at the bottom, a gate. At the
river end, there was, in olden times, a bridge, or pier, called Ivy
Bridge. But I think that there must have been, not only a bridge in
the Strand, but that there was a stream which ran hence into the
Thames. John Stow, in his "Survey of London," first published in
1598, speaks of "Ivy Bridge, in the High Street, which had a way
under it leading to the Thames, the like as sometime had the Strand
Bridge." Now, the Strand Bridge was over the stream of St. Clement's
Well, and Strand Lane, like Ivy Lane, ran down to the river, and, like
it, there was a pier at the end. I am the more certain that there must
have been a river of sorts at the junction of Ivy Lane and the Strand,
because to this day, as I found in the course of a recent investigation,
a stream trickles under John Street and renders useless a large cellar.
Nothing can stop it. It percolates now, just as it has done ever since
the excavations made by the Brothers Adam in 1768. It is drained
away, but it is just sufficient to create a damp atmosphere which is
detrimental to the storing of wine.
Hundreds of thousands of bottles of wine—chiefly port, claret, and
burgundy—are in bins here, and a most admirable place for the
purpose it is. The underground Adelphi is absolutely dry—save for the
one spot mentioned—and the temperature does not vary five degrees
in the course of a year. Here, also, are many hundreds of cases of
champagne, and here the jaded Londoner—if he be sufficiently
favoured—might come and feast his eyes on some few dozens of
bottles of "white port"—a wine which is not in fashion in these
degenerate days, but which, I rejoiced to learn, is still sent hence to
a certain royal household. Strange as it may seem, there is a strong
air of royalty about these dimly-lit vaults. What between the secret
entrance to the old premises of the great bankers—Messrs. Coutts
are the bankers for his Majesty and for the Queen[1]—and the "white
port" which gives its benefit to illustrious persons of royal lineage,
there is a distinct feeling that one is moving on an exalted plane
when, paradoxical as it may seem, we are in this subterranean place.
The distinctly regal air which pervades these caves of silence may
have given rise to a certain statement that hereabouts—half a dozen
yards from the royal stock of "white port"—Lady Jane Grey was cast
into a dungeon deep and carried thence to the dreaded Tower, there
to be beheaded. But the "Nine Days' Queen" knew only her gardens
and her flowers when she lived in Durham House—the predecessor of
the Adelphi. Here, in May, 1553, the Duke of Northumberland married
his son, Lord Guildford Dudley, to Lady Jane, in pursuance of his
design for altering the succession from the Tudor to the Dudley
family. The unfortunate girl of scarce seventeen summers certainly
left Durham House for the Tower—but it was with great pomp and
circumstance, in order to be proclaimed Queen. Her execution
followed hard upon, but she knew not imprisonment in what is now
the Adelphi. On the other hand, the haunt of a wretched woman is
still to be seen in this gloomy spot. "Jenny's Holes" figure on the plan
to this day, and are not likely to be obliterated therefrom. Into one or
other of these places—recesses by the main arches—the outcast
came to sleep and, finally, to die; some say, indeed, that she was
murdered here. "Jenny" has no history, but the vague tradition of her
misery still haunts these "dark arches." Nor is the story at all
improbable. The "dark arches" are forbidding enough now, and, even
in the day-time, the sparse gas jets only serve to make darkness
visible. So recently as the early seventies, when Mr. George
Drummond came into the property, cows were kept in the
underground passages of the Adelphi.
Adelphi Terrace, Adam Street to the east, and John Street, which is
parallel with the terrace and the Strand, and in between, still retain
much of their old-world appearance. But at the western side of the
Adelphi changes are afoot. There is a new building, facing the river,
but stunted and barred from its proper height by that bugbear of the
modern builder, "ancient lights." Then, again, the Caledonian Hotel,
in Robert Street, has taken to itself a new storey, and has been
transmogrified into modern flats with—oh, shade of Adam!—bath-
rooms. The searcher after the picturesque in London architecture
might do worse than descend from the Strand, past the Tivoli. He will
then be on the site of one of the gateways of Old Durham House,
and, turning to the right, he will see a bridge of beautiful design. It
was built, in order to connect the Strand and Adelphi premises of the
bank, by Thomas Coutts, who procured a special Act of Parliament
for the purpose.
The entire Adelphi estate occupies a little over three acres and a
quarter, divided as follows:—
Superficial
feet.
Houses (only) 78,400
Roadways,
terrace, and 45,400
areas
Foreground 19,200
————
143,000
The names of two more noted inhabitants of the Adelphi have to be
included in this "History." The learned Vicesimus Knox (1752-1821),
who is best known to fame as the compiler of "Elegant Extracts"
(1789), lived at No. 1, Adam Street. The first floor of the same house
was the place of retirement, for a score of years, of George Blamire,
barrister-at-law, "of very eccentric habits, but sound mind." John
Timbs, in his "Curiosities of London," states that "no person was
allowed to enter his chamber, his meals and all communications being
left by his housekeeper at the door of his ante-room. He was found
dead in an arm-chair, in which he had been accustomed to sleep for
twenty years. He died of exhaustion, from low fever and neglect; at
which time his rooms were filled with furniture, books, plate,
paintings, and other valuable property." The eccentric habits are
evident; but the "sound mind" is a little doubtful.
Finally, I may state that I have followed the fortunes of my book,
and, after a brief excursion into the noisy part of the world on the
other side of Charing Cross, have returned to the quiet and
comparative solitude of the Adelphi, where tubes do not trouble and
motor buses do not annoy. "Sir," said Dr. Johnson, "when a man is
tired of London, he is tired of life." And I think that there is no part of
London of which a man can be in less apprehension of tiring than the
Adelphi. It is of London, yet away from it; in the heart of the world,
yet secluded. To know it is to love it.
Austin Brereton.
September, 1908.
FOOTNOTES:
[1] See page 212.
Contents
CHAPTER I PAGES
List of Illustrations
The Terrace, York Buildings, Adelphi Frontispiece
The Adelphi (Durham Yard and the New Exchange) and Charing
Cross in 1755
Ivy Lane, Strand (the boundary of the Duchy of Lancaster and the
City of Westminster)
The Fox-under-the-Hill
CHAPTER I
Anthony Bek, Bishop of Durham—The Papal Legate and the
Oxford Clergy—Henry III. and the Earl of Leicester—Prince
Henry—The Author of Philobiblon—Edward III.—Thomas
Hatfield—Henry VIII.—Cuthbert Tunstall—Cranmer at
Durham House—Anne Boleyn—Henry VIII. and Anne of
Cleves feast at Durham House—Dudley, Duke of
Northumberland—Lady Jane Grey—Queen Mary—Queen
Elizabeth—Philip Sidney—Sir Walter Raleigh—Elizabeth
Throgmorton—Glanville v. Courtney—Thomas Egerton—Fire
at Durham House—Raleigh and his Pipe.
Our website is not just a platform for buying books, but a bridge
connecting readers to the timeless values of culture and wisdom. With
an elegant, user-friendly interface and an intelligent search system,
we are committed to providing a quick and convenient shopping
experience. Additionally, our special promotions and home delivery
services ensure that you save time and fully enjoy the joy of reading.
textbookfull.com