Maintaining a Spanning Forest in Highly Dynamic Networks: The Synchronous Case View Full Text


Ontology type: schema:Chapter      Open Access: True


Chapter Info

DATE

2014

AUTHORS

Matthieu Barjon , Arnaud Casteigts , Serge Chaumette , Colette Johnen , Yessin M. Neggaz

ABSTRACT

Highly dynamic networks are characterized by frequent changes in the availability of communication links. Many of these networks are in general partitioned into several components that keep splitting and merging continuously and unpredictably. We present an algorithm that strives to maintain a forest of spanning trees in such networks, without any kind of assumption on the rate of changes. Our algorithm is the adaptation of a coarse-grain interaction algorithm (Casteigts et al., 2013) to the synchronous message passing model (for dynamic networks). While the high-level principles of the coarse-grain variant are preserved, the new algorithm turns out to be significantly more complex. In particular, it involves a new technique that consists of maintaining a distributed permutation of the set of all nodes IDs throughout the execution. The algorithm also inherits the properties of its original variant: It relies on purely localized decisions, for which no global information is ever collected at the nodes, and yet it maintains a number of critical properties whatever the frequency and scale of the changes. In particular, the network remains always covered by a spanning forest in which 1) no cycle can ever appear, 2) every node belongs to a tree, and 3) after an arbitrary number of edge disappearance, all maximal subtrees immediately restore exactly one token (at their root). These properties are ensured whatever the dynamics, even if it keeps going for an arbitrary long period of time. Optimality is not the focus here, however the number of tree per components – the metric of interest here – eventually converges to one if the network stops changing (which is never expected to happen, though). The algorithm correctness is proven and its behavior is tested through experimentation. More... »

PAGES

277-292

References to SciGraph publications

Book

TITLE

Principles of Distributed Systems

ISBN

978-3-319-14471-9
978-3-319-14472-6

Author Affiliations

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/978-3-319-14472-6_19

DOI

http://dx.doi.org/10.1007/978-3-319-14472-6_19

DIMENSIONS

https://app.dimensions.ai/details/publication/pub.1027364647


Indexing Status Check whether this publication has been indexed by Scopus and Web Of Science using the SN Indexing Status Tool
Incoming Citations Browse incoming citations for this publication using opencitations.net

JSON-LD is the canonical representation for SciGraph data.

TIP: You can open this SciGraph record using an external JSON-LD service: JSON-LD Playground Google SDTT

