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

Tobias Poschwatta

dblp:70/3937 · DBLP profile ↗
← Back
6ranked-venue papers
0as first author
0since 2021 · last 2008
—ORCID · none

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

Computer networks · 5

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 networks
3 papers
Network optimization and economics · 72% Transport protocols and congestion control · 23% Content delivery and video streaming · 5%

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

TopicWeightPapersLastEvidence papers
Transport protocols and congestion control › real-time communication
real-time traffic
0.122006
Utility fair congestion control for real-time traffic · INFOCOM 2005
Utility Fair Congestion Control for Real-Time Traffic · INFOCOM 2006
Network optimization and economics
pricing
0.112005
Priority Pricing in Utility Fair Networks · ICNP 2005
Network optimization and economics › pricing › differential pricing
priority pricing
0.112005
Priority Pricing in Utility Fair Networks · ICNP 2005
Network optimization and economics
resource allocation
0.112005
Priority Pricing in Utility Fair Networks · ICNP 2005
Network optimization and economics › fairness
utility fairness
0.112005
Priority Pricing in Utility Fair Networks · ICNP 2005
Content delivery and video streaming
adaptive video streaming
0.012005
Priority Pricing in Utility Fair Networks · ICNP 2005

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

utility function · 0.1optimal control · 0.1ns simulation · 0.1model predictive control · 0.1
YearPublicationVenuePosition
2008 Congestion control in utility fair networks
Tobias Harks, Tobias Poschwatta
Comput. Networks2
2006 On user strategies in a network implementing congestion pricing
abstract
In the context of a network implementing congestion pricing, we focus on user strategies to determine their willingness to pay parameter. We argue that users downloading a file in fixed time, or users running a multimedia application will have other strategies to decide on their payment than simply to maximize their surplus measured by a concave utility function minus cost. Instead, we formulate the download task as an optimal control problem and account for dynamic changes of the state of congestion by using (online) model predictive control techniques. Finally, we develop online control strategies in order to automatically adapt the willingness to pay parameter.
Tobias Harks, Tobias Poschwatta
CCNC2
2006 Utility Fair Congestion Control for Real-Time Traffic
Tobias Harks, Tobias Poschwatta
INFOCOM2
2005 Priority Pricing in Utility Fair Networks
abstract
This paper deals with a new pricing approach in utility fair networks, where the user's application is associated with a utility function. We allow users to have concave as well as non-concave utility functions. Bandwidth is allocated such that utility values of applications are shared fairly. In this work, we derive a fairness measure for utility functions that takes their specific shape into account. Based on this fairness measure, we present a simple pricing mechanism: the user announces his utility function and the network charges in accordance with the fairness measure. Then, we apply our pricing mechanism to a content provider's network. In our model customers want to scale their utilities to achieve their goals (e.g. file download, multimedia streaming) in a cost optimal way. In this regard, we formulate a download problem with predefined, deadline as an optimal control problem and account for dynamic changes of the state of congestion by using (online) model predictive control techniques. Finally, we develop online control strategies and implement them in a user agent (UA) that automatically scales the utilities.
Tobias Harks, Tobias Poschwatta
ICNP2
2005 Utility fair congestion control for real-time traffic
abstract
This paper deals with a new approach to integrate congestion control for real-time applications and elastic traffic into a unified framework. In our previous work, we proposed a new fairness criterion, utility proportional fairness, that takes characteristics of real-time applications into account. We complement this framework by deriving a general method to generate utility functions for layered multimedia applications. Finally, we demonstrate our approach through ns-simulations.
Tobias Harks, Tobias Poschwatta
INFOCOM2
2005 Analysis and performance evaluation of the EFCM common congestion controller for TCP connections
Michael Savoric, Holger Karl, Morten Schläger, Tobias Poschwatta, Adam Wolisz
Comput. Networks4