---
_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: '769'
author:
- first_name: Thorsten
full_name: Biermann, Thorsten
last_name: Biermann
- first_name: Luca
full_name: Scalia, Luca
last_name: Scalia
- first_name: Changsoon
full_name: Choi, Changsoon
last_name: Choi
- first_name: Wolfgang
full_name: Kellerer, Wolfgang
last_name: Kellerer
- first_name: Holger
full_name: Karl, Holger
last_name: Karl
citation:
ama: Biermann T, Scalia L, Choi C, Kellerer W, Karl H. How backhaul networks influence
the feasibility of coordinated multipoint in cellular networks. {IEEE} Communications
Magazine. 2013;(8). doi:10.1109/MCOM.2013.6576356
apa: Biermann, T., Scalia, L., Choi, C., Kellerer, W., & Karl, H. (2013). How
backhaul networks influence the feasibility of coordinated multipoint in cellular
networks. {IEEE} Communications Magazine, (8). https://doi.org/10.1109/MCOM.2013.6576356
bibtex: '@article{Biermann_Scalia_Choi_Kellerer_Karl_2013, title={How backhaul networks
influence the feasibility of coordinated multipoint in cellular networks}, DOI={10.1109/MCOM.2013.6576356},
number={8}, journal={{IEEE} Communications Magazine}, author={Biermann, Thorsten
and Scalia, Luca and Choi, Changsoon and Kellerer, Wolfgang and Karl, Holger},
year={2013} }'
chicago: Biermann, Thorsten, Luca Scalia, Changsoon Choi, Wolfgang Kellerer, and
Holger Karl. “How Backhaul Networks Influence the Feasibility of Coordinated Multipoint
in Cellular Networks.” {IEEE} Communications Magazine, no. 8 (2013). https://doi.org/10.1109/MCOM.2013.6576356.
ieee: T. Biermann, L. Scalia, C. Choi, W. Kellerer, and H. Karl, “How backhaul networks
influence the feasibility of coordinated multipoint in cellular networks,” {IEEE}
Communications Magazine, no. 8, 2013.
mla: Biermann, Thorsten, et al. “How Backhaul Networks Influence the Feasibility
of Coordinated Multipoint in Cellular Networks.” {IEEE} Communications Magazine,
no. 8, 2013, doi:10.1109/MCOM.2013.6576356.
short: T. Biermann, L. Scalia, C. Choi, W. Kellerer, H. Karl, {IEEE} Communications
Magazine (2013).
date_created: 2017-11-27T10:22:26Z
date_updated: 2022-01-06T07:03:44Z
department:
- _id: '75'
doi: 10.1109/MCOM.2013.6576356
issue: '8'
publication: '{IEEE} Communications Magazine'
status: public
title: How backhaul networks influence the feasibility of coordinated multipoint in
cellular networks
type: journal_article
user_id: '15572'
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: '2504'
author:
- first_name: Rana Azeem M.
full_name: Khan, Rana Azeem M.
last_name: Khan
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
citation:
ama: Khan RAM, Karl H. Simulating Cooperative Diversity Protocols for Multi-Hop
Wireless and Sensor Networks.; 2012.
apa: Khan, R. A. M., & Karl, H. (2012). Simulating Cooperative Diversity
Protocols for Multi-hop Wireless and Sensor Networks.
bibtex: '@book{Khan_Karl_2012, title={Simulating Cooperative Diversity Protocols
for Multi-hop Wireless and Sensor Networks}, author={Khan, Rana Azeem M. and Karl,
Holger}, year={2012} }'
chicago: Khan, Rana Azeem M., and Holger Karl. Simulating Cooperative Diversity
Protocols for Multi-Hop Wireless and Sensor Networks, 2012.
ieee: R. A. M. Khan and H. Karl, Simulating Cooperative Diversity Protocols for
Multi-hop Wireless and Sensor Networks. 2012.
mla: Khan, Rana Azeem M., and Holger Karl. Simulating Cooperative Diversity Protocols
for Multi-Hop Wireless and Sensor Networks. 2012.
short: R.A.M. Khan, H. Karl, Simulating Cooperative Diversity Protocols for Multi-Hop
Wireless and Sensor Networks, 2012.
date_created: 2018-04-26T10:33:57Z
date_updated: 2022-01-06T06:56:44Z
department:
- _id: '75'
main_file_link:
- url: https://pdfs.semanticscholar.org/d44f/54184aee09de1c22906b7515976de801d473.pdf
status: public
title: Simulating Cooperative Diversity Protocols for Multi-hop Wireless and Sensor
Networks
type: report
user_id: '15572'
year: '2012'
...
---
_id: '2505'
author:
- first_name: Christian
full_name: Dannewitz, Christian
last_name: Dannewitz
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
- first_name: Aditya
full_name: Yadav, Aditya
last_name: Yadav
citation:
ama: Dannewitz C, Karl H, Yadav A. Report on Locality in DNS Requests – Evaluation
and Impact on Future Internet Architectures.; 2012.
apa: Dannewitz, C., Karl, H., & Yadav, A. (2012). Report on Locality in DNS
Requests – Evaluation and Impact on Future Internet Architectures.
bibtex: '@book{Dannewitz_Karl_Yadav_2012, title={Report on Locality in DNS Requests
– Evaluation and Impact on Future Internet Architectures}, author={Dannewitz,
Christian and Karl, Holger and Yadav, Aditya}, year={2012} }'
chicago: Dannewitz, Christian, Holger Karl, and Aditya Yadav. Report on Locality
in DNS Requests – Evaluation and Impact on Future Internet Architectures,
2012.
ieee: C. Dannewitz, H. Karl, and A. Yadav, Report on Locality in DNS Requests
– Evaluation and Impact on Future Internet Architectures. 2012.
mla: Dannewitz, Christian, et al. Report on Locality in DNS Requests – Evaluation
and Impact on Future Internet Architectures. 2012.
short: C. Dannewitz, H. Karl, A. Yadav, Report on Locality in DNS Requests – Evaluation
and Impact on Future Internet Architectures, 2012.
date_created: 2018-04-26T10:38:06Z
date_updated: 2022-01-06T06:56:44Z
ddc:
- '000'
department:
- _id: '75'
file:
- access_level: closed
content_type: application/pdf
creator: tabu
date_created: 2018-04-26T10:37:47Z
date_updated: 2018-04-26T10:37:47Z
file_id: '2507'
file_name: Dannewitz-Report_on_Locality_in_DNS_Requests.pdf
file_size: 284669
relation: main_file
success: 1
file_date_updated: 2018-04-26T10:37:47Z
has_accepted_license: '1'
status: public
title: Report on Locality in DNS Requests – Evaluation and Impact on Future Internet
Architectures
type: report
user_id: '15572'
year: '2012'
...
---
_id: '1805'
author:
- first_name: T.
full_name: Biermann, T.
last_name: Biermann
- first_name: L.
full_name: Scalia, L.
last_name: Scalia
citation:
ama: 'Biermann T, Scalia L. Mobile WDM Backhaul Access Networks with Physical Inter-Base-Station
Links for Coordinated Multipoint Transmission/Reception Systems. In: 2011 IEEE
Global Telecommunications Conference - GLOBECOM 2011. IEEE; 2012. doi:10.1109/glocom.2011.6133510'
apa: Biermann, T., & Scalia, L. (2012). Mobile WDM Backhaul Access Networks
with Physical Inter-Base-Station Links for Coordinated Multipoint Transmission/Reception
Systems. In 2011 IEEE Global Telecommunications Conference - GLOBECOM 2011.
IEEE. https://doi.org/10.1109/glocom.2011.6133510
bibtex: '@inproceedings{Biermann_Scalia_2012, title={Mobile WDM Backhaul Access
Networks with Physical Inter-Base-Station Links for Coordinated Multipoint Transmission/Reception
Systems}, DOI={10.1109/glocom.2011.6133510},
booktitle={2011 IEEE Global Telecommunications Conference - GLOBECOM 2011}, publisher={IEEE},
author={Biermann, T. and Scalia, L.}, year={2012} }'
chicago: Biermann, T., and L. Scalia. “Mobile WDM Backhaul Access Networks with
Physical Inter-Base-Station Links for Coordinated Multipoint Transmission/Reception
Systems.” In 2011 IEEE Global Telecommunications Conference - GLOBECOM 2011.
IEEE, 2012. https://doi.org/10.1109/glocom.2011.6133510.
ieee: T. Biermann and L. Scalia, “Mobile WDM Backhaul Access Networks with Physical
Inter-Base-Station Links for Coordinated Multipoint Transmission/Reception Systems,”
in 2011 IEEE Global Telecommunications Conference - GLOBECOM 2011, 2012.
mla: Biermann, T., and L. Scalia. “Mobile WDM Backhaul Access Networks with Physical
Inter-Base-Station Links for Coordinated Multipoint Transmission/Reception Systems.”
2011 IEEE Global Telecommunications Conference - GLOBECOM 2011, IEEE, 2012,
doi:10.1109/glocom.2011.6133510.
short: 'T. Biermann, L. Scalia, in: 2011 IEEE Global Telecommunications Conference
- GLOBECOM 2011, IEEE, 2012.'
date_created: 2018-03-27T08:25:28Z
date_updated: 2022-01-06T06:53:25Z
department:
- _id: '75'
doi: 10.1109/glocom.2011.6133510
publication: 2011 IEEE Global Telecommunications Conference - GLOBECOM 2011
publication_identifier:
isbn:
- '9781424492688'
- '9781424492664'
- '9781424492671'
publication_status: published
publisher: IEEE
status: public
title: Mobile WDM Backhaul Access Networks with Physical Inter-Base-Station Links
for Coordinated Multipoint Transmission/Reception Systems
type: conference
user_id: '15572'
year: '2012'
...
---
_id: '1806'
author:
- first_name: Changsoon
full_name: Choi, Changsoon
last_name: Choi
- first_name: Luca
full_name: Scalia, Luca
last_name: Scalia
- first_name: Thorsten
full_name: Biermann, Thorsten
last_name: Biermann
- first_name: Shinj
full_name: Mizuta, Shinj
last_name: Mizuta
citation:
ama: 'Choi C, Scalia L, Biermann T, Mizuta S. Coordinated multipoint multiuser-MIMO
transmissions over backhaul-constrained mobile access networks. In: 2011 IEEE
22nd International Symposium on Personal, Indoor and Mobile Radio Communications.
IEEE; 2012. doi:10.1109/pimrc.2011.6139719'
apa: Choi, C., Scalia, L., Biermann, T., & Mizuta, S. (2012). Coordinated multipoint
multiuser-MIMO transmissions over backhaul-constrained mobile access networks.
In 2011 IEEE 22nd International Symposium on Personal, Indoor and Mobile Radio
Communications. IEEE. https://doi.org/10.1109/pimrc.2011.6139719
bibtex: '@inproceedings{Choi_Scalia_Biermann_Mizuta_2012, title={Coordinated multipoint
multiuser-MIMO transmissions over backhaul-constrained mobile access networks},
DOI={10.1109/pimrc.2011.6139719},
booktitle={2011 IEEE 22nd International Symposium on Personal, Indoor and Mobile
Radio Communications}, publisher={IEEE}, author={Choi, Changsoon and Scalia, Luca
and Biermann, Thorsten and Mizuta, Shinj}, year={2012} }'
chicago: Choi, Changsoon, Luca Scalia, Thorsten Biermann, and Shinj Mizuta. “Coordinated
Multipoint Multiuser-MIMO Transmissions over Backhaul-Constrained Mobile Access
Networks.” In 2011 IEEE 22nd International Symposium on Personal, Indoor and
Mobile Radio Communications. IEEE, 2012. https://doi.org/10.1109/pimrc.2011.6139719.
ieee: C. Choi, L. Scalia, T. Biermann, and S. Mizuta, “Coordinated multipoint multiuser-MIMO
transmissions over backhaul-constrained mobile access networks,” in 2011 IEEE
22nd International Symposium on Personal, Indoor and Mobile Radio Communications,
2012.
mla: Choi, Changsoon, et al. “Coordinated Multipoint Multiuser-MIMO Transmissions
over Backhaul-Constrained Mobile Access Networks.” 2011 IEEE 22nd International
Symposium on Personal, Indoor and Mobile Radio Communications, IEEE, 2012,
doi:10.1109/pimrc.2011.6139719.
short: 'C. Choi, L. Scalia, T. Biermann, S. Mizuta, in: 2011 IEEE 22nd International
Symposium on Personal, Indoor and Mobile Radio Communications, IEEE, 2012.'
date_created: 2018-03-27T08:28:08Z
date_updated: 2022-01-06T06:53:25Z
department:
- _id: '75'
doi: 10.1109/pimrc.2011.6139719
publication: 2011 IEEE 22nd International Symposium on Personal, Indoor and Mobile
Radio Communications
publication_identifier:
isbn:
- '9781457713484'
- '9781457713460'
- '9781457713477'
publication_status: published
publisher: IEEE
status: public
title: Coordinated multipoint multiuser-MIMO transmissions over backhaul-constrained
mobile access networks
type: conference
user_id: '15572'
year: '2012'
...
---
_id: '782'
author:
- first_name: Thorsten
full_name: Biermann, Thorsten
last_name: Biermann
- first_name: Luca
full_name: Scalia, Luca
last_name: Scalia
- first_name: Changsoon
full_name: Choi, Changsoon
last_name: Choi
- first_name: Holger
full_name: Karl, Holger
last_name: Karl
- first_name: Wolfgang
full_name: Kellerer, Wolfgang
last_name: Kellerer
citation:
ama: Biermann T, Scalia L, Choi C, Karl H, Kellerer W. CoMP clustering and backhaul
limitations in cooperative cellular mobile access networks. Pervasive and Mobile
Computing. 2012;(5):662--681. doi:10.1016/j.pmcj.2012.03.005
apa: Biermann, T., Scalia, L., Choi, C., Karl, H., & Kellerer, W. (2012). CoMP
clustering and backhaul limitations in cooperative cellular mobile access networks.
Pervasive and Mobile Computing, (5), 662--681. https://doi.org/10.1016/j.pmcj.2012.03.005
bibtex: '@article{Biermann_Scalia_Choi_Karl_Kellerer_2012, title={CoMP clustering
and backhaul limitations in cooperative cellular mobile access networks}, DOI={10.1016/j.pmcj.2012.03.005},
number={5}, journal={Pervasive and Mobile Computing}, author={Biermann, Thorsten
and Scalia, Luca and Choi, Changsoon and Karl, Holger and Kellerer, Wolfgang},
year={2012}, pages={662--681} }'
chicago: 'Biermann, Thorsten, Luca Scalia, Changsoon Choi, Holger Karl, and Wolfgang
Kellerer. “CoMP Clustering and Backhaul Limitations in Cooperative Cellular Mobile
Access Networks.” Pervasive and Mobile Computing, no. 5 (2012): 662--681.
https://doi.org/10.1016/j.pmcj.2012.03.005.'
ieee: T. Biermann, L. Scalia, C. Choi, H. Karl, and W. Kellerer, “CoMP clustering
and backhaul limitations in cooperative cellular mobile access networks,” Pervasive
and Mobile Computing, no. 5, pp. 662--681, 2012.
mla: Biermann, Thorsten, et al. “CoMP Clustering and Backhaul Limitations in Cooperative
Cellular Mobile Access Networks.” Pervasive and Mobile Computing, no. 5,
2012, pp. 662--681, doi:10.1016/j.pmcj.2012.03.005.
short: T. Biermann, L. Scalia, C. Choi, H. Karl, W. Kellerer, Pervasive and Mobile
Computing (2012) 662--681.
date_created: 2017-11-27T10:22:26Z
date_updated: 2022-01-06T07:03:46Z
department:
- _id: '75'
doi: 10.1016/j.pmcj.2012.03.005
issue: '5'
page: 662--681
publication: Pervasive and Mobile Computing
status: public
title: CoMP clustering and backhaul limitations in cooperative cellular mobile access
networks
type: journal_article
user_id: '15572'
year: '2012'
...
---
_id: '783'
author:
- first_name: Andreas
full_name: Willig, Andreas
last_name: Willig
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
- first_name: Danil
full_name: Kipnis, Danil
last_name: Kipnis
citation:
ama: 'Willig A, Karl H, Kipnis D. Segment-based packet combining: how to schedule
a dense relayer cluster? Wireless Networks. 2012;(2):199--213. doi:10.1007/s11276-011-0395-y'
apa: 'Willig, A., Karl, H., & Kipnis, D. (2012). Segment-based packet combining:
how to schedule a dense relayer cluster? Wireless Networks, (2), 199--213.
https://doi.org/10.1007/s11276-011-0395-y'
bibtex: '@article{Willig_Karl_Kipnis_2012, title={Segment-based packet combining:
how to schedule a dense relayer cluster?}, DOI={10.1007/s11276-011-0395-y},
number={2}, journal={Wireless Networks}, author={Willig, Andreas and Karl, Holger
and Kipnis, Danil}, year={2012}, pages={199--213} }'
chicago: 'Willig, Andreas, Holger Karl, and Danil Kipnis. “Segment-Based Packet
Combining: How to Schedule a Dense Relayer Cluster?” Wireless Networks,
no. 2 (2012): 199--213. https://doi.org/10.1007/s11276-011-0395-y.'
ieee: 'A. Willig, H. Karl, and D. Kipnis, “Segment-based packet combining: how to
schedule a dense relayer cluster?,” Wireless Networks, no. 2, pp. 199--213,
2012.'
mla: 'Willig, Andreas, et al. “Segment-Based Packet Combining: How to Schedule a
Dense Relayer Cluster?” Wireless Networks, no. 2, 2012, pp. 199--213, doi:10.1007/s11276-011-0395-y.'
short: A. Willig, H. Karl, D. Kipnis, Wireless Networks (2012) 199--213.
date_created: 2017-11-27T10:22:26Z
date_updated: 2022-01-06T07:03:46Z
department:
- _id: '75'
doi: 10.1007/s11276-011-0395-y
issue: '2'
page: 199--213
publication: Wireless Networks
status: public
title: 'Segment-based packet combining: how to schedule a dense relayer cluster?'
type: journal_article
user_id: '15572'
year: '2012'
...
---
_id: '784'
author:
- first_name: Matthias
full_name: Herlich, Matthias
last_name: Herlich
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
citation:
ama: 'Herlich M, Karl H. Average and competitive analysis of latency and power consumption
of a queuing system with a sleep mode. In: Proceedings of the 3rd International
Conference on Energy-Efficient Computing and Networking, e-Energy’12, Madrid,
Spain, May 9-11, 2012. ; 2012:14. doi:10.1145/2208828.2208842'
apa: Herlich, M., & Karl, H. (2012). Average and competitive analysis of latency
and power consumption of a queuing system with a sleep mode. In Proceedings
of the 3rd International Conference on Energy-Efficient Computing and Networking,
e-Energy’12, Madrid, Spain, May 9-11, 2012 (p. 14). https://doi.org/10.1145/2208828.2208842
bibtex: '@inproceedings{Herlich_Karl_2012, title={Average and competitive analysis
of latency and power consumption of a queuing system with a sleep mode}, DOI={10.1145/2208828.2208842}, booktitle={Proceedings
of the 3rd International Conference on Energy-Efficient Computing and Networking,
e-Energy’12, Madrid, Spain, May 9-11, 2012}, author={Herlich, Matthias and Karl,
Holger}, year={2012}, pages={14} }'
chicago: Herlich, Matthias, and Holger Karl. “Average and Competitive Analysis of
Latency and Power Consumption of a Queuing System with a Sleep Mode.” In Proceedings
of the 3rd International Conference on Energy-Efficient Computing and Networking,
e-Energy’12, Madrid, Spain, May 9-11, 2012, 14, 2012. https://doi.org/10.1145/2208828.2208842.
ieee: M. Herlich and H. Karl, “Average and competitive analysis of latency and power
consumption of a queuing system with a sleep mode,” in Proceedings of the 3rd
International Conference on Energy-Efficient Computing and Networking, e-Energy’12,
Madrid, Spain, May 9-11, 2012, 2012, p. 14.
mla: Herlich, Matthias, and Holger Karl. “Average and Competitive Analysis of Latency
and Power Consumption of a Queuing System with a Sleep Mode.” Proceedings of
the 3rd International Conference on Energy-Efficient Computing and Networking,
e-Energy’12, Madrid, Spain, May 9-11, 2012, 2012, p. 14, doi:10.1145/2208828.2208842.
short: 'M. Herlich, H. Karl, in: Proceedings of the 3rd International Conference
on Energy-Efficient Computing and Networking, e-Energy’12, Madrid, Spain, May
9-11, 2012, 2012, p. 14.'
date_created: 2017-11-27T10:22:26Z
date_updated: 2022-01-06T07:03:47Z
department:
- _id: '75'
doi: 10.1145/2208828.2208842
ec_funded: '1'
page: '14'
project:
- _id: '26'
call_identifier: FP7-ICT-2009-5
grant_number: '257448'
name: Scalable & Adaptive Internet soLutions
publication: Proceedings of the 3rd International Conference on Energy-Efficient Computing
and Networking, e-Energy'12, Madrid, Spain, May 9-11, 2012
status: public
title: Average and competitive analysis of latency and power consumption of a queuing
system with a sleep mode
type: conference
user_id: '15572'
year: '2012'
...
---
_id: '785'
author:
- first_name: Johannes
full_name: Blanckenstein, Johannes
last_name: Blanckenstein
- first_name: Jirka
full_name: Klaue, Jirka
last_name: Klaue
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
citation:
ama: 'Blanckenstein J, Klaue J, Karl H. Energy Efficient Clustering using a Wake-up
Receiver. In: European Wireless 2012 - 18th European Conference 2012, April
18-20, 2012, Poznan, Poland. ; 2012.'
apa: Blanckenstein, J., Klaue, J., & Karl, H. (2012). Energy Efficient Clustering
using a Wake-up Receiver. In European Wireless 2012 - 18th European Conference
2012, April 18-20, 2012, Poznan, Poland.
bibtex: '@inproceedings{Blanckenstein_Klaue_Karl_2012, title={Energy Efficient Clustering
using a Wake-up Receiver}, booktitle={European Wireless 2012 - 18th European Conference
2012, April 18-20, 2012, Poznan, Poland.}, author={Blanckenstein, Johannes and
Klaue, Jirka and Karl, Holger}, year={2012} }'
chicago: Blanckenstein, Johannes, Jirka Klaue, and Holger Karl. “Energy Efficient
Clustering Using a Wake-up Receiver.” In European Wireless 2012 - 18th European
Conference 2012, April 18-20, 2012, Poznan, Poland., 2012.
ieee: J. Blanckenstein, J. Klaue, and H. Karl, “Energy Efficient Clustering using
a Wake-up Receiver,” in European Wireless 2012 - 18th European Conference 2012,
April 18-20, 2012, Poznan, Poland., 2012.
mla: Blanckenstein, Johannes, et al. “Energy Efficient Clustering Using a Wake-up
Receiver.” European Wireless 2012 - 18th European Conference 2012, April 18-20,
2012, Poznan, Poland., 2012.
short: 'J. Blanckenstein, J. Klaue, H. Karl, in: European Wireless 2012 - 18th European
Conference 2012, April 18-20, 2012, Poznan, Poland., 2012.'
date_created: 2017-11-27T10:22:26Z
date_updated: 2022-01-06T07:03:47Z
department:
- _id: '75'
publication: European Wireless 2012 - 18th European Conference 2012, April 18-20,
2012, Poznan, Poland.
status: public
title: Energy Efficient Clustering using a Wake-up Receiver
type: conference
user_id: '15572'
year: '2012'
...
---
_id: '786'
author:
- first_name: Jörn
full_name: Künsemöller, Jörn
last_name: Künsemöller
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
citation:
ama: 'Künsemöller J, Karl H. On Local Separation of Processing and Storage in Infrastructure-as-a-Service.
In: Economics of Grids, Clouds, Systems, and Services - 9th International Conference,
GECON 2012, Berlin, Germany, November 27-28, 2012. Proceedings. ; 2012:125--138.
doi:10.1007/978-3-642-35194-5_10'
apa: Künsemöller, J., & Karl, H. (2012). On Local Separation of Processing and
Storage in Infrastructure-as-a-Service. In Economics of Grids, Clouds, Systems,
and Services - 9th International Conference, GECON 2012, Berlin, Germany, November
27-28, 2012. Proceedings (pp. 125--138). https://doi.org/10.1007/978-3-642-35194-5_10
bibtex: '@inproceedings{Künsemöller_Karl_2012, title={On Local Separation of Processing
and Storage in Infrastructure-as-a-Service}, DOI={10.1007/978-3-642-35194-5_10},
booktitle={Economics of Grids, Clouds, Systems, and Services - 9th International
Conference, GECON 2012, Berlin, Germany, November 27-28, 2012. Proceedings}, author={Künsemöller,
Jörn and Karl, Holger}, year={2012}, pages={125--138} }'
chicago: Künsemöller, Jörn, and Holger Karl. “On Local Separation of Processing
and Storage in Infrastructure-as-a-Service.” In Economics of Grids, Clouds,
Systems, and Services - 9th International Conference, GECON 2012, Berlin, Germany,
November 27-28, 2012. Proceedings, 125--138, 2012. https://doi.org/10.1007/978-3-642-35194-5_10.
ieee: J. Künsemöller and H. Karl, “On Local Separation of Processing and Storage
in Infrastructure-as-a-Service,” in Economics of Grids, Clouds, Systems, and
Services - 9th International Conference, GECON 2012, Berlin, Germany, November
27-28, 2012. Proceedings, 2012, pp. 125--138.
mla: Künsemöller, Jörn, and Holger Karl. “On Local Separation of Processing and
Storage in Infrastructure-as-a-Service.” Economics of Grids, Clouds, Systems,
and Services - 9th International Conference, GECON 2012, Berlin, Germany, November
27-28, 2012. Proceedings, 2012, pp. 125--138, doi:10.1007/978-3-642-35194-5_10.
short: 'J. Künsemöller, H. Karl, in: Economics of Grids, Clouds, Systems, and Services
- 9th International Conference, GECON 2012, Berlin, Germany, November 27-28, 2012.
Proceedings, 2012, pp. 125--138.'
date_created: 2017-11-27T10:22:26Z
date_updated: 2022-01-06T07:03:47Z
department:
- _id: '75'
doi: 10.1007/978-3-642-35194-5_10
page: 125--138
publication: Economics of Grids, Clouds, Systems, and Services - 9th International
Conference, GECON 2012, Berlin, Germany, November 27-28, 2012. Proceedings
status: public
title: On Local Separation of Processing and Storage in Infrastructure-as-a-Service
type: conference
user_id: '15572'
year: '2012'
...
---
_id: '787'
author:
- first_name: Martin
full_name: Dräxler, Martin
last_name: Dräxler
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
citation:
ama: 'Dräxler M, Karl H. Efficiency of On-Path and Off-Path Caching Strategies in
Information Centric Networks. In: 2012 IEEE International Conference on Green
Computing and Communications, Conference on Internet of Things, and Conference
on Cyber, Physical and Social Computing, GreenCom/IThings/CPSCom 2012, Besancon,
France, November 20-23, 2012. ; 2012:581--587. doi:10.1109/GreenCom.2012.82'
apa: Dräxler, M., & Karl, H. (2012). Efficiency of On-Path and Off-Path Caching
Strategies in Information Centric Networks. In 2012 IEEE International Conference
on Green Computing and Communications, Conference on Internet of Things, and Conference
on Cyber, Physical and Social Computing, GreenCom/iThings/CPSCom 2012, Besancon,
France, November 20-23, 2012 (pp. 581--587). https://doi.org/10.1109/GreenCom.2012.82
bibtex: '@inproceedings{Dräxler_Karl_2012, title={Efficiency of On-Path and Off-Path
Caching Strategies in Information Centric Networks}, DOI={10.1109/GreenCom.2012.82},
booktitle={2012 IEEE International Conference on Green Computing and Communications,
Conference on Internet of Things, and Conference on Cyber, Physical and Social
Computing, GreenCom/iThings/CPSCom 2012, Besancon, France, November 20-23, 2012},
author={Dräxler, Martin and Karl, Holger}, year={2012}, pages={581--587} }'
chicago: Dräxler, Martin, and Holger Karl. “Efficiency of On-Path and Off-Path Caching
Strategies in Information Centric Networks.” In 2012 IEEE International Conference
on Green Computing and Communications, Conference on Internet of Things, and Conference
on Cyber, Physical and Social Computing, GreenCom/IThings/CPSCom 2012, Besancon,
France, November 20-23, 2012, 581--587, 2012. https://doi.org/10.1109/GreenCom.2012.82.
ieee: M. Dräxler and H. Karl, “Efficiency of On-Path and Off-Path Caching Strategies
in Information Centric Networks,” in 2012 IEEE International Conference on
Green Computing and Communications, Conference on Internet of Things, and Conference
on Cyber, Physical and Social Computing, GreenCom/iThings/CPSCom 2012, Besancon,
France, November 20-23, 2012, 2012, pp. 581--587.
mla: Dräxler, Martin, and Holger Karl. “Efficiency of On-Path and Off-Path Caching
Strategies in Information Centric Networks.” 2012 IEEE International Conference
on Green Computing and Communications, Conference on Internet of Things, and Conference
on Cyber, Physical and Social Computing, GreenCom/IThings/CPSCom 2012, Besancon,
France, November 20-23, 2012, 2012, pp. 581--587, doi:10.1109/GreenCom.2012.82.
short: 'M. Dräxler, H. Karl, in: 2012 IEEE International Conference on Green Computing
and Communications, Conference on Internet of Things, and Conference on Cyber,
Physical and Social Computing, GreenCom/IThings/CPSCom 2012, Besancon, France,
November 20-23, 2012, 2012, pp. 581--587.'
date_created: 2017-11-27T10:22:26Z
date_updated: 2022-01-06T07:03:47Z
department:
- _id: '75'
doi: 10.1109/GreenCom.2012.82
page: 581--587
publication: 2012 IEEE International Conference on Green Computing and Communications,
Conference on Internet of Things, and Conference on Cyber, Physical and Social Computing,
GreenCom/iThings/CPSCom 2012, Besancon, France, November 20-23, 2012
status: public
title: Efficiency of On-Path and Off-Path Caching Strategies in Information Centric
Networks
type: conference
user_id: '15572'
year: '2012'
...
---
_id: '788'
author:
- first_name: Christian
full_name: Dannewitz, Christian
last_name: Dannewitz
- first_name: Matthias
full_name: Herlich, Matthias
last_name: Herlich
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
citation:
ama: 'Dannewitz C, Herlich M, Karl H. OpenNetInf - prototyping an information-centric
Network Architecture. In: 37th Annual IEEE Conference on Local Computer Networks,
Workshop Proceedings, Clearwater Beach, FL, USA, October 22-25, 2012. ; 2012:1061--1069.
doi:10.1109/LCNW.2012.6424044'
apa: Dannewitz, C., Herlich, M., & Karl, H. (2012). OpenNetInf - prototyping
an information-centric Network Architecture. In 37th Annual IEEE Conference
on Local Computer Networks, Workshop Proceedings, Clearwater Beach, FL, USA, October
22-25, 2012 (pp. 1061--1069). https://doi.org/10.1109/LCNW.2012.6424044
bibtex: '@inproceedings{Dannewitz_Herlich_Karl_2012, title={OpenNetInf - prototyping
an information-centric Network Architecture}, DOI={10.1109/LCNW.2012.6424044},
booktitle={37th Annual IEEE Conference on Local Computer Networks, Workshop Proceedings,
Clearwater Beach, FL, USA, October 22-25, 2012}, author={Dannewitz, Christian
and Herlich, Matthias and Karl, Holger}, year={2012}, pages={1061--1069} }'
chicago: Dannewitz, Christian, Matthias Herlich, and Holger Karl. “OpenNetInf -
Prototyping an Information-Centric Network Architecture.” In 37th Annual IEEE
Conference on Local Computer Networks, Workshop Proceedings, Clearwater Beach,
FL, USA, October 22-25, 2012, 1061--1069, 2012. https://doi.org/10.1109/LCNW.2012.6424044.
ieee: C. Dannewitz, M. Herlich, and H. Karl, “OpenNetInf - prototyping an information-centric
Network Architecture,” in 37th Annual IEEE Conference on Local Computer Networks,
Workshop Proceedings, Clearwater Beach, FL, USA, October 22-25, 2012, 2012,
pp. 1061--1069.
mla: Dannewitz, Christian, et al. “OpenNetInf - Prototyping an Information-Centric
Network Architecture.” 37th Annual IEEE Conference on Local Computer Networks,
Workshop Proceedings, Clearwater Beach, FL, USA, October 22-25, 2012, 2012,
pp. 1061--1069, doi:10.1109/LCNW.2012.6424044.
short: 'C. Dannewitz, M. Herlich, H. Karl, in: 37th Annual IEEE Conference on Local
Computer Networks, Workshop Proceedings, Clearwater Beach, FL, USA, October 22-25,
2012, 2012, pp. 1061--1069.'
date_created: 2017-11-27T10:22:26Z
date_updated: 2022-01-06T07:03:47Z
department:
- _id: '75'
doi: 10.1109/LCNW.2012.6424044
page: 1061--1069
publication: 37th Annual IEEE Conference on Local Computer Networks, Workshop Proceedings,
Clearwater Beach, FL, USA, October 22-25, 2012
status: public
title: OpenNetInf - prototyping an information-centric Network Architecture
type: conference
user_id: '15572'
year: '2012'
...