![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
Florian Liers
Person information
Refine list
![note](https://dblp.org/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
- [j4]Thomas Zinner, Tobias Hoßfeld
, Markus Fiedler, Florian Liers, Thomas Volkert, Rahamatullah Khondoker, Raimund Schatz
:
Requirement driven prospects for realizing user-centric network orchestration. Multim. Tools Appl. 74(2): 413-437 (2015) - 2014
- [b1]Florian Liers:
Forwarding on gates: a flexible and scalable inter-network layer supporting in-network functions. Technische Universität Ilmenau, Germany, Universitäts-Verlag 2014, ISBN 978-3-86360-094-5, pp. 1-258 - 2013
- [c8]Florian Liers, Markus Hager, Sebastian Schellenberg, Jochen Seitz:
Recursive layering of Forwarding on Gates and Traffic Engineering Middleware for Ethernet. ICOIN 2013: 600-605 - 2012
- [j3]Tobias Hoßfeld, Florian Liers, Raimund Schatz
, Barbara Staehle, Dirk Staehle, Thomas Volkert, Florian Wamser:
Quality of Experience Management for YouTube: Clouds, FoG and the AquareYoum. Prax. Inf.verarb. Kommun. 35(3): 133-143 (2012) - 2010
- [c7]Abutaleb Abdelmohdi Turky, Florian Liers, Andreas Mitschele-Thiel:
Self-optimizing Mechanism for Prediction-Based Decentralized Routing. QSHINE 2010: 454-468
2000 – 2009
- 2009
- [j2]Mohamed Abd rabou Kalil, Florian Liers, Thomas Volkert, Andreas Mitschele-Thiel:
A Novel Opportunistic Spectrum Sharing Scheme for Cognitive Ad Hoc Networks. Electron. Commun. Eur. Assoc. Softw. Sci. Technol. 17 (2009) - [j1]Hassan Al-Mahdi, Mohamed Abd rabou Kalil, Florian Liers, Andreas Mitschele-Thiel:
Increasing spectrum capacity for ad hoc networks using cognitive radios: an analytical model. IEEE Commun. Lett. 13(9): 676-678 (2009) - 2008
- [c6]Ali Diab, Andreas Mitschele-Thiel, Florian Liers:
Estimation of the cost resulting from mobility management protocols using a generic mathematical model. MSWiM 2008: 157-161 - 2007
- [c5]Ali Diab, Florian Liers, Andreas Mitschele-Thiel:
Performance analysis of mobility management protocols using a generic mathematical model. MSWiM 2007: 52-59 - [c4]Florian Liers, Christian Burkhardt, Andreas Mitschele-Thiel:
Static RRC Timeouts for Various Traffic Scenarios. PIMRC 2007: 1-5 - 2006
- [c3]Florian Liers, Bernd Hochberg, Markus Malicke, Andreas Mitschele-Thiel:
Limiting UMTS Dropping Rate with Control-Based CAC Algorithm. PIMRC 2006: 1-5 - [c2]Florian Liers, René Böringer, Andreas Mitschele-Thiel:
Optimal Placement of Anchor Points Within Large Telecommunication Networks. WWIC 2006: 96-107 - 2005
- [c1]Florian Liers, Andreas Mitschele-Thiel:
UMTS data capacity improvements employing dynamic RRC timeouts. PIMRC 2005: 2186-2190
Coauthor Index
![](https://dblp.org/img/cog.dark.24x24.png)
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-25 05:57 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint