---
_id: '18963'
author:
- first_name: Eva- Maria
full_name: Seng, Eva- Maria
id: '499'
last_name: Seng
citation:
ama: Seng E-M. Rekonstruktion des religiösen Ortes. Die Welt und ihr Double Abriss
und Rekonstruktion, Bauhaus Lectures (im Druck). 2013.
apa: Seng, E.-M. (2013). Rekonstruktion des religiösen Ortes. Die Welt und ihr
Double. Abriss und Rekonstruktion, Bauhaus Lectures (im Druck).
bibtex: '@article{Seng_2013, title={Rekonstruktion des religiösen Ortes}, journal={Die
Welt und ihr Double. Abriss und Rekonstruktion, Bauhaus Lectures (im Druck)},
publisher={Bauhaus Lectures (im Druck)}, author={Seng, Eva- Maria}, year={2013}
}'
chicago: Seng, Eva- Maria. “Rekonstruktion des religiösen Ortes.” Die Welt und
ihr Double. Abriss und Rekonstruktion, Bauhaus Lectures (im Druck), 2013.
ieee: E.-M. Seng, “Rekonstruktion des religiösen Ortes,” Die Welt und ihr Double.
Abriss und Rekonstruktion, Bauhaus Lectures (im Druck), 2013.
mla: Seng, Eva-Maria. “Rekonstruktion des religiösen Ortes.” Die Welt und ihr
Double. Abriss und Rekonstruktion, Bauhaus Lectures (im Druck), Bauhaus Lectures
(im Druck), 2013.
short: E.-M. Seng, Die Welt und ihr Double. Abriss und Rekonstruktion, Bauhaus Lectures
(im Druck) (2013).
date_created: 2020-09-03T13:29:49Z
date_updated: 2022-01-06T06:53:55Z
department:
- _id: '443'
language:
- iso: ger
publication: Die Welt und ihr Double. Abriss und Rekonstruktion, Bauhaus Lectures
(im Druck)
publisher: Bauhaus Lectures (im Druck)
status: public
title: Rekonstruktion des religiösen Ortes
type: journal_article
user_id: '21240'
year: '2013'
...
---
_id: '18979'
author:
- first_name: Eva- Maria
full_name: Seng, Eva- Maria
id: '499'
last_name: Seng
citation:
ama: 'Seng E-M. Die Vereine für christliche Kunst und die Bildausstattung der Kirchen
nach dem 2. Weltkrieg in Westfalen und Württemberg im Vergleich. In: Körner H,
Wiener J, eds. Kultbild und Andachtsbild. Essen; 2013:173-186.'
apa: Seng, E.-M. (2013). Die Vereine für christliche Kunst und die Bildausstattung
der Kirchen nach dem 2. Weltkrieg in Westfalen und Württemberg im Vergleich. In
H. Körner & J. Wiener (Eds.), Kultbild und Andachtsbild (pp. 173–186).
Essen.
bibtex: '@inbook{Seng_2013, place={Essen}, title={Die Vereine für christliche Kunst
und die Bildausstattung der Kirchen nach dem 2. Weltkrieg in Westfalen und Württemberg
im Vergleich}, booktitle={Kultbild und Andachtsbild}, author={Seng, Eva- Maria},
editor={Körner, Hans and Wiener, JürgenEditors}, year={2013}, pages={173–186}
}'
chicago: Seng, Eva- Maria. “Die Vereine für christliche Kunst und die Bildausstattung
der Kirchen nach dem 2. Weltkrieg in Westfalen und Württemberg im Vergleich.”
In Kultbild und Andachtsbild, edited by Hans Körner and Jürgen Wiener,
173–86. Essen, 2013.
ieee: E.-M. Seng, “Die Vereine für christliche Kunst und die Bildausstattung der
Kirchen nach dem 2. Weltkrieg in Westfalen und Württemberg im Vergleich,” in Kultbild
und Andachtsbild, H. Körner and J. Wiener, Eds. Essen, 2013, pp. 173–186.
mla: Seng, Eva-Maria. “Die Vereine für christliche Kunst und die Bildausstattung
der Kirchen nach dem 2. Weltkrieg in Westfalen und Württemberg im Vergleich.”
Kultbild und Andachtsbild, edited by Hans Körner and Jürgen Wiener, 2013,
pp. 173–86.
short: 'E.-M. Seng, in: H. Körner, J. Wiener (Eds.), Kultbild und Andachtsbild,
Essen, 2013, pp. 173–186.'
date_created: 2020-09-04T07:53:52Z
date_updated: 2022-01-06T06:53:56Z
department:
- _id: '443'
editor:
- first_name: Hans
full_name: Körner, Hans
last_name: Körner
- first_name: Jürgen
full_name: Wiener, Jürgen
last_name: Wiener
language:
- iso: ger
page: 173-186
place: Essen
publication: Kultbild und Andachtsbild
status: public
title: Die Vereine für christliche Kunst und die Bildausstattung der Kirchen nach
dem 2. Weltkrieg in Westfalen und Württemberg im Vergleich
type: book_chapter
user_id: '21240'
year: '2013'
...
---
_id: '18984'
author:
- first_name: Eva- Maria
full_name: Seng, Eva- Maria
id: '499'
last_name: Seng
citation:
ama: 'Seng E-M. "Kulturerbe zwischen Globalisierung und Lokalisierung“. In: Speitkamp
W, ed. Europäisches Kulturerbe. Bilder, Traditionen, Konfigurationen. Stuttgart;
2013:69-82.'
apa: Seng, E.-M. (2013). "Kulturerbe zwischen Globalisierung und Lokalisierung“.
In W. Speitkamp (Ed.), Europäisches Kulturerbe. Bilder, Traditionen, Konfigurationen
(pp. 69–82). Stuttgart.
bibtex: '@inbook{Seng_2013, place={Stuttgart}, title={"Kulturerbe zwischen Globalisierung
und Lokalisierung“}, booktitle={Europäisches Kulturerbe. Bilder, Traditionen,
Konfigurationen}, author={Seng, Eva- Maria}, editor={Speitkamp, WinfriedEditor},
year={2013}, pages={69–82} }'
chicago: Seng, Eva- Maria. “"Kulturerbe zwischen Globalisierung und Lokalisierung“.”
In Europäisches Kulturerbe. Bilder, Traditionen, Konfigurationen, edited
by Winfried Speitkamp, 69–82. Stuttgart, 2013.
ieee: E.-M. Seng, “"Kulturerbe zwischen Globalisierung und Lokalisierung“,” in Europäisches
Kulturerbe. Bilder, Traditionen, Konfigurationen, W. Speitkamp, Ed. Stuttgart,
2013, pp. 69–82.
mla: Seng, Eva-Maria. “"Kulturerbe zwischen Globalisierung und Lokalisierung“.”
Europäisches Kulturerbe. Bilder, Traditionen, Konfigurationen, edited by
Winfried Speitkamp, 2013, pp. 69–82.
short: 'E.-M. Seng, in: W. Speitkamp (Ed.), Europäisches Kulturerbe. Bilder, Traditionen,
Konfigurationen, Stuttgart, 2013, pp. 69–82.'
date_created: 2020-09-04T08:04:09Z
date_updated: 2022-01-06T06:53:56Z
department:
- _id: '443'
editor:
- first_name: Winfried
full_name: Speitkamp, Winfried
last_name: Speitkamp
language:
- iso: ger
page: 69-82
place: Stuttgart
publication: Europäisches Kulturerbe. Bilder, Traditionen, Konfigurationen
status: public
title: '"Kulturerbe zwischen Globalisierung und Lokalisierung“'
type: book_chapter
user_id: '21240'
year: '2013'
...
---
_id: '23135'
author:
- first_name: Tanja
full_name: Schmuedderich, Tanja
last_name: Schmuedderich
- first_name: Matthias
full_name: Lochbichler, Matthias
last_name: Lochbichler
- first_name: Ansgar
full_name: Trächtler, Ansgar
id: '552'
last_name: Trächtler
citation:
ama: 'Schmuedderich T, Lochbichler M, Trächtler A. Methodik zur anforderungsgerechten
Wahl der Modellierungstiefe von Verhaltensmodellen fuer die virtuelle Inbetriebnahme.
In: Tagungsband Mechatronik 2013 (ISBN 3-86130-958-0). ; 2013:43-48.'
apa: Schmuedderich, T., Lochbichler, M., & Trächtler, A. (2013). Methodik zur
anforderungsgerechten Wahl der Modellierungstiefe von Verhaltensmodellen fuer
die virtuelle Inbetriebnahme. In Tagungsband Mechatronik 2013 (ISBN 3-86130-958-0)
(pp. 43–48).
bibtex: '@inproceedings{Schmuedderich_Lochbichler_Trächtler_2013, title={Methodik
zur anforderungsgerechten Wahl der Modellierungstiefe von Verhaltensmodellen fuer
die virtuelle Inbetriebnahme}, booktitle={Tagungsband Mechatronik 2013 (ISBN 3-86130-958-0)},
author={Schmuedderich, Tanja and Lochbichler, Matthias and Trächtler, Ansgar},
year={2013}, pages={43–48} }'
chicago: Schmuedderich, Tanja, Matthias Lochbichler, and Ansgar Trächtler. “Methodik
Zur Anforderungsgerechten Wahl Der Modellierungstiefe von Verhaltensmodellen Fuer
Die Virtuelle Inbetriebnahme.” In Tagungsband Mechatronik 2013 (ISBN 3-86130-958-0),
43–48, 2013.
ieee: T. Schmuedderich, M. Lochbichler, and A. Trächtler, “Methodik zur anforderungsgerechten
Wahl der Modellierungstiefe von Verhaltensmodellen fuer die virtuelle Inbetriebnahme,”
in Tagungsband Mechatronik 2013 (ISBN 3-86130-958-0), 2013, pp. 43–48.
mla: Schmuedderich, Tanja, et al. “Methodik Zur Anforderungsgerechten Wahl Der Modellierungstiefe
von Verhaltensmodellen Fuer Die Virtuelle Inbetriebnahme.” Tagungsband Mechatronik
2013 (ISBN 3-86130-958-0), 2013, pp. 43–48.
short: 'T. Schmuedderich, M. Lochbichler, A. Trächtler, in: Tagungsband Mechatronik
2013 (ISBN 3-86130-958-0), 2013, pp. 43–48.'
date_created: 2021-08-09T06:58:04Z
date_updated: 2022-01-06T06:55:46Z
department:
- _id: '153'
language:
- iso: eng
page: 43-48
publication: Tagungsband Mechatronik 2013 (ISBN 3-86130-958-0)
status: public
title: Methodik zur anforderungsgerechten Wahl der Modellierungstiefe von Verhaltensmodellen
fuer die virtuelle Inbetriebnahme
type: conference
user_id: '24876'
year: '2013'
...
---
_id: '23136'
author:
- first_name: Tanja
full_name: Schmuedderich, Tanja
last_name: Schmuedderich
- first_name: Ansgar
full_name: Trächtler, Ansgar
id: '552'
last_name: Trächtler
- first_name: Jan
full_name: Brökelmann, Jan
last_name: Brökelmann
- first_name: Jürgen
full_name: Gausemeier, Jürgen
last_name: Gausemeier
citation:
ama: 'Schmuedderich T, Trächtler A, Brökelmann J, Gausemeier J. Procedural Model
for the Virtual Commissioining on the Basis of Model-based Design. In: Smart
Product Engineering - Proceedings of the 23rd CIRP Design Conference (ISBN 978-3-642-30816,
Springer-Verlag). ; 2013:23-32.'
apa: Schmuedderich, T., Trächtler, A., Brökelmann, J., & Gausemeier, J. (2013).
Procedural Model for the Virtual Commissioining on the Basis of Model-based Design.
In Smart Product Engineering - Proceedings of the 23rd CIRP Design Conference
(ISBN 978-3-642-30816, Springer-Verlag) (pp. 23–32).
bibtex: '@inproceedings{Schmuedderich_Trächtler_Brökelmann_Gausemeier_2013, title={Procedural
Model for the Virtual Commissioining on the Basis of Model-based Design}, booktitle={Smart
Product Engineering - Proceedings of the 23rd CIRP Design Conference (ISBN 978-3-642-30816,
Springer-Verlag)}, author={Schmuedderich, Tanja and Trächtler, Ansgar and Brökelmann,
Jan and Gausemeier, Jürgen}, year={2013}, pages={23–32} }'
chicago: Schmuedderich, Tanja, Ansgar Trächtler, Jan Brökelmann, and Jürgen Gausemeier.
“Procedural Model for the Virtual Commissioining on the Basis of Model-Based Design.”
In Smart Product Engineering - Proceedings of the 23rd CIRP Design Conference
(ISBN 978-3-642-30816, Springer-Verlag), 23–32, 2013.
ieee: T. Schmuedderich, A. Trächtler, J. Brökelmann, and J. Gausemeier, “Procedural
Model for the Virtual Commissioining on the Basis of Model-based Design,” in Smart
Product Engineering - Proceedings of the 23rd CIRP Design Conference (ISBN 978-3-642-30816,
Springer-Verlag), 2013, pp. 23–32.
mla: Schmuedderich, Tanja, et al. “Procedural Model for the Virtual Commissioining
on the Basis of Model-Based Design.” Smart Product Engineering - Proceedings
of the 23rd CIRP Design Conference (ISBN 978-3-642-30816, Springer-Verlag),
2013, pp. 23–32.
short: 'T. Schmuedderich, A. Trächtler, J. Brökelmann, J. Gausemeier, in: Smart
Product Engineering - Proceedings of the 23rd CIRP Design Conference (ISBN 978-3-642-30816,
Springer-Verlag), 2013, pp. 23–32.'
date_created: 2021-08-09T06:58:06Z
date_updated: 2022-01-06T06:55:46Z
department:
- _id: '153'
language:
- iso: eng
page: 23-32
publication: Smart Product Engineering - Proceedings of the 23rd CIRP Design Conference
(ISBN 978-3-642-30816, Springer-Verlag)
status: public
title: Procedural Model for the Virtual Commissioining on the Basis of Model-based
Design
type: conference
user_id: '24876'
year: '2013'
...
---
_id: '470'
abstract:
- lang: eng
text: In OpenFlow [1], multiple switches share the same control plane which is centralized
atwhat is called the OpenFlow controller. A switch only consists of a forwarding
plane. Rules for forwarding individual packets (called ow entries in OpenFlow)
are pushed from the controller to the switches. In a network with a high arrival
rate of new ows, such as in a data center, the control trac between the switch
and controller can become very high. As a consequence, routing of new ows will
be slow. One way to reduce control trac is to use wildcarded ow entries. Wildcard
ow entries can be used to create default routes in the network. However, since
switches do not keep track of ows covered by a wildcard ow entry, the controller
no longer has knowledge about individual ows. To nd out about these individual
ows we propose an extension to the current OpenFlow standard to enable packet
sampling of wildcard ow entries.
author:
- first_name: Philip
full_name: Wette, Philip
last_name: Wette
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
citation:
ama: 'Wette P, Karl H. Which Flows Are Hiding Behind My Wildcard Rule? Adding Packet
Sampling to OpenFlow. In: Proceedings of the ACM SIGCOMM ’13. Digital Library.
; 2013:541-542. doi:10.1145/2486001.2491710'
apa: Wette, P., & Karl, H. (2013). Which Flows Are Hiding Behind My Wildcard
Rule? Adding Packet Sampling to OpenFlow. In Proceedings of the ACM SIGCOMM
’13 (pp. 541–542). https://doi.org/10.1145/2486001.2491710
bibtex: '@inproceedings{Wette_Karl_2013, series={Digital Library}, title={Which
Flows Are Hiding Behind My Wildcard Rule? Adding Packet Sampling to OpenFlow},
DOI={10.1145/2486001.2491710},
booktitle={Proceedings of the ACM SIGCOMM ’13}, author={Wette, Philip and Karl,
Holger}, year={2013}, pages={541–542}, collection={Digital Library} }'
chicago: Wette, Philip, and Holger Karl. “Which Flows Are Hiding Behind My Wildcard
Rule? Adding Packet Sampling to OpenFlow.” In Proceedings of the ACM SIGCOMM
’13, 541–42. Digital Library, 2013. https://doi.org/10.1145/2486001.2491710.
ieee: P. Wette and H. Karl, “Which Flows Are Hiding Behind My Wildcard Rule? Adding
Packet Sampling to OpenFlow,” in Proceedings of the ACM SIGCOMM ’13, 2013,
pp. 541–542.
mla: Wette, Philip, and Holger Karl. “Which Flows Are Hiding Behind My Wildcard
Rule? Adding Packet Sampling to OpenFlow.” Proceedings of the ACM SIGCOMM ’13,
2013, pp. 541–42, doi:10.1145/2486001.2491710.
short: 'P. Wette, H. Karl, in: Proceedings of the ACM SIGCOMM ’13, 2013, pp. 541–542.'
date_created: 2017-10-17T12:42:23Z
date_updated: 2022-01-06T07:01:19Z
ddc:
- '040'
department:
- _id: '75'
doi: 10.1145/2486001.2491710
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-16T11:18:01Z
date_updated: 2018-03-16T11:18:01Z
file_id: '1331'
file_name: 470-p541-wette_01.pdf
file_size: 446835
relation: main_file
success: 1
file_date_updated: 2018-03-16T11:18:01Z
has_accepted_license: '1'
page: 541-542
project:
- _id: '1'
name: SFB 901
- _id: '6'
name: SFB 901 - Subprojekt A2
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the ACM SIGCOMM '13
series_title: Digital Library
status: public
title: Which Flows Are Hiding Behind My Wildcard Rule? Adding Packet Sampling to OpenFlow
type: conference
user_id: '15572'
year: '2013'
...
---
_id: '477'
abstract:
- lang: eng
text: We consider the k-token dissemination problem, where k initially arbitrarily
distributed tokens have to be disseminated to all nodes in a dynamic network (as
introduced by Kuhn et al., STOC 2010). In contrast to general dynamic networks,
our dynamic networks are unit disk graphs, i.e., nodes are embedded into the Euclidean
plane and two nodes are connected if and only if their distance is at most R.
Our worst-case adversary is allowed to move the nodes on the plane, but the maximum
velocity v_max of each node is limited and the graph must be connected in each
round. For this model, we provide almost tight lower and upper bounds for k-token
dissemination if nodes are restricted to send only one token per round. It turns
out that the maximum velocity v_max is a meaningful parameter to characterize
dynamics in our model.
author:
- first_name: Sebastian
full_name: Abshoff, Sebastian
last_name: Abshoff
- first_name: Markus
full_name: Benter, Markus
last_name: Benter
- first_name: Andreas
full_name: Cord-Landwehr, Andreas
last_name: Cord-Landwehr
- first_name: Manuel
full_name: Malatyali, Manuel
last_name: Malatyali
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Abshoff S, Benter M, Cord-Landwehr A, Malatyali M, Meyer auf der Heide F.
Token Dissemination in Geometric Dynamic Networks. In: Algorithms for Sensor
Systems - 9th International Symposium on Algorithms and Experiments for Sensor
Systems, Wireless Networks and Distributed Robotics, {ALGOSENSORS} 2013, Sophia
Antipolis, France, September 5-6, 2013, Revised Selected Papers. Lecture Notes
in Computer Science. ; 2013:22-34. doi:10.1007/978-3-642-45346-5_3'
apa: Abshoff, S., Benter, M., Cord-Landwehr, A., Malatyali, M., & Meyer auf
der Heide, F. (2013). Token Dissemination in Geometric Dynamic Networks. In Algorithms
for Sensor Systems - 9th International Symposium on Algorithms and Experiments
for Sensor Systems, Wireless Networks and Distributed Robotics, {ALGOSENSORS}
2013, Sophia Antipolis, France, September 5-6, 2013, Revised Selected Papers
(pp. 22–34). https://doi.org/10.1007/978-3-642-45346-5_3
bibtex: '@inproceedings{Abshoff_Benter_Cord-Landwehr_Malatyali_Meyer auf der Heide_2013,
series={Lecture Notes in Computer Science}, title={Token Dissemination in Geometric
Dynamic Networks}, DOI={10.1007/978-3-642-45346-5_3},
booktitle={Algorithms for Sensor Systems - 9th International Symposium on Algorithms
and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics,
{ALGOSENSORS} 2013, Sophia Antipolis, France, September 5-6, 2013, Revised Selected
Papers}, author={Abshoff, Sebastian and Benter, Markus and Cord-Landwehr, Andreas
and Malatyali, Manuel and Meyer auf der Heide, Friedhelm}, year={2013}, pages={22–34},
collection={Lecture Notes in Computer Science} }'
chicago: Abshoff, Sebastian, Markus Benter, Andreas Cord-Landwehr, Manuel Malatyali,
and Friedhelm Meyer auf der Heide. “Token Dissemination in Geometric Dynamic Networks.”
In Algorithms for Sensor Systems - 9th International Symposium on Algorithms
and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics,
{ALGOSENSORS} 2013, Sophia Antipolis, France, September 5-6, 2013, Revised Selected
Papers, 22–34. Lecture Notes in Computer Science, 2013. https://doi.org/10.1007/978-3-642-45346-5_3.
ieee: S. Abshoff, M. Benter, A. Cord-Landwehr, M. Malatyali, and F. Meyer auf der
Heide, “Token Dissemination in Geometric Dynamic Networks,” in Algorithms for
Sensor Systems - 9th International Symposium on Algorithms and Experiments for
Sensor Systems, Wireless Networks and Distributed Robotics, {ALGOSENSORS} 2013,
Sophia Antipolis, France, September 5-6, 2013, Revised Selected Papers, 2013,
pp. 22–34.
mla: Abshoff, Sebastian, et al. “Token Dissemination in Geometric Dynamic Networks.”
Algorithms for Sensor Systems - 9th International Symposium on Algorithms and
Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, {ALGOSENSORS}
2013, Sophia Antipolis, France, September 5-6, 2013, Revised Selected Papers,
2013, pp. 22–34, doi:10.1007/978-3-642-45346-5_3.
short: 'S. Abshoff, M. Benter, A. Cord-Landwehr, M. Malatyali, F. Meyer auf der
Heide, in: Algorithms for Sensor Systems - 9th International Symposium on Algorithms
and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics,
{ALGOSENSORS} 2013, Sophia Antipolis, France, September 5-6, 2013, Revised Selected
Papers, 2013, pp. 22–34.'
date_created: 2017-10-17T12:42:25Z
date_updated: 2022-01-06T07:01:21Z
ddc:
- '040'
department:
- _id: '63'
doi: 10.1007/978-3-642-45346-5_3
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T14:06:38Z
date_updated: 2018-03-15T14:06:38Z
file_id: '1325'
file_name: 477-geometric-dynamic-networks_01.pdf
file_size: 193169
relation: main_file
success: 1
file_date_updated: 2018-03-15T14:06:38Z
has_accepted_license: '1'
page: 22-34
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publication: Algorithms for Sensor Systems - 9th International Symposium on Algorithms
and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics,
{ALGOSENSORS} 2013, Sophia Antipolis, France, September 5-6, 2013, Revised Selected
Papers
series_title: Lecture Notes in Computer Science
status: public
title: Token Dissemination in Geometric Dynamic Networks
type: conference
user_id: '15504'
year: '2013'
...
---
_id: '490'
author:
- first_name: Felix
full_name: Wallaschek, Felix
last_name: Wallaschek
citation:
ama: Wallaschek F. Routing in heterogenen OpenFlow Netzwerken. Universität
Paderborn; 2013.
apa: Wallaschek, F. (2013). Routing in heterogenen OpenFlow Netzwerken. Universität
Paderborn.
bibtex: '@book{Wallaschek_2013, title={Routing in heterogenen OpenFlow Netzwerken},
publisher={Universität Paderborn}, author={Wallaschek, Felix}, year={2013} }'
chicago: Wallaschek, Felix. Routing in heterogenen OpenFlow Netzwerken. Universität
Paderborn, 2013.
ieee: F. Wallaschek, Routing in heterogenen OpenFlow Netzwerken. Universität
Paderborn, 2013.
mla: Wallaschek, Felix. Routing in heterogenen OpenFlow Netzwerken. Universität
Paderborn, 2013.
short: F. Wallaschek, Routing in heterogenen OpenFlow Netzwerken, Universität Paderborn,
2013.
date_created: 2017-10-17T12:42:27Z
date_updated: 2022-01-06T07:01:28Z
department:
- _id: '75'
language:
- iso: ger
project:
- _id: '1'
name: SFB 901
- _id: '6'
name: SFB 901 - Subprojekt A2
- _id: '2'
name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
title: Routing in heterogenen OpenFlow Netzwerken
type: bachelorsthesis
user_id: '477'
year: '2013'
...
---
_id: '492'
author:
- first_name: Christoph
full_name: Robbert, Christoph
last_name: Robbert
citation:
ama: Robbert C. Ressource-Optimized Deployment of Multi-Tier Applications - The
Data Rate-Constrained Case. Universität Paderborn; 2013.
apa: Robbert, C. (2013). Ressource-Optimized Deployment of Multi-Tier Applications
- The Data Rate-Constrained Case. Universität Paderborn.
bibtex: '@book{Robbert_2013, title={Ressource-Optimized Deployment of Multi-Tier
Applications - The Data Rate-Constrained Case}, publisher={Universität Paderborn},
author={Robbert, Christoph}, year={2013} }'
chicago: Robbert, Christoph. Ressource-Optimized Deployment of Multi-Tier Applications
- The Data Rate-Constrained Case. Universität Paderborn, 2013.
ieee: C. Robbert, Ressource-Optimized Deployment of Multi-Tier Applications -
The Data Rate-Constrained Case. Universität Paderborn, 2013.
mla: Robbert, Christoph. Ressource-Optimized Deployment of Multi-Tier Applications
- The Data Rate-Constrained Case. Universität Paderborn, 2013.
short: C. Robbert, Ressource-Optimized Deployment of Multi-Tier Applications - The
Data Rate-Constrained Case, Universität Paderborn, 2013.
date_created: 2017-10-17T12:42:28Z
date_updated: 2022-01-06T07:01:29Z
department:
- _id: '75'
project:
- _id: '1'
name: SFB 901
- _id: '6'
name: SFB 901 - Subprojekt A2
- _id: '2'
name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
title: Ressource-Optimized Deployment of Multi-Tier Applications - The Data Rate-Constrained
Case
type: bachelorsthesis
user_id: '15504'
year: '2013'
...
---
_id: '496'
abstract:
- lang: eng
text: Within reactive topology control, a node determines its adjacent edges of
a network subgraph without prior knowledge of its neighborhood. The goal is to
construct a local view on a topology which provides certain desired properties
such as planarity. During algorithm execution, a node, in general, is not allowed
to determine all its neighbors of the network graph. There are well-known reactive
algorithms for computing planar subgraphs. However, the subgraphs obtained do
not have constant Euclidean spanning ratio. This means that routing along these
subgraphs may result in potentially long detours. So far, it has been unknown
if planar spanners can be constructed reactively. In this work, we show that at
least under the unit disk network model, this is indeed possible, by proposing
an algorithm for reactive construction of the partial Delaunay triangulation,
which recently turned out to be a spanner. Furthermore, we show that our algorithm
is message-optimal as a node will only exchange messages with nodes that are also
neighbors in the spanner. The algorithm’s presentation is complemented by a rigorous
proof of correctness.
author:
- first_name: Markus
full_name: Benter, Markus
last_name: Benter
- first_name: Florentin
full_name: Neumann, Florentin
last_name: Neumann
- first_name: Hannes
full_name: Frey, Hannes
last_name: Frey
citation:
ama: 'Benter M, Neumann F, Frey H. Reactive Planar Spanner Construction in Wireless
Ad Hoc and Sensor Networks. In: Proceedings of the 32nd IEEE International
Conference on Computer Communications (INFOCOM). ; 2013:2193-2201. doi:10.1109/INFCOM.2013.6567022'
apa: Benter, M., Neumann, F., & Frey, H. (2013). Reactive Planar Spanner Construction
in Wireless Ad Hoc and Sensor Networks. In Proceedings of the 32nd IEEE International
Conference on Computer Communications (INFOCOM) (pp. 2193–2201). https://doi.org/10.1109/INFCOM.2013.6567022
bibtex: '@inproceedings{Benter_Neumann_Frey_2013, title={Reactive Planar Spanner
Construction in Wireless Ad Hoc and Sensor Networks}, DOI={10.1109/INFCOM.2013.6567022},
booktitle={Proceedings of the 32nd IEEE International Conference on Computer Communications
(INFOCOM)}, author={Benter, Markus and Neumann, Florentin and Frey, Hannes}, year={2013},
pages={2193–2201} }'
chicago: Benter, Markus, Florentin Neumann, and Hannes Frey. “Reactive Planar Spanner
Construction in Wireless Ad Hoc and Sensor Networks.” In Proceedings of the
32nd IEEE International Conference on Computer Communications (INFOCOM), 2193–2201,
2013. https://doi.org/10.1109/INFCOM.2013.6567022.
ieee: M. Benter, F. Neumann, and H. Frey, “Reactive Planar Spanner Construction
in Wireless Ad Hoc and Sensor Networks,” in Proceedings of the 32nd IEEE International
Conference on Computer Communications (INFOCOM), 2013, pp. 2193–2201.
mla: Benter, Markus, et al. “Reactive Planar Spanner Construction in Wireless Ad
Hoc and Sensor Networks.” Proceedings of the 32nd IEEE International Conference
on Computer Communications (INFOCOM), 2013, pp. 2193–201, doi:10.1109/INFCOM.2013.6567022.
short: 'M. Benter, F. Neumann, H. Frey, in: Proceedings of the 32nd IEEE International
Conference on Computer Communications (INFOCOM), 2013, pp. 2193–2201.'
date_created: 2017-10-17T12:42:29Z
date_updated: 2022-01-06T07:01:31Z
ddc:
- '040'
department:
- _id: '75'
doi: 10.1109/INFCOM.2013.6567022
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T13:41:34Z
date_updated: 2018-03-15T13:41:34Z
file_id: '1312'
file_name: 496-reactivePDT-copyright.pdf
file_size: 352571
relation: main_file
success: 1
file_date_updated: 2018-03-15T13:41:34Z
has_accepted_license: '1'
page: 2193-2201
project:
- _id: '1'
name: SFB 901
- _id: '6'
name: SFB 901 - Subprojekt A2
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the 32nd IEEE International Conference on Computer Communications
(INFOCOM)
status: public
title: Reactive Planar Spanner Construction in Wireless Ad Hoc and Sensor Networks
type: conference
user_id: '15504'
year: '2013'
...
---
_id: '9866'
abstract:
- lang: eng
text: The hydrothermal method utilizes a solution-based chemical reaction to synthesize
piezoelectric thin films and powders. This method has a number of advantages,
such as low-temperature synthesis, and high purity and high quality of the product.
In order to promote hydrothermal reactions, we developed an ultrasonic assisted
hydrothermal method and confirmed that it produces dense and thick lead--zirconate--titanate
(PZT) films. In the hydrothermal method, a crystal growth process follows the
nucleation process. In this study, we verified that ultrasonic irradiation is
effective for the nucleation process, and there is an optimum irradiation period
to obtain thicker PZT films. With this optimization, a 9.2-$\mu$ m-thick PZT polycrystalline
film was obtained in a single deposition process. For this film, ultrasonic irradiation
was carried out from the beginning of the reaction for 18 h, followed by a 6 h
deposition without ultrasonic irradiation. These results indicate that the ultrasonic
irradiation mainly promotes the nucleation process.
author:
- first_name: Kanako
full_name: Ohta, Kanako
last_name: Ohta
- first_name: Gaku
full_name: Isobe, Gaku
last_name: Isobe
- first_name: Peter
full_name: Bornmann, Peter
last_name: Bornmann
- first_name: Tobias
full_name: Hemsel, Tobias
id: '210'
last_name: Hemsel
- first_name: Takeshi
full_name: Morita, Takeshi
last_name: Morita
citation:
ama: Ohta K, Isobe G, Bornmann P, Hemsel T, Morita T. Study on optimizing ultrasonic
irradiation period for thick polycrystalline PZT film by hydrothermal method.
Ultrasonics. 2013;53(4):837-841. doi:10.1016/j.ultras.2012.12.003
apa: Ohta, K., Isobe, G., Bornmann, P., Hemsel, T., & Morita, T. (2013). Study
on optimizing ultrasonic irradiation period for thick polycrystalline PZT film
by hydrothermal method. Ultrasonics, 53(4), 837–841. https://doi.org/10.1016/j.ultras.2012.12.003
bibtex: '@article{Ohta_Isobe_Bornmann_Hemsel_Morita_2013, title={Study on optimizing
ultrasonic irradiation period for thick polycrystalline PZT film by hydrothermal
method}, volume={53}, DOI={10.1016/j.ultras.2012.12.003},
number={4}, journal={Ultrasonics}, author={Ohta, Kanako and Isobe, Gaku and Bornmann,
Peter and Hemsel, Tobias and Morita, Takeshi}, year={2013}, pages={837–841} }'
chicago: 'Ohta, Kanako, Gaku Isobe, Peter Bornmann, Tobias Hemsel, and Takeshi Morita.
“Study on Optimizing Ultrasonic Irradiation Period for Thick Polycrystalline PZT
Film by Hydrothermal Method.” Ultrasonics 53, no. 4 (2013): 837–41. https://doi.org/10.1016/j.ultras.2012.12.003.'
ieee: K. Ohta, G. Isobe, P. Bornmann, T. Hemsel, and T. Morita, “Study on optimizing
ultrasonic irradiation period for thick polycrystalline PZT film by hydrothermal
method,” Ultrasonics, vol. 53, no. 4, pp. 837–841, 2013.
mla: Ohta, Kanako, et al. “Study on Optimizing Ultrasonic Irradiation Period for
Thick Polycrystalline PZT Film by Hydrothermal Method.” Ultrasonics, vol.
53, no. 4, 2013, pp. 837–41, doi:10.1016/j.ultras.2012.12.003.
short: K. Ohta, G. Isobe, P. Bornmann, T. Hemsel, T. Morita, Ultrasonics 53 (2013)
837–841.
date_created: 2019-05-20T12:03:07Z
date_updated: 2019-09-16T10:54:27Z
department:
- _id: '151'
doi: 10.1016/j.ultras.2012.12.003
intvolume: ' 53'
issue: '4'
keyword:
- Piezoelectric material
language:
- iso: eng
page: 837 - 841
publication: Ultrasonics
publication_identifier:
issn:
- 0041-624X
quality_controlled: '1'
status: public
title: Study on optimizing ultrasonic irradiation period for thick polycrystalline
PZT film by hydrothermal method
type: journal_article
user_id: '55222'
volume: 53
year: '2013'
...
---
_id: '5042'
alternative_title:
- 6., vollständig überarbeitete Auflage
author:
- first_name: Rolf
full_name: König, Rolf
last_name: König
- first_name: Caren
full_name: Sureth-Sloane, Caren
last_name: Sureth-Sloane
citation:
ama: 'König R, Sureth-Sloane C. Besteuerung und Rechtsformwahl. Herne: Verlag
Neue Wirtschafts-Briefe; 2013.'
apa: 'König, R., & Sureth-Sloane, C. (2013). Besteuerung und Rechtsformwahl.
Herne: Verlag Neue Wirtschafts-Briefe.'
bibtex: '@book{König_Sureth-Sloane_2013, place={Herne}, title={Besteuerung und Rechtsformwahl},
publisher={Verlag Neue Wirtschafts-Briefe}, author={König, Rolf and Sureth-Sloane,
Caren}, year={2013} }'
chicago: 'König, Rolf, and Caren Sureth-Sloane. Besteuerung und Rechtsformwahl.
Herne: Verlag Neue Wirtschafts-Briefe, 2013.'
ieee: 'R. König and C. Sureth-Sloane, Besteuerung und Rechtsformwahl. Herne:
Verlag Neue Wirtschafts-Briefe, 2013.'
mla: König, Rolf, and Caren Sureth-Sloane. Besteuerung und Rechtsformwahl.
Verlag Neue Wirtschafts-Briefe, 2013.
short: R. König, C. Sureth-Sloane, Besteuerung und Rechtsformwahl, Verlag Neue Wirtschafts-Briefe,
Herne, 2013.
date_created: 2018-10-30T13:48:38Z
date_updated: 2022-01-06T07:01:35Z
department:
- _id: '187'
- _id: '635'
language:
- iso: ger
place: Herne
publisher: Verlag Neue Wirtschafts-Briefe
status: public
title: Besteuerung und Rechtsformwahl
type: book
user_id: '61801'
year: '2013'
...
---
_id: '508'
abstract:
- lang: eng
text: The process of planning a virtual topology for a Wavelength Devision Multiplexing
(WDM) network is called Virtual Topology Design (VTD). The goal of VTD is to find
a virtual topology that supports forwarding the expected traffic without congestion.
In networks with fluctuating, high traffic demands, it can happen that no single
topology fits all changing traffic demands occurring over a longer time. Thus,
during operation, the virtual topology has to be reconfigured. Since modern networks
tend to be large, VTD algorithms have to scale well with increasing network size,
requiring distributed algorithms. Existing distributed VTD algorithms, however,
react too slowly on congestion for the real-time reconfiguration of large networks.
We propose Selfish Virtual Topology Reconfiguration (SVTR) as a new algorithm
for distributed VTD. It combines reconfiguring the virtual topology and routing
through a Software Defined Network (SDN). SVTR is used for online, on-the-fly
network reconfiguration. Its integrated routing and WDM reconfiguration keeps
connection disruption due to network reconfiguration to a minimum and is able
to react very quickly to traffic pattern changes. SVTR works by iteratively adapting
the virtual topology to the observed traffic patterns without global traffic information
and without future traffic estimations. We evaluated SVTR by simulation and found
that it significantly lowers congestion in realistic networks and high load scenarios.
author:
- first_name: Philip
full_name: Wette, Philip
last_name: Wette
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
citation:
ama: 'Wette P, Karl H. On the Quality of Selfish Virtual Topology Reconfiguration
in IP-over-WDM Networks. In: Proceedings of the 19th IEEE International Workshop
on Local and Metropolitan Area Networks (IEEE LANMAN). ; 2013:1-6. doi:10.1109/LANMAN.2013.6528271'
apa: Wette, P., & Karl, H. (2013). On the Quality of Selfish Virtual Topology
Reconfiguration in IP-over-WDM Networks. In Proceedings of the 19th IEEE International
Workshop on Local and Metropolitan Area Networks (IEEE LANMAN) (pp. 1–6).
https://doi.org/10.1109/LANMAN.2013.6528271
bibtex: '@inproceedings{Wette_Karl_2013, title={On the Quality of Selfish Virtual
Topology Reconfiguration in IP-over-WDM Networks}, DOI={10.1109/LANMAN.2013.6528271},
booktitle={Proceedings of the 19th IEEE International Workshop on Local and Metropolitan
Area Networks (IEEE LANMAN)}, author={Wette, Philip and Karl, Holger}, year={2013},
pages={1–6} }'
chicago: Wette, Philip, and Holger Karl. “On the Quality of Selfish Virtual Topology
Reconfiguration in IP-over-WDM Networks.” In Proceedings of the 19th IEEE International
Workshop on Local and Metropolitan Area Networks (IEEE LANMAN), 1–6, 2013.
https://doi.org/10.1109/LANMAN.2013.6528271.
ieee: P. Wette and H. Karl, “On the Quality of Selfish Virtual Topology Reconfiguration
in IP-over-WDM Networks,” in Proceedings of the 19th IEEE International Workshop
on Local and Metropolitan Area Networks (IEEE LANMAN), 2013, pp. 1–6.
mla: Wette, Philip, and Holger Karl. “On the Quality of Selfish Virtual Topology
Reconfiguration in IP-over-WDM Networks.” Proceedings of the 19th IEEE International
Workshop on Local and Metropolitan Area Networks (IEEE LANMAN), 2013, pp.
1–6, doi:10.1109/LANMAN.2013.6528271.
short: 'P. Wette, H. Karl, in: Proceedings of the 19th IEEE International Workshop
on Local and Metropolitan Area Networks (IEEE LANMAN), 2013, pp. 1–6.'
date_created: 2017-10-17T12:42:31Z
date_updated: 2022-01-06T07:01:37Z
ddc:
- '040'
department:
- _id: '75'
doi: 10.1109/LANMAN.2013.6528271
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T10:50:19Z
date_updated: 2018-03-15T10:50:19Z
file_id: '1307'
file_name: 508-06528271.pdf
file_size: 219902
relation: main_file
success: 1
file_date_updated: 2018-03-15T10:50:19Z
has_accepted_license: '1'
page: '1 - 6 '
project:
- _id: '1'
name: SFB 901
- _id: '6'
name: SFB 901 - Subprojekt A2
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the 19th IEEE International Workshop on Local and Metropolitan
Area Networks (IEEE LANMAN)
status: public
title: On the Quality of Selfish Virtual Topology Reconfiguration in IP-over-WDM Networks
type: conference
user_id: '15572'
year: '2013'
...
---
_id: '509'
abstract:
- lang: eng
text: In this paper we will introduce a new d-dimensional graph for constructing
geometric application layer overlay net-works. Our approach will use internet
coordinates, embedded using the L∞ -metric. After describing the graph structure,
we will show how it limits maintenance overhead by bounding each node’s out-degree
and how it supports greedy routing using one-hop neighbourhood information in
each routing step. We will further show that greedy routing can always compute
a path in our graph and we will also prove that in each forwarding step the next
hop is closer to the destination than the current node.
author:
- first_name: Marcus
full_name: Autenrieth, Marcus
last_name: Autenrieth
- first_name: Hannes
full_name: Frey, Hannes
last_name: Frey
citation:
ama: 'Autenrieth M, Frey H. On Greedy Routing in Degree-bounded Graphs over d-Dimensional
Internet Coordinate Embeddings. In: Proceedings of the Conference on Networked
Systems (NetSys). ; 2013:126-131. doi:10.1109/NetSys.2013.10'
apa: Autenrieth, M., & Frey, H. (2013). On Greedy Routing in Degree-bounded
Graphs over d-Dimensional Internet Coordinate Embeddings. In Proceedings of
the Conference on Networked Systems (NetSys) (pp. 126–131). https://doi.org/10.1109/NetSys.2013.10
bibtex: '@inproceedings{Autenrieth_Frey_2013, title={On Greedy Routing in Degree-bounded
Graphs over d-Dimensional Internet Coordinate Embeddings}, DOI={10.1109/NetSys.2013.10},
booktitle={Proceedings of the Conference on Networked Systems (NetSys)}, author={Autenrieth,
Marcus and Frey, Hannes}, year={2013}, pages={126–131} }'
chicago: Autenrieth, Marcus, and Hannes Frey. “On Greedy Routing in Degree-Bounded
Graphs over d-Dimensional Internet Coordinate Embeddings.” In Proceedings of
the Conference on Networked Systems (NetSys), 126–31, 2013. https://doi.org/10.1109/NetSys.2013.10.
ieee: M. Autenrieth and H. Frey, “On Greedy Routing in Degree-bounded Graphs over
d-Dimensional Internet Coordinate Embeddings,” in Proceedings of the Conference
on Networked Systems (NetSys), 2013, pp. 126–131.
mla: Autenrieth, Marcus, and Hannes Frey. “On Greedy Routing in Degree-Bounded Graphs
over d-Dimensional Internet Coordinate Embeddings.” Proceedings of the Conference
on Networked Systems (NetSys), 2013, pp. 126–31, doi:10.1109/NetSys.2013.10.
short: 'M. Autenrieth, H. Frey, in: Proceedings of the Conference on Networked Systems
(NetSys), 2013, pp. 126–131.'
date_created: 2017-10-17T12:42:31Z
date_updated: 2022-01-06T07:01:37Z
ddc:
- '040'
department:
- _id: '75'
doi: 10.1109/NetSys.2013.10
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T10:46:51Z
date_updated: 2018-03-15T10:46:51Z
file_id: '1304'
file_name: 509-06529245.pdf
file_size: 197048
relation: main_file
success: 1
file_date_updated: 2018-03-15T10:46:51Z
has_accepted_license: '1'
page: 126-131
project:
- _id: '1'
name: SFB 901
- _id: '6'
name: SFB 901 - Subprojekt A2
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the Conference on Networked Systems (NetSys)
status: public
title: On Greedy Routing in Degree-bounded Graphs over d-Dimensional Internet Coordinate
Embeddings
type: conference
user_id: '15504'
year: '2013'
...
---
_id: '511'
author:
- first_name: Malte
full_name: Splietker, Malte
last_name: Splietker
citation:
ama: Splietker M. MapReduce in Software Defined Networks. Universität Paderborn;
2013.
apa: Splietker, M. (2013). MapReduce in Software Defined Networks. Universität
Paderborn.
bibtex: '@book{Splietker_2013, title={MapReduce in Software Defined Networks}, publisher={Universität
Paderborn}, author={Splietker, Malte}, year={2013} }'
chicago: Splietker, Malte. MapReduce in Software Defined Networks. Universität
Paderborn, 2013.
ieee: M. Splietker, MapReduce in Software Defined Networks. Universität Paderborn,
2013.
mla: Splietker, Malte. MapReduce in Software Defined Networks. Universität
Paderborn, 2013.
short: M. Splietker, MapReduce in Software Defined Networks, Universität Paderborn,
2013.
date_created: 2017-10-17T12:42:32Z
date_updated: 2022-01-06T07:01:38Z
department:
- _id: '75'
project:
- _id: '1'
name: SFB 901
- _id: '6'
name: SFB 901 - Subprojekt A2
- _id: '2'
name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
title: MapReduce in Software Defined Networks
type: bachelorsthesis
user_id: '15504'
year: '2013'
...
---
_id: '5112'
author:
- first_name: Bernard Michael
full_name: Gilroy, Bernard Michael
id: '175'
last_name: Gilroy
- first_name: Elmar
full_name: Lukas, Elmar
last_name: Lukas
- first_name: Christian
full_name: Heimann, Christian
last_name: Heimann
citation:
ama: Gilroy BM, Lukas E, Heimann C. Technologiestandort Deutschland und internationale
Wissensspillover. Jahrbücher für Nationalokonomie 6 Statistik. 2013;233.
apa: Gilroy, B. M., Lukas, E., & Heimann, C. (2013). Technologiestandort Deutschland
und internationale Wissensspillover. Jahrbücher Für Nationalokonomie 6 Statistik,
233.
bibtex: '@article{Gilroy_Lukas_Heimann_2013, title={Technologiestandort Deutschland
und internationale Wissensspillover.}, volume={233}, journal={Jahrbücher für Nationalokonomie
6 Statistik}, author={Gilroy, Bernard Michael and Lukas, Elmar and Heimann, Christian},
year={2013} }'
chicago: Gilroy, Bernard Michael, Elmar Lukas, and Christian Heimann. “Technologiestandort
Deutschland Und Internationale Wissensspillover.” Jahrbücher Für Nationalokonomie
6 Statistik 233 (2013).
ieee: B. M. Gilroy, E. Lukas, and C. Heimann, “Technologiestandort Deutschland und
internationale Wissensspillover.,” Jahrbücher für Nationalokonomie 6 Statistik,
vol. 233, 2013.
mla: Gilroy, Bernard Michael, et al. “Technologiestandort Deutschland Und Internationale
Wissensspillover.” Jahrbücher Für Nationalokonomie 6 Statistik, vol. 233,
2013.
short: B.M. Gilroy, E. Lukas, C. Heimann, Jahrbücher Für Nationalokonomie 6 Statistik
233 (2013).
date_created: 2018-10-31T07:58:12Z
date_updated: 2022-01-06T07:01:38Z
department:
- _id: '203'
intvolume: ' 233'
language:
- iso: eng
publication: Jahrbücher für Nationalokonomie 6 Statistik
status: public
title: Technologiestandort Deutschland und internationale Wissensspillover.
type: journal_article
user_id: '26589'
volume: 233
year: '2013'
...
---
_id: '520'
abstract:
- lang: eng
text: Preemptive Routing and Wavelength Assignment (RWA) algorithms preempt established
lightpaths in case not enough resources are available to set up a new lightpath
in a Wavelength Division Multiplexing (WDM) network. The selection of lightpaths
to be preempted relies on internal decisions of the RWA algorithm. Thus, if dedicated
properties of the network topology are required by the applications running on
the network, these requirements have to be known to the RWA algorithm.Otherwise
it might happen that by preempting a particular lightpath these requirements are
violated. If, however, these requirements include parametersknown only at the
nodes running the application, the RWA algorithm cannot evaluate the requirements.
For this reason an RWA algorithm is needed which incorporates feedback from the
application layer in the preemption decisions.This work proposes a simple interface
along with an algorithm for computing and selecting preemption candidates in case
a lightpath cannot be established. We reason about the necessity of using information
from the application layer in the RWA and present two example applications which
benefit from this idea.
author:
- first_name: Philip
full_name: Wette, Philip
last_name: Wette
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
citation:
ama: 'Wette P, Karl H. Incorporating feedback from application layer into routing
and wavelength assignment algorithms. In: Proceedings of the 32nd IEEE International
Conference on Computer Communications (INFOCOM). ; 2013:51-52. doi:10.1109/INFCOMW.2013.6970733'
apa: Wette, P., & Karl, H. (2013). Incorporating feedback from application layer
into routing and wavelength assignment algorithms. In Proceedings of the 32nd
IEEE International Conference on Computer Communications (INFOCOM) (pp. 51–52).
https://doi.org/10.1109/INFCOMW.2013.6970733
bibtex: '@inproceedings{Wette_Karl_2013, title={Incorporating feedback from application
layer into routing and wavelength assignment algorithms}, DOI={10.1109/INFCOMW.2013.6970733},
booktitle={Proceedings of the 32nd IEEE International Conference on Computer Communications
(INFOCOM)}, author={Wette, Philip and Karl, Holger}, year={2013}, pages={51–52}
}'
chicago: Wette, Philip, and Holger Karl. “Incorporating Feedback from Application
Layer into Routing and Wavelength Assignment Algorithms.” In Proceedings of
the 32nd IEEE International Conference on Computer Communications (INFOCOM),
51–52, 2013. https://doi.org/10.1109/INFCOMW.2013.6970733.
ieee: P. Wette and H. Karl, “Incorporating feedback from application layer into
routing and wavelength assignment algorithms,” in Proceedings of the 32nd IEEE
International Conference on Computer Communications (INFOCOM), 2013, pp. 51–52.
mla: Wette, Philip, and Holger Karl. “Incorporating Feedback from Application Layer
into Routing and Wavelength Assignment Algorithms.” Proceedings of the 32nd
IEEE International Conference on Computer Communications (INFOCOM), 2013,
pp. 51–52, doi:10.1109/INFCOMW.2013.6970733.
short: 'P. Wette, H. Karl, in: Proceedings of the 32nd IEEE International Conference
on Computer Communications (INFOCOM), 2013, pp. 51–52.'
date_created: 2017-10-17T12:42:33Z
date_updated: 2022-01-06T07:01:43Z
ddc:
- '040'
department:
- _id: '75'
doi: 10.1109/INFCOMW.2013.6970733
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T10:38:04Z
date_updated: 2018-03-15T10:38:04Z
file_id: '1298'
file_name: 520-wetteinfocom2013.pdf
file_size: 131502
relation: main_file
success: 1
file_date_updated: 2018-03-15T10:38:04Z
has_accepted_license: '1'
main_file_link:
- url: http://ieeexplore.ieee.org/document/6970733/
page: 51-52
project:
- _id: '1'
name: SFB 901
- _id: '6'
name: SFB 901 - Subprojekt A2
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the 32nd IEEE International Conference on Computer Communications
(INFOCOM)
status: public
title: Incorporating feedback from application layer into routing and wavelength assignment
algorithms
type: conference
user_id: '15504'
year: '2013'
...
---
_id: '525'
author:
- first_name: Tim
full_name: Niklas Vinkemeier, Tim
last_name: Niklas Vinkemeier
citation:
ama: Niklas Vinkemeier T. Haptics - Hadoop Performance Testing in Concurrent
Job Scenarios. Universität Paderborn; 2013.
apa: Niklas Vinkemeier, T. (2013). Haptics - Hadoop performance testing in concurrent
job scenarios. Universität Paderborn.
bibtex: '@book{Niklas Vinkemeier_2013, title={Haptics - Hadoop performance testing
in concurrent job scenarios}, publisher={Universität Paderborn}, author={Niklas
Vinkemeier, Tim}, year={2013} }'
chicago: Niklas Vinkemeier, Tim. Haptics - Hadoop Performance Testing in Concurrent
Job Scenarios. Universität Paderborn, 2013.
ieee: T. Niklas Vinkemeier, Haptics - Hadoop performance testing in concurrent
job scenarios. Universität Paderborn, 2013.
mla: Niklas Vinkemeier, Tim. Haptics - Hadoop Performance Testing in Concurrent
Job Scenarios. Universität Paderborn, 2013.
short: T. Niklas Vinkemeier, Haptics - Hadoop Performance Testing in Concurrent
Job Scenarios, Universität Paderborn, 2013.
date_created: 2017-10-17T12:42:34Z
date_updated: 2022-01-06T07:01:48Z
department:
- _id: '75'
project:
- _id: '1'
name: SFB 901
- _id: '6'
name: SFB 901 - Subprojekt A2
- _id: '2'
name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
title: Haptics - Hadoop performance testing in concurrent job scenarios
type: bachelorsthesis
user_id: '15504'
year: '2013'
...
---
_id: '534'
author:
- first_name: Suhas
full_name: Satya, Suhas
last_name: Satya
citation:
ama: Satya S. Emulating Wavelength Division Multiplexing Using Openflow.
Universität Paderborn; 2013.
apa: Satya, S. (2013). Emulating Wavelength Division Multiplexing using Openflow.
Universität Paderborn.
bibtex: '@book{Satya_2013, title={Emulating Wavelength Division Multiplexing using
Openflow}, publisher={Universität Paderborn}, author={Satya, Suhas}, year={2013}
}'
chicago: Satya, Suhas. Emulating Wavelength Division Multiplexing Using Openflow.
Universität Paderborn, 2013.
ieee: S. Satya, Emulating Wavelength Division Multiplexing using Openflow.
Universität Paderborn, 2013.
mla: Satya, Suhas. Emulating Wavelength Division Multiplexing Using Openflow.
Universität Paderborn, 2013.
short: S. Satya, Emulating Wavelength Division Multiplexing Using Openflow, Universität
Paderborn, 2013.
date_created: 2017-10-17T12:42:36Z
date_updated: 2022-01-06T07:01:50Z
department:
- _id: '75'
project:
- _id: '1'
name: SFB 901
- _id: '6'
name: SFB 901 - Subprojekt A2
- _id: '2'
name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
title: Emulating Wavelength Division Multiplexing using Openflow
type: mastersthesis
user_id: '15504'
year: '2013'
...
---
_id: '547'
abstract:
- lang: eng
text: 'In recent years, the role of process models in the development of enterprise
software systems has increased continuously. Today, process models are used at
different levels in the development process. For instance, in Service-Oriented
Architectures (SOA), high-level business process models become input for the development
of IT systems, and in running IT systems executable process models describe choreographies
of Web Services. A key driver behind this development is the necessity for a closer
alignment of business and IT requirements, to reduce the reaction times in software
development to frequent changes in competitive markets.Typically in these scenarios,
process models are developed, maintained, and transformed in a team environment
by several stakeholders that are often from different business units, resulting
in different versions. To obtain integrated process models comprising the changes
applied to different versions, the versions need to be consolidated by means of
model change management. Change management for process models can be compared
to widely used concurrent versioning systems (CVS) and consists of the following
major activities: matching of process models, detection of differences, computation
of dependencies and conflicts between differences, and merging of process models.Although
in general model-driven development (MDD) is accepted as a well-established development
approach, there are still some shortcomings that let developers decide against
MDD and for more traditional development paradigms. These shortcomings comprise
a lack of fully integrated and fully featured development environments for MDD,
such as a comprehensive support for model change management.In this thesis, we
present a framework for process model change management. The framework is based
on an intermediate representation for process models that serves as an abstraction
of specific process modeling languages and focuses on common syntactic and semantic
core concepts for the modeling of workflow in process models. Based on the intermediate
representation, we match process models in versioning scenarios and compute differences
between process models generically. Further, we consider the analysis of dependencies
between differences and show how conflicts between differences can be computed
by taking into account the semantics of the modeling language.As proof-of concept,
we have implemented major parts of this framework in terms of a prototype. The
detection of differences and dependencies contributed also to the Compare & Merge
framework for the IBM WebSphere Business Modeler V 7.0 [1] (WBM), which was released
as a product in fall 2009.'
author:
- first_name: Christian
full_name: Gerth, Christian
last_name: Gerth
citation:
ama: Gerth C. Business Process Models - Change Management. Universität Paderborn;
2013. doi:10.1007/978-3-642-38604-6
apa: Gerth, C. (2013). Business Process Models - Change Management. Universität
Paderborn. https://doi.org/10.1007/978-3-642-38604-6
bibtex: '@book{Gerth_2013, title={Business Process Models - Change Management},
DOI={10.1007/978-3-642-38604-6},
publisher={Universität Paderborn}, author={Gerth, Christian}, year={2013} }'
chicago: Gerth, Christian. Business Process Models - Change Management. Universität
Paderborn, 2013. https://doi.org/10.1007/978-3-642-38604-6.
ieee: C. Gerth, Business Process Models - Change Management. Universität
Paderborn, 2013.
mla: Gerth, Christian. Business Process Models - Change Management. Universität
Paderborn, 2013, doi:10.1007/978-3-642-38604-6.
short: C. Gerth, Business Process Models - Change Management, Universität Paderborn,
2013.
date_created: 2017-10-17T12:42:39Z
date_updated: 2022-01-06T07:01:55Z
department:
- _id: '66'
doi: 10.1007/978-3-642-38604-6
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '9'
name: SFB 901 - Subprojekt B1
- _id: '3'
name: SFB 901 - Project Area B
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Gregor
full_name: Engels, Gregor
id: '107'
last_name: Engels
title: Business Process Models - Change Management
type: dissertation
user_id: '477'
year: '2013'
...