[
  {
    "@context": "https://springernature.github.io/scigraph/jsonld/sgcontext.json", 
    "about": [
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/1005", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Communications Technologies", 
        "type": "DefinedTerm"
      }, 
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/10", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Technology", 
        "type": "DefinedTerm"
      }
    ], 
    "author": [
      {
        "affiliation": {
          "alternateName": "University of Bordeaux", 
          "id": "https://www.grid.ac/institutes/grid.412041.2", 
          "name": [
            "LaBRI, University of Bordeaux, France"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Barjon", 
        "givenName": "Matthieu", 
        "id": "sg:person.013473107645.69", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013473107645.69"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "University of Bordeaux", 
          "id": "https://www.grid.ac/institutes/grid.412041.2", 
          "name": [
            "LaBRI, University of Bordeaux, France"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Casteigts", 
        "givenName": "Arnaud", 
        "id": "sg:person.014046062661.61", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014046062661.61"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "University of Bordeaux", 
          "id": "https://www.grid.ac/institutes/grid.412041.2", 
          "name": [
            "LaBRI, University of Bordeaux, France"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Chaumette", 
        "givenName": "Serge", 
        "id": "sg:person.015133652052.91", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015133652052.91"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "University of Bordeaux", 
          "id": "https://www.grid.ac/institutes/grid.412041.2", 
          "name": [
            "LaBRI, University of Bordeaux, France"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Johnen", 
        "givenName": "Colette", 
        "id": "sg:person.011542041653.48", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011542041653.48"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "University of Bordeaux", 
          "id": "https://www.grid.ac/institutes/grid.412041.2", 
          "name": [
            "LaBRI, University of Bordeaux, France"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Neggaz", 
        "givenName": "Yessin M.", 
        "id": "sg:person.012743642445.24", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012743642445.24"
        ], 
        "type": "Person"
      }
    ], 
    "citation": [
      {
        "id": "https://doi.org/10.1016/s0743-7315(02)00028-x", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1009725741"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1145/800222.806754", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1018316918"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1016/j.jpdc.2012.10.006", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1018512912"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/3-540-51687-5_27", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1036906240", 
          "https://doi.org/10.1007/3-540-51687-5_27"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1145/93385.93409", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1038346318"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/978-3-642-39247-4_9", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1038475277", 
          "https://doi.org/10.1007/978-3-642-39247-4_9"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1145/1806689.1806760", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1046808496"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/978-3-642-41527-2_7", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1046900797", 
          "https://doi.org/10.1007/978-3-642-41527-2_7"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/978-3-540-75142-7_10", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1051561882", 
          "https://doi.org/10.1007/978-3-540-75142-7_10"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/978-3-540-75142-7_10", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1051561882", 
          "https://doi.org/10.1007/978-3-540-75142-7_10"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1145/1391289.1391292", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1051859994"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1142/s0129054115500288", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1062897477"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1109/iceis.2006.1703205", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1094587677"
        ], 
        "type": "CreativeWork"
      }
    ], 
    "datePublished": "2014", 
    "datePublishedReg": "2014-01-01", 
    "description": "Highly dynamic networks are characterized by frequent changes in the availability of communication links. Many of these networks are in general partitioned into several components that keep splitting and merging continuously and unpredictably. We present an algorithm that strives to maintain a forest of spanning trees in such networks, without any kind of assumption on the rate of changes. Our algorithm is the adaptation of a coarse-grain interaction algorithm (Casteigts et al., 2013) to the synchronous message passing model (for dynamic networks). While the high-level principles of the coarse-grain variant are preserved, the new algorithm turns out to be significantly more complex. In particular, it involves a new technique that consists of maintaining a distributed permutation of the set of all nodes IDs throughout the execution. The algorithm also inherits the properties of its original variant: It relies on purely localized decisions, for which no global information is ever collected at the nodes, and yet it maintains a number of critical properties whatever the frequency and scale of the changes. In particular, the network remains always covered by a spanning forest in which 1) no cycle can ever appear, 2) every node belongs to a tree, and 3) after an arbitrary number of edge disappearance, all maximal subtrees immediately restore exactly one token (at their root). These properties are ensured whatever the dynamics, even if it keeps going for an arbitrary long period of time. Optimality is not the focus here, however the number of tree per components \u2013 the metric of interest here \u2013 eventually converges to one if the network stops changing (which is never expected to happen, though). The algorithm correctness is proven and its behavior is tested through experimentation.", 
    "editor": [
      {
        "familyName": "Aguilera", 
        "givenName": "Marcos K.", 
        "type": "Person"
      }, 
      {
        "familyName": "Querzoni", 
        "givenName": "Leonardo", 
        "type": "Person"
      }, 
      {
        "familyName": "Shapiro", 
        "givenName": "Marc", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/978-3-319-14472-6_19", 
    "inLanguage": [
      "en"
    ], 
    "isAccessibleForFree": true, 
    "isPartOf": {
      "isbn": [
        "978-3-319-14471-9", 
        "978-3-319-14472-6"
      ], 
      "name": "Principles of Distributed Systems", 
      "type": "Book"
    }, 
    "name": "Maintaining a Spanning Forest in Highly Dynamic Networks: The Synchronous Case", 
    "pagination": "277-292", 
    "productId": [
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/978-3-319-14472-6_19"
        ]
      }, 
      {
        "name": "readcube_id", 
        "type": "PropertyValue", 
        "value": [
          "825b168aba680ce5fd5095f4befb221958af9aa1a2b5b07ebd4969fb62fadada"
        ]
      }, 
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1027364647"
        ]
      }
    ], 
    "publisher": {
      "location": "Cham", 
      "name": "Springer International Publishing", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/978-3-319-14472-6_19", 
      "https://app.dimensions.ai/details/publication/pub.1027364647"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2019-04-16T00:49", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-uberresearch-data-dimensions-target-20181106-alternative/cleanup/v134/2549eaecd7973599484d7c17b260dba0a4ecb94b/merge/v9/a6c9fde33151104705d4d7ff012ea9563521a3ce/jats-lookup/v90/0000000001_0000000264/records_8700_00000260.jsonl", 
    "type": "Chapter", 
    "url": "http://link.springer.com/10.1007/978-3-319-14472-6_19"
  }
]
 

Download the RDF metadata as:  json-ld nt turtle xml License info

HOW TO GET THIS DATA PROGRAMMATICALLY:

JSON-LD is a popular format for linked data which is fully compatible with JSON.

curl -H 'Accept: application/ld+json' 'https://scigraph.springernature.com/pub.10.1007/978-3-319-14472-6_19'

N-Triples is a line-based linked data format ideal for batch operations.

curl -H 'Accept: application/n-triples' 'https://scigraph.springernature.com/pub.10.1007/978-3-319-14472-6_19'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/978-3-319-14472-6_19'

RDF/XML is a standard XML format for linked data.

curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/978-3-319-14472-6_19'


 

This table displays all metadata directly associated to this object as RDF triples.

143 TRIPLES      23 PREDICATES      39 URIs      20 LITERALS      8 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/978-3-319-14472-6_19 schema:about anzsrc-for:10
2 anzsrc-for:1005
3 schema:author N964e3f945cc54eb796f1e3dacb9aa011
4 schema:citation sg:pub.10.1007/3-540-51687-5_27
5 sg:pub.10.1007/978-3-540-75142-7_10
6 sg:pub.10.1007/978-3-642-39247-4_9
7 sg:pub.10.1007/978-3-642-41527-2_7
8 https://doi.org/10.1016/j.jpdc.2012.10.006
9 https://doi.org/10.1016/s0743-7315(02)00028-x
10 https://doi.org/10.1109/iceis.2006.1703205
11 https://doi.org/10.1142/s0129054115500288
12 https://doi.org/10.1145/1391289.1391292
13 https://doi.org/10.1145/1806689.1806760
14 https://doi.org/10.1145/800222.806754
15 https://doi.org/10.1145/93385.93409
16 schema:datePublished 2014
17 schema:datePublishedReg 2014-01-01
18 schema:description Highly dynamic networks are characterized by frequent changes in the availability of communication links. Many of these networks are in general partitioned into several components that keep splitting and merging continuously and unpredictably. We present an algorithm that strives to maintain a forest of spanning trees in such networks, without any kind of assumption on the rate of changes. Our algorithm is the adaptation of a coarse-grain interaction algorithm (Casteigts et al., 2013) to the synchronous message passing model (for dynamic networks). While the high-level principles of the coarse-grain variant are preserved, the new algorithm turns out to be significantly more complex. In particular, it involves a new technique that consists of maintaining a distributed permutation of the set of all nodes IDs throughout the execution. The algorithm also inherits the properties of its original variant: It relies on purely localized decisions, for which no global information is ever collected at the nodes, and yet it maintains a number of critical properties whatever the frequency and scale of the changes. In particular, the network remains always covered by a spanning forest in which 1) no cycle can ever appear, 2) every node belongs to a tree, and 3) after an arbitrary number of edge disappearance, all maximal subtrees immediately restore exactly one token (at their root). These properties are ensured whatever the dynamics, even if it keeps going for an arbitrary long period of time. Optimality is not the focus here, however the number of tree per components – the metric of interest here – eventually converges to one if the network stops changing (which is never expected to happen, though). The algorithm correctness is proven and its behavior is tested through experimentation.
19 schema:editor Nd87e8728bb20480086857a7162ecb925
20 schema:genre chapter
21 schema:inLanguage en
22 schema:isAccessibleForFree true
23 schema:isPartOf N044d05b6196644e2a754abdcdb2bfa24
24 schema:name Maintaining a Spanning Forest in Highly Dynamic Networks: The Synchronous Case
25 schema:pagination 277-292
26 schema:productId N1bfb9eed3e5944a0b4671b8fb957e2cd
27 Naf02f3593a474d54afa73f6eee88c8c2
28 Nec04b017a57d44929428b30f188752f5
29 schema:publisher Na2cff9901bab46c1b9fd922d6db1fc35
30 schema:sameAs https://app.dimensions.ai/details/publication/pub.1027364647
31 https://doi.org/10.1007/978-3-319-14472-6_19
32 schema:sdDatePublished 2019-04-16T00:49
33 schema:sdLicense https://scigraph.springernature.com/explorer/license/
34 schema:sdPublisher N17a3a611984747b6a413deb699a22e76
35 schema:url http://link.springer.com/10.1007/978-3-319-14472-6_19
36 sgo:license sg:explorer/license/
37 sgo:sdDataset chapters
38 rdf:type schema:Chapter
39 N044d05b6196644e2a754abdcdb2bfa24 schema:isbn 978-3-319-14471-9
40 978-3-319-14472-6
41 schema:name Principles of Distributed Systems
42 rdf:type schema:Book
43 N10a48d32b80b4634b733308991d84fb2 rdf:first sg:person.015133652052.91
44 rdf:rest N80f981a839684d4282d0e4156e16299e
45 N17a3a611984747b6a413deb699a22e76 schema:name Springer Nature - SN SciGraph project
46 rdf:type schema:Organization
47 N1bfb9eed3e5944a0b4671b8fb957e2cd schema:name doi
48 schema:value 10.1007/978-3-319-14472-6_19
49 rdf:type schema:PropertyValue
50 N22cca6b649cb410b92856c7cd33b40f1 rdf:first sg:person.014046062661.61
51 rdf:rest N10a48d32b80b4634b733308991d84fb2
52 N520ec98c973a4cce8ae65549de654e49 rdf:first Nae2e8c0584d6439eb0b61a562021bfe9
53 rdf:rest rdf:nil
54 N778530b6fc454862a3dd7f8c4de3b0c7 schema:familyName Querzoni
55 schema:givenName Leonardo
56 rdf:type schema:Person
57 N80f981a839684d4282d0e4156e16299e rdf:first sg:person.011542041653.48
58 rdf:rest N89f78740bcbd43e79524507a0b185d24
59 N89f78740bcbd43e79524507a0b185d24 rdf:first sg:person.012743642445.24
60 rdf:rest rdf:nil
61 N964e3f945cc54eb796f1e3dacb9aa011 rdf:first sg:person.013473107645.69
62 rdf:rest N22cca6b649cb410b92856c7cd33b40f1
63 N9670b3c7daa347f68c75f21e5c60cf45 rdf:first N778530b6fc454862a3dd7f8c4de3b0c7
64 rdf:rest N520ec98c973a4cce8ae65549de654e49
65 Na2cff9901bab46c1b9fd922d6db1fc35 schema:location Cham
66 schema:name Springer International Publishing
67 rdf:type schema:Organisation
68 Na6ab563fc70644b58627bddf5f3393e5 schema:familyName Aguilera
69 schema:givenName Marcos K.
70 rdf:type schema:Person
71 Nae2e8c0584d6439eb0b61a562021bfe9 schema:familyName Shapiro
72 schema:givenName Marc
73 rdf:type schema:Person
74 Naf02f3593a474d54afa73f6eee88c8c2 schema:name readcube_id
75 schema:value 825b168aba680ce5fd5095f4befb221958af9aa1a2b5b07ebd4969fb62fadada
76 rdf:type schema:PropertyValue
77 Nd87e8728bb20480086857a7162ecb925 rdf:first Na6ab563fc70644b58627bddf5f3393e5
78 rdf:rest N9670b3c7daa347f68c75f21e5c60cf45
79 Nec04b017a57d44929428b30f188752f5 schema:name dimensions_id
80 schema:value pub.1027364647
81 rdf:type schema:PropertyValue
82 anzsrc-for:10 schema:inDefinedTermSet anzsrc-for:
83 schema:name Technology
84 rdf:type schema:DefinedTerm
85 anzsrc-for:1005 schema:inDefinedTermSet anzsrc-for:
86 schema:name Communications Technologies
87 rdf:type schema:DefinedTerm
88 sg:person.011542041653.48 schema:affiliation https://www.grid.ac/institutes/grid.412041.2
89 schema:familyName Johnen
90 schema:givenName Colette
91 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011542041653.48
92 rdf:type schema:Person
93 sg:person.012743642445.24 schema:affiliation https://www.grid.ac/institutes/grid.412041.2
94 schema:familyName Neggaz
95 schema:givenName Yessin M.
96 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012743642445.24
97 rdf:type schema:Person
98 sg:person.013473107645.69 schema:affiliation https://www.grid.ac/institutes/grid.412041.2
99 schema:familyName Barjon
100 schema:givenName Matthieu
101 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013473107645.69
102 rdf:type schema:Person
103 sg:person.014046062661.61 schema:affiliation https://www.grid.ac/institutes/grid.412041.2
104 schema:familyName Casteigts
105 schema:givenName Arnaud
106 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014046062661.61
107 rdf:type schema:Person
108 sg:person.015133652052.91 schema:affiliation https://www.grid.ac/institutes/grid.412041.2
109 schema:familyName Chaumette
110 schema:givenName Serge
111 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015133652052.91
112 rdf:type schema:Person
113 sg:pub.10.1007/3-540-51687-5_27 schema:sameAs https://app.dimensions.ai/details/publication/pub.1036906240
114 https://doi.org/10.1007/3-540-51687-5_27
115 rdf:type schema:CreativeWork
116 sg:pub.10.1007/978-3-540-75142-7_10 schema:sameAs https://app.dimensions.ai/details/publication/pub.1051561882
117 https://doi.org/10.1007/978-3-540-75142-7_10
118 rdf:type schema:CreativeWork
119 sg:pub.10.1007/978-3-642-39247-4_9 schema:sameAs https://app.dimensions.ai/details/publication/pub.1038475277
120 https://doi.org/10.1007/978-3-642-39247-4_9
121 rdf:type schema:CreativeWork
122 sg:pub.10.1007/978-3-642-41527-2_7 schema:sameAs https://app.dimensions.ai/details/publication/pub.1046900797
123 https://doi.org/10.1007/978-3-642-41527-2_7
124 rdf:type schema:CreativeWork
125 https://doi.org/10.1016/j.jpdc.2012.10.006 schema:sameAs https://app.dimensions.ai/details/publication/pub.1018512912
126 rdf:type schema:CreativeWork
127 https://doi.org/10.1016/s0743-7315(02)00028-x schema:sameAs https://app.dimensions.ai/details/publication/pub.1009725741
128 rdf:type schema:CreativeWork
129 https://doi.org/10.1109/iceis.2006.1703205 schema:sameAs https://app.dimensions.ai/details/publication/pub.1094587677
130 rdf:type schema:CreativeWork
131 https://doi.org/10.1142/s0129054115500288 schema:sameAs https://app.dimensions.ai/details/publication/pub.1062897477
132 rdf:type schema:CreativeWork
133 https://doi.org/10.1145/1391289.1391292 schema:sameAs https://app.dimensions.ai/details/publication/pub.1051859994
134 rdf:type schema:CreativeWork
135 https://doi.org/10.1145/1806689.1806760 schema:sameAs https://app.dimensions.ai/details/publication/pub.1046808496
136 rdf:type schema:CreativeWork
137 https://doi.org/10.1145/800222.806754 schema:sameAs https://app.dimensions.ai/details/publication/pub.1018316918
138 rdf:type schema:CreativeWork
139 https://doi.org/10.1145/93385.93409 schema:sameAs https://app.dimensions.ai/details/publication/pub.1038346318
140 rdf:type schema:CreativeWork
141 https://www.grid.ac/institutes/grid.412041.2 schema:alternateName University of Bordeaux
142 schema:name LaBRI, University of Bordeaux, France
143 rdf:type schema:Organization
 




Preview window. Press ESC to close (or click here)


...