Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Gregor Schaffrath

dblp:49/2275 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
0since 2021 · last 2014
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 2 · 1 first-authorTheory of computation · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 33% Cloud and datacenter computing · 33% Parallel and multicore computing · 33%
Computer networks
1 paper
Internet architecture and protocols · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Parallel and multicore computing
competitive analysis
0.212014
The Wide-Area Virtual Service Migration Problem: A Competitive Analysis Approach · IEEE/ACM Trans. Netw. 2014
Cloud and datacenter computing
online algorithms
0.212014
The Wide-Area Virtual Service Migration Problem: A Competitive Analysis Approach · IEEE/ACM Trans. Netw. 2014
Distributed systems › service-oriented architecture › service management
service migration
0.212014
The Wide-Area Virtual Service Migration Problem: A Competitive Analysis Approach · IEEE/ACM Trans. Netw. 2014
Internet architecture and protocols
quality of service
0.112014
The Wide-Area Virtual Service Migration Problem: A Competitive Analysis Approach · IEEE/ACM Trans. Netw. 2014

Methods — techniques the papers use, named apart from their topics

simulation · 0.4online algorithm · 0.4competitive analysis · 0.4
YearPublicationVenuePosition
2014 The Wide-Area Virtual Service Migration Problem: A Competitive Analysis Approach
abstract
Today's trend toward network virtualization and software-defined networking enables flexible new distributed systems where resources can be dynamically allocated and migrated to locations where they are most useful. This paper proposes a competitive analysis approach to design and reason about online algorithms that find a good tradeoff between the benefits and costs of a migratable service. A competitive online algorithm provides worst-case performance guarantees under any demand dynamics, and without any information or statistical assumptions on the demand in the future. This is attractive especially in scenarios where the demand is hard to predict and can be subject to unexpected events. As a case study, we describe a service (e.g., an SAP server or a gaming application) that uses network virtualization to improve the quality of service (QoS) experienced by thin client applications running on mobile devices. By decoupling the service from the underlying resource infrastructure, it can be migrated closer to the current client locations while taking into account migration costs. We identify the major cost factors in such a system and formalize the wide-area service migration problem. Our main contributions are a randomized and a deterministic online algorithm that achieve a competitive ratio of O(logn) in a simplified scenario, where n is the size of the substrate network. This is almost optimal. We complement our worst-case analysis with simulations in different specific scenarios and also sketch a migration demonstrator.
Marcin Bienkowski, Anja Feldmann, Johannes Grassler, Gregor Schaffrath, Stefan Schmid 0001
IEEE/ACM Trans. Netw.4
2013 Competitive and deterministic embeddings of virtual networks
Guy Even, Moti Medina, Gregor Schaffrath, Stefan Schmid 0001
Theor. Comput. Sci.3
2012 A Resource Description Language with Vagueness Support for Multi-Provider Cloud Networks
abstract
The concept of CloudNets, virtual networks connecting cloud resources, has recently attracted much interest from both academic as well as business sides. CloudNets can realize the vision of affordable customized infrastructures. In particular, such networks are expected to be offered even in federated environments with multiple providers. Inter-provider communication about requirements or provisioning of truly customized virtual environments however require a powerful flexible resource description language (RDL). While extensibility and expressiveness seem to be natural requirements for such a language, we identify another less intuitive requirement affecting all actors (or stakeholders) in their economic benefits: the possibility to omit arbitrary specification details and to remainvaguewhile at the same time describing real world scenarios. Not only may a description language ignoring this constraint easily become too bulky to use, it is also likely to force players to focus on details they are not interested in or lack the knowledge to map their actual requirements to. This paper identifies detailed requirements for an RDL to allow for topology and requirement communication in business scenarios. Furthermore, we present the FleRD flexible resource description language for multi-provider virtual network architectures. FleRD is fully incorporated in our own CloudNet prototype architecture.
Gregor Schaffrath, Stefan Schmid 0001, Ishan Vaishnavi, Ashiq Khan, Anja Feldmann
ICCCN1