default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGerhard Haßlinger
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j17]Gerhard Hasslinger, Mahshid Okhovatzadeh, Konstantinos Ntougias, Frank Hasslinger, Oliver Hohlfeld:
An overview of analysis methods and evaluation results for caching strategies. Comput. Networks 228: 109583 (2023)- [j16]Gerhard Hasslinger, Konstantinos Ntougias, Frank Hasslinger, Oliver Hohlfeld:
Scope and Accuracy of Analytic and Approximate Results for FIFO, Clock-Based and LRU Caching Performance. Future Internet 15(3): 91 (2023) - [i2]Gerhard Hasslinger, Mahshid Okhovatzadeh, Konstantinos Ntougias, Frank Hasslinger, Oliver Hohlfeld:
An Overview of Analysis Methods and Evaluation Results for Caching Strategies. CoRR abs/2308.02875 (2023) - 2022
- [j15]Konstantinos Ntougias, Constantinos B. Papadias, Georgios K. Papageorgiou
, Gerhard Hasslinger, Troels B. Sorensen:
Coordinated Caching and QoS-Aware Resource Allocation for Spectrum Sharing. Wirel. Pers. Commun. 126(1): 49-79 (2022) - [c39]Gerhard Hasslinger, Konstantinos Ntougias, Frank Hasslinger, Oliver Hohlfeld:
Analysis of the LRU Cache StartUp Phase and Convergence Time and Error Bounds on Approximations by Fagin and Che. WiOpt 2022: 254-261 - 2020
- [c38]Gerhard Hasslinger, Konstantinos Ntougias, Frank Hasslinger, Oliver Hohlfeld:
General Knapsack Bounds of Web Caching Performance Regarding the Properties of each Cacheable Object. Networking 2020: 821-826
2010 – 2019
- 2019
- [c37]Gerhard Hasslinger, Konstantinos Ntougias, Frank Hasslinger, Oliver Hohlfeld:
Fast and Efficient Web Caching Methods Regarding the Size and Performance Measures per Data Object. CAMAD 2019: 1-7 - [c36]Konstantinos Ntougias, Constantinos B. Papadias, Georgios K. Papageorgiou, Gerhard Hasslinger:
Spectral Coexistence of 5G Networks and Satellite Communication Systems Enabled by Coordinated Caching and QoS-Aware Resource Allocation. EUSIPCO 2019: 1-5 - 2018
- [c35]Gerhard Hasslinger, Konstantinos Ntougias, Frank Hasslinger, Oliver Hohlfeld:
Comparing Web Cache Implementations for Fast O(1) Updates Based on LRU, LFU and Score Gated Strategies. CAMAD 2018: 1-7 - [c34]Gerhard Hasslinger:
Markov Analysis of Optimum Caching as an Equivalent Alternative to Belady's Algorithm Without Look-Ahead. MMB 2018: 35-52 - [c33]Gerhard Hasslinger, Juho Heikkinen, Konstantinos Ntougias, Frank Hasslinger, Oliver Hohlfeld:
Optimum caching versus LRU and LFU: Comparison and combined limited look-ahead strategies. WiOpt 2018: 1-6 - [p2]Wojciech Burakowski, Andrzej Beben, Hans van den Berg, Joost W. Bosman, Gerhard Hasslinger, Attila Kertész, Steven Latré, Rob van der Mei, Tamas Pflanzner, Patrick Gwydion Poullie, Maciej Sosnowski, Bart Spinnewyn, Burkhard Stiller:
Traffic Management for Cloud Federation. Autonomous Control for a Reliable Internet of Services 2018: 269-312 - 2017
- [j14]Gerhard Hasslinger, Konstantinos Ntougias, Frank Hasslinger, Oliver Hohlfeld:
Performance evaluation for new web caching strategies combining LRU with score based object selection. Comput. Networks 125: 172-186 (2017) - [c32]Gerhard Hasslinger, Mahmoud Kunbaz, Frank Hasslinger, Thomas Bauschert:
Web caching evaluation from Wikipedia request statistics. WiOpt 2017: 1-6 - 2016
- [c31]Gerhard Hasslinger, Konstantinos Ntougias, Frank Hasslinger:
Performance and Precision of Web Caching Simulations Including a Random Generator for Zipf Request Pattern. MMB/DFT 2016: 60-76 - [c30]Gerhard Hasslinger, Konstantinos Ntougias, Frank Hasslinger, Oliver Hohlfeld:
Performance Evaluation for New Web Caching Strategies Combining LRU with Score Based Object Selection. ITC 2016: 322-330 - 2014
- [c29]Gerhard Hasslinger, Konstantinos Ntougias:
Evaluation of Caching Strategies Based on Access Statistics of Past Requests. MMB/DFT 2014: 120-135 - 2013
- [c28]Gerhard Haßlinger, Anne Schwahn, Franz Hartleb:
2-State (semi-)Markov processes beyond Gilbert-Elliott: Traffic and channel models based on 2nd order statistics. INFOCOM 2013: 1438-1446 - 2011
- [j13]Gerhard Haßlinger, Franz Hartleb:
Content delivery and caching from a network provider's perspective. Comput. Networks 55(18): 3991-4006 (2011) - [j12]Gerhard Haßlinger, Giorgio Nunzi, Catalin Meirosu, Changpeng Fan, Frank-Uwe Andersen:
Traffic engineering supported by Inherent Network Management: analysis of resource efficiency and cost saving potential. Int. J. Netw. Manag. 21(1): 45-64 (2011) - [c27]Gerhard Haßlinger:
Flexible Traffic Engineering in Full Mesh Networks: Analysis of the Gain in Throughput and Cost Savings. ASMTA 2011: 234-248 - [c26]Gerhard Haßlinger, Oliver Hohlfeld:
Analysis of random and burst error codes in 2-state Markov channels. TSP 2011: 178-184 - 2010
- [j11]Gerhard Haßlinger, Franz Hartleb:
Internet-Verkehr: Plattformen zur Datenverteilung, Zugriffsstatistiken und Optimierung von Transportpfaden. Prax. Inf.verarb. Kommun. 33(2): 85-95 (2010) - [c25]Gerhard Haßlinger, Giorgio Nunzi, Catalin Meirosu, Changpeng Fan, Frank-Uwe Andersen:
Inherent Network Management: Support for Traffic Engineering and CAPEX Analysis in Future Internet Scenarios. EUROMICRO-SEAA 2010: 219-226 - [c24]Gerhard Haßlinger, Oliver Hohlfeld:
Efficiency of caches for content distribution on the Internet. ITC 2010: 1-8
2000 – 2009
- 2009
- [c23]Gerhard Haßlinger, Thomas Kunz:
Challenges for Routing and Search in Dynamic and Self-organizing Networks. ADHOC-NOW 2009: 42-54 - [c22]Gerhard Haßlinger, Franz Hartleb, Thomas Beckhaus:
User Access to Popular Data on the Internet and Approaches for IP Traffic Flow Optimization. ASMTA 2009: 42-55 - 2008
- [j10]Gerhard Haßlinger, Sebastian Kempken:
Applying random walks in structured and self-organizing networks: Evaluation by transient analysis. Prax. Inf.verarb. Kommun. 31(1): 17-23 (2008) - [j9]Sebastian Kempken, Gerhard Haßlinger, Wolfram Luther:
Parameter estimation and optimization techniques for discrete-time semi-Markov models of H.264/AVC video traffic. Telecommun. Syst. 39(2): 77-90 (2008) - [c21]Gerhard Haßlinger, Thomas Kunz:
Efficiency of Search Methods in Dynamic Wireless Networks. EuroNGI Workshop 2008: 142-156 - [c20]Oliver Hohlfeld, Rüdiger Geib, Gerhard Haßlinger:
Packet Loss in Real-Time Services: Markovian Models Generating QoE Impairments. IWQoS 2008: 239-248 - [c19]Gerhard Haßlinger, Oliver Hohlfeld:
The Gilbert-Elliott Model for Packet Loss in Real Time Services on the Internet. MMB 2008: 269-286 - [c18]Gerhard Haßlinger:
Cross-Layer Aspects of Peer-to-Peer Overlays on IP Platforms of Network Providers. Peer-to-Peer Computing 2008: 173-176 - 2007
- [j8]Halldór Matthías Sigurðsson, Ulfur Ron Halldorsson, Gerhard Haßlinger:
Potentials and challenges of peer-to-peer based content distribution. Telematics Informatics 24(4): 348-365 (2007) - [c17]Gerhard Haßlinger, Joachim Mende, Rüdiger Geib, Thomas Beckhaus, Franz Hartleb:
Measurement and Characteristics of Aggregated Traffic in Broadband Access Networks. ITC 2007: 998-1010 - [c16]Gerhard Haßlinger, Sebastian Kempken:
Efficiency of random walks for search in different network structures. VALUETOOLS 2007: 80 - 2006
- [c15]Gerhard Haßlinger:
Validation of Gaussian traffic modeling using standard IP measurement. MMB 2006: 65-80 - 2005
- [j7]Gerhard Haßlinger, Stefan Schnitter, Martin Franzke:
The Efficiency of Traffic Engineering with Regard to Link Failure Resilience. Telecommun. Syst. 29(2): 109-130 (2005) - [p1]Gerhard Haßlinger:
ISP Platforms Under a Heavy Peer-to-Peer Workload. Peer-to-Peer Systems and Applications 2005: 369-381 - [i1]Wolfram Luther, Gerhard Haßlinger, Ekaterina Auer, Eva Dyllong, Daniela Traczinski, Holger Traczinski:
Integration of reliable algorithms into modeling software. Algebraic and Numerical Algorithms and Computer-assisted Proofs 2005 - 2004
- [j6]Daniela Fausten, Wolfram Luther, Gerhard Haßlinger:
Accurate Computation of Traffic Workload Distributions. Numer. Algorithms 37(1-4): 137-146 (2004) - [c14]Gerhard Haßlinger:
Implications of Traffic Characteristics on Quality of Service in Broadband Multi Service Networks. EUROMICRO 2004: 196-204 - [c13]Gerhard Haßlinger, Stefan Schnitter, Martin Franzke:
TE-Scout: An Offline Traffic Engineering Tool for Optimised Path Design in IP Service Provider Networks. MMB 2004: 35-44 - [c12]Daniela Traczinski, Wolfram Luther, Gerhard Haßlinger:
Computing the Workload of Discrete Time Semi-Markov Servers with Result Verification. MMB 2004: 245-254 - 2003
- [c11]Daniela Fausten, Gerhard Haßlinger:
Verified Numerical Analysis of the Performance of Switching Systems in Telecommunication. Numerical Software with Result Verification 2003: 206-225 - 2002
- [c10]Gerhard Haßlinger, Daniela Fausten:
Stationary Workload Analysis for Single Service Systems with Slowly Decreasing Service Time Distributions. ESM 2002: 532-539 - 2001
- [j5]Gerhard Haßlinger:
Quality-of-Service Analysis for Statistical Multiplexing with Gaussian Distributed and Autoregressive Input. Telecommun. Syst. 16(3-4): 315-334 (2001) - [c9]Franz Hartleb, Gerhard Haßlinger:
Comparison of link dimensioning methods for TCP/IP networks. GLOBECOM 2001: 2240-2247 - [c8]Franz Hartleb, Gerhard Haßlinger:
Verkehrsmodell und Dimensionierungsverfahren für IP-Backbone-Links. MMB 2001: 103-118 - 2000
- [j4]Gerhard Haßlinger:
Waiting time, busy periods and output models of a server analyzed via Wiener-Hopf factorization. Perform. Evaluation 40(1-3): 3-26 (2000)
1990 – 1999
- 1999
- [c7]Gerhard Haßlinger:
Die begrenzte Wirkung von Puffern in diensteintegrierenden Kommunikationsnetzen: Ein vergleich von statischem Multiplexing mit und ohne Pufferung. MMB 1999: 221-235 - 1997
- [j3]Gerhard Haßlinger:
Semi-Markovian modelling and performance analysis of variable rate traffic in ATM networks. Telecommun. Syst. 7(1-3): 281-298 (1997) - [c6]Gerhard Haßlinger:
Towards an Analytical Tool for Performance Modelling of ATM Networks by Decomposition. Computer Performance Evaluation 1997: 83-96 - [c5]Gerhard Haßlinger:
Discrete Time Queues with Variable Input: Workload Based Analysis and Applications. MMB 1997: 39-53 - 1996
- [c4]Gerhard Haßlinger, Michael Adam:
Modelling and Performance Analysis of Traffic in ATM Networks Including Autocorrelation. INFOCOM 1996: 1460-1467 - 1995
- [j2]Gerhard Haßlinger:
A Polynomial Factorization Approach to the Discrete Time GI/G/1/(N) Queue Size Distribution. Perform. Evaluation 23(3): 217-240 (1995) - 1994
- [j1]Erik S. Rieger, Gerhard Haßlinger:
An analytical solution for the discrete time single server system with semi-Markovian arrivals. Queueing Syst. Theory Appl. 18(1-2): 69-105 (1994) - 1993
- [c3]Gerhard Haßlinger:
Bounds for Blocking and Deadlock in Transaction Systems with Two-Phase Locking. MMB 1993: 90-102 - 1991
- [c2]C. Breitenbach, Gerhard Haßlinger, P. Herold:
Deadlocks in einem verteilten System mit zentraler Datenhaltung: Vergleich von Auflösungsstrategien und Abschätzung der Deadlockrate. Kommunikation in Verteilten Systemen 1991: 320-334 - [c1]Gerhard Haßlinger, Erik S. Rieger:
Modellierung offener Warteschlangennetzwerke durch Erneuerungsprozesse im diskreten Zeitbereich. MMB 1991: 15-29
1980 – 1989
- 1986
- [b1]Gerhard Haßlinger:
Näherungsverfahren nach dem Prinzip der maximalen Entropie für Warteschlangen-Verteilungen in geschlossenen Netzwerken. Darmstadt University of Technology, Germany, 1986, pp. 1-63
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:54 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
