---
_id: '426'
author:
- first_name: Veit
full_name: Dornseifer, Veit
last_name: Dornseifer
citation:
ama: Dornseifer V. Evaluation of a Hybrid Packet-/Circuit-Switched Data Center
Network. Universität Paderborn; 2014.
apa: Dornseifer, V. (2014). Evaluation of a Hybrid Packet-/Circuit-Switched Data
Center Network. Universität Paderborn.
bibtex: '@book{Dornseifer_2014, title={Evaluation of a Hybrid Packet-/Circuit-Switched
Data Center Network}, publisher={Universität Paderborn}, author={Dornseifer, Veit},
year={2014} }'
chicago: Dornseifer, Veit. Evaluation of a Hybrid Packet-/Circuit-Switched Data
Center Network. Universität Paderborn, 2014.
ieee: V. Dornseifer, Evaluation of a Hybrid Packet-/Circuit-Switched Data Center
Network. Universität Paderborn, 2014.
mla: Dornseifer, Veit. Evaluation of a Hybrid Packet-/Circuit-Switched Data Center
Network. Universität Paderborn, 2014.
short: V. Dornseifer, Evaluation of a Hybrid Packet-/Circuit-Switched Data Center
Network, Universität Paderborn, 2014.
date_created: 2017-10-17T12:42:15Z
date_updated: 2022-01-06T07:00:43Z
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: Evaluation of a Hybrid Packet-/Circuit-Switched Data Center Network
type: mastersthesis
user_id: '15504'
year: '2014'
...
---
_id: '432'
author:
- first_name: Nico
full_name: Bredenbals, Nico
last_name: Bredenbals
citation:
ama: Bredenbals N. Energy-Efficient Queuing with Delayed Deactivation. Universität
Paderborn; 2014.
apa: Bredenbals, N. (2014). Energy-Efficient Queuing with Delayed Deactivation.
Universität Paderborn.
bibtex: '@book{Bredenbals_2014, title={Energy-Efficient Queuing with Delayed Deactivation},
publisher={Universität Paderborn}, author={Bredenbals, Nico}, year={2014} }'
chicago: Bredenbals, Nico. Energy-Efficient Queuing with Delayed Deactivation.
Universität Paderborn, 2014.
ieee: N. Bredenbals, Energy-Efficient Queuing with Delayed Deactivation.
Universität Paderborn, 2014.
mla: Bredenbals, Nico. Energy-Efficient Queuing with Delayed Deactivation.
Universität Paderborn, 2014.
short: N. Bredenbals, Energy-Efficient Queuing with Delayed Deactivation, Universität
Paderborn, 2014.
date_created: 2017-10-17T12:42:16Z
date_updated: 2022-01-06T07:00:54Z
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: Energy-Efficient Queuing with Delayed Deactivation
type: mastersthesis
user_id: '15504'
year: '2014'
...
---
_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: '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: '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: '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: '562'
abstract:
- lang: eng
text: In Distributed Cloud Computing, applications are deployed across many data
centres at topologically diverse locations to improved network-related quality
of service (QoS). As we focus on interactive applications, we minimize the latency
between users and an application by allocating Cloud resources nearby the customers.
Allocating resources at all locations will result in the best latency but also
in the highest expenses. So we need to find an optimal subset of locations which
reduces the latency but also the expenses – the facility location problem (FLP).
In addition, we consider resource capacity restrictions, as a resource can only
serve a limited amount of users. An FLP can be globally solved. Additionally,
we propose a local, distributed heuristic. This heuristic is running within the
network and does not depend on a global component. No distributed, local approximations
for the capacitated FLP have been proposed so far due to the complexity of the
problem. We compared the heuristic with an optimal solution obtained from a mixed
integer program for different network topologies. We investigated the influence
of different parameters like overall resource utilization or different latency
weights.
author:
- first_name: Matthias
full_name: Keller, Matthias
last_name: Keller
- first_name: Stefan
full_name: Pawlik, Stefan
last_name: Pawlik
- first_name: Peter
full_name: Pietrzyk, Peter
last_name: Pietrzyk
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
citation:
ama: 'Keller M, Pawlik S, Pietrzyk P, Karl H. A Local Heuristic for Latency-Optimized
Distributed Cloud Deployment. In: Proceedings of the 6th International Conference
on Utility and Cloud Computing (UCC) Workshop on Distributed Cloud Computing.
; 2013:429-434. doi:10.1109/UCC.2013.85'
apa: Keller, M., Pawlik, S., Pietrzyk, P., & Karl, H. (2013). A Local Heuristic
for Latency-Optimized Distributed Cloud Deployment. In Proceedings of the 6th
International Conference on Utility and Cloud Computing (UCC) workshop on Distributed
cloud computing (pp. 429–434). https://doi.org/10.1109/UCC.2013.85
bibtex: '@inproceedings{Keller_Pawlik_Pietrzyk_Karl_2013, title={A Local Heuristic
for Latency-Optimized Distributed Cloud Deployment}, DOI={10.1109/UCC.2013.85},
booktitle={Proceedings of the 6th International Conference on Utility and Cloud
Computing (UCC) workshop on Distributed cloud computing}, author={Keller, Matthias
and Pawlik, Stefan and Pietrzyk, Peter and Karl, Holger}, year={2013}, pages={429–434}
}'
chicago: Keller, Matthias, Stefan Pawlik, Peter Pietrzyk, and Holger Karl. “A Local
Heuristic for Latency-Optimized Distributed Cloud Deployment.” In Proceedings
of the 6th International Conference on Utility and Cloud Computing (UCC) Workshop
on Distributed Cloud Computing, 429–34, 2013. https://doi.org/10.1109/UCC.2013.85.
ieee: M. Keller, S. Pawlik, P. Pietrzyk, and H. Karl, “A Local Heuristic for Latency-Optimized
Distributed Cloud Deployment,” in Proceedings of the 6th International Conference
on Utility and Cloud Computing (UCC) workshop on Distributed cloud computing,
2013, pp. 429–434.
mla: Keller, Matthias, et al. “A Local Heuristic for Latency-Optimized Distributed
Cloud Deployment.” Proceedings of the 6th International Conference on Utility
and Cloud Computing (UCC) Workshop on Distributed Cloud Computing, 2013, pp.
429–34, doi:10.1109/UCC.2013.85.
short: 'M. Keller, S. Pawlik, P. Pietrzyk, H. Karl, in: Proceedings of the 6th International
Conference on Utility and Cloud Computing (UCC) Workshop on Distributed Cloud
Computing, 2013, pp. 429–434.'
date_created: 2017-10-17T12:42:41Z
date_updated: 2022-01-06T07:02:11Z
ddc:
- '040'
department:
- _id: '75'
- _id: '63'
doi: 10.1109/UCC.2013.85
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T10:25:45Z
date_updated: 2018-03-15T10:25:45Z
file_id: '1279'
file_name: 562-dcc13_paper.pdf
file_size: 347873
relation: main_file
success: 1
file_date_updated: 2018-03-15T10:25:45Z
has_accepted_license: '1'
language:
- iso: eng
page: 429-434
project:
- _id: '1'
name: SFB 901
- _id: '6'
name: SFB 901 - Subprojekt A2
- _id: '5'
name: SFB 901 - Subproject A1
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the 6th International Conference on Utility and Cloud
Computing (UCC) workshop on Distributed cloud computing
status: public
title: A Local Heuristic for Latency-Optimized Distributed Cloud Deployment
type: conference
user_id: '477'
year: '2013'
...
---
_id: '584'
author:
- first_name: Till
full_name: Hohenberger, Till
last_name: Hohenberger
citation:
ama: Hohenberger T. Queuing Latency at Cooperative Base Stations. Universität
Paderborn; 2012.
apa: Hohenberger, T. (2012). Queuing Latency at Cooperative Base Stations.
Universität Paderborn.
bibtex: '@book{Hohenberger_2012, title={Queuing Latency at Cooperative Base Stations},
publisher={Universität Paderborn}, author={Hohenberger, Till}, year={2012} }'
chicago: Hohenberger, Till. Queuing Latency at Cooperative Base Stations.
Universität Paderborn, 2012.
ieee: T. Hohenberger, Queuing Latency at Cooperative Base Stations. Universität
Paderborn, 2012.
mla: Hohenberger, Till. Queuing Latency at Cooperative Base Stations. Universität
Paderborn, 2012.
short: T. Hohenberger, Queuing Latency at Cooperative Base Stations, Universität
Paderborn, 2012.
date_created: 2017-10-17T12:42:46Z
date_updated: 2022-01-06T07:02:43Z
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: Queuing Latency at Cooperative Base Stations
type: bachelorsthesis
user_id: '15504'
year: '2012'
...
---
_id: '593'
author:
- first_name: Tobias
full_name: Rojahn, Tobias
last_name: Rojahn
citation:
ama: Rojahn T. Optimale Zuteilung von Nutzern zu verteilten Cloud-Standorten.
Universität Paderborn; 2012.
apa: Rojahn, T. (2012). Optimale Zuteilung von Nutzern zu verteilten Cloud-Standorten.
Universität Paderborn.
bibtex: '@book{Rojahn_2012, title={Optimale Zuteilung von Nutzern zu verteilten
Cloud-Standorten}, publisher={Universität Paderborn}, author={Rojahn, Tobias},
year={2012} }'
chicago: Rojahn, Tobias. Optimale Zuteilung von Nutzern zu verteilten Cloud-Standorten.
Universität Paderborn, 2012.
ieee: T. Rojahn, Optimale Zuteilung von Nutzern zu verteilten Cloud-Standorten.
Universität Paderborn, 2012.
mla: Rojahn, Tobias. Optimale Zuteilung von Nutzern zu verteilten Cloud-Standorten.
Universität Paderborn, 2012.
short: T. Rojahn, Optimale Zuteilung von Nutzern zu verteilten Cloud-Standorten,
Universität Paderborn, 2012.
date_created: 2017-10-17T12:42:47Z
date_updated: 2022-01-06T07:02:47Z
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: Optimale Zuteilung von Nutzern zu verteilten Cloud-Standorten
type: bachelorsthesis
user_id: '477'
year: '2012'
...
---
_id: '603'
abstract:
- lang: eng
text: 'Preemptive Routing and Wavelength Assignment (RWA) algorithms preempt established
lightpaths in case not enough resources are available to setup 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 by the RWA algorithm. Otherwise
it might happen that by preempting a particular lightpath these requirements are
violated. If, however, these requirements include parameters only known at the
nodes running the application, the RWA algorithm cannot evaluate the requirements.
For this reason a RWA algorithm is needed which involves its users in the preemption
decisions. We present a family of preemptive RWA algorithms for WDM networks.
These algorithms have two distinguishing features: a) they can handle dynamic
traffic by on-the-fly reconfiguration, and b) users can give feedback for reconfiguration
decisions and thus influence the preemption decision of the RWA algorithm, leading
to networks which adapt directly to application needs. This is different from
traffic engineering where the network is (slowly) adapted to observed traffic patterns.
Our algorithms handle various WDM network configurations including networks consisting
of heterogeneous WDM hardware. To this end, we are using the layered graph approach
together with a newly developed graph model that is used to determine conflicting
lightpaths.'
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. Introducing Feedback to Preemptive Routing and Wavelength
Assignment Algorithms for Dynamic Traffic Scenarios. Universität Paderborn;
2012.
apa: Wette, P., & Karl, H. (2012). Introducing feedback to preemptive routing
and wavelength assignment algorithms for dynamic traffic scenarios. Universität
Paderborn.
bibtex: '@book{Wette_Karl_2012, title={Introducing feedback to preemptive routing
and wavelength assignment algorithms for dynamic traffic scenarios}, publisher={Universität
Paderborn}, author={Wette, Philip and Karl, Holger}, year={2012} }'
chicago: Wette, Philip, and Holger Karl. Introducing Feedback to Preemptive Routing
and Wavelength Assignment Algorithms for Dynamic Traffic Scenarios. Universität
Paderborn, 2012.
ieee: P. Wette and H. Karl, Introducing feedback to preemptive routing and wavelength
assignment algorithms for dynamic traffic scenarios. Universität Paderborn,
2012.
mla: Wette, Philip, and Holger Karl. Introducing Feedback to Preemptive Routing
and Wavelength Assignment Algorithms for Dynamic Traffic Scenarios. Universität
Paderborn, 2012.
short: P. Wette, H. Karl, Introducing Feedback to Preemptive Routing and Wavelength
Assignment Algorithms for Dynamic Traffic Scenarios, Universität Paderborn, 2012.
date_created: 2017-10-17T12:42:49Z
date_updated: 2022-01-06T07:02:51Z
ddc:
- '000'
department:
- _id: '75'
file:
- access_level: closed
content_type: application/pdf
creator: hkarl
date_created: 2018-03-09T09:57:26Z
date_updated: 2018-03-09T09:57:26Z
file_id: '1205'
file_name: underlayMod2.pdf
file_size: 717326
relation: main_file
success: 1
file_date_updated: 2018-03-09T09:57:26Z
has_accepted_license: '1'
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: Introducing feedback to preemptive routing and wavelength assignment algorithms
for dynamic traffic scenarios
type: report
user_id: '126'
year: '2012'
...
---
_id: '660'
author:
- first_name: Manuel
full_name: Peuster, Manuel
id: '13271'
last_name: Peuster
citation:
ama: Peuster M. Defining and Deploying Complex Applicances in Multi-Site Cloud
Environments. Universität Paderborn; 2011.
apa: Peuster, M. (2011). Defining and Deploying Complex Applicances in Multi-Site
Cloud Environments. Universität Paderborn.
bibtex: '@book{Peuster_2011, title={Defining and Deploying Complex Applicances in
Multi-Site Cloud Environments}, publisher={Universität Paderborn}, author={Peuster,
Manuel}, year={2011} }'
chicago: Peuster, Manuel. Defining and Deploying Complex Applicances in Multi-Site
Cloud Environments. Universität Paderborn, 2011.
ieee: M. Peuster, Defining and Deploying Complex Applicances in Multi-Site Cloud
Environments. Universität Paderborn, 2011.
mla: Peuster, Manuel. Defining and Deploying Complex Applicances in Multi-Site
Cloud Environments. Universität Paderborn, 2011.
short: M. Peuster, Defining and Deploying Complex Applicances in Multi-Site Cloud
Environments, Universität Paderborn, 2011.
date_created: 2017-10-17T12:43:00Z
date_updated: 2022-01-06T07:03:13Z
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: Defining and Deploying Complex Applicances in Multi-Site Cloud Environments
type: bachelorsthesis
user_id: '15504'
year: '2011'
...